Jeff Edmonds

Jeff Edmonds, Kirk Pruhs: Scalably scheduling processes with arbitrary speedup curves. ACM Transactions on Algorithms 8(3): 28 (2012)

Jeff Edmonds: On the competitiveness of AIMD-TCP within a general network. Theor. Comput. Sci. 462: 12-22 (2012)

Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi: A little advice can be very helpful. SODA 2012: 615-625

Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011)

Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011)

Jeff Edmonds, Kirk Pruhs: Cake cutting really is not a piece of cake. ACM Transactions on Algorithms 7(4): 51 (2011)

Jeff Edmonds, Sungjin Im, Benjamin Moseley: Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond: TCP is Competitive with Resource Augmentation. Theory Comput. Syst. 47(1): 137-161 (2010)

Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias: Inapproximability for Planar Embedding Problems. SODA 2010: 222-235

Jeff Edmonds, Supratik Chakraborty: Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA 2010: 766-781

Jeff Edmonds, Kirk Pruhs: Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692

Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10

Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. STACS 2009: 255-264

Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy. CoRR abs/0902.1260 (2009)

Jeff Edmonds: How to Think About Algorithms. Cambridge University Press 2008, isbn 978-0-521-61410-8, pp. I-XIII, 1-448

Jeff Edmonds: Embedding into l_infinity² Is Easy, Embedding into l _infinity³ Is NP-Complete. Discrete & Computational Geometry 39(4): 747-765 (2008)

Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki: Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164

Jeff Edmonds: Scheduling with Equipartition. Encyclopedia of Algorithms 2008

Sashka Davis, Jeff Edmonds, Russell Impagliazzo: Online Algorithms to Minimize Resource Reallocations and Network Communication. APPROX-RANDOM 2006: 104-115

Jeff Edmonds, Kirk Pruhs: Balanced Allocations of Cake. FOCS 2006: 623-634

Jeff Edmonds, Kirk Pruhs: Cake cutting really is not a piece of cake. SODA 2006: 271-278

Jeff Edmonds, Kirk Pruhs: A maiden analysis of longest wait first. ACM Transactions on Algorithms 1(1): 14-32 (2005)

Micah Adler, Jeff Edmonds, Jirí Matousek: Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459

Jeff Edmonds: On the Competitiveness of AIMD-TCP within a General Network. LATIN 2004: 567-576

Jeff Edmonds, Kirk Pruhs: A maiden analysis of Longest Wait First. SODA 2004: 818-827

Jeff Edmonds, Kirk Pruhs: Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003)

Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng: Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. J. Scheduling 6(3): 231-250 (2003)

Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller: Mining for empty spaces in large data sets. Theor. Comput. Sci. 296(3): 435-452 (2003)

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond: TCP is competitive against a limited adversary. SPAA 2003: 174-183

Jeff Edmonds, Kirk Pruhs: Broadcast scheduling: when fairness is fine. SODA 2002: 421-430

Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3): 210-246 (2001)

Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller: Mining for Empty Rectangles in Large Data Sets. ICDT 2001: 174-188

Jeff Edmonds: Scheduling in the dark. Theor. Comput. Sci. 235(1): 109-141 (2000)

Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas: Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28(6): 2257-2284 (1999)

Jeff Edmonds: Scheduling in the Dark. STOC 1999: 179-188

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57(1): 3-19 (1998)

Greg Barnes, Jeff Edmonds: Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM J. Comput. 27(4): 1190-1202 (1998)

Jeff Edmonds: Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. SIAM J. Comput. 27(5): 1492-1513 (1998)

Jeff Edmonds: Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. Theor. Comput. Sci. 172(1-2): 1-41 (1997)

Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng: Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract). STOC 1997: 120-129

Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority encoding transmission. IEEE Transactions on Information Theory 42(6): 1737-1744 (1996)

Matthew Clegg, Jeff Edmonds, Russell Impagliazzo: Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC 1996: 174-183

Noga Alon, Jeff Edmonds, Michael Luby: Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995: 512-519

Jeff Edmonds, Chung Keung Poon: A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model. STOC 1995: 147-156

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The relative complexity of NP search problems. STOC 1995: 303-314

Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority Encoding Transmission. FOCS 1994: 604-612

Greg Barnes, Jeff Edmonds: Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract). FOCS 1993: 228-237

Jeff Edmonds: Time-space trade-offs for undirected st-connectivity on a JAG. STOC 1993: 718-727

Jeff Edmonds: Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. Structure in Complexity Theory Conference 1991: 322-331

Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall: Communication Complexity Towards Lower Bounds on Circuit Depth. FOCS 1991: 249-257