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

SPARQL queries 

run query for this table of contents

• frequent references
• highly cited publications

or build your own?

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

• 
  Daniel J. Lehmann:
  On the Algebra of Order. 1-23
• 
  Lazaros P. Mavrides:
  A Finite Step-Size Procedure for the F-W Method. 24-29
• 
  Shigeko Seki, Youichi Kobuchi:
  On DIL Schemes Simulated by D0L Schemes. 30-45
• 
  Dana Angluin:
  Finding Patterns Common to a Set of Strings. 46-62
• 
  Satoru Fujishige:
  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem. 63-86
• 
  Tom Head:
  A-Transducers and the Monotonicity of IL Schemes. 87-91
• 
  Jeffrey M. Jaffe:
  The Equivalence of RE Program Schemes and Data Flow Schemes. 92-109
• 
  Hermann A. Maurer, Arto Salomaa, Derick Wood:
  Context-Free Grammar Forms with Strict Interpretations. 110-135
• 
  Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
  Structure Preserving Reductions among Convex Optimization Problems. 136-153

STOC 1979

• 
  Ashok K. Chandra, David Harel:
  Computable Queries for Relational Data Bases. 156-178
• 
  Richard E. Ladner:
  The Complexity of Problems in Systems of Communicating Sequential Processes. 179-194
• 
  Michael Sipser:
  Lower Bounds on the Size of Sweeping Automata. 195-202
• 
  Zvi Galil, Amnon Naamad:
  An O(EVlog²V) Algorithm for the Maximal Flow Problem. 203-217
• 
  Walter L. Ruzzo:
  Tree-Size Bounded Alternation. 218-235
• 
  J. Ian Munro, Hendra Suwanda:
  Implicit Data Structures for Fast Search and Update. 236-250

• 
  Nancy A. Lynch:
  Straight-Line Program Length as a Parameter for Complexity Analysis. 251-280
• 
  G. Naudé:
  A Duality Theory for Decomposable Systems in a Category. 281-291
• 
  Franz-Josef Brandenburg:
  Multiple Equality Sets and Post Machines. 292-316
• 
  Harry R. Lewis:
  Complexity Results for Classes of Quantificational Formulas. 317-353
• 
  Gaston H. Gonnet:
  Open-Addressing Hashing with Unequal-Probability Keys. 354-367
• 
  David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman:
  Adequacy of Decompositions of Relational Databases. 368-379

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-07 20:20 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: