default search action
Jeff Edmonds
Person information
- affiliation: York University, Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c32]Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Hardness of Function Composition for Semantic Read once Branching Programs. CCC 2018: 15:1-15:22 - [i4]Markus D. Solbach, Stephen Voland, Jeff Edmonds, John K. Tsotsos:
Random Polyhedral Scenes: An Image Generator for Active Vision System Experiments. CoRR abs/1803.10100 (2018) - 2017
- [j21]Stefan Dobrev, Jeff Edmonds, Dennis Komm
, Rastislav Královic
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - [c31]Md. Kowsar Hossain, Suprakash Datta, Sk. Imran Hossain
ResVMAC: A Novel Medium Access Control Protocol for Vehicular Ad hoc Networks. ANT/SEIT 2017: 432-439 - 2016
- [j20]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
Upper and Lower Bounds on the Power of Advice. SIAM J. Comput. 45(4): 1412-1432 (2016) - [c30]Stephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi:
Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. ICALP 2016: 36:1-36:13 - 2015
- [c29]Md. Kowsar Hossain, Suprakash Datta, Jeff Edmonds:
Ad-ATMA: An Efficient MAC protocol for Wireless Sensor and Ad Hoc Networks. ANT/SEIT 2015: 484-491 - 2012
- [j19]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. ACM Trans. Algorithms 8(3): 28:1-28:10 (2012) - [j18]Jeff Edmonds:
On the competitiveness of AIMD-TCP within a general network. Theor. Comput. Sci. 462: 12-22 (2012) - [c28]Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
A little advice can be very helpful. SODA 2012: 615-625 - 2011
- [j17]Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam
Nonclairvoyant Speed Scaling for Flow and Energy. Algorithmica 61(3): 507-517 (2011) - [j16]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) - [j15]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7(4): 51:1-51:12 (2011) - [c27]Jeff Edmonds, Sungjin Im, Benjamin Moseley:
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119 - 2010
- [j14]Jeff Edmonds, Suprakash Datta, Patrick W. Dymond:
TCP is Competitive with Resource Augmentation. Theory Comput. Syst. 47(1): 137-161 (2010) - [c26]Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias:
Inapproximability for Planar Embedding Problems. SODA 2010: 222-235 - [c25]Jeff Edmonds, Supratik Chakraborty
Bounding Variance and Expectation of Longest Path Lengths in DAGs. SODA 2010: 766-781 - [i3]Jeff Edmonds:
Every Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold. Scheduling 2010 - [i2]Jeff Edmonds, Kirk Pruhs:
Scalably Scheduling Processes with Arbitrary Speedup Curves. Scheduling 2010
2000 – 2009
- 2009
- [c24]Jeff Edmonds, Kirk Pruhs:
Scalably scheduling processes with arbitrary speedup curves. SODA 2009: 685-692 - [c23]Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs:
Speed scaling of processes with arbitrary speedup curves on a multiprocessor. SPAA 2009: 1-10 - [c22]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 - [i1]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
- [b1]Jeff Edmonds:
How to Think About Algorithms. Cambridge University Press 2008, ISBN 978-0-521-61410-8, pp. I-XIII, 1-448 - [j13]Jeff Edmonds:
Embedding into linfinity2 Is Easy, Embedding into l infinity3 Is NP-Complete. Discret. Comput. Geom. 39(4): 747-765 (2008) - [c21]Jeff Edmonds, Kirk Pruhs, Jaisingh Solanki:
Confidently Cutting a Cake into Approximately Fair Pieces. AAIM 2008: 155-164 - [r1]Jeff Edmonds:
Scheduling with Equipartition. Encyclopedia of Algorithms 2008 - 2006
- [c20]Sashka Davis, Jeff Edmonds, Russell Impagliazzo
Online Algorithms to Minimize Resource Reallocations and Network Communication. APPROX-RANDOM 2006: 104-115 - [c19]Jeff Edmonds, Kirk Pruhs:
Balanced Allocations of Cake. FOCS 2006: 623-634 - [c18]Jeff Edmonds, Kirk Pruhs:
Cake cutting really is not a piece of cake. SODA 2006: 271-278 - 2005
- [j12]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of longest wait first. ACM Trans. Algorithms 1(1): 14-32 (2005) - [c17]Micah Adler, Jeff Edmonds, Jirí Matousek:
Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459 - 2004
- [c16]Jeff Edmonds:
On the Competitiveness of AIMD-TCP within a General Network. LATIN 2004: 567-576 - [c15]Jeff Edmonds, Kirk Pruhs:
A maiden analysis of Longest Wait First. SODA 2004: 818-827 - 2003
- [j11]Jeff Edmonds, Kirk Pruhs:
Multicast Pull Scheduling: When Fairness Is Fine. Algorithmica 36(3): 315-330 (2003) - [j10]Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. J. Sched. 6(3): 231-250 (2003) - [j9]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) - [c14]Jeff Edmonds, Suprakash Datta, Patrick W. Dymond:
TCP is competitive against a limited adversary. SPAA 2003: 174-183 - 2002
- [c13]Jeff Edmonds, Kirk Pruhs:
Broadcast scheduling: when fairness is fine. SODA 2002: 421-430 - 2001
- [j8]Jeff Edmonds, Russell Impagliazzo
Communication complexity towards lower bounds on circuit depth. Comput. Complex. 10(3): 210-246 (2001) - [c12]Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller:
Mining for Empty Rectangles in Large Data Sets. ICDT 2001: 174-188 - 2000
- [j7]Jeff Edmonds:
Scheduling in the dark. Theor. Comput. Sci. 235(1): 109-141 (2000)
1990 – 1999
- 1999
- [j6]Jeff Edmonds, Chung Keung Poon
Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28(6): 2257-2284 (1999) - [c11]Jeff Edmonds:
Scheduling in the Dark. STOC 1999: 179-188 - 1998
- [j5]Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo
The Relative Complexity of NP Search Problems. J. Comput. Syst. Sci. 57(1): 3-19 (1998) - [j4]Greg Barnes, Jeff Edmonds:
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM J. Comput. 27(4): 1190-1202 (1998) - [j3]Jeff Edmonds:
Time-Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. SIAM J. Comput. 27(5): 1492-1513 (1998) - 1997
- [j2]Jeff Edmonds:
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. Theor. Comput. Sci. 172(1-2): 1-41 (1997) - [c10]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 - 1996
- [j1]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority encoding transmission. IEEE Trans. Inf. Theory 42(6): 1737-1744 (1996) - [c9]Matthew Clegg, Jeff Edmonds, Russell Impagliazzo
Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. STOC 1996: 174-183 - 1995
- [c8]Noga Alon, Jeff Edmonds, Michael Luby:
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). FOCS 1995: 512-519 - [c7]Jeff Edmonds, Chung Keung Poon:
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model. STOC 1995: 147-156 - [c6]Paul Beame
The relative complexity of NP search problems. STOC 1995: 303-314 - 1994
- [c5]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority Encoding Transmission. FOCS 1994: 604-612 - 1993
- [c4]Greg Barnes, Jeff Edmonds:
Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract). FOCS 1993: 228-237 - [c3]Jeff Edmonds:
Time-space trade-offs for undirected st-connectivity on a JAG. STOC 1993: 718-727 - 1991
- [c2]Jeff Edmonds:
Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines. SCT 1991: 322-331 - [c1]Jeff Edmonds, Steven Rudich, Russell Impagliazzo
Communication Complexity Towards Lower Bounds on Circuit Depth. FOCS 1991: 249-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: