Остановите войну!
for scientists:
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 36 matches
- 1990
- Martín Abadi, Zohar Manna:
Nonclausal Deduction in First-Order Temporal Logic. J. ACM 37(2): 279-317 (1990) - Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan:
Faster Algorithms for the Shortest Path Problem. J. ACM 37(2): 213-223 (1990) - Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990) - Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish:
A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM 37(2): 238-256 (1990) - François Baccelli, Zhen Liu:
On the Execution of Parallel Programs on Multiprocessor Systems-A Queuing Theory Approach. J. ACM 37(2): 373-414 (1990) - Jan A. Bergstra, Jan Heering, Paul Klint:
Module Algebra. J. ACM 37(2): 335-372 (1990) - Béla Bollobás, Andrei Z. Broder, István Simon:
The Cost Distribution of Clustering in Random Probing. J. ACM 37(2): 224-237 (1990) - David A. Briggs:
A Correction of the Termination Conditions of the Henschen-Naqvi Technique. J. ACM 37(4): 712-719 (1990) - Bernard Chazelle:
Lower Bounds for Orthogonal Range Searching: I. The Reporting Case. J. ACM 37(2): 200-212 (1990) - Bernard Chazelle:
Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model. J. ACM 37(3): 439-463 (1990) - J. Robin B. Cockett, J. A. Hierrera:
Decision Tree Reduction. J. ACM 37(4): 815-842 (1990) - Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi:
Polynomial-Time Implication Problems for Unary Inclusion Dependencies. J. ACM 37(1): 15-46 (1990) - Henry W. Davis:
Cost-Error Relationships in A* Tree-Searching. J. ACM 37(2): 195-199 (1990) - Danny Dolev, Rüdiger Reischuk, H. Raymond Strong:
Early Stopping in Byzantine Agreement. J. ACM 37(4): 720-741 (1990) - Marc H. Graham, Ke Wang:
On the Equivalence of an Egd to a Set of Fd's. J. ACM 37(3): 474-490 (1990) - Yuri Gurevich, Saharon Shelah:
Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. J. ACM 37(3): 674-687 (1990) - Joseph Y. Halpern, Yoram Moses:
Knowledge and Common Knowledge in a Distributed Environment. J. ACM 37(3): 549-587 (1990) - Joseph Y. Halpern, John H. Williams, Edward L. Wimmers:
Completeness of Rewrite Rules and Rewrite Strategies for FP. J. ACM 37(1): 86-143 (1990) - Yijie Han, Robert A. Wagner:
An Efficient and Fast Parallel-Connected Component Algorithm. J. ACM 37(3): 626-642 (1990) - Peter G. Harrison, Naresh M. Patel:
The Representation of Multistage Interconnection Networks in Queuing Models of Parallel Systems. J. ACM 37(4): 863-898 (1990) - Maurice Herlihy:
Concurrency and Availability as Dual Properties of Replicated Atomic Data. J. ACM 37(2): 257-278 (1990) - Dorit S. Hochbaum, J. George Shanthikumar:
Convex Separable Optimization Is Not Much Harder than Linear Optimization. J. ACM 37(4): 843-862 (1990) - Joxan Jaffar:
Minimal and Complete Word Unification. J. ACM 37(1): 47-85 (1990) - Charles Knessl, Charles Tier:
Asymptotic Expansions for Large Closed Queuing Networks. J. ACM 37(1): 144-174 (1990) - Ker-I Ko:
Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy. J. ACM 37(2): 415-438 (1990) - Phokion G. Kolaitis, Christos H. Papadimitriou:
Some Computational Aspects of Circumscription. J. ACM 37(1): 1-14 (1990) - Lawrence L. Larmore, Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37(3): 464-473 (1990) - Attila Máté:
Nondeterministic Polynomial-Time Computations and Models of Arithmetic. J. ACM 37(1): 175-193 (1990) - Gopalan Nadathur, Dale Miller:
Higher-Order Horn Clauses. J. ACM 37(4): 777-814 (1990) - Tobias Nipkow:
Unification in Primal Algebras, Their Powers and Their Varieties. J. ACM 37(4): 742-776 (1990)
skipping 6 more matches
loading more results
failed to load more results, please try again later
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-03-28 16:36 CET 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