The following pages link to Michael E. Saks (Q1112076):
Displayed 42 items.
- Products and Help Bits in Decision Trees (Q4229422) (← links)
- (Q4230341) (← links)
- (Q4234096) (← links)
- Optimal Space Distributed Order-Preserving Lists (Q4242659) (← links)
- (Q4252719) (← links)
- A Complexity Index for Satisfiability Problems (Q4286227) (← links)
- An optimal on-line algorithm for metrical task system (Q4302787) (← links)
- Size--Depth Tradeoffs for Threshold Circuits (Q4337668) (← links)
- Local management of a global resource in a communication network (Q4371514) (← links)
- (Q4526973) (← links)
- (Q4542534) (← links)
- (Q4542576) (← links)
- Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance (Q4575879) (← links)
- Covering Regions by Rectangles (Q4742806) (← links)
- A Class of Perfect Graphs Associated with Planar Rectilinear Regions (Q4742824) (← links)
- (Q4875171) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)
- (Q4941822) (← links)
- Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge (Q4943878) (← links)
- Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time (Q5056449) (← links)
- Circuit lower bounds from NP-hardness of MCSP under turing reductions (Q5092477) (← links)
- On the discrepancy of random matrices with many columns (Q5120742) (← links)
- Constant factor approximations to edit distance on far input pairs in nearly linear time (Q5144955) (← links)
- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields (Q5167786) (← links)
- On Online Labeling with Large Label Set (Q5232147) (← links)
- Wait-free <i>k</i>-set agreement is impossible (Q5248476) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q5248494) (← links)
- Size-depth trade-offs for threshold circuits (Q5248524) (← links)
- Optimal space distributed move-to-front lists (Q5255807) (← links)
- STACS 2004 (Q5309738) (← links)
- A parallel search game (Q5318247) (← links)
- On Randomized Online Labeling with Polynomially Many Labels (Q5326569) (← links)
- A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity (Q5363105) (← links)
- (Q5368900) (← links)
- Local Monotonicity Reconstruction (Q5390580) (← links)
- Tight lower bounds for the online labeling problem (Q5415544) (← links)
- STACS 2005 (Q5710675) (← links)
- Estimating the Longest Increasing Sequence in Polylogarithmic Time (Q5737810) (← links)
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance (Q5741831) (← links)
- A lower bound for primality (Q5943093) (← links)
- Sample spaces with small bias on neighborhoods and error-correcting communication protocols (Q5945921) (← links)
- Towards an algebraic natural proofs barrier via polynomial identity testing (Q6281640) (← links)