(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Indian computer scientist
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]
Education and career
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]
Selected publications
| PD. |
Chawla, Shuchi (2005), "Toward privacy in public databases", in Kilian, Joe, Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, Lecture Notes in Computer Science, 3378, Springer, pp. 363–385, doi:10.1007/978-3-540-30576-7_20, http://www.iacr.org/cryptodb/archive/2005/TCC/3614/3614.pdf .
|
| 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 .
|
| AO. |
"Approximation algorithms for orienteering and discounted-reward TSP", SIAM Journal on Computing 37 (2): 653–670, 2007, doi:10.1137/050645464 . 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", Proceedings of the Forty-Second ACM Symposium on Theory of Computing (STOC '10), New York, NY, USA: ACM, pp. 311–320, doi:10.1145/1806689.1806733, ISBN 978-1-4503-0050-6, https://www.eecs.northwestern.edu/~hartline/papers/sequential-pricing-STOC-10.pdf .
|
References
- ↑ 1.0 1.1 Curriculum vitae, Carnegie Mellon University, 2005, https://www.cs.cmu.edu/~shuchi/jobapp/Shuchi_CV.pdf, retrieved 2018-09-18
- ↑ Kassner, Michael (July 11, 2017), "Fairness-verification tool helps avoid illegal bias in algorithms", TechRepublic, https://www.techrepublic.com/article/fairness-verification-tool-helps-avoid-illegal-bias-in-algorithms/
- ↑ "Professor", Faculty profile (UT-Austin Computer Science Department), https://www.cs.utexas.edu/people/faculty-researchers/shuchi-chawla, retrieved 2021-03-10
- ↑ 4.0 4.1 "Professor", Faculty profile (UW-Madison Computer Science Department), http://pages.cs.wisc.edu/~shuchi/, retrieved 2021-03-10
- ↑ Shuchi Chawla at the Mathematics Genealogy Project
- ↑ Roughgarden, Tim, Tim Roughgarden's Current and Past Students, Stanford University, https://theory.stanford.edu/~tim/students.html, retrieved 2018-09-20
- ↑ Devitt, Terry (February 20, 2009), "Four faculty awarded prestigious Sloan Fellowships", University of Wisconsin–Madison News, https://news.wisc.edu/four-faculty-awarded-prestigious-sloan-fellowships/
- ↑ Barncard, Chris (November 8, 2012), "UW contingent among Kavli Frontiers of Science fellows", University of Wisconsin–Madison News, https://news.wisc.edu/uw-contingent-among-kavli-frontiers-of-science-fellows/
External links
 | Original source: https://en.wikipedia.org/wiki/Shuchi Chawla. Read more |
