Michael Saks

Known as: Michael E. Saks 
Michael Ezra Saks is an American mathematician. He was (2006–2010) director of the Mathematics Graduate Program at Rutgers University. Saks received… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2016
01219852016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The problem of dynamic connectivity in graphs has been extensively studied in the cell probe model. The task is to design a data… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2016
2016
In the noisy population recovery problem of Dvir et al. [6], the goal is to learn an unknown distribution f on binary strings of… (More)
Is this relevant?
2016
2016
We prove that any graph G of minimum degree greater than 2k2 − 1 has a (k + 1)connected induced subgraph H such that the number… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
In this paper we study the fractional block sensitivity of Boolean functions. Recently, Tal [Tal13] and Gilmer, Saks, and… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication… (More)
  • figure 1.1
  • figure 1.2
  • figure 2.1
Is this relevant?
Review
2005
Review
2005
This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower… (More)
  • figure 1
  • table 1
Is this relevant?
2005
2005
In the last lecture we saw how to solve marked ancestor using O( logn log logn) time for queries, and O(log log n) time for… (More)
Is this relevant?
Review
2004
Review
2004
In its 2002 volume, the University of Illinois Law Review published posthumously an unfinished symposium article by Professor… (More)
Is this relevant?
1991
1991
This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For ann-cube the… (More)
  • figure 1
  • figure 3
  • table 1
Is this relevant?
1985
1985
The purpose of this paper is to extend the theorem of Kleitman and Saks [1] to the restricted alphabetic binary trees. Let E be a… (More)
Is this relevant?