Justin Thaler
Ph.D. Candidate
Harvard
School of Engineering and Applied Sciences
Maxwell Dworkin
138
33 Oxford St
Cambridge, MA, 02138
jthaler [at] seas
[dot] harvard [dot] edu
|
|
Justin Thaler |
|
Ph.D. Candidate |
I am a Ph.D. student in the Theory of Computation Group at Harvard University, with funding from the NDSEG and NSF Fellowships. I graduated from Yale University in 2009 with a B.S. in Computer Science and a second major in Mathematics. I am extremely fortunate to be advised by Michael Mitzenmacher. I am broadly interested in algorithms and computational complexity, especially algorithms for massive data sets, verifiable computation, and computational learning theory.
|
A. Chakrabarti, G. Cormode, N. Goyal, and J. Thaler
Annotations for Sparse Data Streams Manuscript. |
|
K. Chandrasekaran, J. Thaler, J. Ullman, and A. Wan
Faster Private Release of Marginals on Small Databases Manuscript. |
|
J. Jiang, M. Mitzenmacher, and J. Thaler
Parallel Peeling Algorithms Manuscript. |
|
A. Chakrabarti, G. Cormode, A. McGregor, and J. Thaler
Annotations in Data Streams [Note: This paper subsumes a preliminary version of this work by Chakrabarti, Cormode, and McGregor that appeared in ICALP 2009.] Manuscript. |
|
J. Thaler
Time-Optimal Interactive Proofs for Circuit Evaluation CRYPTO 2013 |
|
M. Bun and J. Thaler
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities ICALP 2013. Winner of Best Paper Award for Track A. |
|
M. Mitzenmacher and J. Thaler
Peeling Arguments and Double Hashing Allerton 2012 (Invited Paper) |
|
M. T. Goodrich, D. Hirschberg, M. Mitzenmacher, and J. Thaler
Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability MedAlg 2012 |
|
J. Thaler, J. Ullman, and S. Vadhan
Faster Algorithms for Privately Releasing Marginals ICALP 2012 |
|
R. Servedio, L-Y. Tan, and J. Thaler
Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012 |
|
J. Thaler, M. Roberts, M. Mitzenmacher, and H. Pfister
Verifiable Computation with Massively Parallel Interactive Proofs HotCloud 2012 |
|
I. Ivan, M. Mitzenmacher, J. Thaler, and H. Yuen
Continuous Time Channels with Interference ISIT 2012 |
|
M. Mitzenmacher, T. Steinke, and J. Thaler
Hierarchical Heavy Hitters with the Space Saving Algorithm ALENEX 2012 |
|
G. Cormode, M. Mitzenmacher, and J. Thaler
Practical Verified Computation with Streaming Interactive Proofs ITCS 2012 |
|
E. Angelino, M. Goodrich, M. Mitzenmacher, and J. Thaler
External Memory Multimaps ISAAC 2011. Journal version accepted to special issue of Algorithmica. |
|
G. Cormode, J. Thaler, and K. Yi
Verifying Computations with Streaming Interactive Proofs VLDB 2012 |
|
I. Kash, M. Mitzenmacher, J. Thaler, and J. Ullman
On the Zero-Error Capacity Threshold for Deletion Channels 2011 Information Theory and Applications Workshop |
|
G. Cormode, M. Mitzenmacher, and J. Thaler
Streaming Graph Computations with a Helpful Advisor ESA 2010. Journal version in Algorithmica: Volume 65, Issue 2 (2013), pages 409-442. |
|
N. Ruozzi, J. Thaler, and S. Tatikonda
Graph Covers and Quadratic Minimization Allerton 2009 |