79 search results - page 5 / 16 » stoc 2006 |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
STOC
2006
ACM
14 years 7 months ago
2006
ACM
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
STOC
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we improve a recent result of Daskalakis, Goldberg and Papadimitriou on PPAD-completeness of 4-Nash, showing that 3-Nash is PPAD-complete.
STOC
2006
ACM
14 years 7 months ago
2006
ACM
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...