| 2017 | ANT | ResVMAC: A Novel Medium Access Control Protocol for Vehicular Ad hoc Networks. | Md. Kowsar Hossain, Suprakash Datta, Sk. Imran Hossain, Jeff Edmonds |
| 2016 | ICALP | Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. | Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi |
| 2015 | ANT | Ad-ATMA: An Efficient MAC protocol for Wireless Sensor and Ad Hoc Networks. | Md. Kowsar Hossain, Suprakash Datta, Jeff Edmonds |
| 2012 | SODA | A little advice can be very helpful. | Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi |
| 2011 | SODA | Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. | Jeff Edmonds, Sungjin Im, Benjamin Moseley |
| 2010 | SODA | Bounding Variance and Expectation of Longest Path Lengths in DAGs. | Jeff Edmonds, Supratik Chakraborty |
| 2010 | SODA | Inapproximability for Planar Embedding Problems. | Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias |
| 2009 | SODA | Scalably scheduling processes with arbitrary speedup curves. | Jeff Edmonds, Kirk Pruhs |
| 2009 | STACS | Nonclairvoyant Speed Scaling for Flow and Energy. | Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs |
| 2009 | SPAA | Speed scaling of processes with arbitrary speedup curves on a multiprocessor. | Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs |
| 2008 | AAIM | Confidently Cutting a Cake into Approximately Fair Pieces. | Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki |
| 2006 | FOCS | Balanced Allocations of Cake. | Jeff Edmonds, Kirk Pruhs |
| 2006 | SODA | Cake cutting really is not a piece of cake. | Jeff Edmonds, Kirk Pruhs |
| 2005 | STOC | Towards asymptotic optimality in probabilistic packet marking. | Micah Adler, Jeff Edmonds, Jir Matousek |
| 2004 | LATIN | On the Competitiveness of AIMD-TCP within a General Network. | Jeff Edmonds |
| 2004 | SODA | A maiden analysis of Longest Wait First. | Jeff Edmonds, Kirk Pruhs |
| 2003 | SPAA | TCP is competitive against a limited adversary. | Jeff Edmonds, Suprakash Datta, Patrick W. Dymond |
| 2002 | SODA | Broadcast scheduling: when fairness is fine. | Jeff Edmonds, Kirk Pruhs |
| 2001 | ICDT | Mining for Empty Rectangles in Large Data Sets. | Jeff Edmonds, Jarek Gryz, Dongming Liang, Rene J. Miller |
| 1999 | STOC | Scheduling in the Dark. | Jeff Edmonds |
| 1997 | STOC | Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract). | Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng |
| 1996 | STOC | Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. | Matthew Clegg, Jeff Edmonds, Russell Impagliazzo |
| 1995 | FOCS | Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). | Noga Alon, Jeff Edmonds, Michael Luby |
| 1995 | STOC | The relative complexity of NP search problems. | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
| 1995 | STOC | A nearly optimal time-space lower bound for directed | Jeff Edmonds, Chung Keung Poon |
| 1994 | FOCS | Priority Encoding Transmission | Andres Albanese, Johannes Blmer, Jeff Edmonds, Michael Luby, Madhu Sudan |
| 1993 | FOCS | Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) | Greg Barnes, Jeff Edmonds |
| 1993 | STOC | Time-space trade-offs for undirected st-connectivity on a JAG. | Jeff Edmonds |
| 1991 | FOCS | Communication Complexity Towards Lower Bounds on Circuit Depth | Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jir Sgall |