The SCEAS System
| |||||||

## Search the dblp DataBase
Jeff Edmonds:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sashka Davis, Jeff Edmonds, Russell Impagliazzo
**Online Algorithms to Minimize Resource Reallocations and Network Communication.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:104-115 [Conf] - Jeff Edmonds
**Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:322-331 [Conf] - Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
**Priority Encoding Transmission**[Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:604-612 [Conf] - Noga Alon, Jeff Edmonds, Michael Luby
**Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract).**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:512-519 [Conf] - Greg Barnes, Jeff Edmonds
**Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:228-237 [Conf] - Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
**Communication Complexity Towards Lower Bounds on Circuit Depth**[Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:249-257 [Conf] - Jeff Edmonds, Kirk Pruhs
**Balanced Allocations of Cake.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:623-634 [Conf] - Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
**Mining for Empty Rectangles in Large Data Sets.**[Citation Graph (0, 10)][DBLP] ICDT, 2001, pp:174-188 [Conf] - Jeff Edmonds
**On the Competitiveness of AIMD-TCP within a General Network.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:567-576 [Conf] - Jeff Edmonds, Kirk Pruhs
**Broadcast scheduling: when fairness is fine.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:421-430 [Conf] - Jeff Edmonds, Kirk Pruhs
**A maiden analysis of Longest Wait First.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:818-827 [Conf] - Jeff Edmonds, Kirk Pruhs
**Cake cutting really is not a piece of cake.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:271-278 [Conf] - Jeff Edmonds, Suprakash Datta, Patrick W. Dymond
**TCP is competitive against a limited adversary.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:174-183 [Conf] - Micah Adler, Jeff Edmonds, Jirí Matousek
**Towards asymptotic optimality in probabilistic packet marking.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:450-459 [Conf] - Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
**The relative complexity of NP search problems.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:303-314 [Conf] - Matthew Clegg, Jeff Edmonds, Russell Impagliazzo
**Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability.**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:174-183 [Conf] - Jeff Edmonds
**Time-space trade-offs for undirected st-connectivity on a JAG.**[Citation Graph (0, 0)][DBLP] STOC, 1993, pp:718-727 [Conf] - Jeff Edmonds
**Scheduling in the Dark.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:179-188 [Conf] - Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
**Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:120-129 [Conf] - Jeff Edmonds, Chung Keung Poon
**A nearly optimal time-space lower bound for directed**[Citation Graph (0, 0)][DBLP]*st*-connectivity on the NNJAG model. STOC, 1995, pp:147-156 [Conf] - Jeff Edmonds, Kirk Pruhs
**Multicast Pull Scheduling: When Fairness Is Fine.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:3, pp:315-330 [Journal] - Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall
**Communication complexity towards lower bounds on circuit depth.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2001, v:10, n:3, pp:210-246 [Journal] - Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi
**The Relative Complexity of NP Search Problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1998, v:57, n:1, pp:3-19 [Journal] - Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
**Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2003, v:6, n:3, pp:231-250 [Journal] - Greg Barnes, Jeff Edmonds
**Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:4, pp:1190-1202 [Journal] - Jeff Edmonds
**Time-Space Tradeoffs For Undirected**[Citation Graph (0, 0)][DBLP]*st*-Connectivity on a Graph Automata. SIAM J. Comput., 1998, v:27, n:5, pp:1492-1513 [Journal] - Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas
**Tight Lower Bounds for st-Connectivity on the NNJAG Model.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:28, n:6, pp:2257-2284 [Journal] - Jeff Edmonds, Kirk Pruhs
**A maiden analysis of longest wait first.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2005, v:1, n:1, pp:14-32 [Journal] - Jeff Edmonds
**Removing Ramsey Theory: Lower Bounds With Smaller Domain Size.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:172, n:1-2, pp:1-41 [Journal] - Jeff Edmonds
**Scheduling in the dark.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:1, pp:109-141 [Journal] - Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller
**Mining for empty spaces in large data sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:3, n:296, pp:435-452 [Journal] - Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
**Priority encoding transmission.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1737-1744 [Journal] **Confidently Cutting a Cake into Approximately Fair Pieces.**[Citation Graph (, )][DBLP]**Scalably scheduling processes with arbitrary speedup curves.**[Citation Graph (, )][DBLP]**Bounding Variance and Expectation of Longest Path Lengths in DAGs.**[Citation Graph (, )][DBLP]**Inapproximability for Planar Embedding Problems.**[Citation Graph (, )][DBLP]**Speed scaling of processes with arbitrary speedup curves on a multiprocessor.**[Citation Graph (, )][DBLP]**Nonclairvoyant Speed Scaling for Flow and Energy.**[Citation Graph (, )][DBLP]**Nonclairvoyant Speed Scaling for Flow and Energy**[Citation Graph (, )][DBLP]**Embedding into**[Citation Graph (, )][DBLP]*l*_{infinity}^{2}Is Easy, Embedding into*l*_{infinity}^{3}Is NP-Complete.
Search in 0.051secs, Finished in 0.054secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |