J. Edmonds

发表

The Relative Complexity of NP Search Problems

Russell Impagliazzo, Toniann Pitassi, Stephen A. Cook, 1998, J. Comput. Syst. Sci..

Cake cutting really is not a piece of cake

K. Pruhs, J. Edmonds, 2006, SODA 2006.

Time-space lower bounds for directed s-t connectivity on JAG models

J. Edmonds, Greg Barnes, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

A Faster Approximate Minimum Steiner Tree Algorithm & Primal-Dual and Local-Ratio Greedy Algorithms

A. Borodin, H. Kwon, J. Edmonds, 2009 .

Communication complexity towards lower bounds on circuit depth

Russell Impagliazzo, Jirí Sgall, Jeff Edmonds, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Branching Width when Solving Random Jigsaw Puzzles with a Planted Solution by

J. Edmonds, 2012 .

Time-Space Lower Bounds for Directed s-t Connectivityon JAG

J. Edmonds, ModelsGreg Barnes, 2008 .

RQM: A new rate-based active queue management algorithm

Patrick W. Dymond, J. Edmonds, S. Datta, 2004 .

Erasure Codes with a Hierarchical Bundle Structure

Jeff Edmonds, Michael G. Luby, M. Luby, 2017, IEEE Transactions on Information Theory.

Upper and Lower Bounds on the Power of Advice Arkadev Chattopadhyay

T. Pitassi, J. Edmonds, Faith Ellen, 2016 .

A RANDOMIZED ALGORITHM FOR CAKE CUTTING

Patrick W. Dymond, J. Edmonds, S. Datta, 2007 .

Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Improved Results on Models of Greedy and Primal-dual Algorithms Table of Contents

Patrick W. Dymond, J. Edmonds, S. Datta, 2008 .

Cake cutting really is not a piece of cake

K. Pruhs, J. Edmonds, 2006, SODA '06.

How to Think About Algorithms: Preface

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Introduction

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Parsing with Context-Free Grammars

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Dynamic Programming Algorithms

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Randomized Algorithms

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Recursion

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Abstract Data Types

Jeff Edmonds, J. Edmonds, 2008 .

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

Jeff Edmonds, Greg Barnes, J. Edmonds, 1993, FOCS.

How to Think About Algorithms: Conclusion

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Greedy Algorithms

Jeff Edmonds, J. Edmonds, 2008 .

How to Think About Algorithms: Iterative Sorting Algorithms

Jeff Edmonds, J. Edmonds, 2008 .

Scheduling in the Dark 1

J. Edmonds, 1999 .

Using the Groebner basis algorithm to find proofs of unsatisfiability

Russell Impagliazzo, Jeff Edmonds, Matthew Clegg, 1996, STOC '96.

The relative complexity of NP search problems

Russell Impagliazzo, Toniann Pitassi, Stephen A. Cook, 1995, STOC '95.

Bounding variance and expectation of longest path lengths in DAGs

Supratik Chakraborty, Jeff Edmonds, J. Edmonds, 2010, SODA '10.

Definition of Optimization Problems

Jeff Edmonds, J. Edmonds, 2008 .

Mining for empty spaces in large data sets

Renée J. Miller, Jarek Gryz, Dongming Liang, 2003, Theor. Comput. Sci..

Priority encoding transmission

Madhu Sudan, Jeff Edmonds, Johannes Blömer, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Improved analysis of the online set cover problem with advice

Dennis Komm, Jeff Edmonds, Tobias Mömke, 2017, Theor. Comput. Sci..

Towards asymptotic optimality in probabilistic packet marking

Jirí Matousek, Micah Adler, Jeff Edmonds, 2005, STOC '05.

TCP is Competitive with Resource Augmentation

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond, 2010, Theory of Computing Systems.

On the competitiveness of AIMD-TCP within a general network

Jeff Edmonds, J. Edmonds, 2004, Theor. Comput. Sci..

TCP is competitive against a limited adversary

Jeff Edmonds, Suprakash Datta, Patrick W. Dymond, 2003, SPAA '03.

On the Competitiveness of TCP within a General NetworkJe

J. Edmonds, Je Edmonds, 2001 .

Scheduling in the dark

Jeff Edmonds, J. Edmonds, 1999, STOC '99.

Confidently Cutting a Cake into Approximately Fair Pieces

Kirk Pruhs, Jeff Edmonds, Jaisingh Solanki, 2008, AAIM.

Balanced Allocations of Cake

Kirk Pruhs, Jeff Edmonds, K. Pruhs, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Inapproximability for planar embedding problems

Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias, 2010, SODA '10.

Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor

Kirk Pruhs, Jeff Edmonds, Ho-Leung Chan, 2009, SPAA '09.

Scalably scheduling processes with arbitrary speedup curves

Kirk Pruhs, Jeff Edmonds, K. Pruhs, 2009, TALG.

Upper and Lower Bounds on the Power of Advice

Faith Ellen, Toniann Pitassi, Jeff Edmonds, 2016, SIAM J. Comput..

Implementing progress indicators for recursive algorithms

Dave A. Berque, Mark K. Goldberg, Jeffrey A. Edmonds, 1993, SAC '93.

Linear Time Probabilistic Erasure Codes With Nearly Optimal Recovery

M. Luby, J. Edmonds, 2014 .

Linear Time Erasure Codes With Nearly Optimal (Extended Abstract)

Noga Alon, Jeff Edmonds, Michael G. Luby, 1995 .

Linear time erasure codes with nearly optimal recovery

Noga Alon, Jeff Edmonds, Michael Luby, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Using the Groebner basis algorithm to find proofs of unsatisfiability

R. Impagliazzo, J. Edmonds, Matthew Clegg, 1996, STOC '96.

Informal Logic for Computer Science

J. Edmonds, 2022 .

Removing Ramsey Theory: Lower Bounds With Smaller Domain Size

Jeff Edmonds, J. Edmonds, 1997, Theor. Comput. Sci..

Lower bounds with smaller domain size on concurrent write parallel machines

Jeff Edmonds, J. Edmonds, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.