:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Pfrommer, Jakob, Meyer, Anne, Tierney, Kevin
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2207.09118
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sorting multibay block stacking storage systems
by: Pfrommer, Jakob, et al.
Published: (2024)

Dynamic parameterized problems on unit disk graphs
by: An, Shinwoo, et al.
Published: (2024)

Online matching on stochastic block model
by: Cherifa, Maria, et al.
Published: (2025)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
by: Jaberi, Raed, et al.
Published: (2024)

Solving the all pairs shortest path problem after minor update of a large dense graph
by: Liu, Gangli
Published: (2024)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
by: Dumas, Maël, et al.
Published: (2022)

Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)

Pairwise sequence alignment with block and character edit operations
by: Alıcıoğlu, Ahmet Cemal, et al.
Published: (2023)

Improved online load balancing with known makespan
by: Böhm, Martin, et al.
Published: (2024)

Compressed Game Solving
by: Considine, Jeffrey
Published: (2024)

Faster PBWT prefix-array access via batching
by: Gagie, Travis
Published: (2026)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Entrywise Approximate Laplacian Solving
by: Chen, Jingbang, et al.
Published: (2024)

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

On Solving Linear Systems in Sublinear Time
by: Andoni, Alexandr, et al.
Published: (2018)

Solving Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2025)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
by: Harris, David G.
Published: (2021)

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

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)

Solving Positive Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2026)

Solving the Correlation Cluster LP in Sublinear Time
by: Cao, Nairen, et al.
Published: (2025)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

Layered Graph Drawing with Few Gaps and Few Crossings
by: Dobler, Alexander, et al.
Published: (2025)

Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)

Robust recovery for stochastic block models, simplified and generalized
by: Mohanty, Sidhanth, et al.
Published: (2024)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
by: Shibata, Hiroki, et al.
Published: (2025)

An Objective Improvement Approach to Solving Discounted Payoff Games
by: Dell'Erba, Daniele, et al.
Published: (2024)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
by: Yoshida, Yuichi
Published: (2026)

Symmetry-breaking symmetry in directed spectral partitioning
by: Pasadakis, Dimosthenis, et al.
Published: (2025)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
by: Nogler, Jakob, et al.
Published: (2026)

DNA Probe Computing System for Solving NP-Complete Problems
by: Xu, Jin, et al.
Published: (2025)

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

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
by: Kwok, Tsz Chiu, et al.
Published: (2025)

An FPRAS for two terminal reliability in directed acyclic graphs
by: Feng, Weiming, et al.
Published: (2023)

Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)

Hardness of Dynamic Tree Edit Distance and Friends
by: Hu, Bingbing, et al.
Published: (2025)

The Communication Complexity of Pattern Matching with Edits Revisited
by: Kociumaka, Tomasz, et al.
Published: (2026)

Finite matrix multiplication algorithms from infinite groups
by: Blasiak, Jonah, et al.
Published: (2024)

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
by: Basu, Arpon, et al.
Published: (2025)

Fair densest subgraph across multiple graphs
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)