Joshua Brody

	2012
18		Joshua Brody, Hongyu Liang, Xiaoming Sun: Space-Efficient Approximation Scheme for Circular Earth Mover Distance. LATIN 2012: 97-108
	2011
17		Joshua Brody, David P. Woodruff: Streaming Algorithms with One-Sided Estimation. APPROX-RANDOM 2011: 436-447
16		Eric Blais, Joshua Brody, Kevin Matulef: Property Testing Lower Bounds via Communication Complexity. IEEE Conference on Computational Complexity 2011: 210-220
15		Joshua Brody, Kevin Matulef, Chenggang Wu: Lower Bounds for Testing Computability by Small Width OBDDs. TAMC 2011: 320-331
14		Eric Blais, Joshua Brody, Kevin Matulef: Property Testing Lower Bounds via Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 18: 45 (2011)
	2010
13		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
12		Joshua Brody, Elad Verbin: The Coin Problem and Pseudorandomness for Branching Programs. FOCS 2010: 30-39
11		Chrisil Arackaparambil, Sergey Bratus, Joshua Brody, Anna Shubina: Distributed monitoring of conditional entropy for anomaly detection in streams. IPDPS Workshops 2010: 1-8
	2009
10		Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti: Functional Monitoring without Monotonicity. ICALP (1) 2009: 95-106
9		Joshua Brody, Amit Chakrabarti: A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. IEEE Conference on Computational Complexity 2009: 358-368
8		Joshua Brody: The Maximum Communication Complexity of Multi-Party Pointer Jumping. IEEE Conference on Computational Complexity 2009: 379-386
7		Joshua Brody, Amit Chakrabarti: A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences CoRR abs/0902.2399: (2009)
6		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)
5		Joshua Brody, Amit Chakrabarti: A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. Electronic Colloquium on Computational Complexity (ECCC) 16: 15 (2009)
4		Joshua Brody: The Maximum Communication Complexity of Multi-party Pointer Jumping. Electronic Colloquium on Computational Complexity (ECCC) 16: 17 (2009)
	2008
3		Sergey Bratus, Joshua Brody, David Kotz, Anna Shubina: Streaming Estimation of Information-Theoretic Metrics for Anomaly Detection (Extended Abstract). RAID 2008: 412-414
2		Joshua Brody, Amit Chakrabarti: Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. STACS 2008: 145-156
1		Joshua Brody, Amit Chakrabarti: Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound CoRR abs/0802.2843: (2008)

Coauthor Index

1	Chrisil Arackaparambil	[10] [11]
2	Eric Blais	[14] [16]
3	Sergey Bratus	[3] [11]
4	Amit Chakrabarti	[1] [2] [5] [6] [7] [9] [10] [13]
5	David Kotz	[3]
6	Hongyu Liang	[18]
7	Kevin Matulef	[14] [15] [16]
8	Oded Regev	[6] [13]
9	Anna Shubina	[3] [11]
10	Xiaoming Sun	[18]
11	Elad Verbin	[12]
12	Thomas Vidick	[6] [13]
13	Ronald de Wolf	[6] [13]
14	David P. Woodruff	[17]
15	Chenggang Wu	[15]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page