scientific article; zbMATH DE number 1263219
From MaRDI portal
Publication:4234091
zbMATH Open0968.68509MaRDI QIDQ4234091FDOQ4234091
Authors:
Publication date: 29 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (37)
- Title not available (Why is that?)
- OptORAMa: optimal oblivious RAM
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- A unified view to string matching algorithms
- OptORAMa: Optimal oblivious RAM
- New algorithms for binary jumbled pattern matching
- Approximating Huffman codes in parallel
- Improved fast integer sorting in linear space
- A novel quantum anonymous ranking protocol
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Improved parallel integer sorting without concurrent writing
- More Efficient Parallel Integer Sorting
- Sorting short integers: the exposition
- Improving the efficiency of parallel minimum spanning tree algorithms
- Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
- On the approximation of Euclidean SL via geometric method
- Fast Evaluation of Union-Intersection Expressions
- Succinct data structures for flexible text retrieval systems
- Title not available (Why is that?)
- The range 1 query (R1Q) problem
- Computational Science – ICCS 2005
- Sorting in linear time?
- Sorting numbers in linear expected time and optimal extra space
- General document retrieval in compact space
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Improved nonconservative sequential and parallel integer sorting
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Neighbours on a grid
- Upper bounds for sorting integers on random access machines
- When can we sort in \(o(n\log n)\) time?
- An improved Dijkstra's shortest path algorithm for sparse network
- Radix Sorting with No Extra Space
- Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
- Rotation and lighting invariant template matching
- Lower bounds for dynamic algebraic problems
- Title not available (Why is that?)
- Sorting and searching revisted
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)
