Jeff Edmonds

	2012
48		Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi: A little advice can be very helpful. SODA 2012: 615-625
	2011
47		Jeff Edmonds, Sungjin Im, Benjamin Moseley: Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119
46		Jeff Edmonds, Kirk Pruhs: Cake cutting really is not a piece of cake. ACM Transactions on Algorithms 7(4): 51 (2011)
45		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): 507-517 (2011)
44		Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor. Theory Comput. Syst. 49(4): 817-833 (2011)
	2010
43		Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias: Inapproximability for Planar Embedding Problems. SODA 2010: 222-235
42		Jeff Edmonds, Supratik Chakraborty: Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA 2010: 766-781
41		Jeff Edmonds, Suprakash Datta, Patrick W. Dymond: TCP is Competitive with Resource Augmentation. Theory Comput. Syst. 47(1): 137-161 (2010)
	2009
40		Jeff Edmonds, Kirk Pruhs: Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692
39		Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10
38		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: 255-264
37		Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs: Nonclairvoyant Speed Scaling for Flow and Energy CoRR abs/0902.1260: (2009)
	2008
36		Jeff Edmonds: How to Think About Algorithms. Cambridge University Press 2008: I-XIII, 1-448
35		Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki: Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164
34		Jeff Edmonds: Scheduling with Equipartition. Encyclopedia of Algorithms 2008
33		Jeff Edmonds: Embedding into linfinity2 Is Easy, Embedding into l infinity3 Is NP-Complete. Discrete & Computational Geometry 39(4): 747-765 (2008)
	2006
32		Sashka Davis, Jeff Edmonds, Russell Impagliazzo: Online Algorithms to Minimize Resource Reallocations and Network Communication. APPROX-RANDOM 2006: 104-115
31		Jeff Edmonds, Kirk Pruhs: Balanced Allocations of Cake. FOCS 2006: 623-634
30		Jeff Edmonds, Kirk Pruhs: Cake cutting really is not a piece of cake. SODA 2006: 271-278
	2005
29		Micah Adler, Jeff Edmonds, Jirí Matousek: Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459
28		Jeff Edmonds, Kirk Pruhs: A maiden analysis of longest wait first. ACM Transactions on Algorithms 1(1): 14-32 (2005)
	2004
27		Jeff Edmonds: On the Competitiveness of AIMD-TCP within a General Network. LATIN 2004: 567-576
26		Jeff Edmonds, Kirk Pruhs: A maiden analysis of Longest Wait First. SODA 2004: 818-827
	2003
25		Jeff Edmonds, Suprakash Datta, Patrick W. Dymond: TCP is competitive against a limited adversary. SPAA 2003: 174-183
24		Jeff Edmonds, Kirk Pruhs: Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003)
23		Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng: Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. J. Scheduling 6(3): 231-250 (2003)
22		Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller: Mining for empty spaces in large data sets. Theor. Comput. Sci. 296(3): 435-452 (2003)
	2002
21		Jeff Edmonds, Kirk Pruhs: Broadcast scheduling: when fairness is fine. SODA 2002: 421-430
	2001
20		Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller: Mining for Empty Rectangles in Large Data Sets. ICDT 2001: 174-188
19		Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall: Communication complexity towards lower bounds on circuit depth. Computational Complexity 10(3): 210-246 (2001)
	2000
18		Jeff Edmonds: Scheduling in the dark. Theor. Comput. Sci. 235(1): 109-141 (2000)
	1999
17		Jeff Edmonds: Scheduling in the Dark. STOC 1999: 179-188
16		Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas: Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28(6): 2257-2284 (1999)
	1998
15		Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57(1): 3-19 (1998)
14		Greg Barnes, Jeff Edmonds: Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM J. Comput. 27(4): 1190-1202 (1998)
13		Jeff Edmonds: Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. SIAM J. Comput. 27(5): 1492-1513 (1998)
	1997
12		Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng: Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract). STOC 1997: 120-129
11		Jeff Edmonds: Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. Theor. Comput. Sci. 172(1-2): 1-41 (1997)
	1996
10		Matthew Clegg, Jeff Edmonds, Russell Impagliazzo: Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC 1996: 174-183
9		Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority encoding transmission. IEEE Transactions on Information Theory 42(6): 1737-1744 (1996)
	1995
8		Noga Alon, Jeff Edmonds, Michael Luby: Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995: 512-519
7		Jeff Edmonds, Chung Keung Poon: A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model. STOC 1995: 147-156
6		Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi: The relative complexity of NP search problems. STOC 1995: 303-314
	1994
5		Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority Encoding Transmission FOCS 1994: 604-612
	1993
4		Greg Barnes, Jeff Edmonds: Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) FOCS 1993: 228-237
3		Jeff Edmonds: Time-space trade-offs for undirected st-connectivity on a JAG. STOC 1993: 718-727
	1991
2		Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall: Communication Complexity Towards Lower Bounds on Circuit Depth FOCS 1991: 249-257
1		Jeff Edmonds: Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. Structure in Complexity Theory Conference 1991: 322-331

Coauthor Index

1	Dimitris Achlioptas	[16]
2	Micah Adler	[29]
3	Andres Albanese	[5] [9]
4	Noga Alon	[8]
5	Greg Barnes	[4] [14]
6	Paul Beame	[6] [15]
7	Johannes Blömer	[5] [9]
8	Tim Brecht	[12] [23]
9	Supratik Chakraborty	[42]
10	Ho-Leung Chan	[37] [38] [39] [44] [45]
11	Arkadev Chattopadhyay	[48]
12	Donald D. Chinn	[12] [23]
13	Matthew Clegg	[10]
14	Stephen A. Cook	[6] [15]
15	Suprakash Datta	[25] [41]
16	Sashka Davis	[32]
17	Xiaotie Deng	[12] [23]
18	Patrick W. Dymond	[25] [41]
19	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[48]
20	Jarek Gryz	[20] [22]
21	Sungjin Im	[47]
22	Russell Impagliazzo	[2] [6] [10] [15] [19] [32]
23	Tak Wah Lam	[37] [38] [45]
24	Lap-Kei Lee	[37] [38] [45]
25	Dongming Liang	[20] [22]
26	Michael Luby	[5] [8] [9]
27	Alberto Marchetti-Spaccamela	[37] [38] [45]
28	Jirí Matousek	[29]
29	Renée J. Miller	[20] [22]
30	Benjamin Moseley	[47]
31	Toniann Pitassi	[6] [15] [48]
32	Chung Keung Poon	[7] [16]
33	Kirk Pruhs	[21] [24] [26] [28] [30] [31] [35] [37] [38] [39] [40] [44] [45] [46]
34	Steven Rudich	[2] [19]
35	Jiri Sgall	[2] [19]
36	Anastasios Sidiropoulos	[43]
37	Jaisingh Solanki	[35]
38	Madhu Sudan	[5] [9]
39	Anastasios Zouzias	[43]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page