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

• 
  Seinosuke Toda:
  Simple Characterizations of P(#P) and Complete Problems. 1-17
• 
  Tadakazu Sato:
  Group Structured Linear Cellular Automata over Zm. 18-23
• 
  Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi:
  The Random Oracle Hypothesis Is False. 24-39
• 
  Takashi Hattori:
  Time-Extraction for Temporal Logic-Logic Programming and Local Process Time. 40-56
• 
  Egon Wanke:
  The Complexity of Connectivity Problems on Context-Free Graph Languages. 57-82
• 
  Nicholas Pippenger:
  Symmetry in Self-Correcting Cellular Automata. 83-95
• 
  Sanjay Jain, Arun Sharma:
  Characterizing Language Identification by Standardizing Operations. 96-107
• 
  Vijay Raghavan:
  Bounded Degree Graph Inference from Walks. 108-132
• 
  Emanuela Fachini, Angelo Monti:
  A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. 133-147

• 
  Noam Nisan, Avi Wigderson:
  Hardness vs Randomness. 149-167
• 
  Taishin Y. Nishida, Youichi Kobuchi:
  Invariant Sets for Substitution. 168-174
• 
  Narayanan Krishnakumar:
  On Computing Serial Dependency Relations. 175-188
• 
  John Case, Sanjay Jain, Arun Sharma:
  Vacillatory Learning of Nearly Minimal Size Grammars. 189-207
• 
  Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park:
  Dynamic Dictionary Matching. 208-222
• 
  Michael Kaminski:
  A Branching Time Logic with Past Operators. 223-246
• 
  Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson:
  Non-Deterministic Communication Complexity with Few Witnesses. 247-257
• 
  Joost Engelfriet, Heiko Vogler:
  The Translation Power of Top-Down Tree-to-Graph Transducers. 258-305
• 
  Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach:
  Efficient Inference of Partial Types. 306-324
• 
  Vitit Kantabutra:
  A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons. 325-333
• 
  Jia-Huai You, Li-Yan Yuan:
  A Three-Valued Semantics for Deductive Databases and Logic Programs. 334-361
• 
  Kai Salomaa, Sheng Yu:
  Measures of Nondeterminism for Pushdown Automata. 362-374
• 
  Zoran Obradovic, Ian Parberry:
  Learning with Discrete Multi-valued Neurons. 375-390
• 
  Kokichi Sugihara:
  Robust Gift Wrapping for the Three-Dimensional Convex Hull. 391-407
• 
  Leslie Ann Goldberg:
  Listing Graphs That Satisfy First-Order Sentences. 408-424

FOCS 1989

• 
  Ketan Mulmuley:
  An Efficient Algorithm for Hidden Surface Removal, II. 427-453
• 
  Bonnie Berger, John Rompel, Peter W. Shor:
  Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. 454-477
• 
  Rajeev Motwani, Joseph Naor, Moni Naor:
  The Probabilistic Method Yields Deterministic Parallel Algorithms. 478-516
• 
  Vijaya Ramachandran, John H. Reif:
  Planarity Testing in Parallel. 517-561
• 
  Miklós Ajtai, Yuri Gurevich:
  Datalog vs First-Order Logic. 562-588

• 
  Mark A. Fulk, Sanjay Jain, Daniel N. Osherson:
  Open Problems in "Systems That Learn". 589-604
• 
  Jin-yi Cai, Juris Hartmanis:
  On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. 605-619
• 
  Zhenyu Qian:
  Another Look at Parameterization for Order-Sorted Algebraic Specifications. 620-666
• 
  Joan Boyar, Kim S. Larsen:
  Efficient Rebalancing of Chromatic Search Trees. 667-682
• 
  Mark Levene, George Loizou:
  The Nested Universal Relation Data Model. 683-717
• 
  Bruno Durand:
  The Surjectivity Problem for 2D Cellular Automata. 718-725
• 
  Minoru Ito, Grant E. Weddell:
  Implication Problems for Functional Constraints on Databases Supporting Complex Objects. 726-768
• 
  Michael R. Fellows, Michael A. Langston:
  On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. 769-779

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-11-21 20:19 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: