Anna R. Karlin | |
|---|---|
 | |
| Alma mater | Stanford University (BS, PhD) |
| Scientific career | |
| Fields | Computer science |
| Institutions | University of Washington |
| Thesis | Sharing Memory in Distributed Systems - Methods and Application (1987) |
| Doctoral advisor | Jeffrey Ullman |
| Doctoral students | Frank McSherry |
| Website | www |
Anna R. Karlin is an American computer scientist, the Microsoft Professor of Computer Science & Engineering at the University of Washington.
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]
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]
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]
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award for the splay tree data structure.
Leslie B. Lamport is an American computer scientist and mathematician. Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.
Barbara Liskov is an American computer scientist who has made pioneering contributions to programming languages and distributed computing. Her notable work includes the introduction of abstract data types and the accompanying principle of data abstraction, along with the Liskov substitution principle, which applies these ideas to object-oriented programming, subtyping, and inheritance. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science.
Andrei Zary Broder is a distinguished scientist at Google. Previously, he was a research fellow and vice president of computational advertising for Yahoo!, and before that, the vice president of research for AltaVista. He has also worked for IBM Research as a distinguished engineer and was CTO of IBM's Institute for Search and Text Analysis.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Patrick M. Hanrahan is an American computer graphics researcher, the Canon USA Professor of Computer Science and Electrical Engineering in the Computer Graphics Laboratory at Stanford University. His research focuses on rendering algorithms, graphics processing units, as well as scientific illustration and visualization. He has received numerous awards, including the 2019 Turing Award.
The International Symposium on Computer Architecture (ISCA) is an annual academic conference on computer architecture, generally viewed as the top-tier in the field. Association for Computing Machinery's Special Interest Group on Computer Architecture and Institute of Electrical and Electronics Engineers Computer Society are technical sponsors.
Stefan Savage is an American computer science researcher, currently a Professor in the Systems and Networking Group at the University of California, San Diego. There, he holds the Irwin and Joan Jacobs Chair in Information and Computer Science. Savage is widely cited in computer security, particularly in the areas of email spam, network worms and malware propagation, distributed denial of service (DDOS) mitigation and traceback, automotive hacking and wireless security. He received his undergraduate degree at Carnegie Mellon and his Ph.D. from the University of Washington (2002).
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
In computer science, the ski rental problem is a name given to a class of problems in which there is a choice between continuing to pay a repeating cost or paying a one-time cost which eliminates or reduces the repeating cost.
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.
The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society.
Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.
Amos Fiat is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory.
Noam Nisan is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory.
Monika Henzinger is a German computer scientist, and is a former director of research at Google. She is currently a professor at the Institute of Science and Technology Austria. Her expertise is mainly on algorithms with a focus on data structures, algorithmic game theory, information retrieval, search algorithms and Web data mining. She is married to Thomas Henzinger and has three children.
Sanjay Ghemawat is an Indian American computer scientist and software engineer. He is currently a Senior Fellow at Google in the Systems Infrastructure Group. Ghemawat's work at Google, much of it in close collaboration with Jeff Dean, has included big data processing model MapReduce, the Google File System, and databases Bigtable and Spanner. Wired have described him as one of the "most important software engineers of the internet age".
Dawson R. Engler is an American computer scientist and an associate professor of computer science and electrical engineering at Stanford University.
In economics, a budget-additive valuation is a kind of a utility function. It corresponds to a person that, when given a set of items, evaluates them in the following way:
Michael A. Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games. He is David R. Smith Leading Scholar professor of computer science at Stony Brook University, and a co-founder of storage technology startup company Tokutek.
{{citation}}: CS1 maint: untitled periodical (link)| International | |
|---|---|
| National | |
| Academics | |
| Other | |
