default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJustin Thaler
- > Home > Persons > Justin Thaler
Publications
- 2022
[j19]Mark Bun, Justin Thaler:
Approximate Degree in Classical and Quantum Computing. Found. Trends Theor. Comput. Sci. 15(3-4): 229-423 (2022)- 2021
- [j16]Mark Bun, Robin Kothari
, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. Quantum 5: 543 (2021) - [j15]Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. Theory Comput. 17: 1-46 (2021) - [j14]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-rank Can Increase under Intersection. ACM Trans. Comput. Theory 13(4): 24:1-24:17 (2021) - 2020
- [j12]Mark Bun, Justin Thaler:
A Nearly Optimal Lower Bound on the Approximate Degree of AC0. SIAM J. Comput. 49(4) (2020) - [j11]Mark Bun, Justin Thaler:
Guest Column: Approximate Degree in Classical and Quantum Computing. SIGACT News 51(4): 48-72 (2020) - [j10]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Theory Comput. 16: 1-71 (2020) - 2019
- [c40]Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. APPROX-RANDOM 2019: 55:1-55:16 - [c38]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. ICALP 2019: 30:1-30:14 - [c37]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. SODA 2019: 662-678 - [i62]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. CoRR abs/1903.00544 (2019) - [i56]Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c36]Mark Bun, Justin Thaler:
Approximate Degree and the Complexity of Depth Three Circuits. APPROX-RANDOM 2018: 35:1-35:18 - [c34]Mark Bun, Robin Kothari, Justin Thaler:
The polynomial method strikes back: tight quantum query bounds via dual polynomials. STOC 2018: 297-310 - [i53]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. CoRR abs/1809.02254 (2018) - [i52]Mark Bun, Robin Kothari, Justin Thaler:
Quantum algorithms and approximating polynomials for composed functions with shared inputs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i51]Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c30]Mark Bun, Justin Thaler:
A Nearly Optimal Lower Bound on the Approximate Degree of AC0. FOCS 2017: 1-12 - [i50]Mark Bun, Justin Thaler:
A Nearly Optimal Lower Bound on the Approximate Degree of AC0. CoRR abs/1703.05784 (2017) - [i48]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. CoRR abs/1710.09079 (2017) - [i47]Mark Bun, Robin Kothari, Justin Thaler:
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials. Electron. Colloquium Comput. Complex. TR17 (2017) - [i46]Mark Bun, Justin Thaler:
A Nearly Optimal Lower Bound on the Approximate Degree of AC0. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j7]Mark Bun, Justin Thaler:
Dual Polynomials for Collision and Element Distinctness. Theory Comput. 12(1): 1-34 (2016) - [c26]Mark Bun, Justin Thaler:
Improved Bounds on the Sign-Rank of AC^0. ICALP 2016: 37:1-37:14 - [i39]Mark Bun, Justin Thaler:
Improved Bounds on the Sign-Rank of AC0. Electron. Colloquium Comput. Complex. TR16 (2016) - [i38]Mark Bun, Justin Thaler:
Approximate Degree and the Complexity of Depth Three Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j5]Mark Bun, Justin Thaler:
Dual lower bounds for approximate degree and Markov-Bernstein inequalities. Inf. Comput. 243: 2-25 (2015) - [c20]Mark Bun, Justin Thaler:
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits. ICALP (1) 2015: 268-280 - [i37]Mark Bun, Justin Thaler:
Dual Polynomials for Collision and Element Distinctness. CoRR abs/1503.07261 (2015) - [i33]Mark Bun, Justin Thaler:
Dual Polynomials for Collision and Element Distinctness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [c13]Mark Bun, Justin Thaler:
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities. ICALP (1) 2013: 303-314 - [i24]Mark Bun, Justin Thaler:
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities. CoRR abs/1302.6191 (2013) - [i19]Mark Bun, Justin Thaler:
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits. CoRR abs/1311.1616 (2013) - [i18]Mark Bun, Justin Thaler:
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities. Electron. Colloquium Comput. Complex. TR13 (2013) - [i17]Mark Bun, Justin Thaler:
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR13 (2013)
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-23 19:27 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:
