Author:
Ajtai Miklós,Komlós János,Steiger W.L.,Szemerédi Endre
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference10 articles.
1. An O(n log n) sorting network;Ajtai,1983
2. Time bounds for selection;Blum;J. Comput. System Sci.,1973
3. Routing, merging, and sorting on parallel models of computation;Borodin,1982
4. A parallel median algorithm;Cole;Inform. Process. Lett.,1985
5. Explicit construction of linear sized superconcentrators;Gabber;J. Compui. System Sci.,1981
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hyper-Dimensional Modulation for Robust Short Packets in Massive Machine-Type Communications;IEEE Transactions on Communications;2023-03
2. Selection Algorithms with Small Groups;International Journal of Foundations of Computer Science;2020-04
3. A Selectable Sloppy Heap;Algorithms;2019-03-06
4. Finding a Mediocre Player;Lecture Notes in Computer Science;2019
5. Select with Groups of 3 or 4;Lecture Notes in Computer Science;2015