:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Sepúlveda, Mauricio Vargas
Format:	Preprint
Published:	2024
Subjects:	Computation Data Structures and Algorithms Econometrics E.1; G.3; J.4
Online Access:	https://arxiv.org/abs/2408.09618
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
by: Mukhopadhyay, Asish, et al.
Published: (2024)

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
by: Blondin, Michael, et al.
Published: (2024)

Testing the Fairness-Accuracy Improvability of Algorithms
by: Auerbach, Eric, et al.
Published: (2024)

Harvesting Brownian Motion: Zero Energy Computational Sampling
by: Doty, David, et al.
Published: (2023)

Reserve Matching with Thresholds
by: Evren, Suat
Published: (2023)

Finding the Center and Centroid of a Graph with Multiple Sources
by: Chou, Matthew
Published: (2024)

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
by: Akef, Hamidreza, et al.
Published: (2025)

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers
by: Adams, Philip, et al.
Published: (2025)

Estimating Parameters of Structural Models Using Neural Networks
by: Yanhao, et al.
Published: (2025)

New Entropy Measures for Tries with Applications to the XBWT
by: Carfagna, Lorenzo, et al.
Published: (2025)

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
by: Koch, Stefan, et al.
Published: (2025)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
by: Pulyassary, Haripriya, et al.
Published: (2025)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
by: Sitters, René
Published: (2025)

Rahmani Sort: A Novel Variant of Insertion Sort Algorithm with O(nlogn) Complexity
by: Rahmani, Mohammad Khalid Imam
Published: (2024)

How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
by: von Geijer, Kåre, et al.
Published: (2024)

Optimal Secure Coded Distributed Computation over all Fields
by: Soto, Pedro
Published: (2025)

Pre-Training Estimators for Structural Models: Application to Consumer Search
by: Wei, Yanhao 'Max', et al.
Published: (2025)

Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
by: Vershynin, Roman
Published: (2007)

Limits of Approximating the Median Treatment Effect
by: Addanki, Raghavendra, et al.
Published: (2024)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Generalized compression and compressive search of large datasets
by: Prior, Morgan E., et al.
Published: (2024)

ConflictSync: Bandwidth Efficient Synchronization of Divergent State
by: Gomes, Pedro Silva, et al.
Published: (2025)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
by: Baruchel, Thomas
Published: (2025)

Fast Approximate Determinants Using Rational Functions
by: Colthurst, Thomas, et al.
Published: (2024)

Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
by: Sankar, Arvind, et al.
Published: (2003)

The Structural Bite: A Methodological Framework for Minimum Wage Studies using Spanish Administrative Data
by: Lacasa-Cazcarra, Marcos
Published: (2026)

Properties of Egalitarian Sequences of Committees: Theory and Experiments
by: Böhm, Paula, et al.
Published: (2025)

Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
by: Marot-Lassauzaie, Marc, et al.
Published: (2025)

Highway Preferential Attachment Models for Geographic Routing
by: Gila, Ofek, et al.
Published: (2024)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
by: Lecroq, Thierry
Published: (2024)

MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
by: Hermann, Stefan
Published: (2025)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
by: Gila, Ofek, et al.
Published: (2023)

Cache-Oblivious Representation of B-Tree Structures
by: Ondráček, Lukáš, et al.
Published: (2022)

Fast Geographic Routing in Fixed-Growth Graphs
by: Gila, Ofek, et al.
Published: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

Kernel Ridge Riesz Representers: Generalization, Mis-specification, and the Counterfactual Effective Dimension
by: Singh, Rahul
Published: (2021)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
by: Agarwala, Aryan, et al.
Published: (2024)

Optimal rolling of fair dice using fair coins
by: Huber, Mark, et al.
Published: (2024)