default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoshua Brody
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Joshua Brody:
Some Communication Complexity Results and their Applications. Dartmouth College, USA, 2010
Journal Articles
- 2016
- [j4]Joshua Brody, Harry Buhrman, Michal Koucký
, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica 76(3): 749-781 (2016) - [j3]Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. Algorithmica 76(3): 796-845 (2016) - 2015
- [j2]Joshua Brody, Kasper Green Larsen:
Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. Theory Comput. 11: 471-489 (2015) - 2012
- [j1]Eric Blais, Joshua Brody, Kevin Matulef:
Property Testing Lower Bounds via Communication Complexity. Comput. Complex. 21(2): 311-358 (2012)
Conference and Workshop Papers
- 2019
- [c22]Eric Blais, Joshua Brody:
Optimal Separation and Strong Direct Sum for Randomized Query Complexity. CCC 2019: 29:1-29:17 - 2017
- [c21]Joseph Boninger, Joshua Brody, Owen Kephart:
Non-Adaptive Data Structure Bounds for Dynamic Predecessor. FSTTCS 2017: 20:1-20:12 - [c20]Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak:
Position-Based Cryptography and Multiparty Communication Complexity. TCC (1) 2017: 56-81 - 2015
- [c19]Joshua Brody, Mario Sánchez:
Dependent Random Graphs and Multi-Party Pointer Jumping. APPROX-RANDOM 2015: 606-624 - 2014
- [c18]Eric Blais, Joshua Brody, Badih Ghazi:
The Information Complexity of Hamming Distance. APPROX-RANDOM 2014: 465-489 - [c17]Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. APPROX-RANDOM 2014: 545-581 - [c16]Joshua Brody, Sune K. Jakobsen, Dominik Scheder, Peter Winkler:
Cryptogenography. ITCS 2014: 13-22 - [c15]Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Beyond set disjointness: the communication complexity of finding the intersection. PODC 2014: 106-113 - 2013
- [c14]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC 2013: 24-33 - [c13]Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun:
Space-bounded communication complexity. ITCS 2013: 159-172 - 2012
- [c12]Joshua Brody, Hongyu Liang, Xiaoming Sun:
Space-Efficient Approximation Scheme for Circular Earth Mover Distance. LATIN 2012: 97-108 - 2011
- [c11]Joshua Brody, David P. Woodruff:
Streaming Algorithms with One-Sided Estimation. APPROX-RANDOM 2011: 436-447 - [c10]Eric Blais, Joshua Brody, Kevin Matulef:
Property Testing Lower Bounds via Communication Complexity. CCC 2011: 210-220 - [c9]Joshua Brody, Kevin Matulef, Chenggang Wu:
Lower Bounds for Testing Computability by Small Width OBDDs. TAMC 2011: 320-331 - 2010
- [c8]Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf:
Better Gap-Hamming Lower Bounds via Better Round Elimination. APPROX-RANDOM 2010: 476-489 - [c7]Joshua Brody, Elad Verbin:
The Coin Problem and Pseudorandomness for Branching Programs. FOCS 2010: 30-39 - [c6]Chrisil Arackaparambil, Sergey Bratus, Joshua Brody, Anna Shubina:
Distributed monitoring of conditional entropy for anomaly detection in streams. IPDPS Workshops 2010: 1-8 - 2009
- [c5]Joshua Brody, Amit Chakrabarti:
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. CCC 2009: 358-368 - [c4]Joshua Brody:
The Maximum Communication Complexity of Multi-Party Pointer Jumping. CCC 2009: 379-386 - [c3]Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti:
Functional Monitoring without Monotonicity. ICALP (1) 2009: 95-106 - 2008
- [c2]Sergey Bratus, Joshua Brody, David Kotz, Anna Shubina:
Streaming Estimation of Information-Theoretic Metrics for Anomaly Detection (Extended Abstract). RAID 2008: 412-414 - [c1]Joshua Brody, Amit Chakrabarti:
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. STACS 2008: 145-156
Informal and Other Publications
- 2020
- [i17]Joshua Brody, Jae Tak Kim, Peem Lerdputtipongporn, Hariharan Srinivasulu:
A Strong XOR Lemma for Randomized Query Complexity. CoRR abs/2007.05580 (2020) - [i16]Joshua Brody, Jae Tak Kim, Peem Lerdputtipongporn, Hariharan Srinivasulu:
A Strong XOR Lemma for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i15]Eric Blais, Joshua Brody:
Optimal Separation and Strong Direct Sum for Randomized Query Complexity. CoRR abs/1908.01020 (2019) - 2017
- [i14]Joe Boninger, Joshua Brody, Owen Kephart:
Non-Adaptive Data Structure Bounds for Dynamic Predecessor Search. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i13]Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak:
Position-Based Cryptography and Multiparty Communication Complexity. IACR Cryptol. ePrint Arch. 2016: 536 (2016) - 2015
- [i12]Joshua Brody, Mario Sánchez:
Dependent Random Graphs and Multiparty Pointer Jumping. CoRR abs/1506.01083 (2015) - [i11]Joshua Brody, Mario Sánchez:
Dependent Random Graphs and Multiparty Pointer Jumping. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [i10]Joshua Brody:
A Tight Lower Bound for Monotonicity Testing over Large Ranges. CoRR abs/1304.6685 (2013) - 2012
- [i9]Joshua Brody, Kasper Green Larsen:
Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. CoRR abs/1208.2846 (2012) - [i8]Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman:
Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i7]Joshua Brody, Amit Chakrabarti, Ranganath Kondapally:
Certifying Equality With Limited Interaction. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i6]Eric Blais, Joshua Brody, Kevin Matulef:
Property Testing Lower Bounds via Communication Complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - 2009
- [i5]Joshua Brody, Amit Chakrabarti:
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. CoRR abs/0902.2399 (2009) - [i4]Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf:
Better Gap-Hamming Lower Bounds via Better Round Elimination. CoRR abs/0912.5276 (2009) - [i3]Joshua Brody:
The Maximum Communication Complexity of Multi-party Pointer Jumping. Electron. Colloquium Comput. Complex. TR09 (2009) - [i2]Joshua Brody, Amit Chakrabarti:
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i1]Joshua Brody, Amit Chakrabarti:
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. CoRR abs/0802.2843 (2008)
Coauthor Index
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-10-07 21:24 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:
