


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 48 matches
- 1987
- Miklós Ajtai, Yuri Gurevich:
Monotone versus positive. J. ACM 34(4): 1004-1015 (1987) - Catriel Beeri, Michael Kifer:
A theory of intersection anomalies in relational database schemes. J. ACM 34(3): 544-577 (1987) - Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector:
A weighted voting algorithm for replicated directories. J. ACM 34(4): 859-909 (1987) - Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht:
Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3): 578-595 (1987) - Ronald V. Book, Ding-Zhu Du:
The existence and density of generalized complexity cores. J. ACM 34(3): 718-730 (1987) - Gabriel Bracha:
An O(log n) expected rounds randomized byzantine generals protocol. J. ACM 34(4): 910-920 (1987) - Stanley Cabay, Bart Domzy:
Systems of linear equations with dense univariate polynomial coefficients. J. ACM 34(3): 646-660 (1987) - Edward P. F. Chan, Alberto O. Mendelzon:
Answering queries on embedded-complete database schemes. J. ACM 34(2): 349-375 (1987) - Bernard Chazelle, David P. Dobkin:
Intersection of convex objects in two and three dimensions. J. ACM 34(1): 1-27 (1987) - Richard Cole:
Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1): 200-208 (1987) - Pierpaolo Degano, Ugo Montanari:
A model for distributed systems based on graph rewriting. J. ACM 34(2): 411-449 (1987) - Danny Dolev
, Cynthia Dwork, Larry J. Stockmeyer:
On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97 (1987) - Lorenzo Donatiello, Balakrishna R. Iyer:
Analysis of a composite performance reliability measure for fault-tolerant systems. J. ACM 34(1): 179-199 (1987) - Greg N. Frederickson, Nancy A. Lynch:
Electing a leader in a synchronous ring. J. ACM 34(1): 98-115 (1987) - Michael L. Fredman, Robert Endre Tarjan:
Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3): 596-615 (1987) - Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber:
An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM 34(3): 513-531 (1987) - Albert G. Greenberg, Philippe Flajolet, Richard E. Ladner
:
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM 34(2): 289-325 (1987) - Daniel S. Hirschberg, Lawrence L. Larmore:
New applications of failure functions. J. ACM 34(3): 616-625 (1987) - Dorit S. Hochbaum, David B. Shmoys
:
Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1): 144-162 (1987) - Steven Homer
:
Minimal degrees for polynomial reducibilities. J. ACM 34(2): 480-491 (1987) - Wen-Lian Hsu:
Recognizing planar perfect graphs. J. ACM 34(2): 255-288 (1987) - Alfred Inselberg, Tuval Chomut, Mordechai Reif:
Convexity algorithms in parallel coordinates. J. ACM 34(4): 765-801 (1987) - Robert W. Irving, Paul Leather, Dan Gusfield:
An efficient algorithm for the "optimal" stable marriage. J. ACM 34(3): 532-543 (1987) - Donald B. Johnson:
Parallel algorithms for minimum cuts and maximum flows in planar networks. J. ACM 34(4): 950-967 (1987) - Michael Kaminski:
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor. J. ACM 34(4): 968-984 (1987) - Yann-Hang Lee, Kang G. Shin:
Optimal reconfiguration strategy for a degradable multimodule computing system. J. ACM 34(2): 326-348 (1987) - James McKenna:
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks. J. ACM 34(4): 985-1003 (1987) - Debasis Mitra, Randall A. Cieslak:
Randomized parallel communications on an extension of the omega network. J. ACM 34(4): 802-824 (1987) - Neil V. Murray, Erik Rosenthal:
Inference with path resolution and semantic graphs. J. ACM 34(2): 225-254 (1987) - Randolph D. Nelson:
Stochastic catastrophe theory in computer performance modeling. J. ACM 34(3): 661-685 (1987)
skipping 18 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 2025-03-11 15:50 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