Conference
Items from CaltechAUTHORS
- Pham, Huy Tuan (2025) A Sharp
Version of Talagrand’s Selector Process Conjecture and an Application to
Rounding Fractional Covers; Proceedings of the 57th Annual ACM
Symposium on Theory of Computing; 322-328; 10.1145/3717823.3718256
- Jain, Vishesh; Michelen, Marcus; et al. (2023) Optimal
mixing of the down-up walk on independent sets of a given size; 2023
IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);
1665-1681; 10.1109/focs57990.2023.00101
- Arieli, Itai; Babichenkoyako, Yakov; et al. (2023) The
Hazards and Benefits of Condescension in Social Learning; ISBN
9798400701047; EC ’23: Proceedings of the 24th ACM Conference on
Economics and Computation; ACM: New York, NY; 119; 10.1145/3580507.3597752
- Park, Jinyoung and Pham, Huy Tuan (2022) A Proof
of the Kahn-Kalai Conjecture; 2022 IEEE 63rd Annual Symposium on
Foundations of Computer Science (FOCS); 636-639; 10.1109/focs54457.2022.00066
- Anari, Nima; Jain, Vishesh; et al. (2022) Entropic
independence: optimal mixing of down-up random walks; Proceedings of
the 54th Annual ACM SIGACT Symposium on Theory of Computing; 1418-1430;
10.1145/3519935.3520048
- Jain, Vishesh; Pham, Huy Tuan; et al. (2022) Towards
the sampling Lovász Local Lemma; 2021 IEEE 62nd Annual Symposium on
Foundations of Computer Science (FOCS); 173-183; 10.1109/focs52979.2021.00025
