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

STOC 1986

• 
  Edward G. Coffman Jr., Frank Thomson Leighton:
  A Provably Efficient Algorithm for Dynamic Storage Allocation. 2-35
• 
  Mihalis Yannakakis:
  Embedding Planar Graphs in Four Pages. 36-67
• 
  Jin-yi Cai:
  With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy. 68-85
• 
  James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan:
  Making Data Structures Persistent. 86-124
• 
  Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
  Optimal Parallel Selection has Complexity O(Log Log n). 125-133
• 
  Zvi Galil, Ravi Kannan, Endre Szemerédi:
  On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines. 134-149
• 
  David A. Mix Barrington:
  Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹. 150-164
• 
  Herbert Edelsbrunner, Leonidas J. Guibas:
  Topologically Sweeping an Arrangement. 165-194
• 
  Joseph Y. Halpern, Moshe Y. Vardi:
  The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds. 195-237

• 
  Heikki Mannila, Kari-Jouko Räihä:
  Automatic Generation of Test Data for Relational Queries. 240-258
• 
  Jeffrey F. Naughton:
  Data Independent Recursion in Deductive Databases. 259-289
• 
  Nicole Bidoit, Richard Hull:
  Minimalism, Justification and Non-Monotonicity in Deductive Databases. 290-325
• 
  François Bancilhon, Setrag Khoshafian:
  A Calculus for Complex Objects. 326-340
• 
  Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
  On the Convergence of Query Evaluation. 341-359
• 
  Thanasis Hadzilacos, Mihalis Yannakakis:
  Deleting Completed Transactions. 360-379
• 
  Yehoshua Sagiv, Oded Shmueli:
  A Characterization of Finite fd-Acyclicity. 380-404
• 
  Frank Olken, Doron Rotem:
  Rearranging Data to Maximize the Efficiency of Compression. 405-430

• 
  Juraj Hromkovic, Katsushi Inoue, Itsuo Takanami:
  Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines. 431-451
• 
  Oscar H. Ibarra, Tao Jiang, Jik H. Chang:
  On Iterative and Cellular Tree Arrays. 452-473
• 
  Marie-Paule Flé:
  Serialization of Concurrent Programs. 474-493
• 
  Victor Y. Pan, John H. Reif:
  Fast and Efficient Solution of Path Algebra Problems. 494-510
• 
  Craig A. Rich:
  Positive Relativizations of the P = ? NP Problem. 511-523

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-07-17 01:17 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: