Остановите войну!
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
- 1999
- Miklós Ajtai:
Determinism versus Non-Determinism for Linear Time RAMs (Extended Abstract). STOC 1999: 632-641 - Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe:
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). STOC 1999: 499-506 - Masami Amano, Kazuo Iwama:
Undecidability on Quantum Finite Automata. STOC 1999: 368-375 - Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani:
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC 1999: 376-383 - Matthew Andrews, Lisa Zhang:
Packet Routing with Arbitrary End-to-End Delay Requirements. STOC 1999: 557-565 - Sanjeev Arora, George Karakostas:
Approximation Schemes for Minimum Latency Problems. STOC 1999: 688-693 - Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999: 622-631 - Paul Beame, Faith E. Fich:
Optimal Bounds for the Predecessor Problem. STOC 1999: 295-304 - Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin:
One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98 - Amir M. Ben-Amram, Holger Petersen:
Backing Up in Singly Linked Lists. STOC 1999: 780-786 - Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution Made Simple. STOC 1999: 517-526 - Johannes Blömer, Jean-Pierre Seifert:
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice. STOC 1999: 711-720 - Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. STOC 1999: 312-321 - Allan Borodin, Rafail Ostrovsky, Yuval Rabani:
Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. STOC 1999: 435-444 - Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi:
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes. STOC 1999: 547-556 - Jin-yi Cai, Ajay Nerurkar, D. Sivakumar:
Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time. STOC 1999: 726-735 - Ran Canetti, Rafail Ostrovsky:
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract). STOC 1999: 255-264 - Michael R. Capalbo, S. Rao Kosaraju:
Small Universal Graphs. STOC 1999: 741-749 - Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov:
A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. STOC 1999: 305-311 - Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys:
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). STOC 1999: 1-10 - Moses Charikar, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins:
On targeting Markov segments. STOC 1999: 99-108 - Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong:
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. STOC 1999: 119-128 - Fang Chen, László Lovász, Igor Pak:
Lifting Markov Chains to Speed up Mixing. STOC 1999: 275-281 - Jianer Chen, Antonio Miranda:
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract). STOC 1999: 418-427 - Edith Cohen, Haim Kaplan:
Exploiting Regularities in Web Traffic Patterns for Cache Replacement. STOC 1999: 109-118 - Edith Cohen, Haim Kaplan, Uri Zwick:
Connection Caching. STOC 1999: 612-621 - Giovanni Di Crescenzo, Russell Impagliazzo:
Security-Preserving Hardness-Amplification for Any Regular One-Way Function. STOC 1999: 169-178 - Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract). STOC 1999: 265-274 - Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra:
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40
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-04-19 03:43 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