| 2008 |
|---|
| 69 | EE | Micah Adler,
Brent Heeringa:
Approximating Optimal Binary Decision Trees.
APPROX-RANDOM 2008: 1-9 |
| 68 | EE | Micah Adler,
Brent Heeringa:
Search Space Reductions for Nearest-Neighbor Queries.
TAMC 2008: 554-567 |
| 67 | EE | Matthew K. Wright,
Micah Adler,
Brian Neil Levine,
Clay Shields:
Passive-Logging Attacks Against Anonymous Communications Systems.
ACM Trans. Inf. Syst. Secur. 11(2): (2008) |
| 66 | EE | Micah Adler,
Ying Gong,
Arnold L. Rosenberg:
On "Exploiting" Node-Heterogeneous Clusters Optimally.
Theory Comput. Syst. 42(4): 465-487 (2008) |
| 2006 |
|---|
| 65 | EE | Junning Liu,
Micah Adler,
Donald F. Towsley,
Chun Zhang:
On optimal communication cost for gathering correlated data through wireless sensor networks.
MOBICOM 2006: 310-321 |
| 64 | EE | Micah Adler,
Nicholas J. A. Harvey,
Kamal Jain,
Robert D. Kleinberg,
April Rasala Lehman:
On the capacity of information networks.
SODA 2006: 241-250 |
| 63 | EE | Micah Adler,
Erik D. Demaine,
Nicholas J. A. Harvey,
Mihai Patrascu:
Lower bounds for asymmetric communication channels and distributed source coding.
SODA 2006: 251-260 |
| 2005 |
|---|
| 62 | EE | Qunfeng Dong,
Suman Banerjee,
Micah Adler,
Kazu Hirata:
Efficient Probabilistic Packet Marking.
ICNP 2005: 368-377 |
| 61 | EE | Micah Adler,
Rakesh Kumar,
Keith W. Ross,
Dan Rubenstein,
Torsten Suel,
David D. Yao:
Optimal peer selection for P2P downloading and streaming.
INFOCOM 2005: 1538-1549 |
| 60 | EE | Qunfeng Dong,
Suman Banerjee,
Micah Adler,
Archan Misra:
Minimum energy reliable paths using unreliable wireless links.
MobiHoc 2005: 449-459 |
| 59 | EE | Micah Adler:
Collecting correlated information from a sensor network.
SODA 2005: 479-488 |
| 58 | EE | Micah Adler,
Jeff Edmonds,
Jirí Matousek:
Towards asymptotic optimality in probabilistic packet marking.
STOC 2005: 450-459 |
| 57 | EE | Micah Adler,
Dan Rubenstein:
Pricing multicasting in more flexible network models.
ACM Transactions on Algorithms 1(1): 48-73 (2005) |
| 56 | EE | Micah Adler:
Trade-offs in probabilistic packet marking for IP traceback.
J. ACM 52(2): 217-244 (2005) |
| 55 | EE | Micah Adler,
Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs.
J. Algorithms 55(2): 101-112 (2005) |
| 2004 |
|---|
| 54 | | Phillip B. Gibbons,
Micah Adler:
SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms, June 27-30, 2004, Barcelona, Spain
ACM 2004 |
| 53 | EE | Junning Liu,
Micah Adler:
Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors.
ESA 2004: 496-507 |
| 52 | EE | Brent Heeringa,
Micah Adler:
Optimal Website Design with the Constrained Subtree Selection Problem.
ICALP 2004: 757-769 |
| 51 | EE | Matthew Wright,
Micah Adler,
Brian Neil Levine,
Clay Shields:
The predecessor attack: An analysis of a threat to anonymous communications systems.
ACM Trans. Inf. Syst. Secur. 7(4): 489-522 (2004) |
| 50 | EE | Bing Wang,
Subhabrata Sen,
Micah Adler,
Donald F. Towsley:
Optimal proxy cache allocation for efficient streaming media distribution.
IEEE Transactions on Multimedia 6(2): 366-374 (2004) |
| 49 | EE | Micah Adler,
Rakesh Kumar,
Keith W. Ross,
Dan Rubenstein,
David A. Turner,
David D. Yao:
Two optimal peer selection problems.
SIGMETRICS Performance Evaluation Review 32(2): 28-30 (2004) |
| 2003 |
|---|
| 48 | EE | Micah Adler,
Ying Gong,
Arnold L. Rosenberg:
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?".
Annual Simulation Symposium 2003: 39-46 |
| 47 | EE | Matthew Wright,
Micah Adler,
Brian Neil Levine,
Clay Shields:
Defending Anonymous Communications Against Passive Logging Attack.
IEEE Symposium on Security and Privacy 2003: 28- |
| 46 | EE | Micah Adler,
Jin-yi Cai,
Jonathan K. Shapiro,
Donald F. Towsley:
Estimation of Congestion Price Using Probabilistic Packet Marking.
INFOCOM 2003 |
| 45 | EE | Micah Adler,
Ying Gong,
Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters.
SPAA 2003: 1-10 |
| 44 | EE | Micah Adler,
Petra Berenbrink,
Tom Friedetzky,
Leslie Ann Goldberg,
Paul W. Goldberg,
Mike Paterson:
A proportionate fair scheduling rule with good worst-case performance.
SPAA 2003: 101-108 |
| 43 | EE | Micah Adler,
Eran Halperin,
Richard M. Karp,
Vijay V. Vazirani:
A stochastic process on the hypercube with applications to peer-to-peer networks.
STOC 2003: 575-584 |
| 42 | EE | Micah Adler,
Neil Immerman:
An n! lower bound on formula size.
ACM Trans. Comput. Log. 4(3): 296-314 (2003) |
| 41 | EE | Micah Adler,
Sanjeev Khanna,
Rajmohan Rajaraman,
Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Algorithmica 36(2): 123-152 (2003) |
| 40 | | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs.
Combinatorics, Probability & Computing 12(3): (2003) |
| 2002 |
|---|
| 39 | EE | Micah Adler,
Harald Räcke,
Naveen Sivadasan,
Christian Sohler,
Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs.
ICALP 2002: 901-912 |
| 38 | EE | Bing Wang,
Subhabrata Sen,
Micah Adler,
Donald F. Towsley:
Optimal Proxy Cache Allocation for Efficient Streaming Media Distribution.
INFOCOM 2002 |
| 37 | EE | Matthew Wright,
Micah Adler,
Brian Neil Levine,
Clay Shields:
An Analysis of the Degradation of Anonymous Protocols.
NDSS 2002 |
| 36 | EE | Micah Adler,
Dan Rubenstein:
Pricing multicasting in more practical network models.
SODA 2002: 981-990 |
| 35 | EE | Micah Adler,
Adi Rosén:
Tight Bounds for the Performance of Longest-in-System on DAGs.
STACS 2002: 88-99 |
| 34 | EE | Micah Adler:
Tradeoffs in probabilistic packet marking for IP traceback.
STOC 2002: 407-418 |
| 33 | EE | Micah Adler,
Arnold L. Rosenberg,
Ramesh K. Sitaraman,
Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst. 35(6): 599-623 (2002) |
| 2001 |
|---|
| 32 | EE | Micah Adler,
Michael Mitzenmacher:
Towards Compressing Web Graphs.
Data Compression Conference 2001: 203-212 |
| 31 | EE | Micah Adler,
Zihui Ge,
James F. Kurose,
Donald F. Towsley,
Steve Zabele:
Channelization Problem in Large Scale Data Dissemination.
ICNP 2001: 100-109 |
| 30 | EE | Abhishek Chandra,
Micah Adler,
Prashant J. Shenoy:
Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate Fair Scheduling in Multiprocessor Systems.
IEEE Real Time Technology and Applications Symposium 2001: 3-14 |
| 29 | | Micah Adler,
Neil Immerman:
An n! Lower Bound on Formula Size.
LICS 2001: 197- |
| 28 | EE | Micah Adler,
Tian Bu,
Ramesh K. Sitaraman,
Donald F. Towsley:
Tree Layout for Internal Network Characterizations in Multicast Networks.
Networked Group Communication 2001: 189-204 |
| 27 | | John Watkinson,
Micah Adler,
Faith E. Fich:
New Protocols for Asymmetric Communication Channels.
SIROCCO 2001: 337-350 |
| 26 | | Micah Adler,
Frank Thomson Leighton:
Compression Using Efficient Multicasting.
J. Comput. Syst. Sci. 63(1): 127-145 (2001) |
| 25 | EE | Micah Adler,
Bruce M. Maggs:
Protocols for Asymmetric Communication Channels.
J. Comput. Syst. Sci. 63(4): 573-596 (2001) |
| 2000 |
|---|
| 24 | EE | Micah Adler,
Faith E. Fich,
Leslie Ann Goldberg,
Mike Paterson:
Tight Size Bounds for Packet Headers in Narrow Meshes.
ICALP 2000: 756-767 |
| 23 | | Abhishek Chandra,
Micah Adler,
Pawan Goyal,
Prashant J. Shenoy:
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors.
OSDI 2000: 45-58 |
| 22 | EE | Micah Adler,
Frank Thomson Leighton:
Compression using efficient multicasting.
STOC 2000: 153-162 |
| 21 | | Micah Adler,
John W. Byers,
Richard M. Karp:
Parallel Sorting with Limited Bandwidth.
SIAM J. Comput. 29(6): 1997-2015 (2000) |
| 20 | EE | Micah Adler,
Christian Scheideler:
Efficient Communication Strategies for Ad Hoc Wireless Networks.
Theory Comput. Syst. 33(5/6): 337-391 (2000) |
| 1999 |
|---|
| 19 | EE | Micah Adler,
Faith E. Fich:
The Complexity of End-to-End Communication in Memoryless Networks.
PODC 1999: 239-248 |
| 18 | EE | Micah Adler,
Sanjeev Khanna,
Rajmohan Rajaraman,
Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
SPAA 1999: 1-12 |
| 17 | EE | Micah Adler,
Phillip B. Gibbons,
Yossi Matias,
Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions.
Algorithmica 24(3-4): 381-404 (1999) |
| 1998 |
|---|
| 16 | EE | Micah Adler,
Petra Berenbrink,
Klaus Schröder:
Analyzing an Infinite Parallel Job Allocation Process.
ESA 1998: 417-428 |
| 15 | EE | Micah Adler,
Bruce M. Maggs:
Protocols for Asymmetric Communication Channels.
FOCS 1998: 522-533 |
| 14 | EE | Micah Adler,
Christian Scheideler:
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).
SPAA 1998: 259-268 |
| 13 | EE | Micah Adler,
Ramesh K. Sitaraman,
Arnold L. Rosenberg,
Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks.
SPAA 1998: 269-278 |
| 12 | EE | Micah Adler,
Wolfgang Dittrich,
Ben H. H. Juurlink,
Miroslaw Kutylowski,
Ingo Rieping:
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract).
SPAA 1998: 27-36 |
| 11 | | Micah Adler,
Soumen Chakrabarti,
Michael Mitzenmacher,
Lars Eilstrup Rasmussen:
Parallel randomized load balancing.
Random Struct. Algorithms 13(2): 159-188 (1998) |
| 10 | EE | Micah Adler:
Asynchronous Shared Memory Search Structures.
Theory Comput. Syst. 31(4): 377-401 (1998) |
| 1997 |
|---|
| 9 | EE | Micah Adler,
Yair Bartal,
John W. Byers,
Michael Luby,
Danny Raz:
A Modular Analysis of Network Transmission Protocols.
ISTCS 1997: 54-62 |
| 8 | EE | Micah Adler,
Phillip B. Gibbons,
Vijaya Ramachandran,
Yossi Matias:
Modeling Parallel Bandwidth: Local vs. Global Restrictions.
SPAA 1997: 94-105 |
| 1996 |
|---|
| 7 | | Micah Adler:
New Coding Techniques for Improved Bandwidth Utilization.
FOCS 1996: 173-182 |
| 6 | | Micah Adler:
Asynchronous Shared Memory Search Structures.
SPAA 1996: 42-51 |
| 1995 |
|---|
| 5 | | Micah Adler,
John W. Byers,
Richard M. Karp:
Scheduling Parallel Communication: The h-relation Problem.
MFCS 1995: 1-20 |
| 4 | EE | Micah Adler,
John W. Byers,
Richard M. Karp:
Parallel Sorting with Limited Bandwidth.
SPAA 1995: 129-136 |
| 3 | EE | Micah Adler,
Soumen Chakrabarti,
Michael Mitzenmacher,
Lars Eilstrup Rasmussen:
Parallel randomized load balancing (Preliminary Version).
STOC 1995: 238-247 |
| 1994 |
|---|
| 2 | | Micah Adler,
Peter Gemmell,
Mor Harchol-Balter,
Richard M. Karp,
Claire Kenyon:
Selection in the Presence of Noise: The Design of Playoff Systems.
SODA 1994: 564-572 |
| 1 | EE | Micah Adler,
John W. Byers:
AT2 Bounds for a Class of VLSI Problems and String Matching.
SPAA 1994: 140-146 |
