Algorithms in the Ultra-Wide Word Model
From MaRDI portal
Publication:2948478
DOI10.1007/978-3-319-17142-5_29zbMath1460.68014arXiv1411.7359OpenAlexW1937925830MaRDI QIDQ2948478
Alejandro Salinger, Patrick K. Nicholson, Arash Farzan, Alejandro López-Ortiz
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7359
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster algorithm computing string edit distances
- Average running time of the Boyer-Moore-Horspool algorithm
- Dynamic programming on the word RAM
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- Optimal bounds for the predecessor problem and related problems
- Algorithms in the Ultra-Wide Word Model
- Dynamic ordered sets with exponential search trees
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
- Deterministic sorting in O(nloglogn) time and linear space