| On the connectivity and giant component size of random k-out graphs under randomly deleted nodes EC Elumar, M Sood, O Yağan 2021 IEEE International Symposium on Information Theory (ISIT), 2572-2577, 2021 | 7 | 2021 |
| Multi-armed bandits with costly probes EC Elumar, C Tekin, O Yağan IEEE Transactions on Information Theory, 2024 | 5 | 2024 |
| Analyzing R-Robustness of Random K-Out Graphs for the Design of Robust Networks EC Elumar, O Yağan ICC 2023-IEEE International Conference on Communications, 5946-5952, 2023 | 3 | 2023 |
| Robustness of random K-out graphs EC Elumar, O Yağan 2021 60th IEEE Conference on Decision and Control (CDC), 5526-5531, 2021 | 3 | 2021 |
| Multi-armed bandits with probing EC Elumar, C Tekin, O Yağan 2024 IEEE International Symposium on Information Theory (ISIT), 2080-2085, 2024 | 2 | 2024 |
| On the robustness, connectivity and giant component size of random K-out graphs EC Elumar, M Sood, O Yağan arXiv preprint arXiv:2311.02319, 2023 | 2 | 2023 |
| On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs M Sood, EC Elumar, O Yagan arXiv preprint arXiv:2508.11863, 2025 | 1 | 2025 |
| Cost-aware LLM-based Online Dataset Annotation EC Elumar, C Tekin, O Yagan arXiv preprint arXiv:2505.15101, 2025 | 1 | 2025 |
| Bandits with anytime knapsacks EC Elumar, C Tekin, O Yagan arXiv preprint arXiv:2501.18560, 2025 | 1 | 2025 |
| Multi-Armed Bandits with Probes and Knapsacks: Algorithms, Theory and Applications EC Elumar Carnegie Mellon University, 2025 | | 2025 |
| Multi-armed bandits with probing multi-armed C Tekin, EC Elumar, O Yagan IEEE, 0 | | |
