M. Kaufmann, J. F. Sibeyn, T. Suel, `Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes,' Proc. 3rd European Symp. on Algorithms, pp. 75--88, Springer LNCS 979, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Evolutionary Multi-Scenario Optimization for On-line.. - de Jong, Poutré (Correct)
....the performance that is expected on average. 4.1 The Di erence between the Average and the Homogeneous Case Scenario We will avoid the term average case scenario, because it is confusing. In [13, 10, 4] the term is used to mean that behavior is averaged over all possible scenarios. However, in [15, 8, 16], the same word is used to denote a di erent concept, which we will here call the homogeneous case scenario. It is important to distinguish between these two. Average scenario analysis calculates the performance of a system or an algorithm, averaged over (a uniform sample of) all external ....
Michael Kaufmann, Jop F. Sibeyn, and Torsten Suel. Beyond the worst-case bisection bound: fast sorting and ranking on meshes. In Proceedings of the European Symposium on Algorithms, number 979 in Lecture Notes in Computer Science, pages 75-88, Berlin, 1995. Springer-Verlag.
Efficient Sorting On The Star Graph Interconnection Network - Akl, Wolff (1997) (Correct)
.... n Gamma 1 = n(n Gamma 1) 2: It follows therefore that a lower bound on the number of steps required to sort n numbers on the n lattice is Omega Gamma n 2 ) Algorithms and lower bounds for the problem of sorting n numbers on the n lattice can be derived from [12] 14] 15] 27] [30], 31] 33] 41] 44] 59] 61] 62] and [63] Some of these algorithms are oblivious (see, for example, 12] 14] 15] 35] 36] and [37] while others are input sensitive, that is, nonoblivious (see, for example, 30] and [59] some are deterministic (see, for example, 44] ....
.... on the n lattice can be derived from [12] 14] 15] 27] 30] 31] 33] 41] 44] 59] 61] 62] and [63] Some of these algorithms are oblivious (see, for example, 12] 14] 15] 35] 36] and [37] while others are input sensitive, that is, nonoblivious (see, for example, [30], and [59] some are deterministic (see, for example, 44] 61] 62] and [63] while others are randomized (see, for example, 31] and, finally, some are efficient in the worst case (see, for example, 39] while others have a good average running time (see, for example, 41] The ....
M. Kaufmann, J.F. Sibeyn, and T. Suel. Beyond the worst-case bisection bound: Fast sorting and routing on meshes. Proceedings of the European Symposium on Algorithms, Lecture Notes in Computer Science No. 979, Springer-Verlag, Berlin, 1995, pp. 75--88.
On Randomized and Deterministic Schemes for Routing and Sorting on .. - Suel Self-citation (Suel) (Correct)
No context found.
M. Kaufmann, J. F. Sibeyn, T. Suel, `Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes,' Proc. 3rd European Symp. on Algorithms, pp. 75--88, Springer LNCS 979, 1995.
On Randomized and Deterministic Schemes for Routing and Sorting on .. - Suel (1998) Self-citation (Suel) (Correct)
No context found.
M. Kaufmann, J. F. Sibeyn, T. Suel, `Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes,' Proc. 3rd European Symp. on Algorithms, pp. 75#88, Springer LNCS 979, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC