Остановите войну!
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 13 matches
- 2006
- Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis:
Proving Integrality Gaps without Knowing the Linear Program. Theory Comput. 2(2): 19-51 (2006) - Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2(4): 65-90 (2006) - Moses Charikar, Robert Krauthgamer:
Embedding the Ulam metric into l1. Theory Comput. 2(11): 207-224 (2006) - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory Comput. 2(7): 137-146 (2006) - Amit Deshpande, Luis Rademacher, Santosh S. Vempala, Grant Wang:
Matrix Approximation and Projective Clustering via Volume Sampling. Theory Comput. 2(12): 225-247 (2006) - Eldar Fischer, Lance Fortnow:
Tolerant Versus Intolerant Testing for Boolean Properties. Theory Comput. 2(9): 173-183 (2006) - Ioannis Giotis, Venkatesan Guruswami:
Correlation Clustering with a Fixed Number of Clusters. Theory Comput. 2(13): 249-266 (2006) - Anupam Gupta, Aravind Srinivasan:
An Improved Approximation Ratio for the Covering Steiner Problem. Theory Comput. 2(3): 53-64 (2006) - Jeffrey C. Jackson, Rocco A. Servedio:
On Learning Random DNF Formulas Under the Uniform Distribution. Theory Comput. 2(8): 147-172 (2006) - Adam R. Klivans, Amir Shpilka:
Learning Restricted Models of Arithmetic Circuits. Theory Comput. 2(10): 185-206 (2006) - Ran Raz:
Separation of Multilinear Circuit and Formula Size. Theory Comput. 2(6): 121-135 (2006) - Eyal Rozenman, Aner Shalev, Avi Wigderson:
Iterative Construction of Cayley Expander Graphs. Theory Comput. 2(5): 91-120 (2006) - Robert Spalek, Mario Szegedy:
All Quantum Adversary Methods are Equivalent. Theory Comput. 2(1): 1-18 (2006)
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-06 06:03 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