HOME

TheInfoList



OR:

Michael Ezra Saks is an American mathematician. He is currently the Department Chair of the Mathematics Department at Rutgers University (2017–) and from 2006 until 2010 was director of the Mathematics Graduate Program at
Rutgers University Rutgers University (; RU), officially Rutgers, The State University of New Jersey, is a public land-grant research university consisting of four campuses in New Jersey. Chartered in 1766, Rutgers was originally called Queen's College, and wa ...
. Saks received his Ph.D. from the
Massachusetts Institute of Technology The Massachusetts Institute of Technology (MIT) is a Private university, private Land-grant university, land-grant research university in Cambridge, Massachusetts. Established in 1861, MIT has played a key role in the development of modern t ...
in 1980 after completing his dissertation titled ''Duality Properties of Finite Set Systems'' under his advisor
Daniel J. Kleitman Daniel J. Kleitman (born October 4, 1934)article availableon Douglas West (mathematician), Douglas West's web page, University of Illinois at Urbana–Champaign)."Kleitman, Daniel J.," in: ''Who's Who in Frontier Science and Technology'', 1, 1984, ...
. A list of his publications and collaborations may be found at
DBLP DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since No ...
. In 2016 he became a
Fellow of the Association for Computing Machinery A fellow is a concept whose exact meaning depends on context. In learned or professional societies, it refers to a privileged member who is specially elected in recognition of their work and achievements. Within the context of higher education ...
.


Research

Saks research in
computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved ...
,
combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many a ...
, and
graph theory In mathematics, graph theory is the study of '' graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conn ...
has contributed to the study of lower bounds in
order theory Order theory is a branch of mathematics that investigates the intuitive notion of order using binary relations. It provides a formal framework for describing statements such as "this is less than that" or "this precedes that". This article intr ...
,
randomized computation A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performa ...
, and
space–time tradeoff A space–time trade-off or time–memory trade-off in computer science is a case where an algorithm or program trades increased space usage with decreased time. Here, ''space'' refers to the data storage consumed in performing a given task ( RA ...
. In 1984, Saks and Jeff Kahn showed that there exist a tight information-theoretical lower bound for sorting under
partially ordered In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary ...
information up to a multiplicative constant. I

the first super-linear lower bound for the
noisy broadcast problem Noisy is the name or part of the name of six communes of France, communes of France: *Noisy-le-Grand in the Seine-Saint-Denis ''département'' *Noisy-le-Roi in the Yvelines ''département'' *Noisy-le-Sec in the Seine-Saint-Denis ''département'' *N ...
was proved. In a noisy broadcast model, n+1 processors P_0,P_1,\ldots,P_n are assigned a local input bit x_i. Each processor may perform a ''noisy broadcast'' to all other processors where the received bits may be independently flipped with a fixed probability. The problem is for processor P_0 to determine f(x_1,x_2,\ldots,x_n) for some function f. Saks et al. showed that an existing protocol by Gallager was indeed optimal by a reduction from a generalized noisy
decision tree A decision tree is a decision support tool that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains co ...
and produced a \Omega(n\log(n)) lower bound on the depth of the tree that learns the input. In 2003, P. Beame, Saks, X. Sun, and E. Vee published the first time–space lower bound trade-off for randomized computation of decision problems was proved.


Positions

Saks holds positions in the following journal editorial boards: *
SIAM Journal on Computing The ''SIAM Journal on Computing'' is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). Although its official ISO abbreviation is ...
, Associate Editor *
Combinatorica ''Combinatorica'' is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as hono ...
, Editorial Board member *
Journal of Graph Theory The ''Journal of Graph Theory'' is a peer-reviewed mathematics journal specializing in graph theory and related areas, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. Th ...
, Editorial Board member *
Discrete Applied Mathematics ''Discrete Applied Mathematics'' is a peer-reviewed scientific journal covering algorithmic and applied areas of discrete mathematics. It is published by Elsevier and the editor-in-chief is Endre Boros (Rutgers University). The journal was split o ...
, Editorial Board member


Selected publications

* * * * * * *


References


External links

* {{DEFAULTSORT:Saks, Michael Living people Rutgers University faculty Gödel Prize laureates Massachusetts Institute of Technology School of Science alumni Theoretical computer scientists Fellows of the Association for Computing Machinery Year of birth missing (living people) Combinatorialists