Cover Image

Zip-Tries: Simple Dynamic Data Structures for Strings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Eppstein, David, Gila, Ofek, Goodrich, Michael T., Kitagawa, Ryuto
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
by: Gila, Ofek, et al.
Published: (2026)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
by: Goodrich, Michael T., et al.
Published: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
by: Goodrich, Michael T., et al.
Published: (2024)

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

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
by: Eppstein, David, et al.
Published: (2025)

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

Parallel Joinable B-Trees in the Fork-Join I/O Model
by: Goodrich, Michael, et al.
Published: (2025)

Visualizing Treewidth
by: Chiu, Alvin, et al.
Published: (2025)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
by: Gila, Ofek, et al.
Published: (2025)

Fast Schulze Voting Using Quickselect
by: Arora, Arushi, et al.
Published: (2024)

Maintaining Light Spanners via Minimal Updates
by: Khodabandeh, Hadi, et al.
Published: (2024)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

Engineering Rank/Select Data Structures for Large-Alphabet Strings
by: Arroyuelo, Diego, et al.
Published: (2023)

Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)

A Textbook Solution for Dynamic Strings
by: Lipták, Zsuzsanna, et al.
Published: (2024)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)

Longest Common Extension of a Dynamic String in Parallel Constant Time
by: Albert, Daniel
Published: (2026)

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Simple Algorithms for Fully Dynamic Edge Connectivity
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)

A Simple Algorithm for Dynamic Carpooling with Recourse
by: Efron, Yuval, et al.
Published: (2024)

A Simple Dynamic Spanner via APSP
by: Kyng, Rasmus, et al.
Published: (2024)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)

Online String Attractors
by: Whittington, Philip
Published: (2024)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
by: Caroppo, Susanna, et al.
Published: (2025)

The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
by: Munch, Elizabeth, et al.
Published: (2025)

String Covering: A Survey
by: Mhaskar, Neerja, et al.
Published: (2022)

Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)

Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)

String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)

Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)

Indexing Tries within Entropy-Bounded Space
by: Carfagna, Lorenzo, et al.
Published: (2025)

Online Computation of Palindromes and Suffix Trees on Tries
by: Shibata, Hiroki, et al.
Published: (2026)

Computing String Covers in Sublinear Time
by: Radoszewski, Jakub, et al.
Published: (2024)

Algorithms for Parameterized String Matching with Mismatches
by: Saha, Apurba, et al.
Published: (2024)

Online Computation of String Net Frequency
by: Guo, Peaker, et al.
Published: (2024)

Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)

String Matching with a Dynamic Pattern
by: Monteiro, Bruno, et al.
Published: (2025)