Michael Saks

Cited by

	All	Since 2019
Citations	10510	2506
h-index	57	27
i10-index	139	70

480

240

120

360

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202441 27 25 47 73 71 109 143 125 174 121 167 161 193 195 189 215 210 258 228 282 312 362 359 339 372 345 349 405 339 348 402 367 415 388 480 426 407 439 363

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

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
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestVerified email at cs.elte.hu
C. SeshadhriUniversity of California, Santa CruzVerified email at ucsc.edu
Howard KarloffGoldman SachsVerified email at cc.gatech.edu
Anna R. KarlinBill & Melinda Gates Chair and Professor of Computer Science and Engineering, University ofVerified email at cs.washington.edu
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Howard BarnumAdjunct Professor, University of New Mexico, Dept. of Physics and AstronomyVerified email at unm.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoVerified email at ttic.edu
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 and Distinguished University Professor, University of MarylandVerified email at umd.edu
Alexander SchrijverUniversity of Amsterdam and CWIVerified email at cwi.nl
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Larry RudolphMITVerified email at csail.MIT.edu
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoVerified email at ucsd.edu
Lisa HellersteinProfessor of Computer Science, NYU Tandon School of EngineeringVerified email at nyu.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	638	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	472	1989
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	410	2005
Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic behavior 55 (2), 242-269, 2006	401	2006
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	315	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	263	1986
A topological approach to evasiveness J Kahn, M Saks, D Sturtevant Combinatorica 4, 297-306, 1984	231	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	227	2005
Low diameter graph decompositions N Linial, M Saks Combinatorica 13 (4), 441-454, 1993	221	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	191	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	178	1993
Lattices, mobius functions and communications complexity L Lovász, M Saks [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988	172	1988
Every decision tree has an influential variable R O'Donnell, M Saks, O Schramm, RA Servedio 46th annual IEEE symposium on foundations of computer science (FOCS'05), 31-39, 2005	162	2005
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	150	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	149	1998
Orthogonal representations and connectivity of graphs L Lovász, M Saks, A Schrijver Linear Algebra and its applications 114, 439-454, 1989	148	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	147	1986
bphspace (S)⊆ dspace (S3/2) M Saks, S Zhou Journal of computer and system sciences 58 (2), 376-403, 1999	141	1999
The periodic balanced sorting network M Dowd, Y Perl, L Rudolph, M Saks Journal of the ACM (JACM) 36 (4), 738-757, 1989	138	1989
On the cover time of random walks on graphs JD Kahn, N Linial, N Nisan, ME Saks Journal of Theoretical Probability 2, 121-128, 1989	135	1989

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

Follow

Cited by

Co-authors