I am a Research Scientist at Google.
My interests span algorithmic and modeling problems that arise in Internet applications and online social networks. I study: privacy-preserving algorithms, policies, and user experiences; algorithms, data-mining and analytics for social networks and massive scale social data; and algorithmic, economic, and social aspects of online monetization.
I received my Ph.D. in Computer Science from Stanford University, where I was a Cisco Systems Stanford Graduate Fellow advised by Prof. Rajeev Motwani (RIP, Rajeev) and Prof. Ashish Goel. My Ph.D. thesis focused on protecting privacy when mining and sharing user data.
At Stanford, I collaborated with students and faculty from the Research on Algorithms for the Internet group. I was also fortunate to intern at Microsoft Research Search Labs, Facebook, Yahoo! Research, and PARC.
Winner of the 2011-2012 Arthur L. Samuel Thesis Award,
for the best Ph.D. thesis in the Computer Science department at Stanford.
Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, Nina Mishra
Journal of Privacy and Confidentiality, Volume 5, Issue 1, Pages 39-71 (2013)
Aleksandra Korolova [bibtex]
Journal of Privacy and Confidentiality, Volume 3, Issue 1, Pages 27-49 (2011)
Workshop version in IEEE International Workshop on Privacy Aspects of Data Mining (PADM ’2010)
Co-winner of the 2011 PET Award [Press release]
Popular press: New York Times, Gawker
Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma [bibtex]
37th International Conference on Very Large Databases (VLDB ’2011)
Popular press: MIT Technology Review (arXiv Blog)
Aleksandra Korolova, Krishnaram Kenthapadi, Nina Mishra, Alexandros Ntoulas [bibtex]
18th International World Wide Web Conference (WWW ’2009)
Nominated for Best Paper Award
Popular press: Microsoft Research, New Scientist
Aleksandra Korolova, Rajeev Motwani, Shubha U. Nabar, Ying Xu [bibtex]
ACM 17th Conference on Information and Knowledge Management (CIKM ’2008)
Poster version in 24th International Conference on Data Engineering (ICDE ’2008)
Popular press: ACM Crossroads Magazine
Aleksandra Korolova, Ayman Farahat, Philippe Golle [bibtex]
14th International World Wide Web Conference (WWW ’2005)
Aleksandra Korolova [bibtex]
Discrete Mathematics, Volume 292, Issues 1-3, Pages 107-117 (March 2005)
I grew up in Latvia and graduated from Riga secondary school #40, spending fun weeekends preparing for math olympiads at NMS and learning algorithms at Progmeistars. I am indebted for the many opportunities I have had to my family, amazing teachers at the above institutions and to the George Soros Foundation. If you visit or live in Riga, rent an apartment or office space in the center of Riga. My high school mathematics teacher tutors students in London.
I loved spending my college years at MIT, and especially enjoyed the classes taught by Prof. Patrick Winston. I first tried doing research in Dan Spielman's error-correcting codes class and Joe Gallian's Duluth REU. At Stanford, I enjoyed learning some randomized algorithms, algorithmic game theory, cognitive science and design thinking. I also had fun advocating for graduate student interests, distributing funding and organizing tax workshops as part of the Graduate Student Council, and serving as a mentor and Center for Teaching and Learning liason for Computer Science TAs.
In my free time, I enjoy traveling, skiing, playing tennis, and learning languages.