Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,090
reputation
8
18

Thatchaphol

PhD student of Danupon Nanongkai at Theoretical Computer Science Group (TCS) School of Computer Science and Communication (CSC) KTH Royal Institute of Technology, Sweden

I study data structure (dynamic graph algorithm, binary search tree).

7
answers
9
questions
~25k
people reached

Communities (16)

Top network posts

Top tags (31)

Score 32
Posts 5
Posts % 31
Score 23
Posts 5
Score 14
Posts 2
Score 4
Posts 4
Score 3
Posts 2
Score 3
Posts 2
View all tags →

Top posts (16)

All Questions Answers
Votes Newest
20 For which problems in P is it easier to verify the result than to find it? Nov 1 '15
14 Splay tree potential function: why sum the logs of the sizes? Feb 10 '15
13 Most memorable CS paper titles Oct 23 '14
12 Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$ Feb 5 '13
10 Implications between $\mathsf{L}=\mathsf{P}$ and $\mathsf{NL}=\mathsf{NP}$? Nov 5 '13
8 Efficient Reduction from Min Cut to st-Min Cut Oct 16 '14
8 Speed-up of Boolean over Algebraic computation Mar 17 '15
7 Size hierachy for uniform circuits Aug 14 '13
6 Quick-select contiguous subarray Jul 14 '16
3 Graph-related applications of the fast Fourier transform (and other algebraic algorithms) Feb 19 '18
View all questions and answers →

Badges (26)

Gold

—

Silver

8

Rarest

Bronze

18

Rarest

View all badges →

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.