ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “data structures”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.PLTheoreticalRecentAug 11, 2026

A Rig of Transformations

Emma Tye

The paper presents a model of finite algebraic data types as a commutative rig to describe data layouts and their transformations in high-level functional languages.

View →
cs.DCcs.DSEmpiricalRecentJun 27, 2026

Concurrent Splay-Based Tree

Vitaly Aksenov, Rene van Bevern, Artem Shilkin

This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.

View →
math.COcs.DMmath.CTTheoreticalRecentJul 9, 2026

Subword representations and weak hypercube dimension for acyclic categories

Isaac Carcacía-Campos

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

View →
cs.DSTheoreticalRecentJun 14, 2026

Resizable Retrieval

William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou +1 more

The paper presents a resizable data structure for dynamic retrieval with O(1) time operations and space bound parameterized by the current size of the set.

View →
cs.DMcs.DSmath.COTheoreticalRecentJun 16, 2026

An alternative way of defining finite graphs

Maxim Nazarov

The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.DMTheoreticalRecentJun 12, 2026

The Genesis Sequence, Tree Records and Endofunctions

Enrica Duchi, Adrián Lillo, Pablo Puerto, Mercedes Rosas +1 more

The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…

View →
cs.PLcs.SETheoreticalRecentJul 17, 2026

A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)

Giacomo Boldini, Luca Negrini, Luca Olivieri, Pietro Ferrara

The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.

View →
math.COcs.DMq-bio.PETheoreticalRecentJun 12, 2026

Note on the Maximum Number of Trees Displayed by a Tree-Child Network

Yukihiro Murakami, Charles Semple

This paper proves that the number of distinct rooted binary phylogenetic trees displayed by a binary tree-child network with n leaves is at most 2^(n-1)-1, and shows that this upper bound is sharp.

View →
cs.DCcs.CCcs.FLTheoreticalRecentJun 9, 2026

Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties

Chiara Piombi

The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.

View →
cs.DCcs.PFEmpiricalRecentJun 27, 2026

Five Ways to Build a Concurrent Linked From Coarse-Grain Locking to Lock-Free Algorithms

Zeeshan Mohammed Rangrej

This paper explores five methods for making a linked list work efficiently with multiple threads, from using one big lock to a lock-free design.

View →
math.COcs.CCTheoreticalRecentJul 10, 2026

Cut-homotopies and the complexity of edge-coloring problems

Alexey Barsukov, Roman Feller, Maximilian Hadek, Davide Perinti

The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…

View →
cs.DMTheoreticalRecentJun 14, 2026

Structural Lemmas on Temporal Connectivity

Daniele Carnevale, Arnaud Casteigts, David Schindl

This paper presents lemmas on the structure of temporal connectivity in temporal graphs.

View →
cs.DScs.DMTheoreticalRecentAug 17, 2026

Efficient Enumeration of Enclosed Vector Spaces

Anna Bernasconi, Valentina Ciriani, Alessio Conte, Alberto L'Episcopo +1 more

This paper presents algorithms to enumerate and find maximal enclosed vector subspaces in a given set of vectors over a finite field, with a quadratic speed-up compared to brute force.

View →