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

• 
  Moshe Y. Vardi:
  The Implication and Finite Implication Problems for Typed Template Dependencies. 3-28
• 
  Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou:
  Inclusion Dependencies and Their Interaction with Functional Dependencies. 29-59
• 
  Nathan Goodman, Oded Shmueli:
  The Tree Projection Theorem and Relational Query Processing. 60-79
• 
  Tomasz Imielinski, Witold Lipski Jr.:
  The Relational Model of Data and Cylindric Algebras. 80-102
• 
  Paris C. Kanellakis, Christos H. Papadimitriou:
  Is Distributed Locking Harder? 103-120
• 
  Marc H. Graham, Mihalis Yannakakis:
  Independent Database Schemas. 121-141
• 
  Carlo Zaniolo:
  Database Relations with Null Values. 142-166
• 
  David S. Johnson, Anthony C. Klug:
  Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. 167-189

STOC 1982

• 
  Yishai A. Feldman, David Harel:
  A Probabilistic Dynamic Logic. 193-215
• 
  Walter L. Ruzzo, Janos Simon, Martin Tompa:
  Space-Bounded Hierarchies and Probabilistic Computations. 216-230
• 
  Martin Fürer:
  Data Structures for Distributed Counting. 231-243
• 
  Christos H. Papadimitriou, Mihalis Yannakakis:
  The Complexity of Facets (and Some Facets of Complexity). 244-259
• 
  Christos H. Papadimitriou, Michael Sipser:
  Communication Complexity. 260-269
• 
  Shafi Goldwasser, Silvio Micali:
  Probabilistic Encryption. 270-299
• 
  Sandeep N. Bhatt, Frank Thomson Leighton:
  A Framework for Solving VLSI Graph Layout Problems. 300-343

• 
  Manfred K. Warmuth, David Haussler:
  On the Complexity of Iterated Shuffle. 345-358
• 
  Michael C. Loui:
  Minimizing Access Pointers into Trees and Arrays. 359-378
• 
  Dan E. Willard:
  New Trie Data Structures Which Support Very Fast Search Operations. 379-394
• 
  Harry B. Hunt III, Daniel J. Rosenkrantz:
  The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. 395-419
• 
  Errol L. Lloyd, S. S. Ravi:
  One-Layer Routing without Component Constraints. 420-438
• 
  Robin Milner:
  A Complete Inference System for a Class of Regular Behaviours. 439-466

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 2025-05-08 01:50 CEST 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: