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

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Anup Rao
- 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)

Is this relevant?

2016

2016

- Anindya De, Michael E. Saks, Sijian Tang
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 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

- Irena Penev, Stéphan Thomassé, Nicolas Trotignon
- SIAM J. Discrete Math.
- 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)

Is this relevant?

2013

2013

- Raghav Kulkarni, Avishay Tal
- Chicago J. Theor. Comput. Sci.
- 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

- Mihai Patrascu
- SIAM J. Comput.
- 2011

We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication… (More)

Is this relevant?

Review

2005

Review

2005

- Corina E. Patrascu, Mihai Patrascu
- ICALP
- 2005

This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower… (More)

Is this relevant?

2005

2005

- Tim Abbott
- 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

- COMMENT ON EMPIRICISM, TORT LAW, Michael Saks
- 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

- Daniel M. Gordon
- Algorithmica
- 1991

This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For ann-cube the… (More)

Is this relevant?

1985

1985

- Yung-ching Chu
- Discrete Applied Mathematics
- 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?