Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 1980
- Leonard M. Adleman:
On Distinguishing Prime Numbers from Composite Numbers (Abstract). FOCS 1980: 387-406 - Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan:
Biased 2-3 Trees. FOCS 1980: 248-254 - Jon Louis Bentley, Donna J. Brown:
A General Class of Resource Tradeoffs (Extended Abstract). FOCS 1980: 217-228 - Gilles Brassard:
A Time-Luck Tradeoff in Cryptography. FOCS 1980: 380-386 - Burchard von Braunmühl, Rutger Verbeek:
A Recognition Algorithm for Deterministic CFLS optimal in Time and Space. FOCS 1980: 411-420 - Ashok K. Chandra, David Harel:
Structure and Complexity of Relational Queries. FOCS 1980: 333-347 - Paul Chew:
An Improved Algorithm for Computing With Equations. FOCS 1980: 108-117 - Robert L. Constable:
Programs and Types. FOCS 1980: 118-128 - Bruno Courcelle, Paul Franchi-Zannettacci:
On the Expressive Power of Attribute Grammars. FOCS 1980: 161-172 - Ernst-Erich Doberkat:
Some Observations on the Average Behavior of Heapsort (Preliminary Report). FOCS 1980: 229-237 - David P. Dobkin, J. Ian Munro:
Efficient Uses of the Past. FOCS 1980: 200-206 - Patrick W. Dymond, Stephen A. Cook:
Hardware Complexity and Parallel Computation (Preliminary Version). FOCS 1980: 360-372 - Philippe Flajolet, Andrew M. Odlyzko:
Exploring Binary Trees and Other Simple Trees. FOCS 1980: 207-216 - Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). FOCS 1980: 260-269 - Nissim Francez, Daniel Lehmann, Amir Pnueli:
A Linear History Semantics for Distributed Languages (Extended Abstract). FOCS 1980: 143-151 - Nissim Francez, Michael Rodeh:
A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme. FOCS 1980: 373-379 - Greg N. Frederickson:
Implicit Data Structures with Fast Update (Preliminary Report). FOCS 1980: 255-259 - Michael L. Fredman:
The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries. FOCS 1980: 191-199 - Merrick L. Furst, John E. Hopcroft, Eugene M. Luks:
Polynomial-Time Algorithms for Permutation Groups. FOCS 1980: 36-41 - Eitan M. Gurari:
The Equivalence Problem for Deterministic Two-Way Sequential Transducers Is Decidable. FOCS 1980: 83-85 - Dov Harel:
A Linear Time Algorithm for the Lowest Common Ancestors Problem (Extended Abstract). FOCS 1980: 308-319 - David Harel, Dexter Kozen, Rohit Parikh:
Process Logic: Expressiveness, Decidability, Completeness. FOCS 1980: 129-142 - Jia-Wei Hong:
On Similarity and Duality of Computation (Extended Abstract). FOCS 1980: 348-359 - T. C. Hu, M. T. Shing:
Some Theorems about Matrix Multiplication (Extended Abstract). FOCS 1980: 28-35 - Gérard P. Huet, Jean-Marie Hullot:
Proofs by Induction in Equational Theories with Constructors. FOCS 1980: 96-107 - Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract). FOCS 1980: 152-160 - Neil Immerman:
Upper and Lower Bounds for First Order Expressibility. FOCS 1980: 74-82 - Neil D. Jones, Steven S. Muchnick:
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra. FOCS 1980: 185-190 - Richard M. Karp, Christos H. Papadimitriou:
On Linear Characterizations of Combinatorial Optimization Problems. FOCS 1980: 1-9 - A. J. Kfoury:
Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report). FOCS 1980: 173-184
skipping 16 more matches
loading more results
failed to load more results, please try again later
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).
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).
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 .
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.
retrieved on 2024-04-23 16:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint