Остановите войну!
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 74 matches
- 2009
- Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal Range Reporting in Three and Higher Dimensions. FOCS 2009: 149-158 - Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. FOCS 2009: 129-138 - Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich:
Choice-Memory Tradeoff in Allocations. FOCS 2009: 230-238 - Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff:
Efficient Sketches for Earth-Mover Distance, with Applications. FOCS 2009: 324-330 - Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 - David Arthur, Bodo Manthey, Heiko Röglin:
k-Means Has Polynomial Smoothed Complexity. FOCS 2009: 405-414 - Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. FOCS 2009: 293-302 - Nikhil Bansal, Subhash Khot:
Optimal Long Code Test with One Free Bit. FOCS 2009: 453-462 - Nikhil Bansal, Ryan Williams:
Regularity Lemmas and Combinatorial Algorithms. FOCS 2009: 745-754 - Libor Barto, Marcin Kozik:
Constraint Satisfaction Problems of Bounded Width. FOCS 2009: 595-603 - Saugata Basu, Thierry Zell:
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem. FOCS 2009: 73-82 - Paul Beame, Dang-Trinh Huynh-Ngoc:
Multiparty Communication Complexity and Threshold Circuit Size of AC0. FOCS 2009: 53-62 - Avraham Ben-Aroya, Amnon Ta-Shma:
Constructing Small-Bias Sets from Algebraic-Geometric Codes. FOCS 2009: 191-197 - Aaron Bernstein:
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. FOCS 2009: 693-702 - Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. FOCS 2009: 629-638 - Anne Broadbent, Joseph F. Fitzsimons, Elham Kashefi:
Universal Blind Quantum Computation. FOCS 2009: 517-526 - Kevin Buchin, Wolfgang Mulzer:
Delaunay Triangulations in O(sort(n)) Time and More. FOCS 2009: 139-148 - André Chailloux, Iordanis Kerenidis:
Optimal Quantum Strong Coin Flipping. FOCS 2009: 527-533 - Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna:
On Allocating Goods to Maximize Fairness. FOCS 2009: 107-116 - Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna:
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization. FOCS 2009: 495-504 - Arkadev Chattopadhyay, Avi Wigderson:
Linear Systems over Composite Moduli. FOCS 2009: 43-52 - Jeff Cheeger, Bruce Kleiner, Assaf Naor:
A (log n)Omega(1) Integrality Gap for the Sparsest Cut SDP. FOCS 2009: 555-564 - Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities. FOCS 2009: 273-282 - Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. FOCS 2009: 331-340 - Julia Chuzhoy, Sanjeev Khanna:
An O(k3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. FOCS 2009: 437-441 - Yi Deng, Vipul Goyal, Amit Sahai:
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy. FOCS 2009: 251-260 - Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola:
Bounded Independence Fools Halfspaces. FOCS 2009: 171-180 - Irit Dinur, Prahladh Harsha:
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS 2009: 472-481 - Shahar Dobzinski, Shaddin Dughmi:
On the Power of Randomization in Algorithmic Mechanism Design. FOCS 2009: 505-514 - David Doty:
Randomized Self-Assembly for Exact Shapes. FOCS 2009: 85-94
skipping 44 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-03 11:40 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