Computer Science
xdavidliu
  • New York City
  • Member for 3 years, 9 months
Profile Activity
Stats
731
reputation
66k
reached
19
answers
15
questions
About

MIT PhD '15 Theoretical Physics

Currently at Google

Communities (33)

Top network posts

This user doesn’t have any gold badges yet.
4
silver badges
13
bronze badges
View all badges

Top tags (51)

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

Top posts (34)

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 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
4 Undecidability of "is this CFG prefix-free?" Oct 11 '20
3 NP completeness of deciding whether a set of examples, consisting of strings and states, has a corresponding DFA? May 16
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 Show that the single-tape TMs that can not write on the portion the portion of the tape containing the input string recognize only regular languages Aug 24 '20
3 how to bound the probability that quicksort takes greater than n lg n time? Jan 1 '18
View all questions and answers →

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.