Profiles2023-2026
Kiarash Banihashem
Computer Science Department, University of Maryland, College Park
15Papers
0Last author
18Unique co-authors
14First author
0Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers15
- Active Learning for Decision Trees with Provable GuaranteesAuthor 4 of 5ICLR 2026 · 1 citation
- Bandit Social Leaning Dynamics with Exploration EpisodesAuthor 1 of 3ICML 2026 · 1 citation
- Bi-Criteria Metric DistortionAuthor 1 of 7ICLR 2026
- Dynamic Diameter in High-Dimensions against Adaptive Adversary and BeyondAuthor 1 of 6NeurIPS 2025 · 1 citation
- Fair Matroid SelectionAuthor 1 of 3NeurIPS 2025
- Fully Dynamic Embedding into ℓp SpacesAuthor 1 of 7ICML 2025
- Non-monotone Submodular Optimization: p-Matchoid Constraints and Fully Dynamic SettingAuthor 1 of 5NeurIPS 2025
- Replicable Online pricingAuthor 1 of 5NeurIPS 2025
- Dynamic Algorithms for Matroid Submodular MaximizationAuthor 1 of 6SODA 2024 · 5 citations
- A Dynamic Algorithm for Weighted Submodular Cover ProblemAuthor 1 of 5ICML 2024 · 2 citations
- Dynamic Constrained Submodular Optimization with Polylogarithmic Update TimeAuthor 1 of 6ICML 2023 · 8 citations
- Dynamic Non-monotone Submodular MaximizationAuthor 1 of 7NeurIPS 2023 · 7 citations
- Bandit Social Learning under Myopic BehaviorAuthor 1 of 4NeurIPS 2023 · 6 citations
- An Improved Relaxation for Oracle-Efficient Adversarial Contextual BanditsAuthor 1 of 4NeurIPS 2023 · 3 citations
- Optimal Sparse Recovery with Decision StumpsAuthor 1 of 3AAAI 2023 · 2 citations
