Profile Activity

Igor Markov

Network profile

Reputation

303

303
243
183

2016
2017
2018
2019

Top tag

algorithms

Next privilege

500 Rep.

Access review queues

Badges

1

8

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

7 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Answers (3)

Votes Activity Newest

4	Algorithm for getting the outer boundary of a large graph
3	Can a runtime environment detect an infinite loop?
2	$\Omega(\sqrt[3]{n})$ lower bound on random-access memory?

Reputation (303)

+10	Can a runtime environment detect an infinite loop?
+10	Lower bounds: queues that return their min elements in $O(1)$ time
+10	Algorithm for getting the outer boundary of a large graph
+10	$\Omega(\sqrt[3]{n})$ lower bound on random-access memory?

View more →

Questions (2)

Votes Activity Newest

6	Isn't std::bernoulli_distribution inefficient? Designing a bit-parallel Bernoulli generator
5	Lower bounds: queues that return their min elements in $O(1)$ time

Tags (11)

6 algorithms × 2	0 lower-bounds
4 graph-traversal	0 data-structures
4 computational-geometry	0 randomness
3 halting-problem	0 binary-arithmetic
0 priority-queues	0 randomized-algorithms

View more →

Accounts (6)

	MathOverflow	331 rep	1 silver badge9 bronze badges
	Computer Science	303 rep	1 silver badge8 bronze badges
	Stack Overflow	141 rep	3 bronze badges
	Mathematics	101 rep	1 bronze badge
	Quantum Computing	101 rep	2 bronze badges

Badges (9)

Recent Class Name

Yearling	Editor
Popular Question	Supporter
Commentator	Autobiographer
Scholar	Teacher
Student

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (7)

all time			by type
7	up		2	question
0	down		5	answer

Computer Science Stack Exchange works best with JavaScript enabled