Jeff Edmonds - RankMe

61 papers A* 21A 3B 3C 1Journal 25Unranked 6

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