scientific article; zbMATH DE number 1263219
From MaRDI portal
Publication:4234091
Recommendations
Cited in
(39)- Sorting numbers in linear expected time and optimal extra space
- Sorting in linear time?
- When can we sort in o(n n) time?
- Improved parallel integer sorting without concurrent writing
- The range 1 query (R1Q) problem
- Improved fast integer sorting in linear space
- Lower bounds for dynamic algebraic problems
- Improving the efficiency of parallel minimum spanning tree algorithms
- OptORAMa: optimal oblivious RAM
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- Rotation and lighting invariant template matching
- New algorithms for binary jumbled pattern matching
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- Approximating Huffman codes in parallel
- A novel quantum anonymous ranking protocol
- scientific article; zbMATH DE number 1629826 (Why is no real title available?)
- General document retrieval in compact space
- Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
- Radix Sorting with No Extra Space
- scientific article; zbMATH DE number 4090816 (Why is no real title available?)
- scientific article; zbMATH DE number 2079401 (Why is no real title available?)
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Sorting and searching revisted
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Neighbours on a grid
- Sorting short integers: the exposition
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Fast Evaluation of Union-Intersection Expressions
- Computational Science – ICCS 2005
- On the approximation of Euclidean SL via geometric method
- More Efficient Parallel Integer Sorting
- A unified view to string matching algorithms
- OptORAMa: Optimal oblivious RAM
- Text indexing for simple regular expressions
- Even faster algorithm for the Chamfer distance
- Upper bounds for sorting integers on random access machines
- An improved Dijkstra's shortest path algorithm for sparse network
- Improved nonconservative sequential and parallel integer sorting
- Succinct data structures for flexible text retrieval systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234091)
