Igor Markov

63 reputation

bio	website	eecs.umich.edu/~imarkov
	location	Ann Arbor, MI
	age	40
visits	member for	7 months
	seen	2 hours ago
stats	profile views	2

Born in Kiev, Ukraine. Went to high school #145 and Kiev (Taras Shevchenko) University. MA in Mathematics and Ph.D. in Computer Science from UCLA. Currently Professor of EECS at the University of Michigan Ann Arbor.

	63 reputation	bio	website	eecs.umich.edu/~imarkov	visits	member for	7 months
6 badges		location	Ann Arbor, MI		seen	2 hours ago

summary answers questions tags badges favorites bounties reputation activity

2 Answers

votes activity newest

3	Algorithm for getting the outer boundary of a large graph
1	Can a runtime environment detect an infinite loop?

63 Reputation

+10	Can a runtime environment detect an infinite loop?
+30	Algorithm for getting the outer boundary of a large graph
+20	Lower bounds: queues that return their min elements in $O(1)$ time

1 Question

votes activity newest

4	Lower bounds: queues that return their min elements in $O(1)$ time

7 Tags

3 graph-traversal	0 priority-queues
3 algorithms	0 lower-bounds
3 computational-geometry	0 data-structures
1 halting-problem

3 Accounts

	Computer Science	63 rep	6
	Stack Overflow	21 rep	2
$Mathematics Stack Exchange$	Mathematics	1 rep

6 Badges

recent class name

Scholar	Supporter
Student	Autobiographer
Editor	Teacher

0 Active bounties

active offered earned

This user has no active bounties

2 Votes Cast

all time			by type			month
2	up		1	question		1
0	down		1	answer		1

user feed