658 search results - page 16 / 132 » Lower bounds for sorting networks |
MST
1998
13 years 7 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
CN
2007
13 years 7 months ago
2007
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...