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 82 matches
- 1994
- Noga Alon, Nabil Kahalé:
A spectral technique for coloring random 3-colorable graphs (preliminary version). STOC 1994: 346-355 - Noga Alon, Raphael Yuster, Uri Zwick:
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. STOC 1994: 326-335 - Rajeev Alur, Hagit Attiya, Gadi Taubenfeld:
Time-adaptive algorithms for synchronization. STOC 1994: 800-809 - Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
The complexity of searching a sorted array of strings. STOC 1994: 317-325 - Kalvis Apsitis, Rusins Freivalds, Carl H. Smith:
Choosing a learning team: a topological approach. STOC 1994: 283-289 - Sanjeev Arora, Yuval Rabani, Umesh V. Vazirani:
Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). STOC 1994: 459-467 - Peter Auer, Philip M. Long:
Simulating access to hidden information while learning. STOC 1994: 263-272 - Baruch Awerbuch, Lenore Cowen, Mark A. Smith:
Efficient asynchronous distributed symmetry breaking. STOC 1994: 214-223 - Baruch Awerbuch, Tom Leighton:
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. STOC 1994: 487-496 - Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced allocations (extended abstract). STOC 1994: 593-602 - Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell:
Efficient probabilistic checkable proofs and applications to approximation. STOC 1994: 820 - Mihir Bellare, Madhu Sudan:
Improved non-approximability results. STOC 1994: 184-193 - Josh Cohen Benaloh, Dwight Tuinstra:
Receipt-free secret-ballot elections (extended abstract). STOC 1994: 544-553 - Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On lazy randomized incremental construction. STOC 1994: 105-114 - Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan:
The minimum latency problem. STOC 1994: 163-171 - Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, Michael J. Kearns, Yishay Mansour, Steven Rudich:
Weakly learning DNF and characterizing statistical query learning using Fourier analysis. STOC 1994: 253-262 - Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett:
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. STOC 1994: 449-458 - Eric A. Brewer, Frederic T. Chong, Tom Leighton:
Scalable expanders: exploiting hierarchical random wiring. STOC 1994: 144-152 - Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan:
Improved algorithms via approximations of probability distributions (extended abstract). STOC 1994: 584-592 - Bernard Chazelle:
Computational geometry: a retrospective. STOC 1994: 75-94 - Fan R. K. Chung, Shing-Tung Yau:
A near optimal algorithm for edge separators (preliminary version). STOC 1994: 1-8 - Edith Cohen:
Polylog-time and near-linear work approximation scheme for undirected shortest paths. STOC 1994: 16-26 - Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi Wigderson:
On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). STOC 1994: 676-685 - Yefim Dinitz, Alek Vainshtein:
The connectivity carcass of a vertex subset in a graph and its incremental maintenance. STOC 1994: 716-725 - Uriel Feige, Joe Kilian:
Two prover protocols: low error at affordable rates. STOC 1994: 172-183 - Uriel Feige, Joe Kilian, Moni Naor:
A minimal model for secure computation (extended abstract). STOC 1994: 554-563 - Lance Fortnow, Duke Whang:
Optimality and domination in repeated games with bounded players. STOC 1994: 741-749 - Harold N. Gabow:
Efficient splitting off algorithms for graphs. STOC 1994: 696-705 - Naveen Garg, Dorit S. Hochbaum:
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. STOC 1994: 432-438 - Michel X. Goemans, David P. Williamson:
.879-approximation algorithms for MAX CUT and MAX 2SAT. STOC 1994: 422-431
skipping 52 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-09-20 19:53 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