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

• 
  Mihály Geréb-Graus, Ming Li:
  Three One-Way Heads Cannot Do String Matching. 1-8
• 
  Stephen J. Hegner:
  Unique Complements and Decomposition of Database Schemata. 9-57
• 
  Joost Engelfriet, Linda Heyker:
  Hypergraph Languages of Bounded Degree. 58-89
• 
  Guy E. Blelloch, James J. Little:
  Parallel Solutions to Geometric Problems in the Scan Model of Computation. 90-115
• 
  Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz:
  Gap-Definable Counting Classes. 116-148
• 
  Jarkko Kari:
  Reversibility and Surjectivity Problems of Cellular Automata. 149-182
• 
  Jin-yi Cai, Anne Condon, Richard J. Lipton:
  PSPACE Is Provable by Two Provers in One Round. 183-193
• 
  Noga Alon, Pavel Pudlák:
  Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). 194-202

• 
  Leong Kwan Li:
  Learning Fixed Point Patterns by Recurrent Networks. 203-213
• 
  Omer Berkman, Uzi Vishkin:
  Finding Level-Ancestors in Trees. 214-230
• 
  Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
  Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. 231-254
• 
  Marco Cadoli, Maurizio Lenzerini:
  The Complexity of Propositional Closed World Reasoning and Circumscription. 255-310
• 
  Gyora M. Benedek, Alon Itai:
  Nonuniform Learnability. 311-323
• 
  Steven Homer, Luc Longpré:
  On Reductions of NP Sets to Sparse Sets. 324-336
• 
  Douglas R. Stinson:
  Combinatorial Techniques for Universal Hashing. 337-346
• 
  Kai-Yeung Siu, Amir Dembo, Thomas Kailath:
  On the Perceptron Learning Algorithm on Data with High Precision. 347-356
• 
  Alan L. Selman:
  A Taxonomy of Complexity Classes of Functions. 357-381

FOCS 1990

• 
  Marshall W. Bern, David Eppstein, John R. Gilbert:
  Provably Good Mesh Generation. 384-409
• 
  Amos Fiat, Yuval Rabani, Yiftach Ravid:
  Competitive k-Server Algorithms. 410-428
• 
  C. Andrew Neff:
  Specified Precision Polynomial Root Isolation Is in NC. 429-463
• 
  Michael J. Kearns, Robert E. Schapire:
  Efficient Distribution-Free Learning of Probabilistic Concepts. 464-497
• 
  Christos H. Papadimitriou:
  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. 498-532
• 
  Michael L. Fredman, Dan E. Willard:
  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. 533-551

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: