Shuchi Chawla | |
---|---|
Alma mater | |
Known for | algorithms research |
Awards | |
Scientific career | |
Fields | Computer science |
Institutions | University of Texas at Austin |
Shuchi Chawla is an Indian computer scientist who works in the design and analysis of algorithms, [1] and is known for her research on correlation clustering, [CC] information privacy, [PD] mechanism design, [MD] approximation algorithms, [AO] hardness of approximation, [HA] and algorithmic bias. [2] She works as a professor of computer science at the University of Texas at Austin. [3]
Chawla earned a bachelor's degree from the Indian Institute of Technology Delhi in 2000, [1] [4] and received her Ph.D. from Carnegie Mellon University in 2005. Her dissertation, Graph Algorithms for Planning and Partitioning, was supervised by Avrim Blum. [5] After postdoctoral studies at Stanford University under the mentorship of Tim Roughgarden, [6] and at Microsoft Research, Silicon Valley, she joined the Wisconsin faculty in 2006. [4] . She joined the UT-Austin faculty in 2021. She won a Sloan Research Fellowship in 2009, [7] and was named a Kavli Fellow in 2012. [8]
MC. | Blum, Avrim; Chawla, Shuchi (2001), "Learning from labeled and unlabeled data using graph mincuts" (PDF), Proceedings of the Eighteenth International Conference on Machine Learning (ICML '01), San Francisco, CA, USA: Morgan Kaufmann, pp. 19–26, ISBN 1-55860-778-1 . |
CC. | Bansal, Nikhil; Blum, Avrim; Chawla, Shuchi (July 2004), "Correlation clustering" (PDF), Machine Learning , 56 (1–3): 89–113, doi: 10.1023/b:mach.0000033116.57574.95 , S2CID 207582394 . |
PD. | Chawla, Shuchi; Dwork, Cynthia; McSherry, Frank; Smith, Adam; Wee, Hoeteck (2005), "Toward privacy in public databases" (PDF), in Kilian, Joe (ed.), Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3378, Springer, pp. 363–385, doi: 10.1007/978-3-540-30576-7_20 . |
HA. | Chawla, Shuchi; Krauthgamer, Robert; Kumar, Ravi; Rabani, Yuval; Sivakumar, D. (2006), "On the hardness of approximating multicut and sparsest-cut", Computational Complexity, 15 (2): 94–114, doi: 10.1007/s00037-006-0210-9 , MR 2243123 . |
AO. | Blum, Avrim; Chawla, Shuchi; Karger, David R.; Lane, Terran; Meyerson, Adam; Minkoff, Maria (2007), "Approximation algorithms for orienteering and discounted-reward TSP", SIAM Journal on Computing , 37 (2): 653–670, doi:10.1137/050645464, MR 2318723 . Previously announced in the Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. |
MD. | Chawla, Shuchi; Hartline, Jason D.; Malec, David L.; Sivan, Balasubramanian (2010), "Multi-parameter mechanism design and sequential posted pricing" (PDF), Proceedings of the Forty-Second ACM Symposium on Theory of Computing (STOC '10), New York, NY, USA: ACM, pp. 311–320, arXiv: 0907.2435 , doi:10.1145/1806689.1806733, ISBN 978-1-4503-0050-6, S2CID 53036431 . |
The School of Computer Science (SCS) at Carnegie Mellon University in Pittsburgh, Pennsylvania, US is a school for computer science established in 1988. It has been consistently ranked among the top computer science programs over the decades. As of 2022 U.S. News & World Report ranks the graduate program as tied for second with Stanford University and University of California, Berkeley. It is ranked second in the United States on Computer Science Open Rankings, which combines scores from multiple independent rankings.
Algorithmic game theory (AGT) is an area in the intersection of game theory and computer science, with the objective of understanding and design of algorithms in strategic environments.
David Brumley is a professor at Carnegie Mellon University. He is a well-known researcher in software security, network security, and applied cryptography. Prof. Brumley also worked for 5 years as a Computer Security Officer for Stanford University.
Lori L. Holt is a Professor of Psychology at The University of Texas at Austin. She specializes in speech perception, focusing on how general perceptual and cognitive mechanisms contribute to speech perception and how speech can be used to broadly understand auditory cognition. In pursuit of these research areas, she has employed human perceptual and learning paradigms as well as animal behavioral experiments and computational models. Holt received a B.S. in psychology from the University of Wisconsin–Madison in 1995 and a Ph.D. in cognitive psychology with a minor in neurophysiology from UW–Madison in 1999. She was faculty in the Department of Psychology and the Center for the Neural Basis of Cognition at Carnegie Mellon University before taking a position as Professor of Psychology at The University of Texas at Austin. Holt served as co-Director of the Center for the Neural basis of Cognition and was one of two recipients of the Troland Research Awards in 2013.
Sven Koenig is a full professor in computer science at the University of Southern California. He received an M.S. degree in computer science from the University of California at Berkeley in 1991 and a Ph.D. in computer science from Carnegie Mellon University in 1997, advised by Reid Simmons.
Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.
Timothy Avelin Roughgarden is an American computer scientist and a professor of Computer Science at Columbia University. Roughgarden's work deals primarily with game theoretic questions in computer science.
Fei-Fei Li is an American computer scientist, who was born in China and is known for establishing ImageNet, the dataset that enabled rapid advances in computer vision in the 2010s. She is the Sequoia Capital Professor of Computer Science at Stanford University and former board director at Twitter. Li is a Co-Director of the Stanford Institute for Human-Centered Artificial Intelligence, and a Co-Director of the Stanford Vision and Learning Lab. She served as the director of the Stanford Artificial Intelligence Laboratory (SAIL) from 2013 to 2018.
Eric Poe Xing is an American computer scientist whose research spans machine learning, computational biology, and statistical methodology. Xing is founding President of the world’s first artificial intelligence university, Mohamed bin Zayed University of Artificial Intelligence (MBZUAI).
Ariel D. Procaccia is the Gordon McKay Professor of Computer Science at Harvard University. He was previously an associate professor of computer science at Carnegie Mellon University. He is known for his research in artificial intelligence (AI) and theoretical computer science, especially for his work on computational aspects of game theory, social choice, and fair division. He is the founder of Spliddit, a fair division website.
Dorit S. Hochbaum is a professor of industrial engineering and operations research at the University of California, Berkeley. She is known for her work on approximation algorithms, particularly for facility location, covering and packing problems, and scheduling, and on flow and cut algorithms, Markov random fields, image segmentation and clustering.
Jeffrey Michael Heer is an American computer scientist best known for his work on information visualization and interactive data analysis. He is a professor of computer science & engineering at the University of Washington, where he directs the UW Interactive Data Lab. He co-founded Trifacta with Joe Hellerstein and Sean Kandel in 2012.
Srinivasa Aditya Akella is a computer scientist, professor and Regents Chair Professor at the University of Texas at Austin. He is notable for research in software-defined networking, big data systems, low latency networking, content distribution and network function virtualization.
Virginia Vassilevska Williams is a theoretical computer scientist and mathematician known for her research in computational complexity theory and algorithms. She is currently the Steven and Renee Finn Career Development Associate Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. She is notable for her breakthrough results in fast matrix multiplication, for her work on dynamic algorithms, and for helping to develop the field of fine-grained complexity.
Kristen Lorraine Grauman is a Professor of Computer Science at the University of Texas at Austin on leave as a research scientist at Facebook AI Research (FAIR). She works on computer vision and machine learning.
Elaine Runting Shi is a Chinese and American computer scientist and cryptographer, whose research has included work on blockchain and smart contracts, secure distributed systems, and the oblivious RAM model, and cryptographic techniques for encrypted computation. She is an associate professor of computer science and electrical engineering at Carnegie Mellon University.
Maria-Florina (Nina) Balcan is a Romanian-American computer scientist whose research investigates machine learning, algorithmic game theory, theoretical computer science, including active learning, kernel methods, random-sampling mechanisms and envy-free pricing. She is an associate professor of computer science at Carnegie Mellon University.
Andrea Carol Arpaci-Dusseau is an American computer scientist interested in operating systems, file systems, data storage, distributed computing, and computer science education. She is a professor of computer sciences at the University of Wisconsin–Madison.
Mary Katherine Wootters is an American coding theorist, information theorist, and theoretical computer scientist. She is an assistant professor of computer science and electrical engineering and a member of the Institute for Computational and Mathematical Engineering at Stanford University.
Aaron Roth is an American computer scientist. He is the Henry Salvatori Professor of Computer and Cognitive Science at the University of Pennsylvania.