Related Research Articles
Robert Endre Tarjan is an American computer scientist and mathematician. He is the discoverer of several graph algorithms, including Tarjan's off-line lowest common ancestors algorithm, and co-inventor of both splay trees and Fibonacci heaps. Tarjan is currently the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University, and the Chief Scientist at Intertrust Technologies Corporation.
Erik D. Demaine is a professor of Computer Science at the Massachusetts Institute of Technology and a former child prodigy.
Jeffrey Scott Vitter is a U.S. computer scientist and academic administrator. Born in 1955 in New Orleans, Vitter has served in several senior higher education administration posts. He is a former chancellor of the University of Mississippi. He assumed the chancellor position on January 1, 2016. His formal investiture to the chancellorship took place on November 10, 2016, at the University of Mississippi's Oxford Campus.
Leonidas John Guibas is the Paul Pigott Professor of Computer Science and Electrical Engineering at Stanford University, where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories.
Johannes Gehrke is a German computer scientist and the director of Microsoft Research in Redmond and CTO and Head of Machine Learning for the Microsoft Teams Backend. He is an ACM Fellow, an IEEE Fellow, and the recipient of the 2011 IEEE Computer Society Technical Achievement Award. From 1999 to 2015, he was a faculty member in the Department of Computer Science at Cornell University, where at the time of his leaving he was the Tisch University Professor of Computer Science.
Hans-Peter Kriegel is a German computer scientist and professor at the Ludwig Maximilian University of Munich and leading the Database Systems Group in the Department of Computer Science. He was previously professor at the University of Würzburg and the University of Bremen after habilitation at the Technical University of Dortmund and doctorate from Karlsruhe Institute of Technology.
Bojan Mohar is a Slovenian and Canadian mathematician, working in graph theory. He is a professor of mathematics at the University of Ljubljana and the holder of a Canada Research Chair in graph theory at Simon Fraser University in Vancouver, British Columbia, Canada.
Hans Leo Bodlaender is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.
Michael A. Steel is a New Zealand mathematician and statistician, a professor of mathematics and statistics and the director of the Biomathematics Research Centre at the University of Canterbury in Christchurch, New Zealand. He is known for his research on modeling and reconstructing evolutionary trees.
James Ian Munro is a Canadian computer scientist. He is known for his fundamental contributions to algorithms and data structures.
Vijay K. Vaishnavi is a noted researcher and scholar in the computer information systems field with contributions mainly in the areas of design science research, software engineering, and data structures & algorithms, authoring over 150 publications including seven books in these and related areas, and co-owning a patent. He is currently Professor Emeritus at the Department of Computer Information Systems, Georgia State University. He is Senior Editor Emeritus of MIS Quarterly and is on the editorial boards of a number of other major journals. His research has been funded by the National Science Foundation (NSF) as well as by the industry.
Lars Allan Arge was a Danish computer scientist, the head of the Center for Massive Data Algorithmics (MADALGO) at Aarhus University, where he was also a professor of computer science. His research involved the study of algorithms and data structures for handling massive data, especially in graph algorithms and computational geometry.
Martin Farach-Colton is an American computer scientist, known for his work in streaming algorithms, suffix tree construction, pattern matching in compressed data, cache-oblivious algorithms, and lowest common ancestor data structures. He is a professor of computer science at Rutgers University, and a co-founder of storage technology startup company Tokutek.
Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.
Pedro Domingos is a Professor Emeritus of computer science and engineering at the University of Washington. He is a researcher in machine learning known for Markov logic network enabling uncertain inference.
Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.
Shuchi Chawla is an Indian computer scientist who works in the design and analysis of algorithms, and is known for her research on correlation clustering, information privacy, mechanism design, approximation algorithms, hardness of approximation, and algorithmic bias. She works as a professor of computer science at the University of Texas at Austin.
Jelani Osei Nelson is a Professor of Electrical Engineering and Computer Science at the University of California, Berkeley. He won the 2014 Presidential Early Career Award for Scientists and Engineers. Nelson is the creator of AddisCoder, a computer science summer program for Ethiopian high school students in Addis Ababa.
Keith A. Crandall is an American computational biologist, bioinformaticist, and population geneticist, at George Washington University, where he is the founding director of the Computational Biology Institute, and professor in the Department of Biostatistics and Bioinformatics.
Jin-Yi Cai is a Chinese American mathematician and computer scientist. He is a professor of computer science, and also the Steenbock Professor of Mathematical Sciences at the University of Wisconsin–Madison. His research is in theoretical computer science, especially computational complexity theory. In recent years he has concentrated on the classification of computational counting problems, especially counting graph homomorphisms, counting constraint satisfaction problems, and Holant problems as related to holographic algorithms.
References
- ↑ John Iacono at the Mathematics Genealogy Project.
- ↑ Sloan Fellowships Past Fellows
- ↑ John Iacono, Fulbright Scholars Program, retrieved 2018-09-03
- ↑ Algorithms Research Group, ULB, retrieved 2018-09-03
