English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Assume that an $N$-bit sequence $S$ of $k$ self-delimiting numbers is givenas input. We present space-efficient algorithms for sorting, dense ranking and(competitive) ranking $S$ on the word RAM model with word size $\Omega(\log N)$bits. Our algorithms run in $O(k + \frac{N}{\log N})$ time and use $O(N)$ bits.The sorting algorithm returns the given numbers in sorted order, stored withina bit-vector of $N$ bits, whereas our ranking algorithms construct datastructures that allow 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 togetherwith $x$.  As an application of our algorithms we give an algorithm for treeisomorphism, which runs in $O(n)$ time and uses $O(n)$ bits on $n$-node trees.The previous best linear-time algorithm for tree isomorphism uses $\Theta(n\log n)$ bits.

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