:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wan, Xiaolong, Han, Xixian
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2507.12925
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Breadth First Search with Predictions
par: Khan, Shahbaz, et autres
Publié: (2026)

Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
par: Jiang, Zite, et autres
Publié: (2020)

Breadth-First Search Trees with Many or Few Leaves
par: Beisegel, Jesse, et autres
Publié: (2026)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
par: Elberfeld, Michael, et autres
Publié: (2025)

Testing Depth First Search Numbering
par: Czumaj, Artur, et autres
Publié: (2025)

Buffered Partially-Persistent External-Memory Search Trees
par: Brodal, Gerth Stølting, et autres
Publié: (2025)

The Case for External Graph Sketching
par: Bender, Michael A., et autres
Publié: (2025)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
par: Bilò, Davide, et autres
Publié: (2024)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
par: Andoni, Alexandr, et autres
Publié: (2026)

Towards Efficient Data Structures for Approximate Search with Range Queries
par: Kian, Ladan, et autres
Publié: (2026)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
par: Jang, Jihoon, et autres
Publié: (2025)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
par: McCauley, Samuel
Publié: (2024)

Minimizers in Semi-Dynamic Strings
par: Zuba, Wiktor, et autres
Publié: (2025)

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
par: Kalavasis, Alkis, et autres
Publié: (2024)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
par: Shimoda, Takumi, et autres
Publié: (2024)

Semi-Streaming Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2025)

Engineering Semi-streaming DFS algorithms
par: Bhagavan, Kancharla Nikhilesh, et autres
Publié: (2024)

Semi-Robust Communication Complexity of Maximum Matching
par: Huete, Gabriel Cipriani, et autres
Publié: (2025)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
par: Dhar, Saurav, et autres
Publié: (2024)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
par: Flin, Maxime, et autres
Publié: (2026)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
par: Barak, Zohar, et autres
Publié: (2026)

Faster Semi-streaming Matchings via Alternating Trees
par: Mitrović, Slobodan, et autres
Publié: (2024)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
par: Ferdous, S M, et autres
Publié: (2023)

Tree Search With Predictions
par: Dinitz, Michael, et autres
Publié: (2026)

Optimizing Search Strategies: A Study of Two-Pointer Linear Search Implementation
par: Zinnia, Nazma Akter, et autres
Publié: (2024)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
par: Buchbinder, Niv, et autres
Publié: (2026)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
par: Tacheny, Nicolas
Publié: (2026)

The Kernighan-Lin Search Algorithm
par: Dasdan, Ali
Publié: (2025)

Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
par: Wan, Joy Z.
Publié: (2024)

Search Trees on Trees via LP
par: Sadeh, Yaniv, et autres
Publié: (2025)

Hierarchical Multicriteria Shortest Path Search
par: Kurbanov, Temirlan, et autres
Publié: (2025)

Competitive Search in the Line and the Star with Predictions
par: Angelopoulos, Spyros
Publié: (2023)

Local Search k-means++ with Foresight
par: Conrads, Theo, et autres
Publié: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

First Passage Percolation with Queried Hints
par: Karntikoon, Kritkorn, et autres
Publié: (2024)

Quantization for Vector Search under Streaming Updates
par: Aden-Ali, Ishaq, et autres
Publié: (2025)

Graph-Based Algorithms for Diverse Similarity Search
par: Anand, Piyush, et autres
Publié: (2025)

Local Search for Clustering in Almost-linear Time
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)