World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
5286
World Ranking
13045
National Ranking
5252

Overview

Micah Adler is affiliated with the University of Massachusetts Amherst in the United States. Their research primarily focuses on computer science, with particular emphasis on computational theory and mathematics, and artificial intelligence.

The scientist's work covers topics including:

  • Computability, Logic, AI Algorithms
  • Neural Networks and Applications
  • Semigroups and Automata Theory

Adler has published recent papers predominantly in the venue arXiv (Cornell University). Notable papers include:

  • On the Complexity of Neural Computation in Superposition (2024, arXiv)
  • Towards Combinatorial Interpretability of Neural Computation (2025, arXiv)

While some coauthors appear on papers not led by Adler, frequent coauthors for Adler specifically include:

  • Nir Shavit
  • Linghao Kong
  • Shashata Sawmya
  • Dan Alistarh
  • Angelina Ning

Adler's contributions consistently address theoretical foundations of neural computation, interpretability of neural networks, and related algorithmic insights.

Best Publications

  • Optimal proxy cache allocation for efficient streaming media distribution

    Bing Wang;S. Sen;M. Adler;D. Towsley

  • Parallel randomized load balancing

    Micah Adler;Soumen Chakrabarti;Michael Mitzenmacher;Lars Rasmussen

  • The predecessor attack: An analysis of a threat to anonymous communications systems

    Matthew K. Wright;Micah Adler;Brian Neil Levine;Clay Shields

  • Towards compressing Web graphs

    M. Adler;M. Mitzenmacher

  • An Analysis of the Degradation of Anonymous Protocols.

    Matthew K. Wright;Micah Adler;Brian Neil Levine;Clay Shields

  • Defending anonymous communications against passive logging attacks

    M. Wright;M. Adler;B.N. Levine;C. Shields

  • Randomized Pursuit-Evasion in Graphs

    Micah Adler;Harald Räcke;Naveen Sivadasan;Christian Sohler

  • Minimum energy reliable paths using unreliable wireless links

    Qunfeng Dong;Suman Banerjee;Micah Adler;Archan Misra

  • Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors

    Abhishek Chandra;Micah Adler;Pawan Goyal;Prashant Shenoy

  • Tradeoffs in probabilistic packet marking for IP traceback

    Micah Adler

  • Scheduling space‐sharing for internet advertising

    Micah Adler;Phillip B. Gibbons;Yossi Matias

  • Optimal peer selection for P2P downloading and streaming

    M. Adler;R. Kumar;K. Ross;D. Rubenstein

  • A stochastic process on the hypercube with applications to peer-to-peer networks

    Micah Adler;Eran Halperin;Richard M. Karp;Vijay V. Vazirani

  • Efficient algorithms for neighbor discovery in wireless networks

    Sudarshan Vasudevan;Micah Adler;Dennis Goeckel;Don Towsley

  • On the capacity of information networks

    Micah Adler;Nicholas J. A. Harvey;Kamal Jain;Robert Kleinberg

  • Algorithms for optimizing the bandwidth cost of content delivery

    Micah Adler;Ramesh K. Sitaraman;Harish Venkataramani

  • Trade-offs in probabilistic packet marking for IP traceback

    Micah Adler

  • An n! lower bound on formula size

    Micah Adler;Neil Immerman

  • Channelization problem in large scale data dissemination

    M. Adler;Zihui Ge;J.F. Kurose;D. Towsley

  • Deadline fair scheduling: bridging the theory and practice of proportionate pair scheduling in multiprocessor systems

    A. Chandra;M. Adler;P. Shenoy

Frequent Co-Authors

Don Towsley
Don Towsley University of Massachusetts Amherst
Richard M. Karp
Richard M. Karp University of California, Berkeley
John W. Byers
John W. Byers Boston University
Dan Rubenstein
Dan Rubenstein Columbia University
Brian Neil Levine
Brian Neil Levine University of Massachusetts Amherst
Michael Mitzenmacher
Michael Mitzenmacher Harvard University
Arnold L. Rosenberg
Arnold L. Rosenberg University of Massachusetts Amherst
Bruce M. Maggs
Bruce M. Maggs Duke University
Keith W. Ross
Keith W. Ross New York University
Soumen Chakrabarti
Soumen Chakrabarti Indian Institute of Technology Bombay

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Students interested in Computer Science have a wide range of related online degrees to consider, each offering unique career opportunities. For those seeking flexibility and rapid progression, an accelerated computer science degree lets you complete your studies faster, helping you enter the tech workforce sooner.

If your interests extend to applying technical skills to environmental challenges, consider pursuing an online environmental engineering degree. This field is rapidly growing and focuses on designing sustainable solutions.

Another promising option is a career in mechanical engineering. With the cheapest mechanical engineering degree online, you can develop core engineering skills while minimizing your educational expenses.

Physics is another discipline closely aligned with computer science. An online physics bachelor's degree can pave the way for careers in research, technology, or engineering.

Each of these pathways not only broadens your technical expertise but also opens doors to specialized and in-demand roles in today’s STEM-driven job market.

Best Scientists Citing Micah Adler

Trending Scientists

Recently Published Articles