Eitan M. Gurari

According to our database, Eitan M. Gurari authored at least 20 papers between 1978 and 1991.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1991

A WYSIWYG literate programming system (preliminary report).

Eitan M. Gurari, Jesse Wu

Proceedings of the 19th annual conference on Computer Science, 1991

1989

Introduction to the theory of computation.

Eitan M. Gurari

Computer Science Press, ISBN: 978-0-7167-8182-0, 1989

1985

Decidable Problems for Powerful Programs

Eitan M. Gurari

J. ACM, April, 1985

1984

Deadlock detection in communicating finite state machines.

Eitan M. Gurari, Ten-Hwang Lai

SIGACT News, 1984

Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem.

Eitan M. Gurari, Ivan Hal Sudborough

J. Algorithms, 1984

1983

A Note on Finitely-Valued and Finitely Ambiguous Transducers.

Eitan M. Gurari, Oscar H. Ibarra

Math. Syst. Theory, 1983

1982

Some Simplified Undecidable and NP-Hard Problems for Simple Programs.

Eitan M. Gurari, Oscar H. Ibarra

Theor. Comput. Sci., 1982

On the Difficulties Involved in the Segmentation of Pictures.

Eitan M. Gurari, Harry Wechsler

IEEE Trans. Pattern Anal. Mach. Intell., 1982

(Semi)Alternating Stack Automata.

Eitan M. Gurari, Oscar H. Ibarra

Math. Syst. Theory, 1982

1981

The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets.

Eitan M. Gurari, Oscar H. Ibarra

Theor. Comput. Sci., 1981

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

Proceedings of the Automata, 1981

Two-Way Counter Machines and Diophantine Equations

Eitan M. Gurari, Oscar H. Ibarra

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Path Systems: Constructions, Solutions and Applications.

Eitan M. Gurari, Oscar H. Ibarra

SIAM J. Comput., 1980

The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable

Eitan M. Gurari

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Simple Counter Machines and Number-Theoretic Problems.

Eitan M. Gurari, Oscar H. Ibarra

J. Comput. Syst. Sci., 1979

Some Decision Problems Concerning Sequential Transducers and Checking Automata.

Eitan M. Gurari, Oscar H. Ibarra

J. Comput. Syst. Sci., 1979

On the Space Complexity of Recursive Algorithms.

Eitan M. Gurari, Oscar H. Ibarra

Inf. Process. Lett., 1979

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs

Eitan M. Gurari, Oscar H. Ibarra

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

An NP-Complete Number-Theoretic Problem

Eitan M. Gurari, Oscar H. Ibarra

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978