Остановите войну!
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 89 matches
- 2011
- Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. FOCS 2011: 324-333 - Dorit Aharonov, Lior Eldar:
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems. FOCS 2011: 334-343 - Saeed Alaei:
Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers. FOCS 2011: 512-521 - Dan Alistarh, James Aspnes, Seth Gilbert, Rachid Guerraoui:
The Complexity of Renaming. FOCS 2011: 718-727 - Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen:
Near Linear Lower Bound for Dimension Reduction in L1. FOCS 2011: 315-323 - Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak:
Streaming Algorithms via Precision Sampling. FOCS 2011: 363-372 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
How to Garble Arithmetic Circuits. FOCS 2011: 120-129 - Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. FOCS 2011: 472-481 - Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392 - Michael A. Bender, Seth Gilbert:
Mutual Exclusion with O(log2 Log n) Amortized Work. FOCS 2011: 728-737 - Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf:
Tight Lower Bounds for 2-query LCCs over Finite Fields. FOCS 2011: 638-647 - David Bindel, Jon M. Kleinberg, Sigal Oren:
How Bad is Forming Your Own Opinion? FOCS 2011: 57-66 - Anna Blasiak, Robert Kleinberg, Eyal Lubetzky:
Lexicographic Products and the Power of Non-linear Network Coding. FOCS 2011: 609-618 - Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma:
Welfare and Profit Maximization with Production Costs. FOCS 2011: 77-86 - Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos:
Which Networks are Least Susceptible to Cascading Failures? FOCS 2011: 393-402 - Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan:
Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 - Paul S. Bonsma, Jens Schulz, Andreas Wiese:
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. FOCS 2011: 47-56 - Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179 - Christos Boutsidis, Petros Drineas, Malik Magdon-Ismail:
Near Optimal Column-Based Matrix Reconstruction. FOCS 2011: 305-314 - Zvika Brakerski, Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE. FOCS 2011: 97-106 - Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor:
The Grothendieck Constant is Strictly Smaller than Krivine's Bound. FOCS 2011: 453-462 - Mark Braverman, Anup Rao:
Information Equals Amortized Communication. FOCS 2011: 748-757 - Yang Cai, Constantinos Daskalakis:
Extreme-Value Theorems for Optimal Multidimensional Pricing. FOCS 2011: 522-531 - Pietro Caputo, Fabio Martinelli, Fabio Lucio Toninelli:
Sharp Mixing Time Bounds for Sampling Random Surfaces. FOCS 2011: 130-139 - Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik:
Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. FOCS 2011: 532-541 - L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS 2011: 599-608 - André Chailloux, Iordanis Kerenidis:
Optimal Bounds for Quantum Bit Commitment. FOCS 2011: 354-362 - Chandra Chekuri, Alina Ene:
Approximation Algorithms for Submodular Multiway Partition. FOCS 2011: 807-816
skipping 59 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-23 19:32 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