![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 37 matches
- 1991
- Noga Alon, A. K. Dewdney, Teunis J. Ott:
Efficient Simulation of Finite Automata by Neural Nets. J. ACM 38(2): 495-514 (1991) - Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis:
Modularity of Cycles and Paths in Graphs. J. ACM 38(2): 255-274 (1991) - Mikhail J. Atallah, Danny Z. Chen, Hubert Wagener:
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. J. ACM 38(3): 516-533 (1991) - Egon Balas, Donald L. Miller, Joseph F. Pekny, Paolo Toth:
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. J. ACM 38(4): 985-1004 (1991) - Nicholas Bambos
, Jean C. Walrand:
On Stability and Performance of Parallel Processing Systems. J. ACM 38(2): 429-452 (1991) - Bonnie Berger, John Rompel:
Simulating (log c n)-Wise Independence in NC. J. ACM 38(4): 1026-1046 (1991) - Stephen L. Bloom, Zoltán Ésik:
Floyd-Hoare Logic in Iteration Theories. J. ACM 38(4): 887-934 (1991) - Randal E. Bryant:
A Methodology for Hardware Verification Based on Logic Simulation. J. ACM 38(2): 299-328 (1991) - Edward P. F. Chan, Héctor J. Hernández:
Independence-Reducible Database Schemes. J. ACM 38(4): 854-886 (1991) - Vijay Chandru, John N. Hooker:
Extended Horn Sets In Propositional Logic. J. ACM 38(1): 205-221 (1991) - Anne Condon:
Space-Bounded Probabilistic Game Automata. J. ACM 38(2): 472-494 (1991) - Maxime Crochemore, Dominique Perrin:
Two-Way String Matching. J. ACM 38(3): 651-675 (1991) - David P. Dobkin, Subhash Suri:
Maintenance of Geometric Extrema. J. ACM 38(2): 275-298 (1991) - Martin E. Dyer
, Alan M. Frieze
, Ravi Kannan:
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. J. ACM 38(1): 1-17 (1991) - Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi:
A Model-Theoretic Analysis of Knowledge. J. ACM 38(2): 382-428 (1991) - Greg N. Frederickson:
Planar Graph Decomposition and All Pairs Shortest Paths. J. ACM 38(1): 162-204 (1991) - Harold N. Gabow, Robert Endre Tarjan:
Faster Scaling Algorithms for General Graph-Matching Problems. J. ACM 38(4): 815-853 (1991) - Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
The Well-Founded Semantics for General Logic Programs. J. ACM 38(3): 620-650 (1991) - Paul Glasserman:
Structural Conditions for Perturbation Analysis of Queuing Systems. J. ACM 38(4): 1005-1025 (1991) - Oded Goldreich
, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3): 691-729 (1991) - Joseph Y. Halpern, Yoav Shoham:
A Propositional Modal Logic of Time Intervals. J. ACM 38(4): 935-962 (1991) - Jieh Hsiang, Michaël Rusinowitch:
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method. J. ACM 38(3): 559-587 (1991) - Tomasz Imielinski:
Abstraction in Query Processing. J. ACM 38(3): 534-558 (1991) - Yannis E. Ioannidis, Eugene Wong:
Towards an Algebraic Theory of Recursion. J. ACM 38(2): 329-381 (1991) - Gloria Kissin:
Upper and Lower Bounds on Switching Energy in VLSI. J. ACM 38(1): 222-254 (1991) - Frank Thomson Leighton:
Letter from the Editor. J. ACM 38(3): 515-515 (1991) - Yishay Mansour, Baruch Schieber, Prasoon Tiwari:
A Lower Bound for Integer Greatest Common Divisor Computations. J. ACM 38(2): 453-471 (1991) - V. Wiktor Marek, Miroslaw Truszczynski:
Autoepistemic Logic. J. ACM 38(3): 588-619 (1991) - Joseph S. B. Mitchell, Christos H. Papadimitriou:
The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. J. ACM 38(1): 18-73 (1991) - Ketan Mulmuley:
A Fast Planar Partition Algorithm, II. J. ACM 38(1): 74-103 (1991)
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-29 17:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint