NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (31)

cs.CC2019

Approximate degree, secret sharing, and concentration phenomena

Andrej Bogdanov, Nikhil S. Mande, Justin Thaler +1

cs.CC2017

On the Power of Statistical Zero Knowledge

Adam Bouland, Lijie Chen, Dhiraj Holden +2

cs.LG2014

Distribution-Independent Reliable Learning

Varun Kanade, Justin Thaler

cs.DS2012

Practical Verified Computation with Streaming Interactive Proofs

Graham Cormode, Michael Mitzenmacher, Justin Thaler

cs.DB2011

Verifying Computations with Streaming Interactive Proofs

Graham Cormode, Justin Thaler, Ke Yi

cs.DS2011

Hierarchical Heavy Hitters with the Space Saving Algorithm

Michael Mitzenmacher, Thomas Steinke, Justin Thaler

cs.DS2016

Determining Tournament Payout Structures for Daily Fantasy Sports

Christopher Musco, Maxim Sviridenko, Justin Thaler

cs.CC2014

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits

Mark Bun, Justin Thaler

cs.IT2011

On the Zero-Error Capacity Threshold for Deletion Channels

Ian A. Kash, Michael Mitzenmacher, Justin Thaler +1

cs.CC2013

Annotations for Sparse Data Streams

Amit Chakrabarti, Graham Cormode, Navin Goyal +1

cs.DS2011

Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps

Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher +1

cs.CR2017

Time-Optimal Interactive Proofs for Circuit Evaluation

Justin Thaler

cs.DS2010

Streaming Graph Computations with a Helpful Advisor

Graham Cormode, Michael Mitzenmacher, Justin Thaler

cs.LG2016

Reliably Learning the ReLU in Polynomial Time

Surbhi Goel, Varun Kanade, Adam Klivans +1

cs.CC2014

Variable Selection is Hard

Dean Foster, Howard Karloff, Justin Thaler

cs.DS2015

Stream Verification

Justin Thaler

cs.DS2017

A High-Performance Algorithm for Identifying Frequent Items in Data Streams

Daniel Anderson, Pryce Bevan, Kevin Lang +3

cs.DS2016

Space Lower Bounds for Itemset Frequency Sketches

Edo Liberty, Michael Mitzenmacher, Justin Thaler +1

cs.DC2012

Verifiable Computation with Massively Parallel Interactive Proofs

Justin Thaler, Mike Roberts, Michael Mitzenmacher +1

cs.CC2019

Sign-Rank Can Increase Under Intersection

Mark Bun, Nikhil S. Mande, Justin Thaler

cs.DS2014

Faster Algorithms for Privately Releasing Marginals

Justin Thaler, Jonathan Ullman, Salil Vadhan

cs.IT2012

Continuous Time Channels with Interference

Ioana Ivan, Michael Mitzenmacher, Justin Thaler +1

cs.DS2014

Parallel Peeling Algorithms

Jiayang Jiang, Michael Mitzenmacher, Justin Thaler

cs.DS2015

Semi-Streaming Algorithms for Annotated Graph Streams

Justin Thaler

cs.CC2014

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities

Mark Bun, Justin Thaler

cs.DS2011

External-Memory Multimaps

Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher +1

cs.CC2017

A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$

Mark Bun, Justin Thaler

cs.DS2015

Streaming Verification in Data Analysis

Samira Daruki, Justin Thaler, Suresh Venkatasubramanian

cs.DS2013

Faster Private Release of Marginals on Small Databases

Karthekeyan Chandrasekaran, Justin Thaler, Jonathan Ullman +1

cs.DS2016

A Framework for Estimating Stream Expression Cardinalities

Anirban Dasgupta, Kevin Lang, Lee Rhodes +1

cs.CC2015

Dual Polynomials for Collision and Element Distinctness

Mark Bun, Justin Thaler