Sasho Nikolov

1,477 reputation

311

bio	website	paul.rutgers.edu/~anikolov
	location
	age	28
visits	member for	1 year, 1 month
	seen	10 hours ago
stats	profile views	71

I am a PhD student in Rutgers University, working with S. Muthukrishnan. Interested in discrepancy theory (and computational aspects of it), approximation algorithms, differential privacy, streaming and parallel algorithms.

	1,477 reputation	bio	website	paul.rutgers.edu/~anikolov	visits	member for	1 year, 1 month
311 badges		location			seen	10 hours ago

summary answers questions tags badges favorites bounties reputation activity

28 Answers

votes activity newest

11	Can every algorithm's running time be expressed as $\Theta(f(n))$?
11	Sorting as a linear program
10	What is the novelty in MapReduce?
7	If A is poly-time reducible to B, is B poly-time reducible to A?
7	Counting with constant space bounded TMs

1,477 Reputation

+10	What's better for an algorithm complexity, O(log n) or amortized O(log n)?
+10	What is the novelty in MapReduce?
+55	Number of PCP queries
+10	Where to find published research papers?

0 Questions

votes activity newest

This user has not asked any questions

46 Tags

73 algorithms × 17	12 complexity-theory × 3
16 linear-programming × 2	12 sorting × 2
13 space-complexity × 3	11 data-structures × 2
13 streaming-algorithm × 3	11 turing-machines × 2
13 time-complexity × 3	10 distributed-systems