Aleksandar Nikolov (computer scientist)

Last updated
Aleksandar Nikolov
Born
Varna, Bulgaria
Education St. Peter's University
Alma mater Rutgers University
Scientific career
Fields Differential privacy, discrepancy theory
Institutions University of Toronto
Thesis New computational aspects of discrepancy theory  (2014)
Doctoral advisor S. Muthukrishnan
Website www.cs.toronto.edu/~anikolov/

Aleksandar Nikolov is a Bulgarian and Canadian theoretical computer scientist working on differential privacy, discrepancy theory, and high-dimensional geometry. He is a professor at the University of Toronto.

Contents

Nikolov obtained his Ph.D. from Rutgers University in 2014 under the supervision of S. Muthukrishnan (Thesis: New computational aspects of discrepancy theory). [1]

Nikolov is the Canada Research Chair in Algorithms and Private Data Analysis. [2]

Early Life and Education

Aleksandar Nikolov was born in Varna, Bulgaria to Bulgarian parents of Banat origin. After attaining primary and secondary education in Varna, he was awarded a presidential scholarship to St. Peter's University in Jersey City, NJ. There he majored in Computer Science, graduating as the valedictorian of his class. [3] He later pursued graduate studies at Rutgers University, obtaining his PhD in Computer Science under the supervision of S. Muthukrishnan.

Academic and Research Career

Following his doctoral studies, Nikolov joined the University of Toronto as an Assistant Professor in the Department of Computer Science. [4] His research interests include differential privacy, optimization, and the design and analysis of algorithms. Nikolov has made significant contributions to understanding the mathematical foundations of privacy and the development of efficient algorithms with strong theoretical guarantees. [5]

Research Contributions

Nikolov's work on differential privacy has been particularly influential. He has explored various aspects of privacy-preserving data analysis, including mechanisms for ensuring privacy in statistical queries and optimization problems. His research has advanced the theoretical understanding of how to balance data utility with privacy guarantees. [5]

In addition to privacy, Nikolov has contributed to the field of optimization, focusing on algorithms for high-dimensional data and the development of efficient approximation algorithms. His work often intersects with machine learning, where he addresses problems related to data representation and complexity. [5]

Publications and Citations

Aleksandar Nikolov has published numerous papers in prestigious conferences and journals. His work has been widely cited, reflecting the impact of his research on the computer science community. Some of his notable publications include contributions to conferences such as STOC (Symposium on Theory of Computing), FOCS (Foundations of Computer Science), and SODA (Symposium on Discrete Algorithms). [6] [7] [8] [9]

Teaching and Mentorship

At the University of Toronto, Nikolov is also recognized for his dedication to teaching and mentorship. He teaches courses on algorithms, data privacy, and theoretical computer science, inspiring a new generation of computer scientists. His approach to teaching emphasizes both the theoretical underpinnings of computer science and their practical applications. [10]

Professional Activities and Recognition

Nikolov is actively involved in the academic community, serving on program committees for major conferences and reviewing for top journals. His contributions have earned him recognition, highlighting his role as a leading figure in his areas of expertise. [5]

Recent Work and Future Directions

In recent years, Nikolov has focused on developing a 21st-century framework for addressing contemporary problems in computer science. He advocates for interdisciplinary approaches that combine insights from computer science, mathematics, and other fields to tackle complex challenges. His recent initiatives aim to bridge the gap between theoretical research and practical applications, ensuring that advancements in algorithms and privacy have a meaningful impact on society. [11]

Aleksandar Nikolov's Google Scholar Profile

Aleksandar Nikolov's Research Page at the University of Toronto

Aleksandar Nikolov's Personal Homepage at the University of Toronto

Article on the Need for a 21st-Century Framework for 21st-Century Problems

Related Research Articles

<span class="mw-page-title-main">Stephen Cook</span> American-Canadian computer scientist, contributor to complexity theory

Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

<span class="mw-page-title-main">Leonid Khachiyan</span> Soviet and American mathematician and computer scientist

Leonid Genrikhovich Khachiyan was a Soviet and American mathematician and computer scientist.

<span class="mw-page-title-main">Knuth Prize</span> Prize given by ACM and IEEE for outstanding contributions to the foundations of computer science

The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist Donald E. Knuth.

<span class="mw-page-title-main">Ravindran Kannan</span>

Ravindran Kannan is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.

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.

<span class="mw-page-title-main">Yuri Gurevich</span> American computer scientist

Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.

