The complexity of sorting on distributed systems
Information and Control
The VLSI optimality of the AKS sorting network
Information Processing Letters
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
A minimum area VLSI network for O(log n) time sorting
IEEE Transactions on Computers
The Influence of Key Length on the Area-Time Complexity of Sorting
Proceedings of the 12th Colloquium on Automata, Languages and Programming
The entropic limitations on VLSI computations(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complexity theory for VLSI
The area-time complexity of sorting (algorithms, computation, architecture, vlsi)
The area-time complexity of sorting (algorithms, computation, architecture, vlsi)
Computational Aspects of VLSI
Size-time complexity of Boolean networks for prefix computations
Journal of the ACM (JACM)
A New Class of Optimal Bounded-Degree VLSI Sorting Networks
IEEE Transactions on Computers
How to Sort N Items Using a Sorting Network of Fixed I/O Size
IEEE Transactions on Parallel and Distributed Systems
Arbitrary long digit integer sorter HW/SW co-design
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
New area-time lower bounds for the multidimensional DFT
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
| Hi-index | 0.01 |
This work describes a large number of constructions for sorting N integers in the range [0, M - 1], for N ≤ M ≤ N2, for the standard VLSI bit model. Among other results, we attain:VLSI sorter constructions that are within a constant factor of optimal size, for all M and almost all running times T.a fundamentally new merging network for sorting numbers in a bit model.new organizational approaches for optimal tuning of merging networks and the proper management of data flow.