default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMicah Adler
Person information
- affiliation: University of Massachusetts Amherst, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Micah Adler, Nir Shavit:
On the Complexity of Neural Computation in Superposition. CoRR abs/2409.15318 (2024)
2010 – 2019
- 2013
- [j22]Sudarshan Vasudevan, Micah Adler, Dennis Goeckel, Don Towsley
:
Efficient Algorithms for Neighbor Discovery in Wireless Networks. IEEE/ACM Trans. Netw. 21(1): 69-83 (2013) - 2012
- [j21]Micah Adler, Brent Heeringa:
Approximating Optimal Binary Decision Trees. Algorithmica 62(3-4): 1112-1121 (2012) - 2011
- [j20]Micah Adler, Ramesh K. Sitaraman, Harish Venkataramani:
Algorithms for optimizing the bandwidth cost of content delivery. Comput. Networks 55(18): 4007-4020 (2011)
2000 – 2009
- 2008
- [j19]Micah Adler, Ying Gong, Arnold L. Rosenberg:
On "Exploiting" Node-Heterogeneous Clusters Optimally. Theory Comput. Syst. 42(4): 465-487 (2008) - [j18]Matthew K. Wright, Micah Adler, Brian Neil Levine, Clay Shields:
Passive-Logging Attacks Against Anonymous Communications Systems. ACM Trans. Inf. Syst. Secur. 11(2): 3:1-3:34 (2008) - [c51]Micah Adler, Brent Heeringa:
Approximating Optimal Binary Decision Trees. APPROX-RANDOM 2008: 1-9 - [c50]Micah Adler, Brent Heeringa:
Search Space Reductions for Nearest-Neighbor Queries. TAMC 2008: 554-567 - 2006
- [c49]Micah Adler, Ramesh K. Sitaraman, Harish Venkataramani:
Algorithms for Optimizing Bandwidth Costs on the Internet. HotWeb 2006: 1-9 - [c48]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 - [c47]Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. SODA 2006: 241-250 - [c46]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
- [j17]Micah Adler:
Trade-offs in probabilistic packet marking for IP traceback. J. ACM 52(2): 217-244 (2005) - [j16]Micah Adler, Adi Rosén:
Tight bounds for the performance of Longest In System on DAGs. J. Algorithms 55(2): 101-112 (2005) - [j15]Micah Adler, Dan Rubenstein:
Pricing multicasting in more flexible network models. ACM Trans. Algorithms 1(1): 48-73 (2005) - [c45]Qunfeng Dong, Suman Banerjee, Micah Adler, Kazu Hirata:
Efficient Probabilistic Packet Marking. ICNP 2005: 368-377 - [c44]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 - [c43]Qunfeng Dong, Suman Banerjee, Micah Adler, Archan Misra:
Minimum energy reliable paths using unreliable wireless links. MobiHoc 2005: 449-459 - [c42]Micah Adler:
Collecting correlated information from a sensor network. SODA 2005: 479-488 - [c41]Micah Adler, Jeff Edmonds, Jirí Matousek:
Towards asymptotic optimality in probabilistic packet marking. STOC 2005: 450-459 - 2004
- [j14]Micah Adler, Rakesh Kumar, Keith W. Ross, Dan Rubenstein, David A. Turner, David D. Yao:
Two optimal peer selection problems. SIGMETRICS Perform. Evaluation Rev. 32(2): 28-30 (2004) - [j13]Matthew K. 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) - [j12]Bing Wang, Subhabrata Sen, Micah Adler, Donald F. Towsley:
Optimal proxy cache allocation for efficient streaming media distribution. IEEE Trans. Multim. 6(2): 366-374 (2004) - [c40]Junning Liu, Micah Adler:
Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors. ESA 2004: 496-507 - [c39]Brent Heeringa, Micah Adler:
Optimal Website Design with the Constrained Subtree Selection Problem. ICALP 2004: 757-769 - [e1]Phillip B. Gibbons, Micah Adler:
SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona, Spain. ACM 2004, ISBN 1-58113-840-7 [contents] - 2003
- [j11]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) - [j10]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12(3): 225-244 (2003) - [j9]Micah Adler, Neil Immerman:
An n! lower bound on formula size. ACM Trans. Comput. Log. 4(3): 296-314 (2003) - [c38]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Asymptotically Optimal Worksharing in HNOWs: How Long is "Sufficiently Long?". Annual Simulation Symposium 2003: 39-46 - [c37]Bing Wang, Subhabrata Sen, Micah Adler, Don Towsley:
Using multicast for streaming videos across wide area networks. GLOBECOM 2003: 3574-3579 - [c36]Micah Adler, Jin-yi Cai, Jonathan K. Shapiro, Donald F. Towsley:
Estimation of Congestion Price Using Probabilistic Packet Marking. INFOCOM 2003: 2068-2078 - [c35]Matthew K. Wright, Micah Adler, Brian Neil Levine, Clay Shields:
Defending Anonymous Communications Against Passive Logging Attack. S&P 2003: 28-41 - [c34]Micah Adler, Ying Gong, Arnold L. Rosenberg:
Optimal sharing of bags of tasks in heterogeneous clusters. SPAA 2003: 1-10 - [c33]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 - [c32]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 - 2002
- [j8]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) - [c31]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912 - [c30]Bing Wang, Subhabrata Sen, Micah Adler, Donald F. Towsley:
Optimal Proxy Cache Allocation for Efficient Streaming Media Distribution. INFOCOM 2002: 1726-1735 - [c29]Matthew K. Wright, Micah Adler, Brian Neil Levine, Clay Shields:
An Analysis of the Degradation of Anonymous Protocols. NDSS 2002: 1-12 - [c28]Micah Adler, Dan Rubenstein:
Pricing multicasting in more practical network models. SODA 2002: 981-990 - [c27]Micah Adler, Adi Rosén:
Tight Bounds for the Performance of Longest-in-System on DAGs. STACS 2002: 88-99 - [c26]Micah Adler:
Tradeoffs in probabilistic packet marking for IP traceback. STOC 2002: 407-418 - 2001
- [j7]Micah Adler, Frank Thomson Leighton:
Compression Using Efficient Multicasting. J. Comput. Syst. Sci. 63(1): 127-145 (2001) - [j6]Micah Adler, Bruce M. Maggs:
Protocols for Asymmetric Communication Channels. J. Comput. Syst. Sci. 63(4): 573-596 (2001) - [c25]Micah Adler, Michael Mitzenmacher:
Towards Compressing Web Graphs. Data Compression Conference 2001: 203-212 - [c24]Micah Adler, Zihui Ge, James F. Kurose, Donald F. Towsley, Steve Zabele:
Channelization Problem in Large Scale Data Dissemination. ICNP 2001: 100-109 - [c23]Micah Adler, Neil Immerman:
An n! Lower Bound on Formula Size. LICS 2001: 197-206 - [c22]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 - [c21]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 - [c20]John Watkinson, Micah Adler, Faith E. Fich:
New Protocols for Asymmetric Communication Channels. SIROCCO 2001: 337-350 - 2000
- [j5]Micah Adler, Christian Scheideler:
Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst. 33(5/6): 337-391 (2000) - [j4]Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth. SIAM J. Comput. 29(6): 1997-2015 (2000) - [c19]Micah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson:
Tight Size Bounds for Packet Headers in Narrow Meshes. ICALP 2000: 756-767 - [c18]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 - [c17]Micah Adler, Frank Thomson Leighton:
Compression using efficient multicasting. STOC 2000: 153-162
1990 – 1999
- 1999
- [j3]Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24(3-4): 381-404 (1999) - [c16]Micah Adler, Faith E. Fich:
The Complexity of End-to-End Communication in Memoryless Networks. PODC 1999: 239-248 - [c15]Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén:
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. SPAA 1999: 1-12 - 1998
- [j2]Micah Adler:
Asynchronous Shared Memory Search Structures. Theory Comput. Syst. 31(4): 377-401 (1998) - [j1]Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen:
Parallel randomized load balancing. Random Struct. Algorithms 13(2): 159-188 (1998) - [c14]Micah Adler, Petra Berenbrink, Klaus Schröder:
Analyzing an Infinite Parallel Job Allocation Process. ESA 1998: 417-428 - [c13]Micah Adler, Bruce M. Maggs:
Protocols for Asymmetric Communication Channels. FOCS 1998: 522-533 - [c12]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 - [c11]Micah Adler, Christian Scheideler:
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). SPAA 1998: 259-268 - [c10]Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 - 1997
- [c9]Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz:
A Modular Analysis of Network Transmission Protocols. ISTCS 1997: 54-62 - [c8]Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias:
Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA 1997: 94-105 - 1996
- [c7]Micah Adler:
New Coding Techniques for Improved Bandwidth Utilization. FOCS 1996: 173-182 - [c6]Micah Adler:
Asynchronous Shared Memory Search Structures. SPAA 1996: 42-51 - 1995
- [c5]Micah Adler, John W. Byers, Richard M. Karp:
Scheduling Parallel Communication: The h-relation Problem. MFCS 1995: 1-20 - [c4]Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth. SPAA 1995: 129-136 - [c3]Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen:
Parallel randomized load balancing (Preliminary Version). STOC 1995: 238-247 - 1994
- [c2]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 - [c1]Micah Adler, John W. Byers:
AT2 Bounds for a Class of VLSI Problems and String Matching. SPAA 1994: 140-146
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
