165 search results - page 29 / 33 » Improved Lower Bounds on the Randomized Complexity of Graph ... |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
ICALP
2001
Springer
14 years 5 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
COMCOM
2004
13 years 7 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...