Related Research Articles
Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
Tomaž (Tomo) Pisanski is a Slovenian mathematician working mainly in discrete mathematics and graph theory. He is considered by many Slovenian mathematicians to be the "father of Slovenian discrete mathematics."
Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
Shafrira Goldwasser is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at MIT, a professor of mathematical sciences at the Weizmann Institute of Science, Israel, co-founder and chief scientist of Duality Technologies and the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley.
Samson Abramsky is Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at the University of Oxford, from 2000 to 2021. He has made contributions to the areas of domain theory, the lazy lambda calculus, strictness analysis, concurrency theory, interaction categories, geometry of interaction, game semantics and quantum computing. More recently, he has been applying methods from categorical semantics to finite model theory, with applications to descriptive complexity.
Lenore Carol Blum is an American computer scientist and mathematician who has made pioneering contributions to the theories of real number computation, cryptography, and pseudorandom number generation. She was a distinguished career professor of computer science at Carnegie Mellon University until 2019 and is currently a professor in residence at the University of California, Berkeley. She is also known for her efforts to increase diversity in mathematics and computer science.
Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.
Jennifer Tour Chayes is Associate Provost of the Division of Computing, Data Science, and Society and Dean of the School of Information at the University of California, Berkeley. Before joining Berkeley, she was a Technical Fellow and Managing Director of Microsoft Research New England in Cambridge, Massachusetts, which she founded in 2008, and Microsoft Research New York City, which she founded in 2012.
Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.
Nimrod Megiddo is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center and Stanford University. His interests include combinatorial optimization, algorithm design and analysis, game theory, and machine learning. He was one of the first people to propose a solution to the bounding sphere and smallest-circle problem.
Kathleen M. Carley is an American computational social scientist specializing in dynamic network analysis. She is a professor in the School of Computer Science in the Carnegie Mellon Institute for Software Research at Carnegie Mellon University and also holds appointments in the Tepper School of Business, the Heinz College, the Department of Engineering and Public Policy, and the Department of Social and Decision Sciences.
Ioana Dumitriu is a Romanian-American mathematician who works as a professor of mathematics at the University of California, San Diego. Her research interests include the theory of random matrices, numerical analysis, scientific computing, and game theory.
Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford. Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration.
Michael John Wooldridge is a professor of computer science at the University of Oxford. His main research interests is in multi-agent systems, and in particular, in the computational theory aspects of rational action in systems composed of multiple self-interested agents. His work is characterised by the use of techniques from computational logic, game theory, and social choice theory.
Yael Tauman Kalai is a cryptographer and theoretical computer scientist who works as a Senior Principal Researcher at Microsoft Research New England and as an adjunct professor at MIT in the Computer Science and Artificial Intelligence Lab.
Jennifer Shyamala Sayaka Balakrishnan is an American mathematician known for leading a team that solved the problem of the "cursed curve", a Diophantine equation that was known for being "famously difficult". More generally, Balakrishnan specializes in algorithmic number theory and arithmetic geometry. She is the Clare Boothe Luce Associate Professor at Boston University.
Michal Feldman is a full professor of Computer Science and the Chair of Computation and Economics at Tel Aviv University, the head of Economics and Computation (EC) lab, and a visiting researcher in Microsoft Research Israel. Michal’s research focuses on algorithmic game theory, an area that lies in the intersection of computer science, microeconomics and game theory. Among other topics, she studies auction theory, mechanism design, algorithm design, the price of anarchy, and e-commerce. Michal is an alumna of the Israel Young Academy and of the Global Young Academy. Her research is funded by prestigious grants, including, among others, grants of the ERC : ERC starters and ERC consolidator, ISF grants, and an Amazon Research Award. She was selected by the Forbes magazine as one of the most influencing women in Israel in 2016., and was recently awarded the Kadar Award for Outstanding Research.
Nina Holden is a Norwegian mathematician interested in probability theory and stochastic processes, including graphons, random planar maps, the Schramm–Loewner evolution, and their applications to quantum gravity. She is a Junior Fellow at the Institute for Theoretical Studies at ETH Zurich, and has an accepted a position as an associate professor at the Courant Institute of Mathematical Sciences of New York University beginning in 2021.
Edith Hemaspaandra is a Dutch-American theoretical computer scientist whose research concerns computational social choice, the computational complexity theory of problems in social choice theory, and particularly on computational problems involving election manipulation. She is a professor of computer science at the Rochester Institute of Technology.
Kate S. Larson is a Canadian computer scientist working as a professor, Pasupalak AI Fellow, and University Research Chair in the Cheriton School of Computer Science of the University of Waterloo.
References
- 1 2 Edith Elkind, University of Oxford, retrieved 2019-09-16
- ↑ "Edith Elkind", Individual ranking, International Mathematical Olympiad, retrieved 2019-09-16
- ↑ Nomination for the IFAAMAS Board: Edith Elkind (PDF), International Foundation for Autonomous Agents and Multiagent Systems, retrieved 2019-09-16
- ↑ Edith Elkind at the Mathematics Genealogy Project
- ↑ Edith Elkind & Dan Olteanu made professors in Recognition of Distinction exercise, University of Oxford, Department of Computer Science, 19 July 2016, retrieved 2019-09-16
