Michael Saks

Cited by

	All	Since 2016
Citations	8797	2207
h-index	52	24
i10-index	134	65

520

260

130

390

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202136 27 22 36 61 66 94 120 114 160 116 147 144 192 193 181 202 203 241 224 261 314 346 368 334 372 341 351 420 334 354 403 370 411 409 517 92

Co-authors

Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemVerified email at cs.huji.ac.il
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
Howard KarloffGoldman SachsVerified email at cc.gatech.edu
C. SeshadhriUniversity of California, Santa CruzVerified email at ucsc.edu
Anna R. KarlinMicrosoft Professor, Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoVerified email at ttic.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoVerified email at ucsd.edu
Alexander SchrijverUniversity of Amsterdam and CWIVerified email at cwi.nl
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Jason HartlineProfessor of Computer Science, Northwestern U.Verified email at northwestern.edu
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Verified email at alum.mit.edu
Aravind SrinivasanProfessor of Computer Science, University of MarylandVerified email at cs.umd.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Yuval RabaniThe Hebrew University of JerusalemVerified email at cs.huji.ac.il
Lisa HellersteinProfessor of Computer Science, NYU Tandon School of EngineeringVerified email at nyu.edu
Yehoshua PerlDirector of SABOC research center . Professor of computer science NJITVerified email at njit.edu

Michael Saks

Rutgers University-New Brunswick

Verified email at math.rutgers.edu - Homepage

Theoretical Computer Science Discrete Mathematics Combinatorics Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An optimal on-line algorithm for metrical task system A Borodin, N Linial, ME Saks Journal of the ACM (JACM) 39 (4), 745-763, 1992	527	1992
The cell probe complexity of dynamic data structures M Fredman, M Saks Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989	404	1989
Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic Behavior 55 (2), 242-269, 2006	347	2006
An improved exponential-time algorithm for k-SAT R Paturi, P Pudlák, ME Saks, F Zane Journal of the ACM (JACM) 52 (3), 337-364, 2005	343	2005
Wait-free k-set agreement is impossible: The topology of public knowledge M Saks, F Zaharoglou SIAM Journal on Computing 29 (5), 1449-1483, 2000	268	2000
Probabilistic Boolean decision trees and the complexity of evaluating game trees M Saks, A Wigderson 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 29-38, 1986	229	1986
A topological approach to evasiveness J Kahn, M Saks, D Sturtevant Combinatorica 4 (4), 297-306, 1984	198	1984
Weak monotonicity suffices for truthfulness on convex domains M Saks, L Yu Proceedings of the 6th ACM conference on Electronic commerce, 286-293, 2005	196	2005
Low diameter graph decompositions N Linial, M Saks Combinatorica 13 (4), 441-454, 1993	176	1993
An on-line graph coloring algorithm with sublinear performance ratio L Lovász, M Saks, WT Trotter Discrete Mathematics 75 (1-3), 319-325, 1989	155	1989
Wait-free k-set agreement is impossible: the topology of public knowledge M Saks, F Zaharoglou Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993	143	1993
Lattices, mobius functions and communications complexity L Lovász, M Saks [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988	138	1988
The efficiency of resolution and Davis--Putnam procedures P Beame, R Karp, T Pitassi, M Saks SIAM Journal on Computing 31 (4), 1048-1075, 2002	134	2002
On the complexity of unsatisfiability proofs for random k-CNF formulas P Beame, R Karp, T Pitassi, M Saks Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	133	1998
The periodic balanced sorting network M Dowd, Y Perl, L Rudolph, M Saks Journal of the ACM (JACM) 36 (4), 738-757, 1989	133	1989
Maximum induced trees in graphs P Erdös, M Saks, VT Sós Journal of Combinatorial Theory, Series B 41 (1), 61-79, 1986	128	1986
On the cover time of random walks on graphs JD Kahn, N Linial, N Nisan, ME Saks Journal of Theoretical Probability 2 (1), 121-128, 1989	115	1989
Space lower bounds for distance approximation in the data stream model M Saks, X Sun Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	111	2002
Optimal time randomized consensus—making resilient algorithms fast in practice M Saks, N Shavit, H Woll Proceedings of the second annual ACM-SIAM Symposium on Discrete algorithms …, 1991	105	1991
Time-space trade-off lower bounds for randomized computation of decision problems P Beame, M Saks, X Sun, E Vee Journal of the ACM (JACM) 50 (2), 154-195, 2003	103	2003

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors