Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism

02/17/2020
by   Frank Kammer, et al.
0

Assume that an N-bit sequence S of k self-delimiting numbers is given as input. We present space-efficient algorithms for sorting, dense ranking and (competitive) ranking S on the word RAM model with word size Ω(log N). Our algorithms run in O(k + N/log N) time and use O(N) bits. The sorting algorithm returns the given numbers in sorted order stored within a bit-vector of N bits whereas our ranking algorithms construct data structures that allows us subsequently to return the (dense) rank of each number x in S in constant time if the position of x in S is given together with x. As an application of our algorithms we give an algorithm for tree isomorphism that runs in O(n) time and uses O(n) bits on n-node trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2017

Sorting Real Numbers in O(n√( n)) Time and Linear Space

We present an O(n√( n)) time and linear space algorithm for sorting real...
research
02/19/2021

Sorting Short Integers

We build boolean circuits of size O(nm^2) and depth O(log(n) + m log(m))...
research
06/02/2022

Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors

Bit vectors are fundamental building blocks of many succinct data struct...
research
02/23/2023

Storage in Computational Geometry

We show that n real numbers can be stored in a constant number of real n...
research
10/25/2019

A Curious Link Between Prime Numbers, the Maundy Cake Problem and Parallel Sorting

We present new theoretical algorithms that sums the n-ary comparators ou...
research
04/04/2019

Proving tree algorithms for succinct data structures

Succinct data structures give space-efficient representations of large a...
research
10/28/2017

Minimax Rates and Efficient Algorithms for Noisy Sorting

There has been a recent surge of interest in studying permutation-based ...

Please sign up or login with your details

Forgot password? Click here to reset