|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joshua Brody, Hongyu Liang, Xiaoming Sun |
Space-Efficient Approximation Scheme for Circular Earth Mover Distance.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Blais, Joshua Brody, Kevin Matulef |
Property Testing Lower Bounds via Communication Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Kevin Matulef, Chenggang Wu |
Lower Bounds for Testing Computability by Small Width OBDDs. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, David P. Woodruff |
Streaming Algorithms with One-Sided Estimation. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Blais, Joshua Brody, Kevin Matulef |
Property Testing Lower Bounds via Communication Complexity. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chrisil Arackaparambil, Sergey Bratus, Joshua Brody, Anna Shubina |
Distributed monitoring of conditional entropy for anomaly detection in streams. |
IPDPS Workshops |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Elad Verbin |
The Coin Problem and Pseudorandomness for Branching Programs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody |
The Maximum Communication Complexity of Multi-party Pointer Jumping. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti |
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti, Oded Regev, Thomas Vidick, Ronald de Wolf |
Better Gap-Hamming Lower Bounds via Better Round Elimination |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti |
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Chrisil Arackaparambil, Joshua Brody, Amit Chakrabarti |
Functional Monitoring without Monotonicity. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
sensor networks, distributed algorithms, data streams, Communication complexity |
| 1 | Joshua Brody |
The Maximum Communication Complexity of Multi-Party Pointer Jumping. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti |
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti |
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Joshua Brody, Amit Chakrabarti |
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bratus, Joshua Brody, David Kotz, Anna Shubina |
Streaming Estimation of Information-Theoretic Metrics for Anomaly Detection (Extended Abstract). |
RAID |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")