Imagen de Portada

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hamada, Kou, Chakraborty, Sankardeep, Jo, Seungbum, Koriyama, Takuto, Sadakane, Kunihiko, Satti, Srinivasa Rao
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Databases
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Succinct Data Structures for Baxter Permutation and Related Families
por: Chakraborty, Sankardeep, et al.
Publicado: (2024)

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation
por: Balakrishnan, Girish, et al.
Publicado: (2023)

Encodings for Range Minimum Queries over Bounded Alphabets
por: Jo, Seungbum, et al.
Publicado: (2026)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
por: Balakrishnan, Girish, et al.
Publicado: (2024)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
por: Chakraborty, Sankardeep, et al.
Publicado: (2026)

Simple Analysis of Priority Sampling
por: Daliri, Majid, et al.
Publicado: (2023)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
por: Ning, Baoling, et al.
Publicado: (2024)

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
por: Jo, Seungbum, et al.
Publicado: (2022)

Optimal Dynamic Parameterized Subset Sampling
por: Gan, Junhao, et al.
Publicado: (2024)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
por: Ould-Khessal, Nadir, et al.
Publicado: (2026)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

Grafite: Taming Adversarial Queries with Optimal Range Filters
por: Costa, Marco, et al.
Publicado: (2023)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
por: Balasubramanian, Shrinivass Arunachalam
Publicado: (2025)

Optimal Matrix Sketching over Sliding Windows
por: Yin, Hanyan, et al.
Publicado: (2024)

On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond
por: Stoian, Mihail, et al.
Publicado: (2022)

Explaining Rankings with Hidden Group Bonuses
por: Yan, Alvin Hong Yao, et al.
Publicado: (2026)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
por: Schäfer, Patrick, et al.
Publicado: (2022)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

Weighted Fourier Factorizations: Optimal Gaussian Noise for Differentially Private Marginal and Product Queries
por: Lebeda, Christian Janos, et al.
Publicado: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
por: Gao, Jianyang, et al.
Publicado: (2024)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
por: Berkholz, Christoph, et al.
Publicado: (2025)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
por: Lin, Wenqing, et al.
Publicado: (2025)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

Improved Approximation Algorithms for Relational Clustering
por: Esmailpour, Aryan, et al.
Publicado: (2024)

Algorithms for Optimizing Acyclic Queries
por: Luo, Zheng, et al.
Publicado: (2025)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
por: Zhong, Ming, et al.
Publicado: (2023)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
por: Arenas, Marcelo, et al.
Publicado: (2024)

Sampling Methods for Inner Product Sketching
por: Daliri, Majid, et al.
Publicado: (2023)

Approaching 100% Confidence in Stream Summary through ReliableSketch
por: Wu, Yuhan, et al.
Publicado: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)

Computing Data Distribution from Query Selectivities
por: Agarwal, Pankaj K., et al.
Publicado: (2024)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
por: Wang, Kaixin, et al.
Publicado: (2026)

Parallel Dynamic Spatial Indexes
por: Men, Ziyang, et al.
Publicado: (2026)

Faster Relational Algorithms Using Geometric Data Structures
por: Esmailpour, Aryan, et al.
Publicado: (2026)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
por: Koehler, Henning, et al.
Publicado: (2025)