Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.16398 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Dynamic, Self-balancing k-d Tree
by: Brown, Russell A.
Published: (2025)
by: Brown, Russell A.
Published: (2025)
Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
by: Brown, Russell A.
Published: (2024)
by: Brown, Russell A.
Published: (2024)
Review of Three Algorithms That Build k-d Trees
by: Brown, Russell A.
Published: (2025)
by: Brown, Russell A.
Published: (2025)
Building a Balanced k-d Tree in O(kn log n) Time
by: Brown, Russell A.
Published: (2014)
by: Brown, Russell A.
Published: (2014)
Computing the LZ-End parsing: Easy to implement and practically efficient
by: Dinklage, Patrick
Published: (2024)
by: Dinklage, Patrick
Published: (2024)
Competitive Policies for Online Collateral Maintenance
by: Almashaqbeh, Ghada, et al.
Published: (2024)
by: Almashaqbeh, Ghada, et al.
Published: (2024)
FORWARD: Feasibility Oriented Random-Walk Inspired Algorithm for Radial Reconfiguration in Distribution Networks
by: Vendrell, Joan, et al.
Published: (2024)
by: Vendrell, Joan, et al.
Published: (2024)
An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)
by: Liu, Gangli
Published: (2024)
On Parallel $k$-Center Clustering
by: Coy, Sam, et al.
Published: (2023)
by: Coy, Sam, et al.
Published: (2023)
A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
by: Armbruster, Susanne, et al.
Published: (2024)
by: Armbruster, Susanne, et al.
Published: (2024)
Log Diameter Rounds MST Verification and Sensitivity in MPC
by: Coy, Sam, et al.
Published: (2024)
by: Coy, Sam, et al.
Published: (2024)
Optimal (degree+1)-Coloring in Congested Clique
by: Coy, Sam, et al.
Published: (2023)
by: Coy, Sam, et al.
Published: (2023)
Parallel Derandomization for Coloring
by: Coy, Sam, et al.
Published: (2023)
by: Coy, Sam, et al.
Published: (2023)
An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
by: Mastikhina, Anna, et al.
Published: (2024)
by: Mastikhina, Anna, et al.
Published: (2024)
A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
by: Lecroq, Thierry
Published: (2024)
by: Lecroq, Thierry
Published: (2024)
Improved Hardness-of-Approximation for Token Swapping
by: Hiken, Sam, et al.
Published: (2024)
by: Hiken, Sam, et al.
Published: (2024)
Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
by: Wang, Samson, et al.
Published: (2023)
by: Wang, Samson, et al.
Published: (2023)
Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
by: Lee, Russell, et al.
Published: (2022)
by: Lee, Russell, et al.
Published: (2022)
Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)
by: Zhou, Guangyan
Published: (2026)
A novel DFS/BFS approach towards link prediction
by: Dörpinghaus, Jens, et al.
Published: (2024)
by: Dörpinghaus, Jens, et al.
Published: (2024)
Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)
by: Jennings, David, et al.
Published: (2023)
String Covering: A Survey
by: Mhaskar, Neerja, et al.
Published: (2022)
by: Mhaskar, Neerja, et al.
Published: (2022)
A Coalgebraic Dijkstra Algorithm
by: Sanada, Takahiro, et al.
Published: (2026)
by: Sanada, Takahiro, et al.
Published: (2026)
A Lock-free Binary Trie
by: Ko, Jeremy
Published: (2024)
by: Ko, Jeremy
Published: (2024)
Online Matching: A Brief Survey
by: Huang, Zhiyi, et al.
Published: (2024)
by: Huang, Zhiyi, et al.
Published: (2024)
A Textbook Solution for Dynamic Strings
by: Lipták, Zsuzsanna, et al.
Published: (2024)
by: Lipták, Zsuzsanna, et al.
Published: (2024)
A Tolerant Independent Set Tester
by: Seth, Cameron
Published: (2025)
by: Seth, Cameron
Published: (2025)
A Theory of Spectral CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)
by: Khanna, Sanjeev, et al.
Published: (2025)
A practical algorithm for 3-admissibility
by: Awofeso, Christine, et al.
Published: (2025)
by: Awofeso, Christine, et al.
Published: (2025)
A Note on Deterministic FPTAS for Partition
by: Chen, Lin, et al.
Published: (2025)
by: Chen, Lin, et al.
Published: (2025)
A Subquadratic Bound for Online Bisection
by: Bienkowski, Marcin, et al.
Published: (2023)
by: Bienkowski, Marcin, et al.
Published: (2023)
A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)
by: Rozenman, Amit Ganz, et al.
Published: (2026)
A Polynomial Decision for 3-SAT
by: Weiss, Angela
Published: (2022)
by: Weiss, Angela
Published: (2022)
A Unified Framework for Hopsets and Spanners
by: Neiman, Ofer, et al.
Published: (2021)
by: Neiman, Ofer, et al.
Published: (2021)
A Note on Rounding Matchings in General Graphs
by: Dudeja, Aditi
Published: (2024)
by: Dudeja, Aditi
Published: (2024)
A Simple Algorithm for Dynamic Carpooling with Recourse
by: Efron, Yuval, et al.
Published: (2024)
by: Efron, Yuval, et al.
Published: (2024)
A Nearly Quadratic Improvement for Memory Reallocation
by: Farach-Colton, Martin, et al.
Published: (2024)
by: Farach-Colton, Martin, et al.
Published: (2024)
A Simple Dynamic Spanner via APSP
by: Kyng, Rasmus, et al.
Published: (2024)
by: Kyng, Rasmus, et al.
Published: (2024)
Wooly Graphs : A Mathematical Framework For Knitting
by: Gray, Kathryn, et al.
Published: (2024)
by: Gray, Kathryn, et al.
Published: (2024)
A basic lower bound for property testing
by: Fischer, Eldar
Published: (2024)
by: Fischer, Eldar
Published: (2024)