Name
Affiliation
Papers
MICAH ADLER
University of Toronto and Department of Computer Science, University of Massachusetts, Amherst, MA
55
Collaborators
Citations 
PageRank 
78
1244
100.20
Referers 
Referees 
References 
2177
1044
899
Search Limit
1001000
Title
Citations
PageRank
Year
Efficient algorithms for neighbor discovery in wireless networks300.912013
Approximating Optimal Binary Decision Trees160.862012
Algorithms for optimizing the bandwidth cost of content delivery331.442011
On “Exploiting” Node-Heterogeneous Clusters Optimally80.482008
Search space reductions for nearest-neighbor queries20.372008
Algorithms For Optimizing Bandwidth Costs On The Internet30.632006
On optimal communication cost for gathering correlated data through wireless sensor networks291.832006
Lower bounds for asymmetric communication channels and distributed source coding100.562006
Towards asymptotic optimality in probabilistic packet marking40.632005
Trade-offs in probabilistic packet marking for IP traceback521.722005
Minimum energy reliable paths using unreliable wireless links712.912005
Tight bounds for the performance of Longest In System on DAGs.00.342005
Collecting correlated information from a sensor network100.602005
Efficient probabilistic packet marking140.842005
Pricing multicasting in more flexible network models30.412005
Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors10.352004
Two optimal peer selection problems10.352004
The predecessor attack: An analysis of a threat to anonymous communications systems873.012004
Optimal Website Design with the Constrained Subtree Selection Problem40.542004
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes250.902003
Estimation of congestion price using probabilistic packet marking191.642003
Defending anonymous communications against passive logging attacks926.732003
A proportionate fair scheduling rule with good worst-case performance80.592003
A stochastic process on the hypercube with applications to peer-to-peer networks503.852003
Optimal sharing of bags of tasks in heterogeneous clusters301.652003
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?"50.482003
Scheduling Time-Constrained Communication in Linear Networks281.242002
Tradeoffs in Probabilistic Packet Marking for IP Traceback472.662002
Tight Bounds for the Performance of Longest-in-System on DAGs40.452002
Pricing Multicasting in More Practical Network Models81.272002
An Analysis of the Degradation of Anonymous Protocols.11212.622002
Tree Layout for Internal Network Characterizations in Multicast Networks191.662001
New Protocols for Asymmetric Communication Channels71.402001
An n! lower bound on formula size211.272001
Channelization Problem in Large Scale Data Dissemination311.942001
Compression using efficient multicasting10.432001
Towards Compressing Web Graphs8311.672001
Protocols for Asymmetric Communication Channels202.432001
Parallel Sorting with Limited Bandwidth231.572000
Tight Size Bounds for Packet Headers in Narrow Meshes40.472000
Efficient Communication Strategies for Ad-Hoc Wireless Networks242.172000
The complexity of end-to-end communication in memoryless networks70.561999
Modeling Parallel Bandwidth: Local versus Global Restrictions40.451999
Scheduling time-constrained communication in linear networks361.941998
Analyzing an Infinite Parallel Job Allocation Process151.411998
Asynchronous Shared Memory Search Structures30.631998
Efficient communication strategies for ad-hoc wireless networks (extended abstract)282.941998
Communication-optimal parallel minimum spanning tree algorithms (extended abstract)70.651998
Parallel randomized load balancing527.221998
Modeling parallel bandwidth: local vs. global restrictions100.491997
  • 1
  • 2