Theoretical Computer Science
Dmitri Urbanowicz
  • Member for 3 years, 8 months
  • Last seen more than a week ago
Profile Activity
Stats
378
reputation
1k
reached
4
answers
1
question
Communities
View all
About

Software Engineer at Ardecs Ltd. Former senior lecturer at Udmurt State University.

Badges
View all badges
This user doesn’t have any gold badges yet.
1
silver badge
10
bronze badges
Top tags
View all tags
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
9
Score
1
Posts
20
Posts %
7
Score
2
Posts
40
Posts %
7
Score
2
Posts
40
Posts %
Top posts
All Questions Answers
Votes Newest
9
Finding a minimal DFA whose language has a desired intersection with another
May 15 '18
7
How fast can we find and disconnect roots in a forest?
May 21 '18
7
How fast can we find and disconnect roots in a forest?
May 13 '18
2
Why is it a mystery if PSPACE ?= EXPTIME?
Aug 28 '18
1
Clarification of leftmost maximal periodicities
May 31 '18
Top network posts
View all network posts
6
What are the disadvantages of Fibonacci Heaps?
5
Is there a useful algorithm with a decreasing asymptotic time?
5
Cartoon TV series about a boy and an alien (flying head) living in the boy's watches

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.