Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Eitan M. Gurari
1980 – 1989
- 1989
[b1]Eitan M. Gurari: Introduction to the theory of computation. Computer Science Press 1989, ISBN 978-0-7167-8182-0, pp. I-XII, 1-314- 1985
- [j16]
- 1984
- [j15]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
- [j14]Eitan M. Gurari, Oscar H. Ibarra: A Note on Finitely-Valued and Finitely Ambiguous Transducers. Mathematical Systems Theory 16(1): 61-66 (1983)
- 1982
- [j13]Eitan M. Gurari, Oscar H. Ibarra: Two-Way Counter Machines and Diophantine Equations. J. ACM 29(3): 863-873 (1982)
- [j12]Eitan M. Gurari, Oscar H. Ibarra: (Semi)Alternating Stack Automata. Mathematical Systems Theory 15(3): 211-224 (1982)
- [j11]Eitan M. Gurari, Harry Wechsler: On the Difficulties Involved in the Segmentation of Pictures. IEEE Trans. Pattern Anal. Mach. Intell. 4(3): 304-306 (1982)
- [j10]Eitan M. Gurari: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable. SIAM J. Comput. 11(3): 448-452 (1982)
- [j9]Eitan M. Gurari, Oscar H. Ibarra: Some Simplified Undecidable and NP-Hard Problems for Simple Programs. Theor. Comput. Sci. 17: 55-73 (1982)
- 1981
- [j8]Eitan M. Gurari, Oscar H. Ibarra: The Complexity of the Equivalence Problem for Simple Programs. J. ACM 28(3): 535-560 (1981)
- [j7]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)
- [j6]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)
- [c5]Eitan M. Gurari, Oscar H. Ibarra: Two-Way Counter Machines and Diophantine Equations. FOCS 1981: 45-52
- [c4]Eitan M. Gurari, Oscar H. Ibarra: The Complexity of Decision Problems for Finite-Turn Multicounter Machines. ICALP 1981: 495-505
- 1980
- [j5]Eitan M. Gurari, Oscar H. Ibarra: Path Systems: Constructions, Solutions and Applications. SIAM J. Comput. 9(2): 348-374 (1980)
- [c3]Eitan M. Gurari: The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable. FOCS 1980: 83-85
1970 – 1979
- 1979
- [j4]Eitan M. Gurari, Oscar H. Ibarra: On the Space Complexity of Recursive Algorithms. Inf. Process. Lett. 8(5): 267-271 (1979)
- [j3]Eitan M. Gurari, Oscar H. Ibarra: An NP-Complete Number-Theoretic Problem. J. ACM 26(3): 567-581 (1979)
- [j2]Eitan M. Gurari, Oscar H. Ibarra: Some Decision Problems Concerning Sequential Transducers and Checking Automata. J. Comput. Syst. Sci. 18(1): 18-34 (1979)
- [j1]Eitan M. Gurari, Oscar H. Ibarra: Simple Counter Machines and Number-Theoretic Problems. J. Comput. Syst. Sci. 19(2): 145-162 (1979)
- [c2]Eitan M. Gurari, Oscar H. Ibarra: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs. STOC 1979: 142-152
- 1978
- [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:34 CET by the dblp team