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

• 
  Shlomo Moran:
  Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies. 1-8
• 
  Tsuyoshi Nakamura:
  Regularity and Firing Sequences of Computation Graphs. 9-28
• 
  Stephen J. Willson:
  Growth Patterns of Ordered Cellular Automata. 29-41
• 
  Keijo Ruohonen:
  The Decidability of the D0L-DT0L Equivalence Problem. 42-52
• 
  Paul Chew, Michael Machtey:
  A Note on Structure and Looking Back Applied to the Complexity of Computable Functions. 53-59
• 
  Tatsuo Ohtsuki, Hajimu Mori, Toshinobu Kashiwabara, Toshio Fujisawa:
  On Minimal Augmentation of a Graph to Obtain an Interval Graph. 60-97
• 
  Robert Melville:
  An Improved Simulation Result for Ink-Bounded Turing Machines. 98-105

• 
  Gregory A. Riccardi:
  The Independence of Control Structures in Abstract Programming Systems. 107-143
• 
  Dirk Janssens, Grzegorz Rozenberg:
  Decision Problems for Node Label Controlled Graph Grammars. 144-177
• 
  David A. Workman:
  SR(s, k) Parsers: A Class of Shift-Reduce Bounded-Context Parsers. 178-197
• 
  Michael P. Georgeff:
  Interdependent Translation Schemes. 198-219
• 
  Eitan M. Gurari, Oscar H. Ibarra:
  The Complexity of Decision Problems for Finite-Turn Multicounter Machines. 220-229
• 
  John E. Savage:
  Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models. 230-242
• 
  Theodore P. Baker:
  Extending Lookahead for LR Parsers. 243-259

FOCS 1979

• 
  Mark N. Wegman, Larry Carter:
  New Hash Functions and Their Use in Authentication and Set Equality. 265-279
• 
  Gilles Brassard:
  A Time-Luck Tradeoff in Relativized Cryptography. 280-311
• 
  Wolfgang J. Paul, Rüdiger Reischuk:
  On Time versus Space II. (Turing Machines). 312-327
• 
  Dexter Kozen:
  Semantics of Probabilistic Programs. 328-350
• 
  Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
  A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. 351-364
• 
  Walter L. Ruzzo:
  On Uniform Circuit Complexity. 365-383
• 
  Neil Immerman:
  Number of Quantifiers is Better Than Number of Tape Cells. 384-406
• 
  Ofer Gabber, Zvi Galil:
  Explicit Constructions of Linear-Sized Superconcentrators. 407-420
• 
  Janos Simon:
  Division in Idealized Unit Cost RAMS. 421-441
• 
  Michael Machtey, Paul Young:
  Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems. 442-453
• 
  Nicholas Pippenger:
  Computational Complexity of Algebraic Functions. 454-470

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-12-05 22:25 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: