86 search results - page 3 / 18 » Worst-Case Running Times for Average-Case Algorithms |
STACS
1995
Springer
13 years 9 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
COCOA
2010
Springer
13 years 3 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
FCT
2001
Springer
13 years 10 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
ISAAC
2000
Springer
13 years 9 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...