Остановите войну!
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 42 matches
- 1989
- Serge Abiteboul, Victor Vianu:
A transaction-based approach to relational database specification. J. ACM 36(4): 758-789 (1989) - Eric Allender:
P-uniform circuit complexity. J. ACM 36(4): 912-928 (1989) - François Baccelli, William A. Massey, Donald F. Towsley:
Acyclic fork-join queuing networks. J. ACM 36(3): 615-642 (1989) - Paul Beame, Johan Håstad:
Optimal bounds for decision problems on the CRCW PRAM. J. ACM 36(3): 643-670 (1989) - Catriel Beeri, Philip A. Bernstein, Nathan Goodman:
A model for concurrency in nested transactions systems. J. ACM 36(2): 230-269 (1989) - Gianfranco Bilardi, Franco P. Preparata:
Size-time complexity of Boolean networks for prefix computations. J. ACM 36(2): 362-382 (1989) - Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4): 929-965 (1989) - Joan Boyar:
Inferring sequences produced by pseudo-random number generators. J. ACM 36(1): 129-141 (1989) - Janusz A. Brzozowski, Carl-Johan H. Seger:
A unified framework for race analysis of asynchronous networks. J. ACM 36(1): 20-45 (1989) - Ilaria Castellani, Matthew Hennessy:
Distributed bisimulations. J. ACM 36(4): 887-911 (1989) - Benny Chor, Michael Merritt, David B. Shmoys:
Simple constant-time consensus protocols in realistic failure models. J. ACM 36(3): 591-614 (1989) - Walter Cunto, J. Ian Munro:
Average case selection. J. ACM 36(2): 270-279 (1989) - Thomas Dean:
Using temporal hierarchies to efficiently maintain large temporal databases. J. ACM 36(4): 687-718 (1989) - Jens M. Dill:
A counter-example for "A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars". J. ACM 36(1): 92-96 (1989) - Martin Dowd, Yehoshua Perl, Larry Rudolph, Michael E. Saks:
The periodic balanced sorting network. J. ACM 36(4): 738-757 (1989) - Joost Engelfriet, Gilberto Filé:
Passes, sweeps, and visits in attribute grammars. J. ACM 36(4): 841-869 (1989) - Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu:
Recognizing circle graphs in polynomial time. J. ACM 36(3): 435-473 (1989) - Harold N. Gabow, Zvi Galil, Thomas H. Spencer:
Efficient implementation of graph algorithms using contraction. J. ACM 36(3): 540-572 (1989) - Andrew V. Goldberg, Robert Endre Tarjan:
Finding minimum-cost circulations by canceling negative cycles. J. ACM 36(4): 873-886 (1989) - Marc Gyssens, Jan Paredaens, Dirk Van Gucht:
A uniform approach toward handling atomic and structured information in the nested relational database model. J. ACM 36(4): 790-825 (1989) - Paul Helman:
A common schema for dynamic programming and branch and bound algorithms. J. ACM 36(1): 97-128 (1989) - John D. Hobby:
Rasterizing curves of constant width. J. ACM 36(2): 209-229 (1989) - Michael Kaminski:
A note on probabilistically verifying integer and polynomial products. J. ACM 36(1): 142-149 (1989) - Michael Kaminski, Nader H. Bshouty:
Multiplicative complexity of polynomial multiplication over finite fields. J. ACM 36(1): 150-170 (1989) - Sanjiv Kapoor, Edward M. Reingold:
Optimum lopsided binary trees. J. ACM 36(3): 573-590 (1989) - Rolf Klein, Derick Wood:
On the path length of binary trees. J. ACM 36(2): 280-289 (1989) - Juha Kortelainen:
The conjecture of Fliess on commutative context-free languages. J. ACM 36(4): 870-872 (1989) - Thomas Lengauer:
Hierarchical planarity testing algorithms. J. ACM 36(3): 474-509 (1989) - Ming Li, Yaacov Yesha:
New lower bounds for parallel computation. J. ACM 36(3): 671-680 (1989) - Glenn K. Manacher, Tien Dai Bui, Mai Thanh:
Optimum combinations of sorting and merging. J. ACM 36(2): 290-334 (1989)
skipping 12 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-25 18:28 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