Jeff Edmonds

Citace

	Všechny	Od 2019
Citace	3241	574
h-index	23	11
i10-index	33	13

180

135

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320249 11 17 46 44 62 65 79 73 66 99 104 113 113 131 148 176 166 145 159 130 142 136 136 122 124 110 93 98 125 75 71

Veřejný přístup

Zobrazit všechny

5 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Kirk PruhsProfessor of Computer Science, University of PittsburghE-mailová adresa ověřena na: cs.pitt.edu
Michael LubyBitRipple and ICSIE-mailová adresa ověřena na: bitripple.com
Johannes BloemerProfessor for Computer Science, Paderborn UniversityE-mailová adresa ověřena na: mail.upb.de
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityE-mailová adresa ověřena na: cs.harvard.edu
Andres Albanesemyhomevillage.comE-mailová adresa ověřena na: myhomevillage.com
Stephen CookDepartment of Computer Science, University of TorontoE-mailová adresa ověřena na: cs.toronto.edu
Jarek GryzProfessor of Computer Science, York UniversityE-mailová adresa ověřena na: cs.yorku.ca
Renee MillerNortheastern UniversityE-mailová adresa ověřena na: northeastern.edu
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonE-mailová adresa ověřena na: cs.washington.edu
Tim BrechtUniversity of WaterlooE-mailová adresa ověřena na: uwaterloo.ca
Xiaotie DengChair Professor of Computer Science, Peking University, Beijing, ChinaE-mailová adresa ověřena na: pku.edu.cn
Tak-Wah LamUniversity of Hong KongE-mailová adresa ověřena na: cs.hku.hk
Chung Keung PoonHang Seng Management CollegeE-mailová adresa ověřena na: hsmc.edu.hk
Noga AlonPrinceton University and Tel Aviv UniversityE-mailová adresa ověřena na: tau.ac.il
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityE-mailová adresa ověřena na: cmu.edu
Jiri SgallComputer Science Institute of Charles UniversityE-mailová adresa ověřena na: iuuk.mff.cuni.cz

Sledovat

Jeff Edmonds

York University

E-mailová adresa ověřena na: cse.yorku.ca - Domovská stránka

Theoretical Computer Science


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 1996	1008	1996
Using the Groebner basis algorithm to find proofs of unsatisfiability M Clegg, J Edmonds, R Impagliazzo Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996	450	1996
The relative complexity of NP search problems P Beame, S Cook, J Edmonds, R Impagliazzo, T Pitassi Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995	210	1995
Scheduling in the dark J Edmonds Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999	201	1999
Linear time erasure codes with nearly optimal recovery N Alon, J Edmonds, M Luby Proceedings of IEEE 36th Annual Foundations of Computer Science, 512-519, 1995	114	1995
Scalably scheduling processes with arbitrary speedup curves J Edmonds, K Pruhs ACM Transactions on Algorithms (TALG) 8 (3), 1-10, 2012	106	2012
Cake cutting really is not a piece of cake J Edmonds, K Pruhs SODA 6, 271-278, 2006	98	2006
Communication complexity towards lower bounds on circuit depth J Edmonds, R Impagliazzo, S Rudich, J Sgall Computational Complexity 10 (3), 210-246, 2001	85	2001
How to think about algorithms J Edmonds Cambridge University Press, 2024	69	2024
Mining for empty spaces in large data sets J Edmonds, J Gryz, D Liang, RJ Miller Theoretical Computer Science 296 (3), 435-452, 2003	69	2003
Balanced allocations of cake J Edmonds, K Pruhs 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006	59	2006
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics J Edmonds, DD Chinn, T Brecht, X Deng Journal of Scheduling 6 (3), 231-250, 2003	59	2003
Tight lower bounds for st-connectivity on the NNJAG model J Edmonds, CK Poon, D Achlioptas SIAM Journal on Computing 28 (6), 2257-2284, 1999	52	1999
Speed scaling of processes with arbitrary speedup curves on a multiprocessor HL Chan, J Edmonds, K Pruhs Proceedings of the twenty-first annual symposium on Parallelism in …, 2009	51	2009
Nonclairvoyant speed scaling for flow and energy HL Chan, J Edmonds, TW Lam, LK Lee, A Marchetti-Spaccamela, K Pruhs arXiv preprint arXiv:0902.1260, 2009	49	2009
A maiden analysis of longest wait first J Edmonds, K Pruhs ACM Transactions on Algorithms (TALG) 1 (1), 14-32, 2005	44	2005
Multicast pull scheduling: When fairness is fine Edmonds, Pruhs Algorithmica 36, 315-330, 2003	41	2003
Multicast pull scheduling: when fairness is fine J Edmonds, K Pruhs Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 421-430, 2002	41	2002
Mining for empty rectangles in large data sets J Edmonds, J Gryz, D Liang, RJ Miller International Conference on Database Theory, 174-188, 2001	40	2001
Cake cutting really is not a piece of cake J Edmonds, K Pruhs ACM Transactions on Algorithms (TALG) 7 (4), 1-12, 2011	32	2011

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři