bibliographer - Venkatesan Guruswami

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Improved Maximally Recoverable LRCs using Skew Polynomials Sivakanth Gopi Venkatesan Guruswami [github]

Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs Venkatesan Guruswami Euiwoong Lee [github]

Rainbow Coloring Hardness via Low Sensitivity Polymorphisms Venkatesan Guruswami Sai Sandeep [github]

On the Hardness of 4-Coloring a 3-Colorable Graph Venkatesan Guruswami Sanjeev Khanna [github]

The Quest for Strong Inapproximability Results with Perfect Completeness Joshua Brakensiek Venkatesan Guruswami [github]

Library Size: 13G (5 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]