658 search results - page 105 / 132 » Lower bounds for sorting networks |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
SIAMJO
2008
13 years 7 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
TMC
2008
13 years 7 months ago
2008
This paper introduces a cooperation-based database caching system for Mobile Ad Hoc Networks (MANETs). The heart of the system is the nodes that cache submitted queries. The querie...