Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
From MaRDI portal
Publication:6182920
DOI10.1007/978-3-031-34347-6_30arXiv2002.07287MaRDI QIDQ6182920
Frank Kammer, Andrej Sajenko, Johannes Meintrup
Publication date: 22 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.07287
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for time-space trade-offs in sorting and selection
- Space-efficient Euler partition and bipartite edge coloring
- Space-efficient vertex separators for treewidth
- Rank-select indices without tears
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster
- Space efficient linear time algorithms for BFS, DFS and applications
- Succinct representation of labeled graphs
- A uniform paradigm to succinctly encode various families of trees
- Depth-First Search Using $$O(n)$$ Bits
- Space-efficient Basic Graph Algorithms
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- Efficient Storage and Retrieval by Content and Address of Static Files
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Priority Queues and Sorting for Read-Only Data
- Simple 2^f-Color Choice Dictionaries
- Structural, Syntactic, and Statistical Pattern Recognition
This page was built for publication: Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
