2 citations · 2 across the 4 of their papers we have counts for
5 papers
Minimum-Cost -Arborescence Packing in Time
Zhaienhe Zhou
We give a deterministic, strongly polynomial algorithm running in time that finds arc-disjoint arborescences of minimum total cost in a directed multigraph…
Incremental Directed Minimum Cut by Dynamizing Gabow's Algorithm
Thatchaphol Saranurak, Kaiyang Xie, Zhaienhe Zhou
We give the first incremental algorithm for directed global minimum cut. Given a directed graph with vertices undergoing edge insertions, our deterministic algorithm explic…
High-Rate Public-Key Pseudorandom Codes for Edit Errors
Shengtang Huang, Xin Li, Songtao Mao +1
Pseudorandom codes (PRCs), introduced by Christ and Gunn (CRYPTO '2024), are error-correcting codes whose codewords are computationally indistinguishable from uniformly random stri…
Improved Decoding of Tanner Codes
Zhaienhe Zhou, Zeyu Guo
In this paper, we present improved decoding algorithms for expander-based Tanner codes. We begin by developing a randomized linear-time decoding algorithm that, under the condition…
Algorithms for Sparse LPN and LSPN Against Low-noise
Xue Chen, Wenxuan Shu, Zhaienhe Zhou
We consider sparse variants of the classical Learning Parities with random Noise (LPN) problem. Our main contribution is a new algorithmic framework that provides learning algorith…