Cover Image

An Algorithm to Recover Shredded Random Matrices

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Atamanchuk, Caelan, Devroye, Luc, Vicenzo, Massimo
Format:	Preprint
Published:	2023
Subjects:	Probability Discrete Mathematics Data Structures and Algorithms Combinatorics 60C05 (Primary) 68Q25 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
by: Mühlenthaler, Moritz, et al.
Published: (2024)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

BFS versus DFS for random targets in ordered trees
by: Dimitrov, Stoyan, et al.
Published: (2024)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
by: Meusel, Julia, et al.
Published: (2025)

Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
by: Bonnet, Édouard, et al.
Published: (2026)

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

Rumors on evolving graphs through stationary times
by: Bonasorte, Vicenzo
Published: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Sublinear-Time Computation in the Presence of Online Erasures
by: Kalemaj, Iden, et al.
Published: (2021)

Answering Related Questions
by: Bonnet, Édouard
Published: (2025)

Coloring Hardness on Low Twin-Width Graphs
by: Bonnet, Édouard
Published: (2025)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
by: Kunisky, Dmitriy, et al.
Published: (2023)

Algorithms for the ferromagnetic Potts model on expanders
by: Carlson, Charlie, et al.
Published: (2022)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
by: Davari, Morteza, et al.
Published: (2025)

Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
by: Chen, Yeyuan
Published: (2024)

Boltzmann Distribution on "Short" Integer Partitions with Power Parts: Limit Laws and Sampling
by: Peyen, Jean C., et al.
Published: (2023)

Boltzmann Sampling for Powersets without an Oracle
by: Peyen, Jean
Published: (2026)

Integrating High-Dimensional Functions Deterministically
by: Gamarnik, David, et al.
Published: (2024)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Strong spatial mixing for colorings on trees and its algorithmic applications
by: Chen, Zongchen, et al.
Published: (2023)

Cycle-factors of regular graphs via entropy
by: Christoph, Micha, et al.
Published: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
by: Bansal, Nikhil, et al.
Published: (2025)

Probabilistic estimates of the diameters of the Rubik's Cube groups
by: Hirata, So
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

On balanceable and simply balanceable regular graphs
by: Ahanjideh, Milad, et al.
Published: (2024)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Resolving Sets in Temporal Graphs
by: Bok, Jan, et al.
Published: (2024)