Остановите войну!
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 87 matches
- 1991
- Ilan Adler, Peter A. Beling:
Polynomial Algorithms for LP over a Subring of the Algebraic Integers with Applications to LP with Circulant Matrices. FOCS 1991: 480-487 - Howard Aizenstein, Leonard Pitt:
Exact Learning of Read-Twice DNF Formulas (Extended Abstract). FOCS 1991: 170-179 - Noga Alon:
A parallel algorithmic version of the Local Lemma. FOCS 1991: 586-593 - Noga Alon, Zvi Galil, Oded Margalit:
On the Exponent of the All Pairs Shortest Path Problem. FOCS 1991: 569-575 - Amihood Amir, Martin Farach:
Adaptive Dictionary Matching. FOCS 1991: 760-766 - Arne Andersson, Thomas Ottmann:
Faster Uniquely Represented Dictionaries. FOCS 1991: 642-649 - Yonatan Aumann, Michael Ben-Or:
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract). FOCS 1991: 440-446 - Baruch Awerbuch, Boaz Patt-Shamir, George Varghese:
Self-Stabilization By Local Checking and Correction (Extended Abstract). FOCS 1991: 268-277 - Baruch Awerbuch, Leonard J. Schulman:
The Maintenance of Common Data in a Distributed System. FOCS 1991: 505-514 - Baruch Awerbuch, George Varghese:
Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols (Extended Abstract). FOCS 1991: 258-267 - László Babai, Katalin Friedl:
Approximate Representation Theory of Finite Groups. FOCS 1991: 733-742 - Sanjoy K. Baruah, Gilad Koren, Bhubaneswar Mishra, Arvind Raghunathan, Louis E. Rosier, Dennis E. Shasha:
On-line Scheduling in the Presence of Overload. FOCS 1991: 100-110 - Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser:
Languages that Are Easier than their Proofs. FOCS 1991: 19-28 - Richard Beigel, Jun Tarui:
On ACC. FOCS 1991: 783-792 - Amir M. Ben-Amram, Zvi Galil:
Lower Bounds for Data Structure Problems on RAMs (Extended Abstract). FOCS 1991: 622-631 - Johannes Blömer:
Computing Sums of Radicals in Polynomial Time. FOCS 1991: 670-677 - Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. FOCS 1991: 90-99 - Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge. FOCS 1991: 69-78 - Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulae. FOCS 1991: 334-341 - Bernard Chazelle:
An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract). FOCS 1991: 29-38 - Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou:
How to Learn an Unknown Environment (Extended Abstract). FOCS 1991: 298-303 - Bruce Randall Donald, Davied Renpan Chang:
On the Complexity of Computing the Homology Type of a Triangulation. FOCS 1991: 650-661 - Ding-Zhu Du, Yanjun Zhang, Qing Feng:
On Better Heuristic for Euclidean Steiner Minimum Trees (Extended Abstract). FOCS 1991: 431-439 - Herbert Edelsbrunner, Tiow Seng Tan:
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract). FOCS 1991: 414-423 - Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall:
Communication Complexity Towards Lower Bounds on Circuit Depth. FOCS 1991: 249-257 - E. Allen Emerson, Charanjit S. Jutla:
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). FOCS 1991: 368-377 - Ioannis Z. Emiris, John F. Canny:
A General Approach to Removing Degeneracies. FOCS 1991: 405-413 - David Eppstein:
Dynamic Three-Dimensional Linear Programming. FOCS 1991: 488-494 - Tomás Feder, Eyal Kushilevitz, Moni Naor:
Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248 - Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy:
Approximating Clique is Almost NP-Complete (Preliminary Version). FOCS 1991: 2-12
skipping 57 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-06-04 02:25 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