The following pages link to Michael E. Saks (Q1112076):
Displaying 50 items.
- (Q202098) (redirect page) (← links)
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
- (Q583244) (redirect page) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- Lower bounds on the randomized communication complexity of read-once functions (Q626679) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- A lower bound on the integrality gap for minimum multicut in directed networks (Q705752) (← links)
- A polyomino with no stochastic function (Q762170) (← links)
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- The non-crossing graph (Q813926) (← links)
- Some extremal problems arising from discrete control processes (Q913685) (← links)
- A topological approach to evasiveness (Q1065831) (← links)
- Every poset has a central element (Q1068859) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Largest induced suborders satisfying the chain condition (Q1074604) (← links)
- Maximum induced trees in graphs (Q1082351) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
- Combinatorial representation and convex dimension of convex geometries (Q1112077) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- An on-line graph coloring algorithm with sublinear performance ratio (Q1124602) (← links)
- A short proof of the existence of k-saturated partitions of partially ordered sets (Q1137582) (← links)
- Product partial orders with the Sperner property (Q1151409) (← links)
- On chains and Sperner k-families in ranked posets. II (Q1153108) (← links)
- On computing majority by comparisons (Q1181015) (← links)
- Sharpening the LYM inequality (Q1200274) (← links)
- Low distortion Euclidean embeddings of trees (Q1269777) (← links)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- Correlation inequalities and a conjecture for permanents (Q1311017) (← links)
- Low diameter graph decompositions (Q1316650) (← links)
- Approximating threshold circuits by rational functions (Q1333272) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- A limit theorem for sets of stochastic matrices. (Q1430373) (← links)
- A correction: Orthogonal representations and connectivity of graphs (Q1579514) (← links)
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- On FKG-type and permanental inequalities (Q1624521) (← links)
- Online labeling: algorithms, lower bounds and open questions (Q1625136) (← links)
- Composition limits and separating examples for some Boolean function complexity measures (Q1701350) (← links)
- The number of distinct subset sums of a finite set of vectors (Q1801789) (← links)
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance (Q1821125) (← links)
- On the widths of finite distributive lattices (Q1821126) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- On the cover time of random walks on graphs (Q1823548) (← links)
- On the bandwidth of triangulated triangles (Q1842168) (← links)
- Kleitman and combinatorics (Q1850009) (← links)
- On list update and work function algorithms. (Q1853486) (← links)
