:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Chan-Hon-Tong, Adrien
Format:	Preprint
Published:	2019
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/1901.08525
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solution independence and self-referential instances
by: Zhou, Guangyan, et al.
Published: (2026)

Constructing self-referential instances for the clique problem
by: Li, Jiaqi, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Faster feasibility for dynamic flows and transshipments on temporal networks
by: Sheridan, Kristin, et al.
Published: (2024)

On Constrained and k Shortest Paths
by: Bendahi, Abderrahim, et al.
Published: (2024)

On the instance optimality of detecting collisions and subgraphs
by: Ben-Eliezer, Omri, et al.
Published: (2023)

Stable algorithms cannot reliably find isolated perceptron solutions
by: Gong, Shuyang, et al.
Published: (2026)

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
by: Liu, Bowie, et al.
Published: (2024)

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
by: Furcy, David, et al.
Published: (2024)

The SMART approach to instance-optimal online learning
by: Banerjee, Siddhartha, et al.
Published: (2024)

INTACT: Compact Storage of Data Streams in Mobile Devices to Unlock User Privacy at the Edge
by: Raes, Rémy, et al.
Published: (2025)

Derandomizing Pseudopolynomial Algorithms for Subset Sum
by: Chan, Timothy M.
Published: (2026)

Exactly simulating stochastic chemical reaction networks in sub-constant time per reaction
by: Petrack, Joshua, et al.
Published: (2025)

Improved approximation ratio for covering pliable set families
by: Nutov, Zeev
Published: (2024)

Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
by: Lancia, Giuseppe, et al.
Published: (2024)

Approximation and parameterized algorithms for covering disjointness-compliable set families
by: Nutov, Zeev, et al.
Published: (2025)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Tight analysis of the primal-dual method for edge-covering pliable set families
by: Nutov, Zeev
Published: (2025)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

Computing the LZ-End parsing: Easy to implement and practically efficient
by: Dinklage, Patrick
Published: (2024)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
by: Becchetti, Luca, et al.
Published: (2025)

Space/time-efficient RDF stores based on circular suffix sorting
by: Brisaboa, Nieves R., et al.
Published: (2020)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
by: Yang, Connor, et al.
Published: (2025)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
by: Moreno, Matthew Andres, et al.
Published: (2024)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)

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

Space-efficient SLP encoding for $O(\log N)$-time random access
by: Takasaka, Akito, et al.
Published: (2024)

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
by: Olbrich, Jannik
Published: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
by: Sharman, Bharat, et al.
Published: (2025)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)

OPTWIN: Drift identification with optimal sub-windows
by: Tosi, Mauro Dalle Lucca, et al.
Published: (2023)

Carbonyl4: A Sketch for Set-Increment Mixed Updates
by: Zhao, Yikai, et al.
Published: (2024)

A Fair and Memory/Time-efficient Hashmap
by: Asudeh, Abolfazl, et al.
Published: (2023)

An efficient heuristic for approximate maximum flow computations
by: Qian, Jingyun, et al.
Published: (2024)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

Faster Algorithms for Text-to-Pattern Hamming Distances
by: Chan, Timothy M., et al.
Published: (2023)

Chromatic correlation clustering via cluster LP
by: Abbasi, Fateme, et al.
Published: (2025)

Cache Management for Mixture-of-Experts LLMs -- extended version
by: Angelopoulos, Spyros, et al.
Published: (2025)

Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale: a self-calibrated randomized solution
by: Wu, Changye, et al.
Published: (2018)