Подписаться
Joshua Brody
Joshua Brody
Associate Professor, Swarthmore College
Подтвержден адрес электронной почты в домене cs.swarthmore.edu - Главная страница
Название
Процитировано
Процитировано
Год
Property testing lower bounds via communication complexity
E Blais, J Brody, K Matulef
computational complexity 21, 311-358, 2012
1712012
Functional monitoring without monotonicity
C Arackaparambil, J Brody, A Chakrabarti
Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009
982009
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
912010
Towards a reverse newman’s theorem in interactive information complexity
J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin
Algorithmica 76, 749-781, 2016
392016
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
372014
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
372009
Certifying equality with limited interaction
J Brody, A Chakrabarti, R Kondapally, DP Woodruff, G Yaroslavtsev
Algorithmica 76, 796-845, 2016
302016
Adapt or die: Polynomial lower bounds for non-adaptive dynamic data structures
J Brody, KG Larsen
arXiv preprint arXiv:1208.2846, 2012
282012
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
Better gap-hamming lower bounds via better round elimination
J Brody, A Chakrabarti, O Regev, T Vidick, R De Wolf
International Workshop on Randomization and Approximation Techniques in …, 2010
262010
The information complexity of hamming distance
E Blais, J Brody, B Ghazi
Schloss Dagstuhl 28, 465, 2014
182014
Optimal separation and strong direct sum for randomized query complexity
E Blais, J Brody
arXiv preprint arXiv:1908.01020, 2019
172019
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
162013
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
16*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
A strong XOR lemma for randomized query complexity
J Brody, JT Kim, P Lerdputtipongporn, H Srinivasulu
arXiv preprint arXiv:2007.05580, 2020
122020
Cryptogenography
J Brody, SK Jakobsen, D Scheder, P Winkler
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
102014
The maximum communication complexity of multi-party pointer jumping
J Brody
2009 24th Annual IEEE Conference on Computational Complexity, 379-386, 2009
92009
Position-based cryptography and multiparty communication complexity
J Brody, S Dziembowski, S Faust, K Pietrzak
Theory of Cryptography Conference, 56-81, 2017
82017
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
7*2018
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20