Michael Saks

인용

	전체	2020년 이후
서지정보	10628	2228
h-index	58	26
i10-index	139	61

500

250

125

375

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202547 73 71 111 142 128 174 121 167 161 193 195 189 215 211 258 228 282 313 364 359 339 371 342 349 409 339 348 402 369 416 387 481 424 404 434 448 34

공개 액세스

모두 보기

자료 14개

자료 0개

공개

비공개

재정 지원 요구사항 기준

공동 저자

Nati LinialProfessor of Computer Science, The Hebrew University of Jerusalemcs.huji.ac.il의 이메일 확인됨
Paul BeameProfessor of Computer Science and Engineering, University of Washingtoncs.washington.edu의 이메일 확인됨
Michal KouckyCharles University, Pragueiuuk.mff.cuni.cz의 이메일 확인됨
Laszlo Lovaszprofessor of mathematics, Eotvos University, Budapestcs.elte.hu의 이메일 확인됨
C. SeshadhriUniversity of California, Santa Cruzucsc.edu의 이메일 확인됨
Howard KarloffGoldman Sachscc.gatech.edu의 이메일 확인됨
Anna R. KarlinBill & Melinda Gates Chair and Professor of Computer Science and Engineering, University ofcs.washington.edu의 이메일 확인됨
Eric AllenderRutgers Universitycs.rutgers.edu의 이메일 확인됨
Howard BarnumAdjunct Professor, University of New Mexico, Dept. of Physics and Astronomyunm.edu의 이메일 확인됨
David ZuckermanProfessor of Computer Science, University of Texas at Austincs.utexas.edu의 이메일 확인됨
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at Chicagottic.edu의 이메일 확인됨
Jason HartlineProfessor of Computer Science, Northwestern U.northwestern.edu의 이메일 확인됨
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.alum.mit.edu의 이메일 확인됨
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of Marylandumd.edu의 이메일 확인됨
Alexander SchrijverUniversity of Amsterdam and CWIcwi.nl의 이메일 확인됨
Noam NisanProfessor of Computer Science, Hebrew University of Jerusalemcs.huji.ac.il의 이메일 확인됨
Larry RudolphMITcsail.MIT.edu의 이메일 확인됨
Noga AlonPrinceton University and Tel Aviv Universitytau.ac.il의 이메일 확인됨
Ronald GrahamProfessor of Mathematics and Computer Science, UC San Diegoucsd.edu의 이메일 확인됨
Yuval RabaniThe Hebrew University of Jerusalemcs.huji.ac.il의 이메일 확인됨

팔로우

Michael Saks

Rutgers University-New Brunswick

math.rutgers.edu의 이메일 확인됨 - 홈페이지

Theoretical Computer Science Discrete Mathematics Combinatorics Mathematics


제목 서지정보순 정렬 연도순 정렬 제목순 정렬	인용 인용	연도
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	647	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	477	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	416	2005
Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic behavior 55 (2), 242-269, 2006	402	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	324	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	267	1986
A topological approach to evasiveness J Kahn, M Saks, D Sturtevant Combinatorica 4, 297-306, 1984	232	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	231	2005
Low diameter graph decompositions N Linial, M Saks Combinatorica 13 (4), 441-454, 1993	225	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	179	1993
Lattices, mobius functions and communications complexity L Lovász, M Saks [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science …, 1988	173	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	163	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	151	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	151	1986
Orthogonal representations and connectivity of graphs L Lovász, M Saks, A Schrijver Linear Algebra and its applications 114, 439-454, 1989	150	1989
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
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

현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.

학술자료 1–20

연간 인용횟수

중복된 서지정보

병합된 서지정보

공동 저자 추가공동 저자

팔로우

인용

공동 저자