default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

• 
  Ashok K. Chandra:
  Editor's Foreword: Selected Papers of PODS 1989. 1
• 
  Simona Rabinovici-Cohen, Ouri Wolfson:
  Why a Single Parallelization Strategy Is Not Enough in Knowledge Bases. 2-44
• 
  Theodore Johnson, Dennis E. Shasha:
  B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. 45-76
• 
  Michael Kifer, James Wu:
  A Logic Programming with Complex Objects. 77-120
• 
  Richard Hull, Jianwen Su:
  Algebraic and Calculus Query Languages for Recursively Typed Complex Objects. 121-156
• 
  William E. Weihl:
  The Impact of Recovery on Concurrency Control. 157-184
• 
  Allen Van Gelder:
  The Alternating Fixpoint of Logic Programs with Negation. 185-221
• 
  Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
  Logical Query Optimization by Proff-Tree Transformation. 222-248

29th IEEE Conference on Foundations of Computer Science

• 
  Michael Luby:
  Removing Randomness in Parallel Computation without a Processor Penalty. 250-286
• 
  David A. McAllester, Prakash Panangaden, Vasant Shanbhogue:
  Nonexpressibility of Fairness and Signaling. 287-321
• 
  László Lovász, Michael E. Saks:
  Communication Complexity and Combinatorial Lattice Theory. 322-349
• 
  János Komlós, Ramamohan Paturi:
  Effect of Connectivity in an Associative Memory Model. 350-373

22nd Symposium on the Theory of Computing

• 
  Johan Håstad, A. W. Schrift, Adi Shamir:
  The Discrete Logarithm Modulo a Composite Hides O(n) Bits. 376-404
• 
  Mario Szegedy:
  Functions with Bounded Symmetric Communication Complexity, Programs over Commutative Monoids, and ACC. 405-423
• 
  Michael L. Fredman, Dan E. Willard:
  Surpassing the Information Theoretic Bound with Fusion Trees. 424-436
• 
  Ketan Mulmuley:
  Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements. 437-458
• 
  Ming-Yang Kao, Philip N. Klein:
  Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. 459-500
• 
  Robert Cypher, C. Greg Plaxton:
  Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. 501-548
• 
  Manuel Blum, Michael Luby, Ronitt Rubinfeld:
  Self-Testing/Correcting with Applications to Numerical Problems. 549-595

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).

load links from unpaywall.org

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).

load content from archive.org

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 .

load data from openalex.org

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.

last updated on 2024-12-26 00:37 CET by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: