Dynamic data structures for twin-ordered matrices

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Bosek, Bartłomiej, Czyżewska, Jadwiga, Kipouridis, Evangelos, Nadara, Wojciech, Pilipczuk, Michał, Węgrzycki, Karol, Zych-Pawlewicz, Anna
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915810989047808
author Bosek, Bartłomiej
Czyżewska, Jadwiga
Kipouridis, Evangelos
Nadara, Wojciech
Pilipczuk, Michał
Węgrzycki, Karol
Zych-Pawlewicz, Anna
author_facet Bosek, Bartłomiej
Czyżewska, Jadwiga
Kipouridis, Evangelos
Nadara, Wojciech
Pilipczuk, Michał
Węgrzycki, Karol
Zych-Pawlewicz, Anna
contents We present a dynamic data structure for representing binary $n\times n$ matrices that are $d$-twin-ordered, for a~fixed parameter $d$. Our structure supports cell queries and single-cell updates both in $\Oh(\log \log n)$ expected worst case time, while using $\Oh_d(n)$ memory; here, the $\Oh_d(\cdot)$ notation
format Preprint
id arxiv_https___arxiv_org_abs_2602_18770
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Dynamic data structures for twin-ordered matrices
Bosek, Bartłomiej
Czyżewska, Jadwiga
Kipouridis, Evangelos
Nadara, Wojciech
Pilipczuk, Michał
Węgrzycki, Karol
Zych-Pawlewicz, Anna
Data Structures and Algorithms
We present a dynamic data structure for representing binary $n\times n$ matrices that are $d$-twin-ordered, for a~fixed parameter $d$. Our structure supports cell queries and single-cell updates both in $\Oh(\log \log n)$ expected worst case time, while using $\Oh_d(n)$ memory; here, the $\Oh_d(\cdot)$ notation
title Dynamic data structures for twin-ordered matrices
topic Data Structures and Algorithms
url https://arxiv.org/abs/2602.18770