Výsledky vyhledávání

Report

Succinct Data Structures for Baxter Permutation and Related Families

Autor: Chakraborty, Sankardeep, Jo, Seungbum, Kim, Geunho, Sadakane, Kunihiko

A permutation $\pi: [n] \rightarrow [n]$ is a Baxter permutation if and only if it does not contain either of the patterns $2-41-3$ and $3-14-2$. Baxter permutations are one of the most widely studied subclasses of general permutation due to their co

Externí odkaz: http://arxiv.org/abs/2409.16650

Zobrazit plný text záznamu

Report

Space-efficient data structure for next/previous larger/smaller value queries

Autor: Jo, Seungbum, Kim, Geunho

Given an array of size $n$ from a total order, we consider the problem of constructing a data structure that supports various queries (range minimum/maximum queries with their variants and next/previous larger/smaller queries) efficiently. In the enc

Externí odkaz: http://arxiv.org/abs/2209.00158

Zobrazit plný text záznamu