Jeff Edmonds

According to our database, Jeff Edmonds authored at least 47 papers between 1991 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

Random Polyhedral Scenes: An Image Generator for Active Vision System Experiments.

Markus D. Solbach, Stephen Voland, Jeff Edmonds, John K. Tsotsos

CoRR, 2018

Hardness of Function Composition for Semantic Read once Branching Programs.

Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi

Proceedings of the 33rd Computational Complexity Conference, 2018

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

ResVMAC: A Novel Medium Access Control Protocol for Vehicular Ad hoc Networks.

Md. Kowsar Hossain, Suprakash Datta, Sk. Imran Hossain, Jeff Edmonds

Proceedings of the 8th International Conference on Ambient Systems, 2017

2016

Upper and Lower Bounds on the Power of Advice.

Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi

SIAM J. Comput., 2016

Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs.

Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Ad-ATMA: An Efficient MAC protocol for Wireless Sensor and Ad Hoc Networks.

Md. Kowsar Hossain, Suprakash Datta, Jeff Edmonds

Proceedings of the 6th International Conference on Ambient Systems, 2015

2012

On the competitiveness of AIMD-TCP within a general network.

Jeff Edmonds

Theor. Comput. Sci., 2012

Scalably scheduling processes with arbitrary speedup curves.

Jeff Edmonds, Kirk Pruhs

ACM Trans. Algorithms, 2012

A little advice can be very helpful.

Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Cake cutting really is not a piece of cake.

Jeff Edmonds, Kirk Pruhs

ACM Trans. Algorithms, 2011

Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor.

Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs

Theory Comput. Syst., 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

Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work.

Jeff Edmonds, Sungjin Im, Benjamin Moseley

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

TCP is Competitive with Resource Augmentation.

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond

Theory Comput. Syst., 2010

Inapproximability for Planar Embedding Problems.

Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Bounding Variance and Expectation of Longest Path Lengths in DAGs.

Jeff Edmonds, Supratik Chakraborty

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold.

Jeff Edmonds

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2008

Scheduling with Equipartition.

Jeff Edmonds

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Embedding into <i>l</i>_infinity² Is Easy, Embedding into <i>l</i> _infinity³ Is NP-Complete.

Jeff Edmonds

Discret. Comput. Geom., 2008

Confidently Cutting a Cake into Approximately Fair Pieces.

Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki

Proceedings of the Algorithmic Aspects in Information and Management, 2008

How to Think About Algorithms.

Jeff Edmonds

Cambridge University Press, ISBN: 978-0-521-61410-8, 2008

2006

Balanced Allocations of Cake.

Jeff Edmonds, Kirk Pruhs

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Online Algorithms to Minimize Resource Reallocations and Network Communication.

Sashka Davis, Jeff Edmonds, Russell Impagliazzo

Proceedings of the Approximation, 2006

2005

A maiden analysis of longest wait first.

Jeff Edmonds, Kirk Pruhs

ACM Trans. Algorithms, 2005

Towards asymptotic optimality in probabilistic packet marking.

Micah Adler, Jeff Edmonds, Jirí Matousek

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2003

Mining for empty spaces in large data sets.

Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller

Theor. Comput. Sci., 2003

Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics.

Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng

J. Sched., 2003

Multicast Pull Scheduling: When Fairness Is Fine.

Jeff Edmonds, Kirk Pruhs

Algorithmica, 2003

TCP is competitive against a limited adversary.

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

Broadcast scheduling: when fairness is fine.

Jeff Edmonds, Kirk Pruhs

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Communication complexity towards lower bounds on circuit depth.

Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jirí Sgall

Comput. Complex., 2001

Mining for Empty Rectangles in Large Data Sets.

Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller

Proceedings of the Database Theory, 2001

2000

Scheduling in the dark.

Jeff Edmonds

Theor. Comput. Sci., 2000

1999

Tight Lower Bounds for st-Connectivity on the NNJAG Model.

Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas

SIAM J. Comput., 1999

1998

Time-Space Tradeoffs For Undirected <i>st</i>-Connectivity on a Graph Automata.

Jeff Edmonds

SIAM J. Comput., 1998

Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models.

Greg Barnes, Jeff Edmonds

SIAM J. Comput., 1998

The Relative Complexity of NP Search Problems.

Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi

J. Comput. Syst. Sci., 1998

1997

Removing Ramsey Theory: Lower Bounds With Smaller Domain Size.

Jeff Edmonds

Theor. Comput. Sci., 1997

Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract).

Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Priority encoding transmission.

Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan

IEEE Trans. Inf. Theory, 1996

Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability.

Matthew Clegg, Jeff Edmonds, Russell Impagliazzo

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

A nearly optimal time-space lower bound for directed <i>st</i>-connectivity on the NNJAG model.

Jeff Edmonds, Chung Keung Poon

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract).

Noga Alon, Jeff Edmonds, Michael Luby

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1993

Time-space trade-offs for undirected st-connectivity on a JAG.

Jeff Edmonds

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)

Greg Barnes, Jeff Edmonds

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines.

Jeff Edmonds

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991