Michael E. Saks
Affiliations: | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
MathematicsGoogle:
"Michael Saks"Parents
Sign in to add mentor| Daniel J. Kleitman | grad student | 1980 | MIT | |
| (Duality Properties of Finite Set Systems) | ||||
Children
Sign in to add trainee| Srikrishnan Divakaran | grad student | 2001 | Rutgers, New Brunswick |
| Clifford D. Smyth | grad student | 2001 | Rutgers, New Brunswick |
| Xiaodong Sun | grad student | 2002 | Rutgers, New Brunswick |
| Malka Rosenthal | grad student | 2003 | Rutgers, New Brunswick |
| Navin Goyal | grad student | 2005 | Rutgers, New Brunswick |
| Mangesh Gupte | grad student | 2011 | Rutgers, New Brunswick |
| Nikolaos Leonardos | grad student | 2012 | Rutgers, New Brunswick |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chiarelli J, Hatami P, Saks ME. (2020) An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function Combinatorica. 40: 237-244 |
| Babka M, Bulánek J, Cunát V, et al. (2019) On Online Labeling with Large Label Set Siam Journal On Discrete Mathematics. 33: 1175-1193 |
| Kahn J, Saks M, Smyth C. (2011) The dual bkr inequality and rudich's conjecture Combinatorics, Probability & Computing. 20: 257-266 |
| Divakaran S, Saks M. (2011) An online algorithm for a problem in scheduling with set-ups and release times Algorithmica (New York). 60: 301-315 |
| Goyal N, Saks ME. (2010) Rounds vs. Queries Tradeoff in Noisy Computation Theory of Computing. 6: 113-134 |
| Balogh J, Bollobás B, Saks M, et al. (2009) The unlabelled speed of a hereditary graph property Journal of Combinatorial Theory, Series B. 99: 9-19 |
| Allender E, Hellerstein L, Mccabe P, et al. (2008) Minimizing disjunctive normal form formulas and AC0 circuits given a truth table Siam Journal On Computing. 38: 63-84 |
| Goyal N, Kindler G, Saks M. (2008) Lower Bounds for the Noisy Broadcast Problem Siam Journal On Computing. 37: 1806-1841 |
| Divakaran S, Saks M. (2008) Approximation algorithms for problems in scheduling with set-ups Discrete Applied Mathematics. 156: 719-729 |
| Linial N, Saks ME, Statter D. (2006) The Non-Crossing Graph Electronic Journal of Combinatorics. 13: 2 |