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 21 of 21 records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all 21 records

refine by search term

refine by author

• more options

• no options

• 

• temporarily not available

refine by access 

• more options

• no options

• 

• temporarily not available

• 
  Takumi Kasai, Akeo Adachi:
  A Characterization of Time Complexity by Simple Loop Programs. 1-17
• 
  William J. Masek, Mike Paterson:
  A Faster Algorithm Computing String Edit Distances. 18-31
• 
  Janusz A. Brzozowski, Faith E. Fich:
  Languages of R-Trivial Monoids. 32-49
• 
  John Gallant, David Maier, James A. Storer:
  On Finding Minimal Length Superstrings. 50-58
• 
  Satoru Miyano:
  One-Way Weak-Stack-Counter Automata. 59-76
• 
  Teofilo F. Gonzalez, Joseph F. JáJá:
  On the Complexity of Computing Bilinear Forms with {0, 1} Constants. 77-95
• 
  Matthew Hennessy:
  A Proof System for the First-Order Relational Calculus. 96-110
• 
  Paul F. Dietz, S. Rao Kosaraju:
  Recognition of Topological Equivalence of Patterns by Array Automata. 111-116
• no results

STOC 1978

• 
  Martin Tompa:
  Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits. 118-132
• 
  Andrea S. LaPaugh, Ronald L. Rivest:
  The Subgraph Homeomorphism Problem. 133-149
• 
  Joost Engelfriet, Grzegorz Rozenberg, Giora Slutzki:
  Tree Transducers, L Systems, and Two-Way Machines. 150-202
• 
  Raymond E. Miller, Chee-Keng Yap:
  On Formulating Simultaneity for Studying Parallelism and Synchronization. 203-218
• 
  John M. Lewis, Mihalis Yannakakis:
  The Node-Deletion Problem for Hereditary Properties is NP-Complete. 219-230
• 
  Vaughan R. Pratt:
  A Near-Optimal Method for Reasoning about Action. 231-254
• 
  I. S. Filotti:
  An Algorithm for Imbedding Cubic Graphs in the Torus. 255-276
• no results

• 
  Abraham Ginzburg, Michael Yoeli:
  Vector Addition Systems and Regular Languages. 277-284
• 
  Luc Boasson, Maurice Nivat:
  Adherences of Languages. 285-309
• 
  Jan Paredaens:
  The Interaction of Integrity Constraints in an Information System. 310-329
• 
  Michael A. Arbib, Ernest G. Manes:
  Foundations of System Theory: The Hankel Matrix. 330-378
• 
  Karel Culík II, Arto Salomaa:
  Test Sets and Checking Words for Homomorphism Equivalence. 379-395
• 
  Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer:
  Coping with Errors in Binary Search Procedures. 396-404
• no results

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-08-28 00:51 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: