#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1993

2019

- This year (2)
- Last 5 years (7)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for… (More)

- Moses Charikar, Eric Lehman, +4 authors Abhi Shelat
- IEEE Transactions on Information Theory
- 2005

This paper addresses the smallest grammar problem: What is the smallest context-free grammar that generates exactly one given string /spl sigma/? This is a natural question about a fundamental object… (More)

- April Rasala Lehman, Eric Lehman
- SODA
- 2004

We address the network information flow problem, in which messages available to a set of sources must be passed through a network to a set of sinks with specified demands. This differs from… (More)

The field of property testing studies algorithms that distinguish, using a small number of queries, between inputs which satisfy a given property, and those that are `far' from satisfying the… (More)

- Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
- RANDOM-APPROX
- 1999

We present improved algorithms for testing monotonicity of functions. Namely, given the ability to query an unknown function f: Σ n ↦ Ξ, where Σ and Ξ are finite ordered sets, the test always accepts… (More)

- Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
- Combinatorica
- 1998

at arguments of its choice, the test always accepts a monotone f, and rejects f with high probability if it is ε-far from being monotone (i.e., every monotone function differs from f on more than an… (More)

- Eric Lehman, Abhi Shelat
- SODA
- 2002

Several recently-proposed data compression algorithms are based on the idea of representing a string by a context-free grammar. Most of these algorithms are known to be asymptotically optimal with… (More)

- Joel Grodstein, Eric Lehman, Heather Harkness, Bill Grundmann, Yosinatori Watanabe
- Proceedings of IEEE International Conference on…
- 1995

We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as constant and makes the cell's delay a linear function of load. Out model is based on… (More)

- Moses Charikar, Eric Lehman, +5 authors Abhi Shelat
- STOC
- 2002

We consider the problem of finding the smallest context-free grammar that generates exactly one given string of length <i>n</i>. The size of this grammar is of theoretical interest as an efficiently… (More)