Остановите войну!
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 79 matches
- 2007
- Ittai Abraham, Yair Bartal, Ofer Neiman:
Local embeddings of metric spaces. STOC 2007: 631-640 - Amit Agarwal, Noga Alon, Moses Charikar:
Improved approximation for directed cut problems. STOC 2007: 671-680 - Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie:
Testing k-wise and almost k-wise independence. STOC 2007: 496-505 - Matthew Andrews, Kyomin Jung, Alexander L. Stolyar:
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads. STOC 2007: 145-154 - Elliot Anshelevich, Adriana Karagiozova:
Terminal backup, 3D matching, and covering cubic graphs. STOC 2007: 391-400 - Sanjeev Arora, Satyen Kale:
A combinatorial, primal-dual approach to semidefinite programs. STOC 2007: 227-236 - Arash Asadpour, Amin Saberi:
An approximation algorithm for max-min fair allocation of indivisible goods. STOC 2007: 114-121 - Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164 - Per Austrin:
Balanced max 2-sat might not be the hardest. STOC 2007: 189-197 - Saugata Basu:
Combinatorial complexity in O-minimal geometry. STOC 2007: 47-56 - Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali:
Simple deterministic approximation algorithms for counting matchings. STOC 2007: 122-127 - Paul Beame, T. S. Jayram, Atri Rudra:
Lower bounds for randomized read/write stream algorithms. STOC 2007: 689-698 - Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
Fourier meets möbius: fast subset convolution. STOC 2007: 67-74 - Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch:
First to market is not everything: an analysis of preferential attachment with fitness. STOC 2007: 135-144 - Mark Braverman, Michael Yampolsky:
Constructing non-computable Julia sets. STOC 2007: 709-716 - Bo Brinkman, Adriana Karagiozova, James R. Lee:
Vertex cuts, random walks, and dimension reduction in series-parallel graphs. STOC 2007: 621-630 - Jin-yi Cai, Pinyan Lu:
Holographic algorithms: from art to science. STOC 2007: 401-410 - Timothy M. Chan:
More algorithms for all-pairs shortest paths in weighted graphs. STOC 2007: 590-598 - Timothy M. Chan, Mihai Patrascu:
Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39 - Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar:
Hardness of routing with congestion in directed graphs. STOC 2007: 165-178 - Julia Chuzhoy, Sanjeev Khanna:
Polynomial flow-cut gaps and hardness of directed cut problems. STOC 2007: 179-188 - Stefan S. Dantchev:
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. STOC 2007: 311-317 - Amit Deshpande, Kasturi R. Varadarajan:
Sampling-based dimension reduction for subspace approximation. STOC 2007: 641-650 - Shahar Dobzinski, Noam Nisan:
Limitations of VCG-based mechanisms. STOC 2007: 338-344 - Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Degree-constrained network flows. STOC 2007: 681-688 - John Dunagan, Nicholas J. A. Harvey:
Iteratively constructing preconditioners via the conjugate gradient method. STOC 2007: 207-216 - Cynthia Dwork, Frank McSherry, Kunal Talwar:
The price of privacy and the limits of LP decoding. STOC 2007: 85-94 - Matthias Englert, Harald Räcke, Matthias Westermann:
Reordering buffers for general metric spaces. STOC 2007: 556-564 - Gianni Franceschini, S. Muthukrishnan:
Optimal suffix selection. STOC 2007: 328-337 - Martin Fürer:
Faster integer multiplication. STOC 2007: 57-66
skipping 49 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-12 11:33 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