Computer Science
Sasho Nikolov's user avatar
Sasho Nikolov's user avatar
Sasho Nikolov's user avatar
Sasho Nikolov
  • Member for 10 years, 4 months
  • Last seen more than a week ago
Profile Activity
Stats
2,497
reputation
88k
reached
32
answers
0
questions
Communities
View all
About

I am an assistant professor in the computer science department in University of Toronto. Interested in discrepancy theory (and computational aspects of it), convex geometry, approximation algorithms, differential privacy, streaming and parallel algorithms.

Badges
View all badges
This user doesn’t have any gold badges yet.
15
silver badges
20
bronze badges
Top tags
View all tags
128
Score
17
Posts
53
Posts %
44
Score
2
Posts
6
Posts %
40
Score
2
Posts
6
Posts %
20
Score
4
Posts
12
Posts %
16
Score
4
Posts
12
Posts %
16
Score
3
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
33
Sorting as a linear program
Sep 30, 2012
answer
22
What is the novelty in MapReduce?
Aug 3, 2012
answer
19
Efficient map data structure supporting approximate lookup
May 26, 2012
answer
12
Can every algorithm's running time be expressed as $\Theta(f(n))$?
Feb 13, 2013
answer
11
Known facets of the Travelling Salesman Problem polytope
Sep 5, 2012
answer
9
Where to find published research papers?
Dec 4, 2012
answer
7
Find the point with minimum max distance to any point in a set
Mar 4, 2013
answer
7
Counting with constant space bounded TMs
Jul 30, 2012
answer
7
Why use comparisons instead of runtime for comparing two algorithms?
Aug 12, 2012
answer
7
If A is poly-time reducible to B, is B poly-time reducible to A?
Apr 13, 2013
Top Meta posts
0
1
4
Answering exercise questions from textbooks where the authors explicitly ask other not to post solutions on web
Top network posts
View all network posts
54
Examples of algorithms requiring deep mathematics to prove correctness
50
How important is knowing how to program for TCS?
44
Applications of representation theory of the symmetric group
35
Lipton's most influential results
33
Hard-looking algorithmic problems made easy by theorems

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.