2 papers
cs.CC2020
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
Siddharth Bhandari, Prahladh Harsha
Recently, Cohen, Haeupler and Schulman gave an explicit construction of binary tree codes over polylogarithmic-sized output alphabet based on Pudlák's construction of maximum-dista…
cs.DS2019
Improved Bounds for Perfect Sampling of -Colorings in Graphs
Siddharth Bhandari, Sayantan Chakraborty
We present a randomized algorithm that takes as input an undirected -vertex graph with maximum degree and an integer , and returns a random proper -coloring o…