Остановите войну!
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 44 matches
- 1979
- Leonard M. Adleman:
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract). FOCS 1979: 55-60 - Leonard M. Adleman, Kenneth L. Manders:
Reductions that Lie. FOCS 1979: 397-410 - Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis:
Modeling Communications Protocols by Automata. FOCS 1979: 267-273 - Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff:
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. FOCS 1979: 218-223 - Bengt Aspvall, Yossi Shiloach:
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality. FOCS 1979: 205-217 - László Babai, Ludek Kucera:
Canonical Labelling of Graphs in Linear Average Time. FOCS 1979: 39-46 - Theodore P. Baker, Juris Hartmanis:
Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages. FOCS 1979: 392-396 - Meera Blattner:
The Decidability of the Equivalence of Context-Free Grammar Forms. FOCS 1979: 91-96 - Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa:
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. FOCS 1979: 319-327 - Gilles Brassard:
Relativized Cryptography. FOCS 1979: 383-391 - Edmund M. Clarke, Lishing Liu:
Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs (Preliminary Report). FOCS 1979: 255-266 - Nachum Dershowitz:
Orderings for Term-Rewriting Systems. FOCS 1979: 123-131 - David P. Dobkin, Lawrence Snyder:
On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract). FOCS 1979: 9-17 - Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin:
Resource Allocation with Immunity to Limited Process Failure (Preliminary Report). FOCS 1979: 234-254 - Philippe Flajolet, Jean Françon, Jean Vuillemin:
Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version). FOCS 1979: 183-195 - Ofer Gabber, Zvi Galil:
Explicit Constructions of Linear Size Superconcentrators. FOCS 1979: 364-370 - Harold N. Gabow, Robert Endre Tarjan:
Efficient Algorithms for Simple Matroid Intersection Problems. FOCS 1979: 196-204 - Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda:
Toward Self-Organizing Linear Search (Preliminary Draught). FOCS 1979: 169-174 - Sheila A. Greibach:
Formal Languages: Origins and Directions. FOCS 1979: 66-90 - Juris Hartmanis:
Observations about the Development of Theoretical Computer Science. FOCS 1979: 224-233 - Neil Immerman:
Length of Predicate Calculus Formulas as a New Complexity Measure. FOCS 1979: 337-347 - Zvi M. Kedem, Abraham Silberschatz:
Controlling Concurrency Using Locking Protocols (Preliminary Report). FOCS 1979: 274-285 - David G. Kirkpatrick:
Efficient Computation of Continuous Skeletons. FOCS 1979: 18-27 - Stephen Cole Kleene:
Origins of Recursive Function Theory. FOCS 1979: 371-382 - Dexter Kozen:
Semantics of Probabilistic Programs. FOCS 1979: 101-114 - J. C. Lagarias:
Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations. FOCS 1979: 47-54 - Karl J. Lieberherr, Ernst Specker:
Complexity of Partial Satisfaction. FOCS 1979: 132-139 - Hermann A. Maurer, Maurice Nivat:
Bijective A-Transducers. FOCS 1979: 97-100 - Victor Y. Pan:
Field Extension and Triangular Aggregating, Uniting and Canceling for the Acceleration of Matrix Multiplications. FOCS 1979: 28-38 - Wolfgang J. Paul, Rüdiger Reischuk:
On Time versus Space II. FOCS 1979: 298-306
skipping 14 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-05-07 21:10 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