2252 search results - page 217 / 451 » Lower Bounds for Dynamic Algorithms |
135
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
157
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
161
click to vote
PRDC
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider scheduling real-time distributable threads in the presence of node/link failures and message losses in large-scale network systems. We present a distributed scheduling...
139
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
114
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...