Eitan M. Gurari

Publication Activity (10 Years)

Years Active: 1978-1991
Publications (10 Years): 0

Publications

Eitan M. Gurari, Jesse Wu
A WYSIWYG literate programming system (preliminary report). ACM Conference on Computer Science (1991)
Eitan M. Gurari
Decidable Problems for Powerful Programs J. ACM 32 (2) (1985)
Eitan M. Gurari, Ten-Hwang Lai
Deadlock detection in communicating finite state machines. SIGACT News 16 (1) (1984)
Eitan M. Gurari, Ten-Hwang Lai
Deadlock detection in communicating finite state machines. SIGACT News 15 (4) (1984)
Eitan M. Gurari, Ivan Hal Sudborough
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. J. Algorithms 5 (4) (1984)
Eitan M. Gurari, Oscar H. Ibarra
A Note on Finitely-Valued and Finitely Ambiguous Transducers. Math. Syst. Theory 16 (1) (1983)
Eitan M. Gurari, Harry Wechsler
On the Difficulties Involved in the Segmentation of Pictures. IEEE Trans. Pattern Anal. Mach. Intell. 4 (3) (1982)
Eitan M. Gurari
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. SIAM J. Comput. 11 (3) (1982)
Eitan M. Gurari, Oscar H. Ibarra
Two-Way Counter Machines and Diophantine Equations. J. ACM 29 (3) (1982)
Eitan M. Gurari, Oscar H. Ibarra
Some Simplified Undecidable and NP-Hard Problems for Simple Programs. Theor. Comput. Sci. 17 (1982)
Eitan M. Gurari, Oscar H. Ibarra
(Semi)Alternating Stack Automata. Math. Syst. Theory 15 (3) (1982)
Eitan M. Gurari, Oscar H. Ibarra
The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci. 22 (2) (1981)
Eitan M. Gurari, Oscar H. Ibarra
The Complexity of the Equivalence Problem for Simple Programs. J. ACM 28 (3) (1981)
Eitan M. Gurari, Oscar H. Ibarra
Two-Way Counter Machines and Diophantine Equations FOCS (1981)
Eitan M. Gurari, Oscar H. Ibarra
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. Theor. Comput. Sci. 13 (1981)
Eitan M. Gurari, Oscar H. Ibarra
The Complexity of Decision Problems for Finite-Turn Multicounter Machines. ICALP (1981)
Eitan M. Gurari
The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable FOCS (1980)
Eitan M. Gurari, Oscar H. Ibarra
Path Systems: Constructions, Solutions and Applications. SIAM J. Comput. 9 (2) (1980)
Eitan M. Gurari, Oscar H. Ibarra
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs STOC (1979)
Eitan M. Gurari, Oscar H. Ibarra
An NP-Complete Number-Theoretic Problem. J. ACM 26 (3) (1979)
Eitan M. Gurari, Oscar H. Ibarra
On the Space Complexity of Recursive Algorithms. Inf. Process. Lett. 8 (5) (1979)
Eitan M. Gurari, Oscar H. Ibarra
Some Decision Problems Concerning Sequential Transducers and Checking Automata. J. Comput. Syst. Sci. 18 (1) (1979)
Eitan M. Gurari, Oscar H. Ibarra
Simple Counter Machines and Number-Theoretic Problems. J. Comput. Syst. Sci. 19 (2) (1979)
Eitan M. Gurari, Oscar H. Ibarra
An NP-Complete Number-Theoretic Problem STOC (1978)