The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT. Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012.

<span class="mw-page-title-main">Cynthia Dwork</span> American computer scientist

Cynthia Dwork is an American computer scientist best known for her contributions to cryptography, distributed computing, and algorithmic fairness. She is one of the inventors of differential privacy and proof-of-work.

<span class="mw-page-title-main">Dimitri Bertsekas</span> Greek electrical engineer

Dimitri Panteli Bertsekas is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.

<span class="mw-page-title-main">Toniann Pitassi</span> Canadian-American computer scientist

Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.

<span class="mw-page-title-main">Martin Farach-Colton</span> American computer scientist

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 the Leonard J. Shustek Professor of Computer Science and chair of the Department of Computer Science and Engineering at New York University. Formerly, he was a Distinguished Professor of Computer Science at Rutgers University. He co-founded the storage technology startup company Tokutek.

<span class="mw-page-title-main">Virginia Vassilevska Williams</span> Theoretical computer scientist

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.

Grigory Yaroslavtsev is a Russian-American computer scientist. He is an assistant professor of computer science at George Mason University. Previously he was an assistant professor of computer science at Indiana University and the founding director of the Center for Algorithms and Machine Learning (CAML) at Indiana University.

Michael A. Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games. He is David R. Smith Leading Scholar professor of computer science at Stony Brook University, and a co-founder of storage technology startup company Tokutek.

S. ("Muthu") Muthukrishnan is a computer scientist of Indian origin, known for his work in streaming algorithms, auction design, and pattern matching. He is vice president of sponsored products, Amazon (company) Advertising.

<span class="mw-page-title-main">Philip N. Klein</span> American computer scientist

Philip N. Klein is an American computer scientist and professor at Brown University. His research focuses on algorithms for optimization problems in graphs. 

Sébastien Bubeck is a French-American computer scientist and mathematician. He is currently Microsoft's Vice President of Applied Research and leads the Machine Learning Foundations group at Microsoft Research Redmond. Bubeck was formerly professor at Princeton University and a researcher at the University of California, Berkeley. He is known for his contributions to online learning, optimization and more recently studying deep neural networks, and in particular transformer models.

Prasad Raghavendra is an Indian-American theoretical computer scientist and mathematician, working in optimization, complexity theory, approximation algorithms, hardness of approximation and statistics. He is a professor of computer science at the University of California at Berkeley.

<span class="mw-page-title-main">Atulya Nagar</span>

Atulya K. Nagar is a mathematical physicist, academic and author. He holds the Foundation Chair as Professor of Mathematics and is the Pro-Vice-Chancellor for Research at Liverpool Hope University.

References

  1. ↑ Nikolov, Aleksandar (2014). New computational aspects of discrepancy theory (Thesis). Rutgers University - Graduate School - New Brunswick.
  2. ↑ "U of T gains 34 new Canada Research Chairs". University of Toronto News. Retrieved 2019-10-23.
  3. ↑ Saint Peter's University (2008-06-10). SPC '08 Valedictorian, Aleksandar Nikolov . Retrieved 2024-07-08– via YouTube.
  4. ↑ "Aleksandar Nikolov". www.cs.toronto.edu. Retrieved 2024-07-08.
  5. 1 2 3 4 "Aleksandar Nikolov". scholar.google.com. Retrieved 2024-07-08.
  6. ↑ "Aleksandar Nikolov". Simons Foundation. Retrieved 2024-07-08.
  7. ↑ Andoni, Alexandr; Naor, Assaf; Nikolov, Aleksandar; Razenshteyn, Ilya; Waingarten, Erik (2018-06-20). "Data-dependent hashing via nonlinear spectral gaps". Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2018. New York, NY, USA: Association for Computing Machinery. pp. 787–800. doi:10.1145/3188745.3188846. ISBN   978-1-4503-5559-9.
  8. ↑ Kush, Deepanshu; Nikolov, Aleksandar; Tang, Haohua (2021-05-10). "Near Neighbor Search via Efficient Average Distortion Embeddings". arXiv: 2105.04712 [cs.DS].
  9. ↑ "dblp: SODA 2021". dblp.org. Retrieved 2024-07-08.
  10. ↑ "Teaching: Courses". www.cs.toronto.edu. Retrieved 2024-07-08.
  11. ↑ "We need a 21st century framework for 21st century problems". Schwartz Reisman Institute. Retrieved 2024-07-08.


This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.