Brody, Joshua - Institute for Theoretical Computer Science, Tsinghua University

E-print Network

FAQ • HELP • SITE MAP • CONTACT US

Powered by Explorit

Advanced Search

Brody, Joshua - Institute for Theoretical Computer Science, Tsinghua University

Distributed Monitoring of Conditional Entropy for Anomaly Detection in Streams
Functional Monitoring Without Monotonicity Chrisil Arackaparambil, Joshua Brody, and Amit Chakrabarti
The Maximum Communication Complexity of Multi-Party Pointer Jumping
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
arXiv:0912.5276v1[cs.CC]30Dec2009 Better Gap-Hamming Lower Bounds via Better Round Elimination
Measuring information-theoretic statistics of traffic has proved useful in detecting network anomalies; however, the more com-
Functional Monitoring Without Monotonicity Chrisil Arackaparambil, Joshua Brody, and Amit Chakrabarti
arXiv:0802.2843v1[cs.CC]20Feb2008 Symposium on Theoretical Aspects of Computer Science 2008 (Bordeaux), pp. 145-156
The Coin Problem, and Pseudorandomness for Branching Programs Joshua Brody1
Streaming Algorithms with One-Sided Joshua Brody1
Streaming Estimation of Information-theoretic Metrics for Anomaly Detection
Some Communication Complexity Results and their Applications
Lower Bounds for Testing Computability by Small Width OBDDs