20 results for “data structures”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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.
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.
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.
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.
The paper introduces graph linear notation as an alternative definition for finite graphs, simplifying graph illustration and isomorphism comparison.
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.
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…
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…
The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.
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.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
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.
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…
This paper presents lemmas on the structure of temporal connectivity in temporal graphs.
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.