Theoretical Computer Science
Meta user
Network profile
1,414
reputation
11
27

hengxin

I am a Ph.D. candidate majoring in Computer Science at Nanjing University, China. I am interested in distributed computing and formal methods.

Contact: hengxin0912@gmail.com

Address: Nanjing University Xianlin Campus, 163 Xianlin Avenue, Qixia, Nanjing 210023, Jiangsu, China

18
answers
31
questions
~31k
people reached

Communities (18)

Top network posts

Top tags (50)

Score 16
Posts 30
Posts % 61
Score 10
Posts 5
Score 9
Posts 18
Score 9
Posts 9
Score 6
Posts 6
Score 4
Posts 20
View all tags →

Top posts (49) All Questions Answers | Votes Newest

23 Curious about computer-assisted NP-completeness proofs Jan 31 '15
19 Why is the consensus problem so important in distributed computing? Dec 5 '12
13 Correctness proofs of classic Paxos and Fast Paxos Sep 24 '14
11 Is there algorithmic mathematical analysis? May 30 '15
10 What are the major research issues in distributed transactions? Dec 14 '14
10 Why is linearizability a safety property and why are safety properties closed sets? Feb 27 '14
9 Is linearizability equivalent to consensus problem? Apr 15 '13
8 Is there some mathematical closed form (or somewhat tight asymptotic one) for “Google Eggs Puzzle”? Dec 9 '12
7 Explaining computer science algorithms/concepts/ideas using metaphors Nov 2 '14
7 Confusions about the technique for verifying implementations of linearizable objects in [Herlihy and Wing, 1990] Nov 23 '15
View all questions and answers →

Badges (38)

Gold

—

Silver

11

Rarest

Bronze

27

Rarest

View all badges →