Efficient algorithms for neighbor discovery in wireless networks | 30 | 0.91 | 2013 |
Approximating Optimal Binary Decision Trees | 16 | 0.86 | 2012 |
Algorithms for optimizing the bandwidth cost of content delivery | 33 | 1.44 | 2011 |
On “Exploiting” Node-Heterogeneous Clusters Optimally | 8 | 0.48 | 2008 |
Search space reductions for nearest-neighbor queries | 2 | 0.37 | 2008 |
Algorithms For Optimizing Bandwidth Costs On The Internet | 3 | 0.63 | 2006 |
On optimal communication cost for gathering correlated data through wireless sensor networks | 29 | 1.83 | 2006 |
Lower bounds for asymmetric communication channels and distributed source coding | 10 | 0.56 | 2006 |
Towards asymptotic optimality in probabilistic packet marking | 4 | 0.63 | 2005 |
Trade-offs in probabilistic packet marking for IP traceback | 52 | 1.72 | 2005 |
Minimum energy reliable paths using unreliable wireless links | 71 | 2.91 | 2005 |
Tight bounds for the performance of Longest In System on DAGs. | 0 | 0.34 | 2005 |
Collecting correlated information from a sensor network | 10 | 0.60 | 2005 |
Efficient probabilistic packet marking | 14 | 0.84 | 2005 |
Pricing multicasting in more flexible network models | 3 | 0.41 | 2005 |
Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors | 1 | 0.35 | 2004 |
Two optimal peer selection problems | 1 | 0.35 | 2004 |
The predecessor attack: An analysis of a threat to anonymous communications systems | 87 | 3.01 | 2004 |
Optimal Website Design with the Constrained Subtree Selection Problem | 4 | 0.54 | 2004 |
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes | 25 | 0.90 | 2003 |
Estimation of congestion price using probabilistic packet marking | 19 | 1.64 | 2003 |
Defending anonymous communications against passive logging attacks | 92 | 6.73 | 2003 |
A proportionate fair scheduling rule with good worst-case performance | 8 | 0.59 | 2003 |
A stochastic process on the hypercube with applications to peer-to-peer networks | 50 | 3.85 | 2003 |
Optimal sharing of bags of tasks in heterogeneous clusters | 30 | 1.65 | 2003 |
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?" | 5 | 0.48 | 2003 |
Scheduling Time-Constrained Communication in Linear Networks | 28 | 1.24 | 2002 |
Tradeoffs in Probabilistic Packet Marking for IP Traceback | 47 | 2.66 | 2002 |
Tight Bounds for the Performance of Longest-in-System on DAGs | 4 | 0.45 | 2002 |
Pricing Multicasting in More Practical Network Models | 8 | 1.27 | 2002 |
An Analysis of the Degradation of Anonymous Protocols. | 112 | 12.62 | 2002 |
Tree Layout for Internal Network Characterizations in Multicast Networks | 19 | 1.66 | 2001 |
New Protocols for Asymmetric Communication Channels | 7 | 1.40 | 2001 |
An n! lower bound on formula size | 21 | 1.27 | 2001 |
Channelization Problem in Large Scale Data Dissemination | 31 | 1.94 | 2001 |
Compression using efficient multicasting | 1 | 0.43 | 2001 |
Towards Compressing Web Graphs | 83 | 11.67 | 2001 |
Protocols for Asymmetric Communication Channels | 20 | 2.43 | 2001 |
Parallel Sorting with Limited Bandwidth | 23 | 1.57 | 2000 |
Tight Size Bounds for Packet Headers in Narrow Meshes | 4 | 0.47 | 2000 |
Efficient Communication Strategies for Ad-Hoc Wireless Networks | 24 | 2.17 | 2000 |
The complexity of end-to-end communication in memoryless networks | 7 | 0.56 | 1999 |
Modeling Parallel Bandwidth: Local versus Global Restrictions | 4 | 0.45 | 1999 |
Scheduling time-constrained communication in linear networks | 36 | 1.94 | 1998 |
Analyzing an Infinite Parallel Job Allocation Process | 15 | 1.41 | 1998 |
Asynchronous Shared Memory Search Structures | 3 | 0.63 | 1998 |
Efficient communication strategies for ad-hoc wireless networks (extended abstract) | 28 | 2.94 | 1998 |
Communication-optimal parallel minimum spanning tree algorithms (extended abstract) | 7 | 0.65 | 1998 |
Parallel randomized load balancing | 52 | 7.22 | 1998 |
Modeling parallel bandwidth: local vs. global restrictions | 10 | 0.49 | 1997 |