World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
55
Citations
16587
World Ranking
4217
National Ranking
1990

Research.com Recognitions

  • 2016 - Fellow of the American Academy of Arts and Sciences
  • 2012 - ACM Fellow For contributions to the design and analysis of algorithms and their use in the study of systems design.

Overview

Anna R. Karlin is affiliated with the University of Washington in the United States and has a body of work that spans multiple aspects of computer science and decision sciences. Their research contributions focus notably on computational theory, optimization, and auction theory.

The scientist's recent publications include the following papers:

  • A (Slightly) Improved Approximation Algorithm for Metric TSP, 2023, published in Operations Research
  • A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP, 2022, published in the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Approximately Revenue-Maximizing Auctions for Deliberative Agents, 2021, published in Proceedings of the AAAI Conference on Artificial Intelligence
  • Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue, 2023, published in Mathematics of Operations Research
  • Simple pricing schemes for consumers with evolving values, 2022, published in Games and Economic Behavior

Frequent co-authors in their work include Nathan Klein, Shayan Oveis Gharan, Kira Goldner, Shuchi Chawla, and Niv Buchbinder.

Karlin's frequent publication venues reflect their research focus and include arXiv, Operations Research, the IEEE Symposium on Foundations of Computer Science, Mathematics of Operations Research, and Proceedings of the AAAI Conference on Artificial Intelligence.

Their main fields of study encompass Computer Science and Decision Sciences, with subfields such as Computational Theory and Mathematics, Management Science and Operations Research, Computer Networks and Communications, Industrial and Manufacturing Engineering, and Economics and Econometrics.

Among the main topics covered in their research are:

  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Auction Theory and Applications
  • Advanced Graph Theory Research
  • Optimization and Packing Problems
  • Vehicle Routing Optimization Methods
  • Consumer Market Behavior and Pricing

Anna R. Karlin has received notable recognitions including being named a Fellow of the American Academy of Arts and Sciences in 2016 and an ACM Fellow in 2012 for their contributions to the design and analysis of algorithms and system design.

Best Publications

  • Practical network support for IP traceback

    Stefan Savage;David Wetherall;Anna Karlin;Tom Anderson

  • Competitive snoopy caching

    Anna R. Karlin;Mark S. Manasse;Larry Rudolph;Daniel D. Sleator

  • Balanced Allocations

    Yossi Azar;Andrei Z. Broder;Anna R. Karlin;Eli Upfal

  • On the scale and performance of cooperative Web proxy caching

    Alec Wolman;M. Voelker;Nitin Sharma;Neal Cardwell

  • Network support for IP traceback

    Stefan Savage;David Wetherall;Anna Karlin;Tom Anderson

  • Implementing global memory management in a workstation cluster

    M. J. Feeley;W. E. Morgan;E. P. Pighin;A. R. Karlin

  • Dynamic Perfect Hashing: Upper and Lower Bounds

    Martin Dietzfelbinger;Anna Karlin;Kurt Mehlhorn;Friedhelm Meyer auf der Heide

  • A study of integrated prefetching and caching strategies

    Pei Cao;Edward W. Felten;Anna R. Karlin;Kai Li

  • Competitive randomized algorithms for nonuniform problems

    A. R. Karlin;M. S. Manasse;L. A. Mcgeoch;S. Owicki

  • On profit-maximizing envy-free pricing

    Venkatesan Guruswami;Jason D. Hartline;Anna R. Karlin;David Kempe

  • Spectral analysis of data

    Yossi Azar;Amos Fiat;Anna Karlin;Frank McSherry

  • Parallel hashing: an efficient implementation of shared memory

    Anna R. Karlin;Eli Upfal

  • Implementation and performance of integrated application-controlled file caching, prefetching, and disk scheduling

    Pei Cao;Edward W. Felten;Anna R. Karlin;Kai Li

  • Bounds on the cover time

    Andrei Z. Broder;Anna R. Karlin

  • Multilevel adaptive hashing

    Andrei Z. Broder;Anna R. Karlin

  • Empirical studies of competitve spinning for a shared-memory multiprocessor

    Anna R. Karlin;Kai Li;Mark S. Manasse;Susan Owicki

  • Dynamic TCP acknowledgement and other stories about e/(e-1)

    Anna R. Karlin;Claire Kenyon;Dana Randall

  • On-line load balancing

    Yossi Azar;Andrei Z. Broder;Anna R. Karlin

  • Strongly Competitive Algorithms for Paging with Locality of Reference

    Sandy Irani;Anna R. Karlin;Steven Phillips

  • Greedy bidding strategies for keyword auctions

    Matthew Cary;Aparna Das;Ben Edelman;Ioannis Giotis

Frequent Co-Authors

Andrei Z. Broder
Andrei Z. Broder Google (United States)
Jason D. Hartline
Jason D. Hartline Northwestern University
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Amos Fiat
Amos Fiat Tel Aviv University
Yossi Azar
Yossi Azar Tel Aviv University
Eli Upfal
Eli Upfal Brown University
Henry M. Levy
Henry M. Levy University of Washington
Elias Koutsoupias
Elias Koutsoupias University of Oxford
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Kai Li
Kai Li Princeton University

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

If you're interested in studying Computer Science in the USA, a variety of online degrees and pathways are available to suit different goals and backgrounds. For those looking to get started quickly, exploring the easiest associate's degree to get is a practical way to enter the tech field with minimal time and investment.

Many students pursue online education due to its flexibility and cost savings. When choosing a program, consider enrolling in one of the most popular online colleges, as these institutions often offer strong Computer Science and related technology degrees with national accreditation.

Tech careers can also branch into specialized fields. For those interested in gaming and interactive media, a game design degree online allows students to gain the creative and technical skills needed for this booming industry. Advanced professionals may consider pursuing edd programs online to move into leadership or educational roles.

Online degrees make it easier than ever to launch or advance a career in computing, with options for every interest and stage of your professional journey.

Best Scientists Citing Anna R. Karlin

Trending Scientists

Recently Published Articles