Остановите войну!
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 68 matches
- 1999
- Yehuda Afek, Gideon Stupp, Dan Touitou:
ong-lived Adaptive Collect with Applications. FOCS 1999: 262-272 - Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS 1999: 32-44 - Manindra Agrawal, Somenath Biswas:
Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209 - Miklós Ajtai:
A Non-linear Time Lower Bound for Boolean Branching Programs. FOCS 1999: 60-70 - Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. FOCS 1999: 656-666 - Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy:
Regular Languages Are Testable with a Constant Number of Queries. FOCS 1999: 645-655 - Andris Ambainis:
A Better Lower Bound for Quantum Algorithms Searching an Ordered List. FOCS 1999: 352-357 - Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet:
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999: 160-170 - Rosa I. Arriaga, Santosh S. Vempala:
An Algorithmic Theory of Learning: Robust Concepts and Random Projection. FOCS 1999: 616-623 - Rakesh D. Barve, Jeffrey Scott Vitter:
A Theoretical Framework for Memory-Adaptive Algorithms. FOCS 1999: 273-284 - Eli Ben-Sasson, Russell Impagliazzo:
Random CNF's are Hard for the Polynomial Calculus. FOCS 1999: 415-421 - Markus Bläser:
A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields. FOCS 1999: 45-50 - Avrim Blum, Carl Burch, Adam Kalai:
Finely-Competitive Paging. FOCS 1999: 450-458 - Maria Luisa Bonet, Nicola Galesi:
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432 - Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu:
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS 1999: 218-229 - P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis. FOCS 1999: 486-494 - Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368 - Timothy M. Chan:
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. FOCS 1999: 92-99 - Moses Charikar, Sudipto Guha:
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. FOCS 1999: 378-388 - Zhi-Zhong Chen, Xin He, Chun-Hsi Huang:
Finding Double Euler Trails of Planar Graphs in Linear Time. FOCS 1999: 319-329 - Sanjoy Dasgupta:
Learning Mixtures of Gaussians. FOCS 1999: 634-644 - Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of Approximating the Minimum Distance of a Linear Code. FOCS 1999: 475-485 - Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. FOCS 1999: 523-534 - Martin E. Dyer, Alan M. Frieze, Mark Jerrum:
On Counting Independent Sets in Sparse Graphs. FOCS 1999: 210-217 - David Eppstein:
Setting Parameters by Example. FOCS 1999: 309-318 - Martin Farach-Colton, Piotr Indyk:
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180 - Uriel Feige:
Noncryptographic Selection Protocols. FOCS 1999: 142-153 - Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511 - Jon Feldman, Matthias Ruhl:
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. FOCS 1999: 299-308 - Lisa Fleischer:
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. FOCS 1999: 24-31
skipping 38 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-05-03 21:07 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