The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Tradeoffs for VLSI models with subpolynomial delay
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A Benchmark Parallel Sort for Shared Memory Multiprocessors
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation
IEEE Transactions on Computers
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Depth-Size Tradeoffs for Neural Computation
IEEE Transactions on Computers - Special issue on artificial neural networks
A New Class of Optimal Bounded-Degree VLSI Sorting Networks
IEEE Transactions on Computers
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A simple architecture for constant time sorting machines
ACM SIGARCH Computer Architecture News
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Parallel processors applied to string transformations (abstract)
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
The de Bruijn multiprocessor network: a versatile sorting network
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast parallel sorting algorithms
Communications of the ACM
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Boosting and Hard-Core Set Construction
Machine Learning
Bit-Sliced VLSI Algorithm for Search and Sort
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Study of Sort Algorithms for Multiprocessor Database Machines
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The realization of monotone Boolean functions (Preliminary Version)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Fault-secure algorithms for multiple-processor systems
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
A minimum area VLSI network for O(logn) time sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A new class of two stage parallel sorting schemes
ACM '82 Proceedings of the ACM '82 conference
Multi-mesh of trees with its parallel algorithms
Journal of Systems Architecture: the EUROMICRO Journal
The complexity of contract negotiation
Artificial Intelligence
An image retrieval system using FPGAs
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
IEEE Transactions on Computers
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
Area-Time Optimal Fast Implementation of Several Functions in a VLSI Model
IEEE Transactions on Computers
IEEE Transactions on Computers
The Analysis and Design of Some New Sorting Machines
IEEE Transactions on Computers
IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
ROE sorting on ILLIAC array processor
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Parallel Generation of l-Sequences
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
The complexity of contract negotiation
Artificial Intelligence
IBM Journal of Research and Development
Efficient hardware algorithms for n choose k counters
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Discrete Applied Mathematics
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.06 |