Остановите войну!
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 60 matches
- 1990
- Alok Aggarwal, Mark Hansen, Frank Thomson Leighton:
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract). STOC 1990: 331-340 - Noga Alon, Paul D. Seymour, Robin Thomas:
A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990: 293-299 - Sanjeev Arora, Frank Thomson Leighton, Bruce M. Maggs:
On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract). STOC 1990: 149-158 - Donald Beaver, Silvio Micali, Phillip Rogaway:
The Round Complexity of Secure Protocols (Extended Abstract). STOC 1990: 503-513 - Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
Perfect Zero-Knowledge in Constant Rounds. STOC 1990: 482-493 - Mihir Bellare, Silvio Micali, Rafail Ostrovsky:
The (True) Complexity of Statistical Zero Knowledge. STOC 1990: 494-502 - Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
On the Power of Randomization in Online Algorithms (Extended Abstract). STOC 1990: 379-386 - Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
Online Algorithms for Locating Checkpoints. STOC 1990: 359-368 - Avrim Blum:
Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract). STOC 1990: 64-72 - Manuel Blum, Michael Luby, Ronitt Rubinfeld:
Self-Testing/Correcting with Applications to Numerical Problems. STOC 1990: 73-83 - Raymond A. Board, Leonard Pitt:
On the Necessity of Occam Algorithms. STOC 1990: 54-63 - Allan Borodin, Prasoon Tiwari:
On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version). STOC 1990: 535-545 - Richard Cleve:
Towards Optimal Simulations of Formulas by Bounded-Width Programs. STOC 1990: 271-277 - Richard Cole:
On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract). STOC 1990: 8-17 - Don Coppersmith, Peter Doyle, Prabhakar Raghavan, Marc Snir:
Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). STOC 1990: 369-378 - Robert Cypher, C. Greg Plaxton:
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. STOC 1990: 193-203 - Martin Dietzfelbinger, Friedhelm Meyer auf der Heide:
How to Distribute a Dictionary in a Complete Network. STOC 1990: 117-127 - Shimon Even, Sergio Rajsbaum:
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract). STOC 1990: 95-105 - Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal:
Computing with Unreliable Information (Preliminary Version). STOC 1990: 128-137 - Uriel Feige, Adi Shamir:
Witness Indistinguishable and Witness Hiding Protocols. STOC 1990: 416-426 - Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld:
The Wakeup Problem (Extended Abstract). STOC 1990: 106-116 - Greg N. Frederickson:
The Information Theory Bound Is Tight for Selection in a Heap. STOC 1990: 26-33 - Michael L. Fredman, Dan E. Willard:
BLASTING through the Information Theoretic Barrier with FUSION TREES. STOC 1990: 1-7 - Joseph Gil, Friedhelm Meyer auf der Heide, Avi Wigderson:
Not All Keys Can Be Hashed in Constant Time (Preliminary Version). STOC 1990: 244-253 - Wayne Goddard, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. STOC 1990: 45-53 - Tero Harju, Juhani Karhumäki:
Decidability of the Multiplicity Equivalence of Multitape Finite Automata. STOC 1990: 477-481 - Johan Håstad:
Pseudo-Random Generators under Uniform Assumptions. STOC 1990: 395-404 - William M. Kantor, Eugene M. Luks:
Computing in Quotient Groups. STOC 1990: 524-534 - Ming-Yang Kao, Philip N. Klein:
Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. STOC 1990: 181-192 - Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani:
An Optimal Algorithm for On-line Bipartite Matching. STOC 1990: 352-358
skipping 30 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 00:05 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