Joshua Brody
Joshua Brody
Assistant Professor, Swarthmore College
Verified email at cs.swarthmore.edu - Homepage
Title
Cited by
Cited by
Year
Property testing lower bounds via communication complexity
E Blais, J Brody, K Matulef
computational complexity 21 (2), 311-358, 2012
1562012
Functional monitoring without monotonicity
C Arackaparambil, J Brody, A Chakrabarti
International Colloquium on Automata, Languages, and Programming, 95-106, 2009
962009
The coin problem and pseudorandomness for branching programs
J Brody, E Verbin
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 30-39, 2010
722010
Towards a reverse newman’s theorem in interactive information complexity
J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin
Algorithmica 76 (3), 749-781, 2016
352016
A multi-round communication lower bound for gap hamming and some consequences
J Brody, A Chakrabarti
2009 24th Annual IEEE Conference on Computational Complexity, 358-368, 2009
322009
Distributed monitoring of conditional entropy for anomaly detection in streams
C Arackaparambil, S Bratus, J Brody, A Shubina
Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 …, 2010
282010
Certifying equality with limited interaction
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev
Algorithmica 76 (3), 796-845, 2016
262016
Beyond set disjointness: the communication complexity of finding the intersection
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
242014
Better gap-hamming lower bounds via better round elimination
J Brody, A Chakrabarti, O Regev, T Vidick, R De Wolf
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010
232010
Adapt or die: Polynomial lower bounds for non-adaptive dynamic data structures
J Brody, KG Larsen
arXiv preprint arXiv:1208.2846, 2012
212012
Lower bounds for testing computability by small width OBDDs
J Brody, K Matulef, C Wu
International Conference on Theory and Applications of Models of Computation …, 2011
17*2011
Sublinear communication protocols for multi-party pointer jumping and a related lower bound
J Brody, A Chakrabarti
25th Annual Symposium on Theoretical Aspects of Computer Science (STACS …, 2008
152008
The information complexity of hamming distance
E Blais, J Brody, B Ghazi
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
142014
Space-bounded communication complexity
JE Brody, S Chen, PA Papakonstantinou, H Song, X Sun
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
142013
The maximum communication complexity of multi-party pointer jumping
J Brody
2009 24th Annual IEEE Conference on Computational Complexity, 379-386, 2009
102009
Cryptogenography
J Brody, SK Jakobsen, D Scheder, P Winkler
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
82014
Optimal separation and strong direct sum for randomized query complexity
E Blais, J Brody
arXiv preprint arXiv:1908.01020, 2019
62019
Distance-sensitive property testing lower bounds
J Brody, P Hatami
arXiv preprint arXiv:1304.6685, 2013
5*2013
Space-efficient approximation scheme for circular earth mover distance
J Brody, H Liang, X Sun
Latin American Symposium on Theoretical Informatics, 97-108, 2012
42012
Non-adaptive data structure bounds for dynamic predecessor
J Boninger, J Brody, O Kephart
37th IARCS Annual Conference on Foundations of Software Technology and …, 2018
3*2018
The system can't perform the operation now. Try again later.
Articles 1–20