Stop the war!

Остановите войну!

• solidarity - (ua) - (ru)
• news - (ua) - (ru)
• donate - donate - donate

for scientists:

• ERA4Ukraine
• Assistance in Germany
• Ukrainian Global University
• #ScienceForUkraine

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

• 
  E. Allen Emerson, Joseph Y. Halpern:
  Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. 1-24
• 
  Karl M. Schimpf, Jean H. Gallier:
  Tree Pushdown Automata. 25-40
• 
  John H. Reif, A. Prasad Sistla:
  A Multiprocess Network Logic with Temporal and Spatial Modalities. 41-53
• 
  Norishige Chiba, Takao Nishizeki, Shigenobu Abe, Takao Ozawa:
  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees. 54-76
• 
  Marek Chrobak:
  Variations on the Technique of Duris and Galil. 77-85
• 
  Joost Engelfriet:
  Hierarchies of Hyper-AFLs. 86-115
• 
  Richard E. Ladner, Jeffrey K. Norman:
  Solitaire Automata. 116-129
• 
  Allan Borodin, John E. Hopcroft:
  Routing, Merging, and Sorting on Parallel Models of Computation. 130-145

STOC 1983

• 
  Patrick W. Dymond, Martin Tompa:
  Speedups of Deterministic Machines by Synchronous Parallel Machines. 149-161
• 
  Dexter Kozen:
  A Probabilistic PDL. 162-178
• 
  Susan Landau, Gary L. Miller:
  Solvability by Radicals is in Polynomial Time. 179-208
• 
  Harold N. Gabow, Robert Endre Tarjan:
  A Linear-Time Algorithm for a Special Case of Disjoint Set Union. 209-221
• 
  Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
  Unbounded Fan-In Circuits and Associative Functions. 222-234
• 
  Arjen K. Lenstra:
  Factoring Multivariate Polynomials over Finite Fields. 235-248

• 
  Jakob Gonczarowski, Eliahu Shamir:
  Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style. 249-273
• 
  Antonio Bahamonde:
  Cost Functors and Optimal Realization. 274-290
• 
  Hirotomo Aso, Namio Honda:
  Dynamical Characteristics of Linear Cellular Automata. 291-317
• 
  Michael G. Main, David B. Benson:
  Free Semiring-Representations and Nondeterminism. 318-328
• 
  Ferng-Ching Lin, I-Chen Wu:
  Area-Period Tradeoffs for Multiplication of Rectangular Matrices. 329-342
• 
  Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek:
  Complexity of Certain Decision Problems about Congruential Languages. 343-358
• 
  William M. Kantor:
  Sylow's Theorem in Polynomial Time. 359-394
• 
  Ronald V. Book, Timothy J. Long, Alan L. Selman:
  Qualitative Relativizations of Complexity Classes. 395-413

a service of  

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 web.archive.org

Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-23 23:46 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: