Igor Markov

Reputation

313

Next privilege

500 Rep.

Access review queues

Yearling

0/1

0 posts edited

0 helpful flags

7 votes cast

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?

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

View more →

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

This user has not participated in any tags

This user has no bookmarked questions.