3 papers
cs.DS2026
Faster and simpler traversal of 0/1-polytopes
JiÅÃ Fink, Petr HladÃk, Arturo Merino +2
Recently, Merino and Mütze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope , where $X\subseteq\{0,1\}^n…
math.CO2024
Generating all invertible matrices by row operations
Petr Gregor, Hung P. Hoang, Arturo Merino +1
We show that all invertible matrices over any finite field can be generated in a Gray code fashion. More specifically, there exists a listing such that…
cs.DS2024
Cache-Oblivious Representation of B-Tree Structures
Lukáš OndráÄek, OndÅej MiÄka
We propose a general data structure CORoBTS for storing B-tree-like search trees dynamically in a cache-oblivious way combining the van Emde Boas memory layout with packed memory a…