Computer Science
Profile Activity
Meta user
Network profile
590
reputation
2
12

xdavidliu

MIT PhD '15 Theoretical Physics

Currently at Google

13
answers
8
questions
~55k
people reached
  • New York City
  • Member for 2 years, 11 months
  • 45 profile views
  • Last seen Nov 26 at 20:08

Communities (32)

Top network posts

Top tags (33)

Score 9
Posts 9
Posts % 43
Score 9
Posts 6
Score 8
Posts 6
Score 5
Posts 4
Score 5
Posts 3
Score 4
Posts 5
View all tags →

Top posts (21)

All Questions Answers
Votes Newest
5 Undecidability of “is this CFG prefix-free?” Oct 12
4 Algorithm to find diameter of a tree using BFS/DFS. Why does it work? Jan 15 '18
4 Undecidability of “is this CFG prefix-free?” Oct 11
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
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
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
View all questions and answers →

Badges (14)

Gold

—

Silver

2

Rarest

Bronze

12

Rarest

View all badges →