Estimating the longest increasing sequence in polylogarithmic time
- Michael Saks
- C. Seshadhri
- 2010
- FOCS 2010
Publications
Date
Featured collections
Popular topics
5 results for Michael Saks
Optimal time randomized consensus - Making resilient algorithms fast in practice
- Michael Saks
- Nir Shavit
- et al.
- 1991
- SODA 1991
Local monotonicity reconstruction
- Michael Saks
- C. Seshadhri
- 2010
- SIAM Journal on Computing
Time-space tradeoffs for branching programs
- Paul Beame
- T.S. Jayram
- et al.
- 2001
- Journal of Computer and System Sciences
On the cover time of random walks on graphs
- Jeff D. Kahn
- Nathan Linial
- et al.
- 1989
- Journal of Theoretical Probability