Sciweavers

105 search results - page 21 / 21
» Linear Time Algorithm for Weak Parity Games
Sort
View
IANDC
2006
77views more  IANDC 2006»
13 years 6 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
BIRTHDAY
2010
Springer
13 years 7 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
11 years 8 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
SIGGRAPH
2010
ACM
13 years 10 months ago
A multi-layered display with water drops
We present a multi-layered display that uses water drops as voxels. Water drops refract most incident light, making them excellent wide-angle lenses. Each 2D layer of our display ...
Peter C. Barnum, Srinivasa G. Narasimhan, Takeo Ka...
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 6 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden