Sciweavers

SODA
2008
ACM
86views Algorithms» more  SODA 2008»
14 years 29 days ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
FOCS
2006
IEEE
14 years 5 months ago
Better lossless condensers through derandomized curve samplers
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
Amnon Ta-Shma, Christopher Umans