default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEitan M. Gurari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 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
Journal Articles
- 1985
- [j18]Eitan M. Gurari:
Decidable Problems for Powerful Programs. J. ACM 32(2): 466-483 (1985) - 1984
- [j17]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) - [j16]Eitan M. Gurari, Ten-Hwang Lai:
Deadlock detection in communicating finite state machines. SIGACT News 15(4): 63-64 (1984) - [j15]Eitan M. Gurari, Ten-Hwang Lai:
Deadlock detection in communicating finite state machines. SIGACT News 16(1): 63-64 (1984) - 1983
- [j14]Eitan M. Gurari, Oscar H. Ibarra:
A Note on Finitely-Valued and Finitely Ambiguous Transducers. Math. Syst. 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. Math. Syst. 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) - 1980
- [j5]Eitan M. Gurari, Oscar H. Ibarra:
Path Systems: Constructions, Solutions and Applications. SIAM J. Comput. 9(2): 348-374 (1980) - 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)
Conference and Workshop Papers
- 1991
- [c6]Eitan M. Gurari, Jesse Wu:
A WYSIWYG literate programming system (preliminary report). ACM Conference on Computer Science 1991: 94-104 - 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
- [c3]Eitan M. Gurari:
The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable. FOCS 1980: 83-85 - 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]Eitan M. Gurari, Oscar H. Ibarra:
An NP-Complete Number-Theoretic Problem. STOC 1978: 205-215
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
