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

FOCS 1980

• 
  Mihalis Yannakakis, Christos H. Papadimitriou:
  Algebraic Dependencies. 2-41
• 
  Eugene M. Luks:
  Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. 42-65
• 
  Michael O. Rabin:
  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable. 66-75
• 
  Neil Immerman:
  Upper and Lower Bounds for First Order Expressibility. 76-98
• 
  Ashok K. Chandra, David Harel:
  Structure and Complexity of Relational Queries. 99-128

FOCS 1980

• 
  Stephen R. Mahaney:
  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis. 130-143
• 
  David Harel, Dexter Kozen, Rohit Parikh:
  Process Logic: Expressiveness, Decidability, Completeness. 144-170
• 
  Philippe Flajolet, Andrew M. Odlyzko:
  The Average Height of Binary Trees and Other Simple Trees. 171-213
• 
  Jon Louis Bentley, Donna J. Brown:
  A General Class of Resource Tradeoffs. 214-238
• 
  Gérard P. Huet, Jean-Marie Hullot:
  Proofs by Induction in Equational Theories with Constructors. 239-266

• 
  Jan A. Bergstra, John V. Tucker:
  Expressiveness and the Completeness of Hoare's Logic. 267-284
• 
  Takumi Kasai, Raymond E. Miller:
  Homomorphisms between Models of Parallel Computation. 285-331
• 
  Christoph M. Hoffmann:
  Subcomplete Generalizations of Graph Isomorphism. 332-359
• 
  Wolfgang Thomas:
  Classifying Regular Events in Symbolic Logic. 360-376
• 
  Werner Kuich:
  An Algebraic Characterization of Some Principal Regulated Rational Cones. 377-401
• 
  Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli:
  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness. 402-417
• 
  Joost Engelfriet, Sven Skyum:
  The Copying Power of One-State Tree Transducers. 418-435

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-19 22:13 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: