Scalable and Efficient Comparison-based Search without Features D Chumbalov, L Maystre, M Grossglauser ICML 2020, 2019 | 9* | 2019 |
Randomized polynomial time protocol for combinatorial Slepian-Wolf problem D Chumbalov, A Romashchenko International Symposium on Mathematical Foundations of Computer Science, 235-247, 2015 | 3 | 2015 |
Combinatorial Version of the Slepian–Wolf Coding Theorem for Binary Strings DA Chumbalov Сибирские электронные математические известия 10 (0), 656-665, 2013 | 3 | 2013 |
On the combinatorial version of the Slepian–Wolf problem D Chumbalov, A Romashchenko IEEE Transactions on Information Theory 64 (9), 6054-6069, 2018 | 2 | 2018 |
Fast interactive search under a scale-free comparison oracle D Chumbalov, LH Klein, L Maystre, M Grossglauser Proceedings of the 40th Conference on Uncertainty in Artificial Intelligence …, 2024 | | 2024 |
Fast Interactive Search with a Scale-Free Comparison Oracle D Chumbalov, L Klein, L Maystre, M Grossglauser arXiv preprint arXiv:2306.01814, 2023 | | 2023 |
Stochastic Models for Comparison-based Search D Chumbalov EPFL, 2023 | | 2023 |