user avatar
user avatar
user avatar
Peter
  • Member for 10 years, 10 months
  • Last seen more than a month ago
17 votes
Accepted

Why is the consensus problem so important in distributed computing?

9 votes
Accepted

Is there a list of canonical problems in distributed systems?

9 votes

What papers should everyone read?

8 votes

Efficient and simple randomized algorithms where determinism is difficult

8 votes
Accepted

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

7 votes

Good examples for how to write well in TCS

6 votes

Efficient and simple randomized algorithms where determinism is difficult

5 votes

bounds in centralized and distributed

5 votes
Accepted

Honest Majority unconditional coinflipping without private channels

4 votes

What's the relation between the dominating set and vertex cover?

4 votes

Distributed file storage system - theoretical approaches

3 votes
Accepted

Concurrent data structures vs. Distributed data structures

3 votes

FloodSet in general networks

3 votes

Are there websites for TCS announcements that maintain mailing-lists or web feeds?

3 votes

What are infinite graphs good for?

3 votes

What can we prove with infinite graphs that we cannot prove without them?

3 votes
Accepted

Results about computability power or limitations of shared read/write registers

2 votes
Accepted

What do these lower bounds really mean?

2 votes

Lower bound for orienting an asynchronous ring?

2 votes
Accepted

Average message complexity for the election problem on graphs

2 votes

Infinitely large but locally finite computation problems

1 vote

State of the art algorithms for community detection in graphs

1 vote

Why do timeouts require synchronized clocks?