Sorting on Electronic Computer Systems
Journal of the ACM (JACM)
A lower bound on the size of shellsort networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The periodic balanced sorting network
Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
A lower bound on the average-case complexity of shellsort
Journal of the ACM (JACM)
Algorithm 346: F-Test Probabilities
Communications of the ACM
ACM Computing Surveys (CSUR)
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
Internal and tape sorting using the replacement-selection technique
Communications of the ACM
An empirical study of minimal storage sorting
Communications of the ACM
A method of comparing the time requirements of sorting methods
Communications of the ACM
A high-speed sorting procedure
Communications of the ACM
Asymptotic analysis of (3, 2, 1)-shell sort
Random Structures & Algorithms
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The scan line approach to design rules checking: Computational experiences
DAC '84 Proceedings of the 21st Design Automation Conference
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Towards a canonical form for computer programs
ACM '75 Proceedings of the 1975 annual conference
Language directed computer performance evaluation
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Using finite experiments to study asymptotic performance
Experimental algorithmics
Assertions: A Personal Perspective
IEEE Annals of the History of Computing
Assertions: a personal perspective
Software pioneers
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
"Flowblocks": a technique for structured programming
ACM SIGPLAN Notices
Transferable FORTRAN Subroutine for Rapid Extended Sorting
IEEE Transactions on Computers
Cellular Logic-in-Memory Arrays
IEEE Transactions on Computers
An experimental study of sorting and branch prediction
Journal of Experimental Algorithmics (JEA)
On the adaptiveness of Quicksort
Journal of Experimental Algorithmics (JEA)
Snakes and ladders: patterns in Heapsort
Journal of Computing Sciences in Colleges
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The Frobenius Problem and Its Generalizations
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
An economical construction for sorting networks
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
A guided bibliography to sorting
IBM Systems Journal
A phenomenon in the theory of sorting
Journal of Computer and System Sciences
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A key-address mapping sort algorithm
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
TELE-INFO'11/MINO'11/SIP'11 Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Communications of the ACM
The growing-tree sorting algorithm
WSEAS Transactions on Information Science and Applications
Increasing the efficiency of quicksort using a neural network based algorithm selection model
Information Sciences: an International Journal
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 48.33 |