caa a22 4500 465821472 CHVBK 20180323112136.0 cr unu---uuuuu 170327e19900601xx s 000 0 eng 10.1007/BF02017340 doi (NATIONALLICENCE)springer-10.1007/BF02017340 The multilevel principle applied to sorting [Elektronische Daten] [Craig Douglas, Willard Miranker] Sorting algorithms are developed in the setting of iterative multilevel methods. These algorithms borrow aggregation techniques from algorithms used for the numerical solution of elliptic partial differential equations which are of optimal order in running time and storage space for structured problems. A computationally inexpensive preconditioner drives random data chosen from known distributions towards a special case for which the new sorting algorithms are of optimal order. BIT Foundations, 1990 68P10 nationallicence Douglas Craig Mathematical Sciences Department, IBM Research Division, Thomas J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, New York, USA aut Miranker Willard Mathematical Sciences Department, IBM Research Division, Thomas J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, New York, USA aut BIT Kluwer Academic Publishers 30/2(1990-06-01), 177-195 0006-3835 30:2<177 1990 30 10543 https://doi.org/10.1007/BF02017340 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02017340 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Douglas Craig Mathematical Sciences Department, IBM Research Division, Thomas J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, New York, USA aut NATIONALLICENCE 700 1- Miranker Willard Mathematical Sciences Department, IBM Research Division, Thomas J. Watson Research Center, P. O. Box 218, 10598, Yorktown Heights, New York, USA aut NATIONALLICENCE 773 0- BIT Kluwer Academic Publishers 30/2(1990-06-01), 177-195 0006-3835 30:2<177 1990 30 10543 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer