|
How Hard Is It to Approximate the Best Nash Equilibrium?
By Elad Hazan and Robert Krauthgamer 1 
· 0 
·
from
SICOMP
·
published 01/2011
|
|
|
The Complexity of Early Deciding Set Agreement
By Eli Gafni, Rachid Guerraoui, and Bastian Pochon 1
· 0
·
from
SICOMP
·
published 01/2011
|
|
|
Multiwriter Consistency Conditions for Shared Memory Registers
By Cheng Shao, Jennifer L. Welch, Evelyn Pierce, and Hyunyoung Lee 1
· 0
·
from
SICOMP
·
published 01/2011
|
|
|
Randomly Supported Independence and Resistance
By Per Austrin and Johan HAstad 1
· 0
·
from
SICOMP
·
published 01/2011
|
|
|
Lower Bounds for Randomized Consensus under a Weak Adversary
By Hagit Attiya and Keren Censor-Hillel 1
· 0
·
from
SICOMP
·
published 12/2010
|
|
|
Analysis of Delays Caused by Local Synchronization
By Julia Lipman and Quentin F. Stout 1
· 0
·
from
SICOMP
·
published 12/2010
|
|
|
Correctness of Gossip-Based Membership under Message Loss
By Maxim Gurevich and Idit Keidar 1
· 0
·
from
SICOMP
·
published 12/2010
|
|
|
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
By David Eppstein, Michael T. Goodrich, and Darren Strash 1
· 0
·
from
SICOMP
·
published 12/2010
|
|
|
Tightening Nonsimple Paths and Cycles on Surfaces
By Eric Colin de Verdiere and Jeff Erickson 1
· 0
·
from
SICOMP
·
published 12/2010
|
|
|
Fast Access to Distributed Atomic Memory
By Partha Dutta, Rachid Guerraoui, Ron R. Levy, and Marko Vukolic 1
· 0
·
from
SICOMP
·
published 12/2010
|
Author profiles -- Claim your papers. Groups -- Create a group for your department. Paper revisions and version control.
Log in