Michael Saks

Citado por

	Todos	Desde 2020
Citações	10670	2250
Índice h	58	26
Índice i10	140	61

480

240

120

360

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202546 73 72 113 140 130 172 120 167 161 191 196 190 217 216 253 227 285 314 364 363 339 383 345 348 417 333 343 400 369 418 384 479 427 397 423 458 63

Acesso público

Ver todos

15 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Nati LinialProfessor of Computer Science, The Hebrew University of JerusalemE-mail confirmado em cs.huji.ac.il
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonE-mail confirmado em cs.washington.edu
Michal KouckyCharles University, PragueE-mail confirmado em iuuk.mff.cuni.cz
Laszlo Lovaszprofessor of mathematics, Eotvos University, BudapestE-mail confirmado em cs.elte.hu
C. SeshadhriUniversity of California, Santa CruzE-mail confirmado em ucsc.edu
Howard KarloffGoldman SachsE-mail confirmado em cc.gatech.edu
Howard BarnumAdjunct Professor, University of New Mexico, Dept. of Physics and AstronomyE-mail confirmado em unm.edu
Anna R. KarlinBill & Melinda Gates Chair and Professor of Computer Science and Engineering, University ofE-mail confirmado em cs.washington.edu
Eric AllenderRutgers UniversityE-mail confirmado em cs.rutgers.edu
David ZuckermanProfessor of Computer Science, University of Texas at AustinE-mail confirmado em cs.utexas.edu
Avrim BlumProfessor and Chief Academic Officer, Toyota Technological Institute at ChicagoE-mail confirmado em ttic.edu
Alexander SchrijverUniversity of Amsterdam and CWIE-mail confirmado em cwi.nl
Jason HartlineProfessor of Computer Science, Northwestern U.E-mail confirmado em northwestern.edu
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.E-mail confirmado em alum.mit.edu
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of MarylandE-mail confirmado em umd.edu
Noam NisanProfessor of Computer Science, Hebrew University of JerusalemE-mail confirmado em cs.huji.ac.il
Larry RudolphMITE-mail confirmado em csail.MIT.edu
Ronald GrahamProfessor of Mathematics and Computer Science, UC San DiegoE-mail confirmado em ucsd.edu
Noga AlonPrinceton University and Tel Aviv UniversityE-mail confirmado em tau.ac.il
David PelegProfessor of Computer Science, Weizmann InstituteE-mail confirmado em weizmann.ac.il

Seguir

Michael Saks

Rutgers University-New Brunswick

E-mail confirmado em math.rutgers.edu - Página inicial

Theoretical Computer Science Discrete Mathematics Combinatorics Mathematics


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	644	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	475	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	419	2005
Competitive auctions AV Goldberg, JD Hartline, AR Karlin, M Saks, A Wright Games and Economic behavior 55 (2), 242-269, 2006	403	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	322	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	272	1986
A topological approach to evasiveness J Kahn, M Saks, D Sturtevant Combinatorica 4, 297-306, 1984	235	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	233	2005
Low diameter graph decompositions N Linial, M Saks Combinatorica 13 (4), 441-454, 1993	226	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	190	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	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	164	2005
Maximum induced trees in graphs P Erdös, M Saks, VT Sós Journal of Combinatorial Theory, Series B 41 (1), 61-79, 1986	156	1986
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	153	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	150	1998
Orthogonal representations and connectivity of graphs L Lovász, M Saks, A Schrijver Linear Algebra and its applications 114, 439-454, 1989	142	1989
The periodic balanced sorting network M Dowd, Y Perl, L Rudolph, M Saks Journal of the ACM (JACM) 36 (4), 738-757, 1989	141	1989
bphspace (S)⊆ dspace (S3/2) M Saks, S Zhou Journal of computer and system sciences 58 (2), 376-403, 1999	139	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	136	1989

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores