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