Eitan M. Gurari

25 papers A* 5Journal 18Unranked 1

Year	Rank	Type	Title / Venue / Authors
1991	—	`conf`	A WYSIWYG literate programming system (preliminary report). ACM Conference on Computer Science Eitan M. Gurari, Jesse Wu
1989	—	`book`	Introduction to the theory of computation. Eitan M. Gurari
1985	J	`jnl`	Decidable Problems for Powerful Programs J. ACM Eitan M. Gurari
1984	J	`jnl`	Deadlock detection in communicating finite state machines. SIGACT News Eitan M. Gurari, Ten-Hwang Lai
1984	J	`jnl`	Deadlock detection in communicating finite state machines. SIGACT News Eitan M. Gurari, Ten-Hwang Lai
1984	J	`jnl`	Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. J. Algorithms Eitan M. Gurari, Ivan Hal Sudborough
1983	J	`jnl`	A Note on Finitely-Valued and Finitely Ambiguous Transducers. Math. Syst. Theory Eitan M. Gurari, Oscar H. Ibarra
1982	J	`jnl`	(Semi)Alternating Stack Automata. Math. Syst. Theory Eitan M. Gurari, Oscar H. Ibarra
1982	J	`jnl`	On the Difficulties Involved in the Segmentation of Pictures. IEEE Trans. Pattern Anal. Mach. Intell. Eitan M. Gurari, Harry Wechsler
1982	J	`jnl`	Some Simplified Undecidable and NP-Hard Problems for Simple Programs. Theor. Comput. Sci. Eitan M. Gurari, Oscar H. Ibarra
1982	J	`jnl`	The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. SIAM J. Comput. Eitan M. Gurari
1982	J	`jnl`	Two-Way Counter Machines and Diophantine Equations. J. ACM Eitan M. Gurari, Oscar H. Ibarra
1981	A*	`conf`	The Complexity of Decision Problems for Finite-Turn Multicounter Machines. ICALP Eitan M. Gurari, Oscar H. Ibarra
1981	J	`jnl`	The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci. Eitan M. Gurari, Oscar H. Ibarra
1981	J	`jnl`	The Complexity of the Equivalence Problem for Simple Programs. J. ACM Eitan M. Gurari, Oscar H. Ibarra
1981	J	`jnl`	The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. Theor. Comput. Sci. Eitan M. Gurari, Oscar H. Ibarra
1981	A*	`conf`	Two-Way Counter Machines and Diophantine Equations FOCS Eitan M. Gurari, Oscar H. Ibarra
1980	J	`jnl`	Path Systems: Constructions, Solutions and Applications. SIAM J. Comput. Eitan M. Gurari, Oscar H. Ibarra
1980	A*	`conf`	The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable FOCS Eitan M. Gurari
1979	J	`jnl`	An NP-Complete Number-Theoretic Problem. J. ACM Eitan M. Gurari, Oscar H. Ibarra
1979	J	`jnl`	On the Space Complexity of Recursive Algorithms. Inf. Process. Lett. Eitan M. Gurari, Oscar H. Ibarra
1979	J	`jnl`	Simple Counter Machines and Number-Theoretic Problems. J. Comput. Syst. Sci. Eitan M. Gurari, Oscar H. Ibarra
1979	J	`jnl`	Some Decision Problems Concerning Sequential Transducers and Checking Automata. J. Comput. Syst. Sci. Eitan M. Gurari, Oscar H. Ibarra
1979	A*	`conf`	The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs STOC Eitan M. Gurari, Oscar H. Ibarra
1978	A*	`conf`	An NP-Complete Number-Theoretic Problem STOC Eitan M. Gurari, Oscar H. Ibarra