Edmonds, Jeff - Department of Computer Science, York University (Toronto)

Advanced Search

Edmonds, Jeff - Department of Computer Science, York University (Toronto)

Multicast Pull Scheduling: When Fairness is Fine Je Edmonds Kirk Pruhs y
A Maiden Analysis of Longest Wait First Jeff Edmonds
A Faster Approximate Minimum Steiner Tree Algorithm & Primal-Dual and Local-Ratio Greedy Algorithms
REMOVING RAMSEY THEORY: LOWER BOUNDS WITH SMALLER DOMAIN SIZE
A Nearly Optimal Time-Space Lower Bound
Priority Encoding Transmission Andres Albanese Johannes Blomery Je Edmondsz
The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms
Communication Complexity Towards Lower Bounds on Circuit Depth
On the Competitiveness of AIMD-TCP within a General Network Jeff Edmonds
The Relative Complexity of NP Search Problems Paul Beame3
Some Quick Ideas April 15, 2009
Probabilistic Erasure-Resilient Codes Je Edmonds Michael Lubyy
Linear Time Erasure Codes With Nearly Optimal Recovery (Extended Abstract)
Online Algorithms to Minimize Resource Reallocations and Network Communication
Mining for Empty Rectangles in Large Data Sets Je Edmonds1
I couldn't find an easy way to copy their bibliography from their .pdf file. James, perhaps you can figure it out or type them out. Perhaps we should add the following.
Inapproximability for planar embedding problems Jeff Edmonds
There has been considerable recent interest in probabilistic packet marking schemes for sending information from nodes (routers) along one or more paths traveled by a stream of packets
Embedding into l2 Embedding into l3
Using the Groebner basis algorithm to nd proofs of unsatis ability Matthew Clegg
TCP is Competitive Against a Limited AdversaryThis research was supported in part by grants from NSERC and CITO.
RAEM: An Asynchronous & Randomized Bandwidth Adjustment Jeff Edmonds, Suprakash Datta, and Patrick Dymond
Balanced Allocations of Cake Jeff Edmonds
Cake Cutting Really is Not a Piece of Cake Jeff Edmonds
Tight Lower Bounds for st-Connectivity on the NNJAG Model (jeff@cs.yorku.ca)
Time-Space Lower Bounds for Directed s-t Connectivity on JAG Models
Time-Space Trade-O s For Undirected ST -Connectivity
Time-Space Lower Bounds for Undirected and
Priority and More By "the people"
Bounding Variance and Expectation of Longest Path Lengths in DAGs Jeff Edmonds
Confidently Cutting a Cake into Approximately Fair Jeff Edmonds1
A Little Advice Can Be Very Helpful Arkadev Chattopadhyay
A Faster Approximate Minimum Steiner Tree Algorithm & Primal-Dual and Local-Ratio Greedy Algorithms
A Faster Approximate Minimum Steiner Tree Algorithm & Primal-Dual and Local-Ratio Greedy Algorithms