Остановите войну!
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 86 matches
- 2000
- Dimitris Achlioptas:
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). STOC 2000: 28-37 - Micah Adler, Frank Thomson Leighton:
Compression using efficient multicasting. STOC 2000: 153-162 - Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao:
Quantum bit escrow. STOC 2000: 705-714 - William Aiello, Fan R. K. Chung, Linyuan Lu:
A random graph model for massive graphs. STOC 2000: 171-180 - Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space complexity in propositional calculus. STOC 2000: 358-367 - Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295 - Andris Ambainis:
Quantum lower bounds by quantum arguments. STOC 2000: 636-643 - Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani:
Computing with highly mixed states (extended abstract). STOC 2000: 697-704 - Arne Andersson, Mikkel Thorup:
Tight(er) worst-case bounds on dynamic searching and priority queues. STOC 2000: 335-342 - Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744 - Omer Barkol, Yuval Rabani:
Tighter bounds for nearest neighbor search and related problems in the cell probe model. STOC 2000: 388-396 - Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking:
Balanced allocations: the heavily loaded case. STOC 2000: 745-754 - Piotr Berman, Bhaskar DasGupta:
Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 - Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury:
A proof of the security of quantum key distribution (extended abstract). STOC 2000: 715-724 - Avrim Blum, Adam Kalai, Hal Wasserman:
Noise-tolerant learning, the parity problem, and the statistical query model. STOC 2000: 435-440 - Dan Boneh:
Finding smooth integers in short intervals using CRT decoding. STOC 2000: 265-272 - Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh:
Are bitvectors optimal? STOC 2000: 449-458 - Costas Busch, Maurice Herlihy, Roger Wattenhofer:
Hard-Potato routing. STOC 2000: 278-285 - Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali:
Resettable zero-knowledge (extended abstract). STOC 2000: 235-244 - Robert D. Carr, Santosh S. Vempala:
Randomized metarounding (extended abstract). STOC 2000: 58-62 - Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai:
Query strategies for priced information (extended abstract). STOC 2000: 582-591 - Danny Z. Chen, Jinhui Xu:
Shortest path queries in planar graphs. STOC 2000: 469-478 - Richard Cole, Ramesh Hariharan:
Faster suffix tree construction with missing suffix links. STOC 2000: 407-415 - Ronald Cramer, Ivan Damgård, Stefan Dziembowski:
On the complexity of verifiable secret sharing and multiparty computation. STOC 2000: 325-334 - Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
On zero-knowledge proofs (extended abstract): "from membership to decision". STOC 2000: 255-264 - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the sum-of-squares algorithm for bin packing. STOC 2000: 208-217 - Artur Czumaj, Christian Scheideler:
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). STOC 2000: 38-47 - Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha:
Self-testing of universal and fault-tolerant sets of quantum gates. STOC 2000: 688-696 - Herbert Edelsbrunner, Xiang-Yang Li, Gary L. Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua Teng, Alper Üngör, Noel Walkington:
Smoothing and cleaning up slivers. STOC 2000: 273-277 - Guy Even, Sudipto Guha, Baruch Schieber:
Improved approximations of crossings in graph drawings. STOC 2000: 296-305
skipping 56 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-04-24 00:04 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