2 papers
cs.DM2025
Tournament Robustness via Redundancy
Klim Efremenko, Hendrik Molter, Meirav Zehavi
A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names.…
cs.DS2025
Unbounded Error Correcting Codes
Klim Efremenko, Or Zamir
Traditional error-correcting codes (ECCs) assume a fixed message length, but many scenarios involve ongoing or indefinite transmissions where the message length is not known in adv…