Sciweavers

21007 search results - page 3779 / 4202
» Mobile Parallel Computing
Sort
View
ICS
2010
Tsinghua U.
16 years 4 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant
ICS
2010
Tsinghua U.
16 years 4 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ICS
2010
Tsinghua U.
16 years 4 months ago
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
ICS
2010
Tsinghua U.
16 years 4 months ago
Robustness of the Learning with Errors Assumption
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod...
ICS
2010
Tsinghua U.
16 years 4 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
« Prev « First page 3779 / 4202 Last » Next »