Computer Science
Profile Activity
Meta user
Network profile
620
reputation
4
13

xdavidliu

MIT PhD '15 Theoretical Physics

Currently at Google

16
answers
13
questions
~60k
people reached
  • New York City
  • Member for 3 years, 2 months
  • 64 profile views
  • Last seen Feb 12 at 3:49

Communities (33)

Top network posts

Top tags (45)

Score 11
Posts 7
Posts % 24
Score 9
Posts 9
Score 8
Posts 6
Score 6
Posts 9
Score 5
Posts 5
Score 5
Posts 4
View all tags →

Top posts (29)

All Questions Answers
Votes Newest
5 Algorithm to find diameter of a tree using BFS/DFS. Why does it work? Jan 15 '18
5 Undecidability of “is this CFG prefix-free?” Oct 12 '20
4 Undecidability of “is this CFG prefix-free?” Oct 11 '20
3 is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected? Jan 15 '18
3 is it decidable whether a grammar in Chomsky normal form has useless rules? Oct 12 '20
3 how to bound the probability that quicksort takes greater than n lg n time? Jan 1 '18
3 how does Kleene-Post show two languages that are not Turing reducible to each other? Oct 25 '20
3 how to bound the probability that quicksort takes greater than n lg n time? Jan 1 '18
2 monotonically increasing codeword length in optimal (maybe Huffman) code for alphabet with monotonically decreasing frequencies Jan 21 '18
2 how does Kleene-Post show two languages that are not Turing reducible to each other? Oct 24 '20
View all questions and answers →

Badges (17)

Gold

—

Silver

4

Rarest

Bronze

13

Rarest

View all badges →