Jump to content

Anna Karlin

From Wikipedia, the free encyclopedia
(Redirected from Anna R. Karlin)
Anna R. Karlin
Alma materStanford University (BS, PhD)
Scientific career
FieldsComputer science
InstitutionsUniversity of Washington
Thesis Sharing Memory in Distributed Systems - Methods and Application  (1987)
Doctoral advisorJeffrey Ullman
Doctoral studentsFrank McSherry
Websitewww.cs.washington.edu/people/faculty/karlin

Anna R. Karlin is an American computer scientist, the Microsoft Professor of Computer Science & Engineering at the University of Washington.

Biography

[edit]

Karlin was born into an academic family. Her father, Samuel Karlin, was a mathematician at Stanford University, and her brother, Kenneth Karlin, is a professor of chemistry at Johns Hopkins University.[1][2]

Karlin went to Stanford for her undergraduate studies, receiving a bachelor's degree in 1981.[3] She stayed at Stanford for graduate school, and earned Ph.D. in 1987 under the supervision of Jeffrey Ullman.[4] She continued to work near Stanford, at the DEC Systems Research Center, for five years, before moving to the University of Washington in 1994.[3] She was program chair of the IEEE Symposium on Foundations of Computer Science in 1997.[3][5]

Karlin was also one of the founding members of the rock music band Severe Tire Damage,[6] and in 1993 as part of the band she participated in the first live music broadcast on the Internet.[7]

Research

[edit]

Karlin's research interests are in the design and analysis of online algorithms and randomized algorithms, which she has applied to problems in algorithmic game theory, system software, distributed computing, and data mining.[5] She has written heavily cited papers on the use of randomized packet markings to perform IP traceback,[8] competitive analysis of multiprocessor cache coherence algorithms,[9] unified algorithms for simultaneously managing all levels of the memory hierarchy,[10] web proxy servers,[11] and hash tables with constant worst-case lookup time.[12]

Awards and honors

[edit]

In 2012, Karlin was named as a fellow of the Association for Computing Machinery.[13] In 2016 she became a fellow of the American Academy of Arts and Sciences.[14] She was awarded the 2020 ACM Paris Kanellakis Theory and Practice Award, "For the discovery and analysis of balanced allocations, known as the power of two choices, and their extensive applications to practice."[15] She was elected to the National Academy of Sciences in 2021 and to the National Academy of Engineering in 2022.[16][17]

Selected publications

[edit]
  • Karlin, Anna R.; Manasse, Mark S.; Rudolph, Larry; Sleator, Daniel D. (1988), "Competitive snoopy caching", Algorithmica, 3 (1): 79–119, doi:10.1007/BF01762111, MR 0925479.
  • Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. (1994), "Dynamic perfect hashing: upper and lower bounds", SIAM Journal on Computing, 23 (4): 738–761, doi:10.1137/S0097539791194094, MR 1283572.
  • Feeley, M. J.; Morgan, W. E.; Pighin, E. P.; Karlin, A. R.; Levy, H. M.; Thekkath, C. A. (1995), "Implementing global memory management in a workstation cluster", Proceedings of the 15th ACM Symposium on Operating Systems Principles (SOSP '95), pp. 201–212, doi:10.1145/224056.224072, ISBN 978-0897917155.
  • Wolman, Alec; Voelker, M.; Sharma, Nitin; Cardwell, Neal; Karlin, Anna; Levy, Henry M. (1999), "On the scale and performance of cooperative Web proxy caching", Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP '99), pp. 16–31, CiteSeerX 10.1.1.74.7126, doi:10.1145/319151.319153, ISBN 978-1581131406.
  • Savage, Stefan; Wetherall, David; Karlin, Anna; Anderson, Tom (2000), "Practical network support for IP traceback", Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM '00) (PDF), pp. 295–306, doi:10.1145/347059.347560, ISBN 978-1581132236.
  • Savage, Stefan; Wetherall, David; Karlin, Anna; Anderson, Tom (2001), "Network support for IP traceback", IEEE/ACM Transactions on Networking, 9 (3): 226–237, doi:10.1109/90.929847.
  • Karlin, Anna; Peres, Yuval (2017), Game Theory, Alive, Providence, Rhode Island: American Mathematical Society.[18]

References

[edit]
  1. ^ Sam Karlin, mathematician who improved DNA analysis, dead at 83 Archived 2016-06-12 at the Wayback Machine, Stanford University, retrieved 2011-01-16.
  2. ^ Ambrose, Susan A. (1997), Journeys of women in science and engineering : no universal constants, Philadelphia: Temple Univ. Press, p. 247, ISBN 978-1-56639-527-4
  3. ^ a b c Curriculum vitae, retrieved 2012-02-23.
  4. ^ Anna R. Karlin at the Mathematics Genealogy Project
  5. ^ a b Speaker biography Archived January 3, 2013, at the Wayback Machine for Grace Hopper Lecture Series, University of Pennsylvania School of Engineering and Applied Science, retrieved 2012-02-23.
  6. ^ Severe Tire Damage: The Band Archived 2008-04-18 at the Wayback Machine, retrieved 2012-02-23.
  7. ^ Severe Tire Damage plays the first live music performance on the internet Archived 2011-11-14 at the Wayback Machine, retrieved 2012-02-23.
  8. ^ Savage, Wetherall, and Karlin et al. (2000, 2001)
  9. ^ Karlin et al. (1988).
  10. ^ Feeley et al. (1995).
  11. ^ Wolman et al. (1999).
  12. ^ Dietzfelbinger et al. (1994).
  13. ^ ACM Fellows Named for Computing Innovations that Advance Technologies in Information Age Archived 2012-12-12 at the Wayback Machine, ACM, December 11, 2012.
  14. ^ Newly Elected Members, American Academy of Arts and Sciences, April 2016, retrieved 2016-04-20
  15. ^ "Anna Karlin". awards.acm.org. Retrieved 2021-12-14.
  16. ^ 2021 NAS Election, National Academy of Sciences, retrieved 2021-04-26
  17. ^ "National Academy of Engineering Elects 111 Members and 22 International Members". NAE Website. Retrieved 2022-02-11.
  18. ^ Reviews of Game Theory, Alive:
Retrieved from "https://en.wikipedia.org/w/index.php?title=Anna_Karlin&oldid=1245917445"