Stack Exchange

hengxin

中国江苏省Nanjing Shi

http://www.bigoh.net/wiki/index.php/%E7%94%A8%E6%88%B7:Hengfeng-Wei

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

top accounts reputation activity favorites subscriptions
Top Questions
23 votes

Curious about computer-assisted NP-completeness proofs

cc.complexity-theory reference-request soft-question reductions proof-assistants asked Jan 31 '15 at 5:37
cstheory.stackexchange.com

22 votes

Why is the “topologist's sine curve” not locally connected?

general-topology connectedness asked Feb 7 '14 at 8:07
math.stackexchange.com

21 votes

How to enforce the left-to-right node ordering in GraphViz rank layout?

layout graphviz graph-visualization asked Jan 2 '13 at 13:49
stackoverflow.com

19 votes

Why is the consensus problem so important in distributed computing?

reference-request big-picture dc.distributed-comp asked Dec 5 '12 at 11:37
cstheory.stackexchange.com

14 votes

How to center an `itemize` in beamer, together with its headline?

beamer horizontal-alignment lists itemize asked Apr 16 '15 at 4:10
tex.stackexchange.com

13 votes

Correctness proofs of classic Paxos and Fast Paxos

ds.algorithms dc.distributed-comp proofs asked Sep 24 '14 at 9:00
cstheory.stackexchange.com

13 votes

What are the components and path components of $\mathbb{R}^{\omega}$ in the product, uniform, and box topologies?

general-topology connectedness product-space box-product asked Feb 9 '14 at 4:30
math.stackexchange.com

12 votes

Checking if all true and reset a Boolean[] array using one-liner lambda expression of Java 8

java arrays lambda java-8 java-stream asked Dec 28 '15 at 12:36
stackoverflow.com

11 votes

Existence of a 0- and 1-valent configurations in the proof of FLP impossibility result

distributed-computing consensus asked Feb 28 '13 at 9:20
stackoverflow.com

11 votes

Why is linearizability a safety property and why are safety properties closed sets?

reference-request fl.formal-languages dc.distributed-comp concurrency asked Feb 27 '14 at 12:28
cstheory.stackexchange.com

1 2 3 4 5 … 8

Top Answers
19
How do I find my wife in a supermarket?
cs.stackexchange.com

19
log(n) complexity. Difficulty understanding example
cs.stackexchange.com

16
If the two generals problem is unsolvable how can we human beings agree on things?
cs.stackexchange.com

15
Formal program verification in practice
cs.stackexchange.com

14
Projection map being a closed map
math.stackexchange.com

12
What is the best solution to find whether the sum of an array is even or odd
cs.stackexchange.com

9
Product of a Transition System and a Finite Automaton
cs.stackexchange.com

8
When did polynomial-time algorithm become of interest?
cs.stackexchange.com

7
Minimum spanning tree and its connected subgraph
cs.stackexchange.com

7
Finding a permutation $p$ of $x_1, x_2, \dots, x_n$ which maximises $\sum_{i=1}^{n-1}|x_{p_{i+1}}-x_{p_i}|$
cstheory.stackexchange.com

7
Major unsolved problems in distributed systems?
cstheory.stackexchange.com

7
Does Deadlock imply Starvation
cs.stackexchange.com

7
Why is the lower bound of element uniqueness in $\Omega(n\log n)$?
cs.stackexchange.com

6
Consensus problem of distributed systems
cs.stackexchange.com

6
Finding shortest paths in undirected graphs with possibly negative edge weights
cs.stackexchange.com

6
Implementing wait-free consensus with queues
cs.stackexchange.com

5
Algorithm to convert decimal number to binary
cs.stackexchange.com

5
When the heapsort worst case occurs?
cs.stackexchange.com

5
Does Heapsort work in time o(n log n) in the best case?
cs.stackexchange.com

5
CTL vs LTL - when a formula satisfy a model
cs.stackexchange.com

5
4-color to 3-color polynomial reduction
cs.stackexchange.com

5
Determine whether a point lies in a convex hull of points in O(logn)
cs.stackexchange.com

5
Algorithm to return largest subset of non-intersecting intervals
cs.stackexchange.com

5
Shared legend below a group of horizontally aligned figures in pgfplots
tex.stackexchange.com

5
how to draw a line segment bounded by ticks at end points
tex.stackexchange.com