Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. - Jeff Edmonds (SCT, 1991)

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

Time-space trade-offs for undirected st-connectivity on a JAG. - Jeff Edmonds (STOC, 1993)

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

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

Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. - Matthew Clegg; Jeff Edmonds; Russell Impagliazzo (STOC, 1996)

Priority encoding transmission. - Andres Albanese; Johannes Blömer; Jeff Edmonds; Michael Luby; Madhu Sudan 001 (IEEE Trans. Inf. Theory, 1996)

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

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

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

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

Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. - Jeff Edmonds (SIAM J. Comput., 1998)

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

Scheduling in the dark. - Jeff Edmonds (Theor. Comput. Sci., 2000)

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

Communication complexity towards lower bounds on circuit depth. - Jeff Edmonds; Russell Impagliazzo; Steven Rudich; Jirí Sgall (Comput. Complex., 2001)

Broadcast scheduling: when fairness is fine. - Jeff Edmonds; Kirk Pruhs (SODA, 2002)

TCP is competitive against a limited adversary. - Jeff Edmonds; Suprakash Datta; Patrick W. Dymond (SPAA, 2003)

Multicast Pull Scheduling: When Fairness Is Fine. - Jeff Edmonds; Kirk Pruhs (Algorithmica, 2003)

Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. - Jeff Edmonds; Donald D. Chinn; Tim Brecht; Xiaotie Deng (J. Sched., 2003)

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

Towards asymptotic optimality in probabilistic packet marking. - Micah Adler; Jeff Edmonds; Jirí Matousek 001 (STOC, 2005)

A maiden analysis of longest wait first. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2005)

Online Algorithms to Minimize Resource Reallocations and Network Communication. - Sashka Davis; Jeff Edmonds; Russell Impagliazzo (APPROX-RANDOM, 2006)

Balanced Allocations of Cake. - Jeff Edmonds; Kirk Pruhs (FOCS, 2006)

How to Think About Algorithms. - Jeff Edmonds (Cambridge University Press, 2008)

Confidently Cutting a Cake into Approximately Fair Pieces. - Jeff Edmonds; Kirk Pruhs; Jaisingh Solanki (AAIM, 2008)

Embedding into linfinity2 Is Easy, Embedding into l infinity3 Is NP-Complete. - Jeff Edmonds (Discret. Comput. Geom., 2008)

Scheduling with Equipartition. - Jeff Edmonds (Encyclopedia of Algorithms, 2008)

Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold. - Jeff Edmonds (Scheduling, 2010)

Bounding Variance and Expectation of Longest Path Lengths in DAGs. - Jeff Edmonds; Supratik Chakraborty (SODA, 2010)

Inapproximability for Planar Embedding Problems. - Jeff Edmonds; Anastasios Sidiropoulos; Anastasios Zouzias (SODA, 2010)

TCP is Competitive with Resource Augmentation. - Jeff Edmonds; Suprakash Datta; Patrick W. Dymond (Theory Comput. Syst., 2010)

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

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

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

Cake cutting really is not a piece of cake. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2011)

A little advice can be very helpful. - Arkadev Chattopadhyay; Jeff Edmonds; Faith Ellen; Toniann Pitassi (SODA, 2012)

Scalably scheduling processes with arbitrary speedup curves. - Jeff Edmonds; Kirk Pruhs (ACM Trans. Algorithms, 2012)

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

Ad-ATMA: An Efficient MAC protocol for Wireless Sensor and Ad Hoc Networks. - Md. Kowsar Hossain; Suprakash Datta; Jeff Edmonds (ANT/SEIT, 2015)

Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. - Stephen A. Cook; Jeff Edmonds; Venkatesh Medabalimi; Toniann Pitassi (ICALP, 2016)

Upper and Lower Bounds on the Power of Advice. - Arkadev Chattopadhyay; Jeff Edmonds; Faith Ellen; Toniann Pitassi (SIAM J. Comput., 2016)

ResVMAC: A Novel Medium Access Control Protocol for Vehicular Ad hoc Networks. - Md. Kowsar Hossain; Suprakash Datta; Sk. Imran Hossain; Jeff Edmonds (ANT/SEIT, 2017)

Improved analysis of the online set cover problem with advice. - Stefan Dobrev; Jeff Edmonds; Dennis Komm; Rastislav Královic; Richard Královic; Sacha Krug; Tobias Mömke (Theor. Comput. Sci., 2017)

Hardness of Function Composition for Semantic Read once Branching Programs. - Jeff Edmonds; Venkatesh Medabalimi; Toniann Pitassi (CCC, 2018)

Random Polyhedral Scenes: An Image Generator for Active Vision System Experiments. - Markus D. Solbach; Stephen Voland; Jeff Edmonds; John K. Tsotsos (CoRR, 2018)