Остановите войну!
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 32 matches
- 1977
- Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller:
On Taking Roots in Finite Fields. FOCS 1977: 175-178 - Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977: 107-113 - Victor L. Bennison, Robert I. Soare:
Recursion Theoretic Characterizations of Complexity Theoretic Properties. FOCS 1977: 100-106 - Leonard Berman:
Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report. FOCS 1977: 95-99 - Manuel Blum, William J. Sakoda:
On the Capability of Finite Automata in 2 and 3 Dimensional Space. FOCS 1977: 147-161 - Ronald V. Book:
Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets. FOCS 1977: 58-61 - Edmund M. Clarke:
Program Invariants as Fixed Points (Preliminary Reports). FOCS 1977: 18-29 - Edward G. Coffman Jr., Joseph Y.-T. Leung:
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. FOCS 1977: 214-221 - Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin:
On the Average Number of Registers Required for Evaluating Arithmetic Expressions. FOCS 1977: 196-205 - Zvi Galil, Joel I. Seiferas:
Saving Space in Fast String-Matching. FOCS 1977: 179-188 - Leonidas J. Guibas, Andrew M. Odlyzko:
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. FOCS 1977: 189-195 - Gérard P. Huet:
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. FOCS 1977: 30-45 - Laurent Hyafil:
The Power of Commutativity. FOCS 1977: 171-174 - Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications. FOCS 1977: 74-81 - Howard P. Katseff, Michael Sipser:
Several Results in Program Size Complexity. FOCS 1977: 82-89 - Dexter Kozen:
Lower Bounds for Natural Proof Systems. FOCS 1977: 254-266 - H. T. Kung, S. W. Song:
An Efficient Parallel Garbage Collection System and Its Correctness Proof. FOCS 1977: 120-131 - Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems. FOCS 1977: 206-213 - Daniel Lehmann, Michael B. Smyth:
Data Types (Extended Abstract). FOCS 1977: 7-12 - Harry R. Lewis:
A New Decidable Problem, with Applications (Extended Abstract). FOCS 1977: 62-73 - Richard J. Lipton:
A Necessary and Sufficient Condition for the Existence of Hoare Logics. FOCS 1977: 1-6 - Richard J. Lipton, Robert Endre Tarjan:
Application of a Planar Separator Theorem. FOCS 1977: 162-170 - Errol L. Lloyd:
On Triangulations of a Set of Points in the Plane. FOCS 1977: 228-240 - David Maier:
A Space Efficient Method for the Lowest Common Ancestor Problem and an Application to Finding Negative Cycles. FOCS 1977: 132-141 - Greg Nelson, Derek C. Oppen:
Fast Decision Algorithms Based on Union and Find. FOCS 1977: 114-119 - David A. Plaisted:
New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. FOCS 1977: 241-253 - Amir Pnueli:
The Temporal Logic of Programs. FOCS 1977: 46-57 - Michael B. Smyth, Gordon D. Plotkin:
The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract). FOCS 1977: 13-17 - Lawrence Snyder:
On Uniquely Represented Data Structures (Extended Abstract). FOCS 1977: 142-146 - Richard Statman:
The Typed lambda-Calculus Is not Elementary Recursive. FOCS 1977: 90-94
skipping 2 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-08 18:33 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