The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs - Eitan M. Gurari; Oscar H. Ibarra (STOC, 1979)

On the Space Complexity of Recursive Algorithms. - Eitan M. Gurari; Oscar H. Ibarra (Inf. Process. Lett., 1979)

An NP-Complete Number-Theoretic Problem. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1979)

Some Decision Problems Concerning Sequential Transducers and Checking Automata. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1979)

Simple Counter Machines and Number-Theoretic Problems. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1979)

Path Systems: Constructions, Solutions and Applications. - Eitan M. Gurari; Oscar H. Ibarra (SIAM J. Comput., 1980)

The Complexity of the Equivalence Problem for Simple Programs. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1981)

The Complexity of Decision Problems for Finite-Turn Multicounter Machines. - Eitan M. Gurari; Oscar H. Ibarra (J. Comput. Syst. Sci., 1981)

The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets. - Eitan M. Gurari; Oscar H. Ibarra (Theor. Comput. Sci., 1981)

Two-Way Counter Machines and Diophantine Equations. - Eitan M. Gurari; Oscar H. Ibarra (J. ACM, 1982)

(Semi)Alternating Stack Automata. - Eitan M. Gurari; Oscar H. Ibarra (Math. Syst. Theory, 1982)

On the Difficulties Involved in the Segmentation of Pictures. - Eitan M. Gurari; Harry Wechsler (IEEE Trans. Pattern Anal. Mach. Intell., 1982)

The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. - Eitan M. Gurari (SIAM J. Comput., 1982)

Some Simplified Undecidable and NP-Hard Problems for Simple Programs. - Eitan M. Gurari; Oscar H. Ibarra (Theor. Comput. Sci., 1982)

A Note on Finitely-Valued and Finitely Ambiguous Transducers. - Eitan M. Gurari; Oscar H. Ibarra (Math. Syst. Theory, 1983)

Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. - Eitan M. Gurari; Ivan Hal Sudborough (J. Algorithms, 1984)

Deadlock detection in communicating finite state machines. - Eitan M. Gurari; Ten-Hwang Lai (SIGACT News, 1984)

Decidable Problems for Powerful Programs - Eitan M. Gurari (J. ACM, 1985)

Introduction to the theory of computation. - Eitan M. Gurari (Computer Science Press, 1989)

A WYSIWYG literate programming system (preliminary report). - Eitan M. Gurari; Jesse Wu (ACM Conference on Computer Science, 1991)