Kunde, M.: Bounds for l-selection and related problems on grids of processors. Proceedings of the Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, G.D.R., (Oct. l988). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Upper and Lower Bounds for Selection on the Mesh - Anne Condon (1993) (3 citations) (Correct)
....a constant number of packets between time steps. Any selection algorithm requires n Gamma 1 steps, since this is the distance from the corners to the center of the mesh. This is the only known lower bound for selection on the standard model of the mesh (Kunde s lower bound of 2n Gamma o(n) steps [10] applies only to a very restricted model of the mesh) The previously best algorithm for this problem runs in 1:22n steps [7, 8, 15] Thus, the complexity of selection on the mesh is well known to be Theta(n) the main open question is whether there exists a distance optimal, or n o(n) time, ....
....steps. An algorithm is weakly adaptive if it is O(1) adaptive; otherwise we say it is highly adaptive. An algorithm is maximally adaptive if every step of the algorithm is a knowledge step. The maximally adaptive model is similar to the lower bound model of Schnorr and Shamir [18] Kunde [10] and Han et al. 5] However, our model allows replication of packets, which is not allowed in their model. On the other hand, their model is more general than our maximally adaptive model in that an algorithm may depend on the values of accessible packets, and not just on the outcomes of ....
[Article contains additional citation context not shown here]
M. Kunde. l-selection and related problems on grids of processors. Journal of New Generation Computer Systems, 2:129--143, 1989.
Time Lower Bounds for Parallel Sorting - On Mesh-Connected Processor (Correct)
No context found.
Kunde, M.: Bounds for l-selection and related problems on grids of processors. Proceedings of the Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, G.D.R., (Oct. l988).
Optimal Parallel Algorithms for Multiselection on.. - Shen, Han, Pan, Evans (Correct)
No context found.
M. Kunde. l-selection and related problems on grids of processors. J. of New Generation Computer Systems, 2:129--143, 1989.
Indexing Functions and Time Lower Bounds for Sorting on .. - Han, Igarashi.. (1992) (6 citations) (Correct)
No context found.
M. Kunde. Boiunds for l-selection and related problems on grids of processors, in: Proceedings of the Fourth International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, Lecture Notes in Computer Science 342 (Springer, Berlin, 1988) 298-307.
Randomized Algorithms on the Mesh - Narayanan (1998) (1 citation) (Correct)
No context found.
M. Kunde. l-selection and related problems on grids of processors. Journal of New Generation Computer Systems, 2:129#143, 1989.
Zero-One Sorting On The Mesh - Krizanc, Narayanan (1995) (5 citations) (Correct)
No context found.
M. Kunde, l-selection and related problems on grids of processors. Journal of New Generation Computer Systems, 2, 1989, 129--143.
Implementations of Randomized Sorting on Large.. - William L.. (1992) (31 citations) (Correct)
No context found.
M. Kunde, l-selection and Related Problems on Grids of Processors, Aegan Workshop on Computing: VLSI Algorithms and Architectures, vol. 319 of Lecture Notes in Computer Science, pp. 423-433, SpringerVerlag, NY, 1988.
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