The following pages link to Michael E. Saks (Q1112076):
Displayed 50 items.
- The Euclidean distortion of complete binary trees (Q1864125) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- Multicolour Turán problems (Q1883379) (← links)
- Complexity of some arithmetic problems for binary polynomials (Q1889852) (← links)
- Witness sets for families of binary vectors (Q1906149) (← links)
- On the rational relationships among pseudo-roots of a non-commutative polynomial (Q1996040) (← links)
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function (Q2003766) (← links)
- Balancing poset extensions (Q2266032) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- A localization inequality for set functions. (Q2490870) (← links)
- The unlabelled speed of a hereditary graph property (Q2519010) (← links)
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (Q2706128) (← links)
- The Efficiency of Resolution and Davis--Putnam Procedures (Q2784492) (← links)
- (Q2816411) (← links)
- Lower bounds for leader election and collective coin-flipping in the perfect information model (Q2819564) (← links)
- On Online Labeling with Polynomially Many Labels (Q2912834) (← links)
- (Q2921722) (← links)
- (Q2957913) (← links)
- (Q2969648) (← links)
- A New Approach to the Sensitivity Conjecture (Q2989036) (← links)
- (Q3002819) (← links)
- The Dual BKR Inequality and Rudich's Conjecture (Q3081331) (← links)
- (Q3138968) (← links)
- (Q3138972) (← links)
- (Q3142416) (← links)
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (Q3149888) (← links)
- A tail bound for read-<i>k</i>families of functions (Q3192374) (← links)
- (Q3304119) (← links)
- Probabilistic strategies for the partition and plurality problems (Q3419612) (← links)
- Time-space trade-off lower bounds for randomized computation of decision problems (Q3455560) (← links)
- Tight Lower Bounds for the Online Labeling Problem (Q3457193) (← links)
- The periodic balanced sorting network (Q3476271) (← links)
- An improved exponential-time algorithm for <i>k</i> -SAT (Q3546306) (← links)
- Lower Bounds for the Noisy Broadcast Problem (Q3549324) (← links)
- Space lower bounds for distance approximation in the data stream model (Q3579208) (← links)
- (Q3579388) (← links)
- Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table (Q3614150) (← links)
- (Q3680857) (← links)
- (Q3686039) (← links)
- Searching ordered structures (Q3700849) (← links)
- (Q3785965) (← links)
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number (Q3791167) (← links)
- A Limit Theorem for (min, +) Matrix Multiplication (Q3813823) (← links)
- A Robust Noncryptographic Protocol for Collective Coin Flipping (Q3824138) (← links)
- (Q3830840) (← links)
- Explicit OR-dispersers with polylogarithmic degree (Q3841042) (← links)
- Set Orderings Requiring Costliest Alphabetic Binary Trees (Q3964022) (← links)
- A Statistical Procedure for Cluster Recognition with Application to Atlanta Leukemia-Lymphoma Data (Q3965470) (← links)
- Dilworth Numbers, Incidence Maps and Product Partial Orders (Q3966187) (← links)
- Group labelings of graphs (Q4198810) (← links)