Остановите войну!
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 51 matches
- 1985
- Serge Abiteboul:
Disaggregations in Databases. J. ACM 32(1): 79-101 (1985) - Ilan Adler, Nimrod Megiddo:
A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. J. ACM 32(4): 871-895 (1985) - Baruch Awerbuch:
Complexity of Network Synchronization. J. ACM 32(4): 804-823 (1985) - Amitava Bagchi, A. Mahanti:
Three Approaches to Heuristic Search in Networks. J. ACM 32(1): 1-27 (1985) - Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard:
Algorithms for Resolving Conflicts in Dynamic Storage Allocation. J. ACM 32(2): 327-343 (1985) - Michael A. Bauer:
Soundness and Completeness of a Synthesis Algorithm Based on Example Computations. J. ACM 32(2): 249-279 (1985) - Edward A. Bender, Jon T. Butler:
Enumeration of Structured Flowcharts. J. ACM 32(3): 537-548 (1985) - Gabriel Bracha, Sam Toueg:
Asynchronous Consensus and Broadcast Protocols. J. ACM 32(4): 824-840 (1985) - Gael N. Buckley, Abraham Silberschatz:
Beyond Two-Phase Locking. J. ACM 32(2): 314-326 (1985) - Wei-Lu Cao, William J. Stewart:
Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains. J. ACM 32(3): 702-719 (1985) - Bernard Chazelle, Louis Monier:
A Model of Computation for VLSI with Related Complexity Results. J. ACM 32(3): 573-588 (1985) - Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets. J. ACM 32(2): 383-410 (1985) - William H. Cunningham:
Optimal Attach and Reinforcement of a Network. J. ACM 32(3): 549-561 (1985) - Rina Dechter, Judea Pearl:
Generalized Best-First Search Strategies and the Optimality of A*. J. ACM 32(3): 505-536 (1985) - Danny Dolev, Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement. J. ACM 32(1): 191-204 (1985) - Shimon Even, Alan L. Selman, Yacov Yacobi:
Hard-Core Theorems for Complexity Classes. J. ACM 32(1): 205-217 (1985) - Ulrich Faigle:
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms. J. ACM 32(4): 861-870 (1985) - Michael J. Fischer, Nancy A. Lynch, Mike Paterson:
Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382 (1985) - Eugene C. Freuder:
A Sufficient Condition for Backtrack-Bounded Search. J. ACM 32(4): 755-761 (1985) - Ken Fuchs, Dennis G. Kafura:
Memory-Constrained Task Scheduling on a Network of Dual Processors. J. ACM 32(1): 102-129 (1985) - Hector Garcia-Molina, Daniel Barbará:
How to Assign Votes in a Distributed System. J. ACM 32(4): 841-860 (1985) - Georg Gottlob, Alexander Leitsch:
On the Efficiency of Subsumption Algorithms. J. ACM 32(2): 280-295 (1985) - Albert G. Greenberg, Shmuel Winograd:
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels. J. ACM 32(3): 589-596 (1985) - Eitan M. Gurari:
Decidable Problems for Powerful Programs. J. ACM 32(2): 466-483 (1985) - Friedhelm Meyer auf der Heide:
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines. J. ACM 32(4): 929-937 (1985) - Matthew Hennessy:
Acceptance Trees. J. ACM 32(4): 896-928 (1985) - Matthew Hennessy, Robin Milner:
Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32(1): 137-161 (1985) - Dorit S. Hochbaum, Wolfgang Maass:
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J. ACM 32(1): 130-136 (1985) - Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. J. ACM 32(4): 762-773 (1985) - Maria M. Klawe:
A Tight Bound for Black and White Pebbles on the Pyramid. J. ACM 32(1): 218-228 (1985)
skipping 21 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-05-26 23:57 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