| 1985 |
|---|
| 20 | EE | Eitan M. Gurari:
Decidable Problems for Powerful Programs
J. ACM 32(2): 466-483 (1985) |
| 1984 |
|---|
| 19 | | Eitan M. Gurari,
Ivan Hal Sudborough:
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem.
J. Algorithms 5(4): 531-546 (1984) |
| 1983 |
|---|
| 18 | | Eitan M. Gurari,
Oscar H. Ibarra:
A Note on Finitely-Valued and Finitely Ambiguous Transducers.
Mathematical Systems Theory 16(1): 61-66 (1983) |
| 1982 |
|---|
| 17 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations.
J. ACM 29(3): 863-873 (1982) |
| 16 | | Eitan M. Gurari,
Oscar H. Ibarra:
(Semi)Alternating Stack Automata.
Mathematical Systems Theory 15(3): 211-224 (1982) |
| 15 | | Eitan M. Gurari:
The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable.
SIAM J. Comput. 11(3): 448-452 (1982) |
| 14 | | Eitan M. Gurari,
Oscar H. Ibarra:
Some Simplified Undecidable and NP-Hard Problems for Simple Programs.
Theor. Comput. Sci. 17: 55-73 (1982) |
| 1981 |
|---|
| 13 | | Eitan M. Gurari,
Oscar H. Ibarra:
Two-Way Counter Machines and Diophantine Equations
FOCS 1981: 45-52 |
| 12 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines.
ICALP 1981: 495-505 |
| 11 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Simple Programs.
J. ACM 28(3): 535-560 (1981) |
| 10 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of Decision Problems for Finite-Turn Multicounter Machines.
J. Comput. Syst. Sci. 22(2): 220-229 (1981) |
| 9 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets.
Theor. Comput. Sci. 13: 295-314 (1981) |
| 1980 |
|---|
| 8 | | Eitan M. Gurari:
The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable
FOCS 1980: 83-85 |
| 7 | | Eitan M. Gurari,
Oscar H. Ibarra:
Path Systems: Constructions, Solutions and Applications.
SIAM J. Comput. 9(2): 348-374 (1980) |
| 1979 |
|---|
| 6 | | Eitan M. Gurari,
Oscar H. Ibarra:
The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs
STOC 1979: 142-152 |
| 5 | | Eitan M. Gurari,
Oscar H. Ibarra:
On the Space Complexity of Recursive Algorithms.
Inf. Process. Lett. 8(5): 267-271 (1979) |
| 4 | EE | Eitan M. Gurari,
Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem.
J. ACM 26(3): 567-581 (1979) |
| 3 | | Eitan M. Gurari,
Oscar H. Ibarra:
Some Decision Problems Concerning Sequential Transducers and Checking Automata.
J. Comput. Syst. Sci. 18(1): 18-34 (1979) |
| 2 | | Eitan M. Gurari,
Oscar H. Ibarra:
Simple Counter Machines and Number-Theoretic Problems.
J. Comput. Syst. Sci. 19(2): 145-162 (1979) |
| 1978 |
|---|
| 1 | | Eitan M. Gurari,
Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem
STOC 1978: 205-215 |
