Prati
Jeff Edmonds
Jeff Edmonds
Potvrđena adresa e-pošte na cse.yorku.ca - Početna stranica
Naslov
Citirano
Citirano
Godina
Priority encoding transmission
A Albanese, J Blomer, J Edmonds, M Luby, M Sudan
IEEE transactions on information theory 42 (6), 1737-1744, 1996
10081996
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
2071995
Scheduling in the dark
J Edmonds
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
1991999
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
1161995
Scalably scheduling processes with arbitrary speedup curves
J Edmonds, K Pruhs
ACM Transactions on Algorithms (TALG) 8 (3), 1-10, 2012
1012012
Cake cutting really is not a piece of cake
J Edmonds, K Pruhs
SODA 6, 271-278, 2006
892006
Communication complexity towards lower bounds on circuit depth
J Edmonds, R Impagliazzo, S Rudich, J Sgall
Computational Complexity 10, 210-246, 2001
882001
How to think about algorithms
J Edmonds
Cambridge University Press, 2024
712024
Mining for empty spaces in large data sets
J Edmonds, J Gryz, D Liang, RJ Miller
Theoretical Computer Science 296 (3), 435-452, 2003
682003
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
592003
Balanced allocations of cake
J Edmonds, K Pruhs
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
582006
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
512009
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
511999
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
492009
A maiden analysis of longest wait first
J Edmonds, K Pruhs
ACM Transactions on Algorithms (TALG) 1 (1), 14-32, 2005
452005
Multicast pull scheduling: When fairness is fine
Edmonds, Pruhs
Algorithmica 36, 315-330, 2003
452003
Mining for empty rectangles in large data sets
J Edmonds, J Gryz, D Liang, RJ Miller
International Conference on Database Theory, 174-188, 2001
402001
Broadcast scheduling: when fairness is fine.
J Edmonds, K Pruhs
SODA 810, 811-813, 2002
382002
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work
J Edmonds, S Im, B Moseley
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011
322011
Cake cutting really is not a piece of cake
J Edmonds, K Pruhs
ACM Transactions on Algorithms (TALG) 7 (4), 1-12, 2011
302011
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20