The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Micah Adler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  65. Approximating Optimal Binary Decision Trees. [Citation Graph (, )][DBLP]


  66. Search Space Reductions for Nearest-Neighbor Queries. [Citation Graph (, )][DBLP]


Search in 0.024secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002