Остановите войну!
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 86 matches
- 2008
- Scott Aaronson, Avi Wigderson:
Algebrization: a new barrier in complexity theory. STOC 2008: 731-740 - Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi:
Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28 - Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226 - Baruch Awerbuch, Rohit Khandekar:
Stateless distributed gradient descent for positive linear programs. STOC 2008: 691-700 - Maria-Florina Balcan, Avrim Blum, Santosh S. Vempala:
A discriminative framework for clustering via similarity functions. STOC 2008: 671-680 - Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan:
Additive guarantees for degree bounded directed network design. STOC 2008: 769-778 - Omer Barkol, Yuval Ishai, Enav Weinreb:
Communication in the presence of replication. STOC 2008: 661-670 - Libor Barto, Marcin Kozik, Todd Niven:
Graphs, polymorphisms and the complexity of homomorphism problems. STOC 2008: 789-796 - Avraham Ben-Aroya, Amnon Ta-Shma:
A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334 - Itai Benjamini, Oded Schramm, Asaf Shapira:
Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402 - Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth:
Regret minimization and the price of total anarchy. STOC 2008: 373-382 - Avrim Blum, Katrina Ligett, Aaron Roth:
A learning theory approach to non-interactive database privacy. STOC 2008: 609-618 - Manuel Bodirsky, Jan Kára:
The complexity of temporal constraint satisfaction problems. STOC 2008: 29-38 - Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou:
The myth of the folk theorem. STOC 2008: 365-372 - Jin-yi Cai, Xi Chen, Dong Li:
A quadratic lower bound for the permanent and determinant problem over any characteristic != 2. STOC 2008: 491-498 - Amit Chakrabarti, Graham Cormode, Andrew McGregor:
Robust lower bounds for communication and stream computation. STOC 2008: 641-650 - Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna:
Network design for vertex connectivity. STOC 2008: 167-176 - Yiling Chen, Sharad Goel, David M. Pennock:
Pricing combinatorial markets for tournaments. STOC 2008: 305-314 - Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, Igor Razgon:
A fixed-parameter algorithm for the directed feedback vertex set problem. STOC 2008: 177-186 - Sung-Soon Choi, Jeong Han Kim:
Optimal query complexity bounds for finding graphs. STOC 2008: 749-758 - Richard Cole, Lisa Fleischer:
Fast-converging tatonnement algorithms for one-time and ongoing market problems. STOC 2008: 315-324 - Aaron Cote, Adam Meyerson, Laura J. Poplawski:
Randomized k-server on hierarchical binary trees. STOC 2008: 227-234 - Samuel I. Daitch, Daniel A. Spielman:
Faster approximate lossy generalized flow via interior point algorithms. STOC 2008: 451-460 - Abhimanyu Das, David Kempe:
Algorithms for subset selection in linear regression. STOC 2008: 45-54 - Sanjoy Dasgupta, Yoav Freund:
Random projection trees and low dimensional manifolds. STOC 2008: 537-546 - Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic. STOC 2008: 499-506 - Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan:
Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284 - Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. STOC 2008: 741-748 - Jittat Fakcharoenphol, Bundit Laekhanukit:
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158
skipping 56 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 08:57 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