Theoretical Computer Science
templatetypedef's user avatar
templatetypedef's user avatar
templatetypedef's user avatar
templatetypedef
  • Member for 12 years, 8 months
  • Last seen more than a week ago
Profile Activity
Stats
2,121
reputation
34k
reached
3
answers
29
questions
Communities
View all
About

I love teaching, learning, and that really great feeling you get when you finally understand something.

Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
24
bronze badges
Top tags
View all tags
20
Score
24
Posts
75
Posts %
18
Score
8
Posts
25
Posts %
16
Score
2
Posts
6
Posts %
2
Score
5
Posts
16
Posts %
0
Score
4
Posts
12
Posts %
0
Score
3
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
26
Recovering a parse forest from an Earley parser?
Jul 14, 2011
question
18
Is the traditional analysis of Bloom filters wrong?
Apr 10, 2014
question
18
Splay tree potential function: why sum the logs of the sizes?
Apr 25, 2014
answer
16
Recent advances in computer science since 2010?
Sep 24
question
9
Starting point for cache-oblivious algorithms?
Jun 16, 2011
question
9
Generalizing Brzozowski's DFA minimization algorithm to finite automata with different classes of accepting states?
Dec 2, 2015
question
8
Sorted dictionary structure supporting efficient merges?
Apr 21, 2016
question
7
Analysis of Comb Sort?
Jan 5, 2012
question
7
Scaling Algorithms for the Minimum Spanning Tree Problem?
Jan 10, 2012
question
7
Simple proof that splay trees have the dynamic finger property?
Jun 4, 2019
Top network posts
View all network posts
609
How to use range-based for() loop with std::map?
558
What is the difference between LL and LR parsing?
338
Infinite recursion in JavaScript quicksort?
322
What is pseudopolynomial time? How does it differ from polynomial time?
311
What would cause an algorithm to have O(log n) complexity?

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.