Deterministic sampling—a new technique for fast pattern matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Constant-time parallel integer sorting
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Optimal schedules for parallel prefix computation with bounded resources
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
List ranking and list scan on the Cray C-90
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Efficient low-contention parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Finding level-ancestors in trees
Journal of Computer and System Sciences
The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints
IEEE Transactions on Computers
Scalable Parallel Implementations of List Ranking on Fine-Grained Machines
IEEE Transactions on Parallel and Distributed Systems
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Class of Depth-Size Optimal Parallel Prefix Circuits
The Journal of Supercomputing
Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism
Journal of Experimental Algorithmics (JEA)
Optimal and efficient algorithms for summing and prefix summing on parallel machines
Journal of Parallel and Distributed Computing
Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit
The Journal of Supercomputing
A Family of Parallel Prefix Algorithms Embedded in Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel prefix computation on extended multi-mesh network
Information Processing Letters
On Identifying Strongly Connected Components in Parallel
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Portable List Ranking: An Experimental Study
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Portable list ranking: an experimental study
Journal of Experimental Algorithmics (JEA)
Z4: a new depth-size optimal parallel prefix circuit with small depth
Neural, Parallel & Scientific Computations
A new approach to constructing optimal parallel prefix circuits with small depth
Journal of Parallel and Distributed Computing
Finding strongly connected components in distributed graphs
Journal of Parallel and Distributed Computing
Faster optimal parallel prefix circuits: New algorithmic construction
Journal of Parallel and Distributed Computing
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
Nordic Journal of Computing
Reconfigurable hardware solution to parallel prefix computation
The Journal of Supercomputing
Computation-efficient parallel prefix
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Parallel prefix algorithms on the multicomputer
WSEAS Transactions on Computer Research
Fast problem-size-independent parallel prefix circuits
Journal of Parallel and Distributed Computing
Fast and scalable list ranking on the GPU
Proceedings of the 23rd international conference on Supercomputing
New parallel prefix algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
New families of computation-efficient parallel prefix algorithms
WSEAS Transactions on Computers
Parallel algorithms for finding SCCs in implicitly given graphs
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Reasoning in multi-agent systems with random knowledge distribution
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Brief announcement: truly parallel burrows-wheeler compression and decompression
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
A class of almost-optimal size-independent parallel prefix circuits
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |