Eitan M. Gurari - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

1991

A WYSIWYG literate programming system (preliminary report)Eitan M. Gurari, Jesse Wu. acm 1991: 94-104 [doi]

1989

Introduction to the theory of computationEitan M. Gurari. Computer Science Press, 1989.

1985

Decidable Problems for Powerful ProgramsEitan M. Gurari. JACM, 32(2):466-483, April 1985. [doi]

1984

Deadlock detection in communicating finite state machinesEitan M. Gurari, Ten-Hwang Lai. sigact, 16(1):63-64, 1984. [doi]

Deadlock detection in communicating finite state machinesEitan M. Gurari, Ten-Hwang Lai. sigact, 15(4):63-64, 1984. [doi]

Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement ProblemEitan M. Gurari, Ivan Hal Sudborough. jal, 5(4):531-546, 1984.

1983

A Note on Finitely-Valued and Finitely Ambiguous TransducersEitan M. Gurari, Oscar H. Ibarra. mst, 16(1):61-66, 1983.

1982

The Equivalence Problem for Deterministic Two-Way Sequential Transducers is DecidableEitan M. Gurari. SICOMP, 11(3):448-452, 1982.

On the Difficulties Involved in the Segmentation of PicturesEitan M. Gurari, Harry Wechsler. pami, 4(3):304-306, 1982. [doi]

Some Simplified Undecidable and NP-Hard Problems for Simple ProgramsEitan M. Gurari, Oscar H. Ibarra. TCS, 17:55-73, 1982.

Two-Way Counter Machines and Diophantine EquationsEitan M. Gurari, Oscar H. Ibarra. JACM, 29(3):863-873, 1982. [doi]

(Semi)Alternating Stack AutomataEitan M. Gurari, Oscar H. Ibarra. mst, 15(3):211-224, 1982.

1981

1980

The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is DecidableEitan M. Gurari. focs 1980: 83-85

Path Systems: Constructions, Solutions and ApplicationsEitan M. Gurari, Oscar H. Ibarra. SICOMP, 9(2):348-374, 1980.

1979

1978

An NP-Complete Number-Theoretic ProblemEitan M. Gurari, Oscar H. Ibarra. stoc 1978: 205-215

Sign in or sign up to see more results.

runs on WebDSL