77 search results - page 7 / 16 » A Note on the Asymptotics and Computational Complexity of Gr... |
138
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
154
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
164
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
181
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
162
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...