Jeff Edmonds

Publication Activity (10 Years)

Years Active: 1991-2018
Publications (10 Years): 6

Top Topics

Medium Access Control

Upper And Lower Bounds

Wireless Sensor

Top Venues

Theor. Comput. Sci.

Publications

Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi
Hardness of Function Composition for Semantic Read once Branching Programs. Computational Complexity Conference (2018)
Markus D. Solbach, Stephen Voland, Jeff Edmonds, John K. Tsotsos
Random Polyhedral Scenes: An Image Generator for Active Vision System Experiments. CoRR (2018)
Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689 (2017)
Md. Kowsar Hossain, Suprakash Datta, Sk. Imran Hossain, Jeff Edmonds
ResVMAC: A Novel Medium Access Control Protocol for Vehicular Ad hoc Networks. ANT/SEIT (2017)
Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi
Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. ICALP (2016)
Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. 45 (4) (2016)
Md. Kowsar Hossain, Suprakash Datta, Jeff Edmonds
Ad-ATMA: An Efficient MAC protocol for Wireless Sensor and Ad Hoc Networks. ANT/SEIT (2015)
Jeff Edmonds, Kirk Pruhs
Scalably scheduling processes with arbitrary speedup curves. ACM Trans. Algorithms 8 (3) (2012)
Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi
A little advice can be very helpful. SODA (2012)
Jeff Edmonds
On the competitiveness of AIMD-TCP within a general network. Theor. Comput. Sci. 462 (2012)
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) (2011)
Jeff Edmonds, Sungjin Im, Benjamin Moseley
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA (2011)
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49 (4) (2011)
Jeff Edmonds, Kirk Pruhs
Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7 (4) (2011)
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias
Inapproximability for Planar Embedding Problems. SODA (2010)
Jeff Edmonds, Supratik Chakraborty
Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA (2010)
Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
TCP is Competitive with Resource Augmentation. Theory Comput. Syst. 47 (1) (2010)
Jeff Edmonds
Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold. Scheduling (2010)
Jeff Edmonds, Kirk Pruhs
Scalably Scheduling Processes with Arbitrary Speedup Curves. Scheduling (2010)
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)
Jeff Edmonds, Kirk Pruhs
Scalably scheduling processes with arbitrary speedup curves. SODA (2009)
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA (2009)
Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs
Nonclairvoyant Speed Scaling for Flow and Energy CoRR (2009)
Jeff Edmonds
Is NP-Complete. Discret. Comput. Geom. 39 (4) (2008)
Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki
Confidently Cutting a Cake into Approximately Fair Pieces. AAIM (2008)
Jeff Edmonds, Kirk Pruhs
Cake cutting really is not a piece of cake. SODA (2006)
Jeff Edmonds, Kirk Pruhs
Balanced Allocations of Cake. FOCS (2006)
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
Online Algorithms to Minimize Resource Reallocations and Network Communication. APPROX-RANDOM (2006)
Jeff Edmonds, Kirk Pruhs
A maiden analysis of longest wait first. ACM Trans. Algorithms 1 (1) (2005)
Micah Adler, Jeff Edmonds, Jirí Matousek
Towards asymptotic optimality in probabilistic packet marking. STOC (2005)
Jeff Edmonds, Kirk Pruhs
A maiden analysis of Longest Wait First. SODA (2004)
Jeff Edmonds
On the Competitiveness of AIMD-TCP within a General Network. LATIN (2004)
Jeff Edmonds, Kirk Pruhs
Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36 (3) (2003)
Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
Mining for empty spaces in large data sets. Theor. Comput. Sci. 296 (3) (2003)
Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. J. Sched. 6 (3) (2003)
Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
TCP is competitive against a limited adversary. SPAA (2003)
Jeff Edmonds, Kirk Pruhs
Broadcast scheduling: when fairness is fine. SODA (2002)
Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jirí Sgall
Communication complexity towards lower bounds on circuit depth. Comput. Complex. 10 (3) (2001)
Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
Mining for Empty Rectangles in Large Data Sets. ICDT (2001)
Jeff Edmonds
Scheduling in the dark. Theor. Comput. Sci. 235 (1) (2000)
Jeff Edmonds
Scheduling in the Dark. STOC (1999)
Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas
Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28 (6) (1999)
Greg Barnes, Jeff Edmonds
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM J. Comput. 27 (4) (1998)
Jeff Edmonds
-Connectivity on a Graph Automata. SIAM J. Comput. 27 (5) (1998)
Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57 (1) (1998)
Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract). STOC (1997)
Jeff Edmonds
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. Theor. Comput. Sci. 172 (1-2) (1997)
Matthew Clegg, Jeff Edmonds, Russell Impagliazzo
Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC (1996)
Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
Priority encoding transmission. IEEE Trans. Inf. Theory 42 (6) (1996)
Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
The relative complexity of NP search problems. STOC (1995)
Jeff Edmonds, Chung Keung Poon
-connectivity on the NNJAG model. STOC (1995)
Noga Alon, Jeff Edmonds, Michael Luby
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS (1995)
Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
Priority Encoding Transmission FOCS (1994)
Jeff Edmonds
Time-space trade-offs for undirected st-connectivity on a JAG. STOC (1993)
Greg Barnes, Jeff Edmonds
Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) FOCS (1993)
Jeff Edmonds
Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. Computational Complexity Conference (1991)
Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall
Communication Complexity Towards Lower Bounds on Circuit Depth FOCS (1991)