default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Witmer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c7]Pravesh K. Kothari, Ryuhei Mori
, Ryan O'Donnell, David Witmer:
Sum of squares lower bounds for refuting any CSP. STOC 2017: 132-145- [i8]Pravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell, David Witmer:
Sum of squares lower bounds for refuting any CSP. CoRR abs/1701.04521 (2017) - 2016
- [c6]Ryuhei Mori, David Witmer:
Lower Bounds for CSP Refutation by SDP Hierarchies. APPROX-RANDOM 2016: 41:1-41:30 - [i7]Ryuhei Mori, David Witmer:
Lower bounds for CSP refutation by SDP hierarchies. CoRR abs/1610.03029 (2016) - 2015
- [c5]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [c4]Sarah R. Allen, Ryan O'Donnell, David Witmer:
How to Refute a Random CSP. FOCS 2015: 689-708 - [i6]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i5]Sarah R. Allen, Ryan O'Donnell, David Witmer:
How to refute a random CSP. CoRR abs/1505.04383 (2015) - [i4]Guy Kindler, Ryan O'Donnell, David Witmer:
Continuous analogues of the Most Informative Function problem. CoRR abs/1506.03167 (2015) - [i3]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Ryan O'Donnell, David Witmer:
Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch. CCC 2014: 1-12 - 2013
- [c2]Sarah M. Loos, David Witmer, Peter Steenkiste, André Platzer:
Efficiency analysis of formally verified adaptive cruise controllers. ITSC 2013: 1565-1570 - [c1]Anupam Gupta, Kunal Talwar, David Witmer:
Sparsest cut on bounded treewidth graphs: algorithms and hardness results. STOC 2013: 281-290 - [i2]Anupam Gupta, Kunal Talwar, David Witmer:
Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results. CoRR abs/1305.1347 (2013) - 2012
- [i1]Ryan O'Donnell, David Witmer:
Improved small-set expansion from higher eigenvalues. CoRR abs/1204.4688 (2012)
Coauthor Index
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.
last updated on 2024-08-05 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
