Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Improved nonconservative sequential and parallel integer sorting
Information Processing Letters
Improved deterministic parallel integer sorting
Information and Computation
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Improved parallel integer sorting without concurrent writing
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Computer organization & design: the hardware/software interface
Computer organization & design: the hardware/software interface
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic algebraic problems
Information and Computation
Deterministic sorting in O(nlog log n) time and linear space
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved fast interger sorting in linear space
Information and Computation
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Sorting and Searching using Ternary CAMs
IEEE Micro
Efficient Strongly Universal and Optimally Universal Hashing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Paging on a RAM with Limited Resources
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Space-Efficient Data Structures for Flexible Text Retrieval Systems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Fast Integer Sorting in Linear Space
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Future Generation Computer Systems - Systems performance analysis and evaluation
Fast string sorting using order-preserving compression
Journal of Experimental Algorithmics (JEA)
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Rotation and lighting invariant template matching
Information and Computation
Approximating Huffman codes in parallel
Journal of Discrete Algorithms
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Interval Stabbing Problems in Small Integer Ranges
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Improving parallel computation with fast integer sorting
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Fast evaluation of union-intersection expressions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
More efficient parallel integer sorting
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
New algorithms for binary jumbled pattern matching
Information Processing Letters
| Hi-index | 0.00 |