Image de couverture de livre

Towards a Unified Theory of Time-Varying Data

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bumpus, Benjamin Merlin, Fairbanks, James, Karvonen, Martti, Leal, Wilmer, Simard, Frédéric
Format:	Preprint
Publié:	2024
Sujets:	Category Theory Data Structures and Algorithms 68P05, 68R01, 18D70
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
par: Rahat, Md Tanzeem, et autres
Publié: (2025)

Notes on Randomized Algorithms
par: Aspnes, James
Publié: (2020)

Structured Decompositions: Structural and Algorithmic Compositionality
par: Bumpus, Benjamin Merlin, et autres
Publié: (2022)

Optimal Discretization is Fixed-parameter Tractable
par: Kratsch, Stefan, et autres
Publié: (2020)

Adjacency Labeling Schemes for Small Classes
par: Bonnet, Édouard, et autres
Publié: (2024)

An Allele-Centric Pan-Graph-Matrix Representation for Scalable Pangenome Analysis
par: Garrone, Roberto
Publié: (2025)

Euclidean Affine Functions and Applications to Calendar Algorithms
par: Neri, Cassio, et autres
Publié: (2021)

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Algorithms Transcending the SAT-Symmetry Interface
par: Anders, Markus, et autres
Publié: (2023)

Tight bounds on adjacency labels for monotone graph classes
par: Bonnet, Édouard, et autres
Publié: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
par: Bonnet, Édouard, et autres
Publié: (2023)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
par: Alpay, Faruk, et autres
Publié: (2026)

Local categories: a new framework for partiality
par: Lanfranchi, Marcello, et autres
Publié: (2025)

Binary Jumbled Indexing: Suffix tree histogram
par: Cunha, Luís, et autres
Publié: (2024)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

Optimizing Exact String Matching via Statistical Anchoring
par: Garraoui, Omar
Publié: (2025)

Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
par: Urata, Tsuyoshi, et autres
Publié: (2024)

Compact enumeration for scheduling one machine
par: Vakhania, Nodari
Publié: (2021)

Competitive Data-Structure Dynamization
par: Mathieu, Claire, et autres
Publié: (2020)

Can a Lightweight Automated AI Pipeline Solve Research-Level Mathematical Problems?
par: Meng, Lve, et autres
Publié: (2026)

Grothendieck's Geometric Universes and A Sheaf-Theoretic Foundation of Information Network
par: Inoué, Takao
Publié: (2026)

A Pattern Language for Machine Learning Tasks
par: Rodatz, Benjamin, et autres
Publié: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Shortest Paths in a Weighted Simplicial Complex
par: Chakraborty, Sukrit, et autres
Publié: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Algebraic Databases
par: Schultz, Patrick, et autres
Publié: (2016)

On the Anatomy of Attention
par: Khatri, Nikhil, et autres
Publié: (2024)

Optimal Online Bipartite Matching in Degree-2 Graphs
par: Bhangale, Amey, et autres
Publié: (2025)

The Selective G-Bispectrum and its Inversion: Applications to G-Invariant Networks
par: Mataigne, Simon, et autres
Publié: (2024)

Functors on relational structures which admit both left and right adjoints
par: Dalmau, Víctor, et autres
Publié: (2023)

The Merkle Mountain Belt
par: Cevallos, Alfonso, et autres
Publié: (2025)

Day algebras
par: Robinson, Edmund, et autres
Publié: (2025)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
par: Alpay, Faruk, et autres
Publié: (2026)

The Complexity of Resilience for Digraph Queries
par: Bodirsky, Manuel, et autres
Publié: (2026)

The Beauty of Anisotropic Mesh Refinement: Omnitrees for Efficient Dyadic Discretizations
par: Pollinger, Theresa, et autres
Publié: (2025)

Independent Set Reconfiguration Under Bounded-Hop Token
par: Hatano, Hiroki, et autres
Publié: (2024)

A scalable clustering algorithm to approximate graph cuts
par: Suchan, Leo, et autres
Publié: (2023)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
par: S, Rajeshwari, et autres
Publié: (2022)

Huffman-Bucket Sketch: A Simple $O(m)$ Algorithm for Cardinality Estimation
par: Karppa, Matti
Publié: (2026)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
par: Eslami, Navid, et autres
Publié: (2024)