Остановите войну!
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 90 matches
- 2012
- Scott Aaronson, Paul F. Christiano:
Quantum money from hidden subspaces. STOC 2012: 41-60 - Jacob D. Abernethy, Rafael M. Frongillo, Andre Wibisono:
Minimax option pricing meets black-scholes in the limit. STOC 2012: 1029-1040 - Ittai Abraham, Shiri Chechik, Cyril Gavoille:
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218 - Ittai Abraham, Ofer Neiman:
Using petal-decompositions to build a low stretch spanning tree. STOC 2012: 395-406 - Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
Optimal online buffer scheduling for block devices. STOC 2012: 589-598 - Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. STOC 2012: 599-614 - Miklós Ajtai:
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract. STOC 2012: 249-268 - Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090 - Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Improving christofides' algorithm for the s-t path TSP. STOC 2012: 875-886 - Benny Applebaum:
Pseudorandom generators with long stretch and low locality from random local one-way functions. STOC 2012: 805-816 - Sanjeev Arora, Rong Ge, Ravindran Kannan, Ankur Moitra:
Computing a nonnegative matrix factorization - provably. STOC 2012: 145-162 - Pablo Daniel Azar, Silvio Micali:
Rational proofs. STOC 2012: 1017-1028 - Nikhil Bansal, Vibhor Bhatt, Prasad Jayanti, Ranganath Kondapally:
Tight time-space tradeoff for mutual exclusion. STOC 2012: 971-982 - Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan A. Kelner, David Steurer, Yuan Zhou:
Hypercontractivity, sum-of-squares proofs, and their applications. STOC 2012: 307-326 - Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. STOC 2012: 663-672 - Libor Barto, Marcin Kozik:
Robust satisfiability of constraint satisfaction problems. STOC 2012: 931-940 - Paul Beame, Christopher Beck, Russell Impagliazzo:
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space. STOC 2012: 213-232 - Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget feasible mechanism design: from prior-free to bayesian. STOC 2012: 449-458 - Aleksandrs Belovs:
Span programs for functions with constant-sized 1-certificates: extended abstract. STOC 2012: 77-84 - Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar:
Unconditional differentially private mechanisms for linear queries. STOC 2012: 1269-1284 - Jean Bourgain, Amir Yehudayoff:
Monotone expansion. STOC 2012: 1061-1078 - Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai:
Multiparty computation secure against continual memory leakage. STOC 2012: 1235-1254 - Christina Brandt, Nicole Immorlica, Gautam Kamath, Robert Kleinberg:
An analysis of one-dimensional schelling segregation. STOC 2012: 789-804 - Mark Braverman:
Interactive information complexity. STOC 2012: 505-524 - Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan:
Strict fibonacci heaps. STOC 2012: 1177-1184 - Tobias Brunsch, Heiko Röglin:
Improved smoothed analysis of multiobjective optimization. STOC 2012: 407-426 - Jan Bulánek, Michal Koucký, Michael E. Saks:
Tight lower bounds for the online labeling problem. STOC 2012: 1185-1198 - Jin-Yi Cai, Xi Chen:
Complexity of counting CSP with complex weights. STOC 2012: 909-920 - Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg:
An algorithmic characterization of multi-dimensional mechanisms. STOC 2012: 459-478 - Manuel Cebrián, Lorenzo Coviello, Andrea Vattani, Panagiotis Voulgaris:
Finding red balloons with split contracts: robustness to individuals' selfishness. STOC 2012: 775-788
skipping 60 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-29 16:46 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