Michael Saks

Cited by

	All	Since 2018
Citations	10101	2545
h-index	56	26
i10-index	138	68

500

250

125

375

19851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202341 27 26 44 70 71 110 138 121 169 121 167 159 184 201 193 208 210 258 229 278 313 364 362 333 368 339 347 402 339 341 406 376 413 402 481 444 452 350

Public access

View all

12 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
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
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
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
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
Alexander SchrijverUniversity of Amsterdam and CWIVerified email at cwi.nl
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
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemVerified email at cs.huji.ac.il
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Lisa HellersteinProfessor of Computer Science, NYU Tandon School of EngineeringVerified email at nyu.edu
Yuval RabaniThe Hebrew University of JerusalemVerified email at cs.huji.ac.il
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoVerified email at ucsd.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	608	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	463	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	398	2005
Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic behavior 55 (2), 242-269, 2006	390	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	309	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	250	1986
A topological approach to evasiveness J Kahn, M Saks, D Sturtevant Combinatorica 4, 297-306, 1984	227	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	221	2005
Low diameter graph decompositions N Linial, M Saks Combinatorica 13 (4), 441-454, 1993	212	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	181	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	165	1993
Lattices, mobius functions and communications complexity L Lovász, M Saks [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988	155	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	153	2005
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	152	1998
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	145	2002
Maximum induced trees in graphs P Erdös, M Saks, VT Sós Journal of Combinatorial Theory, Series B 41 (1), 61-79, 1986	141	1986
Orthogonal representations and connectivity of graphs L Lovász, M Saks, A Schrijver Linear Algebra and its applications 114, 439-454, 1989	136	1989
The periodic balanced sorting network M Dowd, Y Perl, L Rudolph, M Saks Journal of the ACM (JACM) 36 (4), 738-757, 1989	134	1989
bphspace (S)⊆ dspace (S3/2) M Saks, S Zhou Journal of computer and system sciences 58 (2), 376-403, 1999	129	1999
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	129	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