Jeff Edmonds
Jeff Edmonds
Verified email at cse.yorku.ca - Homepage
Title
Cited by
Cited by
Year
Priority encoding transmission
A Albanese, J Blomer, J Edmonds, M Luby, M Sudan
IEEE transactions on information theory 42 (6), 1737-1744, 1996
9381996
Scheduling in the dark
J Edmonds
Theoretical Computer Science 235 (1), 109-141, 2000
1852000
The relative complexity of NP search problems
P Beame, S Cook, J Edmonds, R Impagliazzo, T Pitassi
Journal of Computer and System Sciences 57 (1), 3-19, 1998
1531998
Scalably scheduling processes with arbitrary speedup curves
J Edmonds, K Pruhs
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
912009
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
871995
Nonclairvoyant speed scaling for flow and energy
HL Chan, J Edmonds, TW Lam, LK Lee, A Marchetti-Spaccamela, K Pruhs
Algorithmica 61 (3), 507-517, 2011
732011
Cake cutting really is not a piece of cake
J Edmonds, K Pruhs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
722006
Mining for empty spaces in large data sets
J Edmonds, J Gryz, D Liang, RJ Miller
Theoretical Computer Science 296 (3), 435-452, 2003
642003
Communication complexity towards lower bounds on circuit depth
J Edmonds, R Impagliazzo, S Rudich, J Sgall
Computational Complexity 10 (3), 210-246, 2001
582001
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
542009
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
542003
Balanced allocations of cake
J Edmonds, K Pruhs
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
502006
How to think about algorithms
J Edmonds
Cambridge University Press, 2008
472008
Multicast pull scheduling: When fairness is fine
J Edmonds, K Pruhs
Algorithmica 36 (3), 315-330, 2003
442003
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
441999
A maiden analysis of longest wait first
J Edmonds, K Pruhs
ACM Transactions on Algorithms (TALG) 1 (1), 14-32, 2005
422005
Broadcast scheduling: when fairness is fine.
J Edmonds, K Pruhs
SODA 810, 811-813, 2002
412002
Mining for empty rectangles in large data sets
J Edmonds, J Gryz, D Liang, RJ Miller
International Conference on Database Theory, 174-188, 2001
382001
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
302011
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
J Edmonds, DD Chinn, T Brecht, X Deng
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
291997
The system can't perform the operation now. Try again later.
Articles 1–20