:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Zinnia, Nazma Akter, Hanada, Eisuke
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2406.16729
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Heaps and Dijkstra on Pointer Machines
by: van der Hoog, Ivor, et al.
Published: (2026)

Accelerating Graph Similarity Search through Integer Linear Programming
by: D'Ascenzo, Andrea, et al.
Published: (2025)

Implementing Binary Search Trees in GP 2 (Extended Abstract)
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Tree Search With Predictions
by: Dinitz, Michael, et al.
Published: (2026)

The Kernighan-Lin Search Algorithm
by: Dasdan, Ali
Published: (2025)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
by: Ma, Xinran, et al.
Published: (2025)

Local Search k-means++ with Foresight
by: Conrads, Theo, et al.
Published: (2024)

Dynamic Breadth First Search with Predictions
by: Khan, Shahbaz, et al.
Published: (2026)

Competitive Search in the Line and the Star with Predictions
by: Angelopoulos, Spyros
Published: (2023)

Search Trees on Trees via LP
by: Sadeh, Yaniv, et al.
Published: (2025)

Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)

Hierarchical Multicriteria Shortest Path Search
by: Kurbanov, Temirlan, et al.
Published: (2025)

A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

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

Hardness Amplification for Dynamic Binary Search Trees
by: Jiang, Shunhua, et al.
Published: (2024)

Scalable $k$-clique Densest Subgraph Search
by: Ye, Xiaowei, et al.
Published: (2024)

Efficient Semi-External Breadth-First Search
by: Wan, Xiaolong, et al.
Published: (2025)

Quantization for Vector Search under Streaming Updates
by: Aden-Ali, Ishaq, et al.
Published: (2025)

Graph-Based Algorithms for Diverse Similarity Search
by: Anand, Piyush, et al.
Published: (2025)

Searching 2D-Strings for Matching Frames
by: Boneh, Itai, et al.
Published: (2023)

Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)

Local Search for Clustering in Almost-linear Time
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)

A General Technique for Searching in Implicit Sets via Function Inversion
by: Aronov, Boris, et al.
Published: (2023)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
by: Jansen, Bart M. P., et al.
Published: (2024)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
by: Bilò, Davide, et al.
Published: (2024)

Local Search-based Individually Fair Clustering with Outliers
by: Maity, Binita, et al.
Published: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
by: Anand, Aditya, et al.
Published: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
by: Sharma, Eklavya
Published: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
by: Khanna, Sanjeev, et al.
Published: (2025)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
by: Li, Binhong, et al.
Published: (2025)

Scalable Similarity Search over Large Attributed Bipartite Graphs
by: Ou, Xi, et al.
Published: (2025)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
by: Feng, Shiyuan, et al.
Published: (2025)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Towards Efficient Data Structures for Approximate Search with Range Queries
by: Kian, Ladan, et al.
Published: (2026)

A Theoretical Framework for Distribution-Aware Dataset Search
by: Esmailpour, Aryan, et al.
Published: (2025)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
by: Dehghankar, Mohsen, et al.
Published: (2025)

Fun Maximizing Search, (Non) Instance Optimality, and Video Games for Parrots
by: Barbay, Jérémy
Published: (2024)

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
by: Donkers, Huib, et al.
Published: (2021)