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

FOCS 1984

• 
  Ketan Mulmuley:
  Fully Abstract Submodels of Typed Lambda Calculi. 2-46
• 
  Amos Fiat, Adi Shamir:
  Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers. 47-65
• 
  J. Ian Munro:
  An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time. 66-74
• 
  Miklos Santha, Umesh V. Vazirani:
  Generating Quasi-random Sequences from Semi-random Sources. 75-87
• 
  Albert G. Greenberg, Alan Weiss:
  A Lower Bound for Probabilistic Algorithms for Finite State Machines. 88-105
• 
  Ramamohan Paturi, Janos Simon:
  Probabilistic Communication Complexity. 106-123

• 
  Heikki Mannila, Kari-Jouko Räihä:
  Design by Example: An Application of Armstrong Relations. 126-141
• 
  Moshe Y. Vardi:
  Querying Logical Databases. 142-160
• 
  Ouri Wolfson, Mihalis Yannakakis:
  Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. 161-178
• 
  Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
  Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. 179-202
• 
  Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
  Partition Semantics for Relations. 203-233
• 
  Tim Connors:
  Equivalence of Views by Query Capacity. 234-274
• 
  Yehoshua Sagiv:
  Concurrent Operations on B*-Trees with Overtaking. 275-296
• 
  Thanasis Hadzilacos, Christos H. Papadimitriou:
  Algorithmic Aspects of Multiversion Concurrency Control. 297-310

• 
  Orna Grumberg, Nissim Francez, Shmuel Katz:
  A Complete Rule for Equifair Termination. 313-332
• 
  Andrzej Tarlecki:
  Quasi-varieties in Abstract Algebraic Institutions. 333-360
• 
  Serge Abiteboul, Nicole Bidoit:
  Non First Normal Form Relations: An Algebra Allowing Data Restructuring. 361-393
• 
  Martin E. Kaliski, S. Yunkap Kwankam, Pamela Halpern, David Shulman:
  A Theory of Orbital Behavior in a Class of Nonlinear Systems: Chaos and a Signature-Based Approach. 394-414
• 
  Dirk Janssens, Grzegorz Rozenberg, Emo Welzl:
  The Bounded Degree Problem for NLC Grammars is Decidable. 415-422
• 
  Günter Hotz:
  A Representation Theorem of Infinite Dimensional Algebras and Applications to Language Theory. 423-455
• 
  Elias Dahlhaus, Manfred K. Warmuth:
  Membership for Growing Context-Sensitive Grammars is Polynomial. 456-472
• 
  Howard C. Card, Adonios Thanailakis, Werner Pries, Robert D. McLeod:
  Analysis of Bounded Linear Cellular Automata Based on a Method of Image Charges. 473-480

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-10-22 02:14 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: