Hossein Esfandiari

Samira HosseinGhorban

Alipasha Montaseri

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Resilient k-Clustering.

[BibT_eX]

[DOI]

Sara Ahmadian

Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

High-Dimensional Geometric Streaming for Nearly Low Rank Data.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Tackling Provably Hard Representative Selection via Graph Neural Networks.

[BibT_eX]

[DOI]

Mehran Kazemi

Anton Tsitsulin

Deepak Ramachandran

Bryan Perozzi

Trans. Mach. Learn. Res., 2023

Robust Load Balancing with Machine Learned Advice.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

Robust and differentially private stochastic linear bandits.

[BibT_eX]

[DOI]

Vasileios Charisopoulos

CoRR, 2023

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries.

[BibT_eX]

[DOI]

Hendrik Fichtenberger

CoRR, 2023

Brief Announcement: Streaming Balanced Clustering.

[BibT_eX]

[DOI]

Peilin Zhong

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries.

[BibT_eX]

[DOI]

Hendrik Fichtenberger

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Replicable Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Robust and private stochastic linear bandits.

[BibT_eX]

[DOI]

Vasileios Charisopoulos

Proceedings of the International Conference on Machine Learning, 2023

Replicable Bandits.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Seeding with Costly Network Information.

[BibT_eX]

[DOI]

Oper. Res., 2022

Reproducible Bandits.

[BibT_eX]

[DOI]

CoRR, 2022

Smooth Anonymity for Sparse Binary Matrices.

[BibT_eX]

[DOI]

CoRR, 2022

Improved Approximations for Euclidean k-means and k-median, via Nested Quasi-Independent Sets.

[BibT_eX]

[DOI]

CoRR, 2022

Online Allocation and Display Ads Optimization with Surplus Supply.

[BibT_eX]

[DOI]

Yasamin Nazari

Balasubramanian Sivan

Yifeng Teng

Creighton Thomas

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Almost Tight Approximation Algorithms for Explainable Clustering.

[BibT_eX]

[DOI]

Shyam Narayanan

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Anonymous Bandits for Multi-User Systems.

[BibT_eX]

[DOI]

Jon Schneider

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Tight and Robust Private Mean Estimation with Few Users.

[BibT_eX]

[DOI]

Shyam Narayanan

Proceedings of the International Conference on Machine Learning, 2022

Label differential privacy via clustering.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Massively Parallel Computation via Remote Memory Access.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Optimal Fully Dynamic k-Centers Clustering.

[BibT_eX]

[DOI]

Rajesh Jayaram

CoRR, 2021

Feature Cross Search via Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Adaptivity in Adaptive Submodularity.

[BibT_eX]

[DOI]

Amin Karbasi

Proceedings of the Conference on Learning Theory, 2021

Almost Linear Time Density Level Set Estimation via DBSCAN.

[BibT_eX]

[DOI]

Peilin Zhong

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Regret Bounds for Batched Bandits.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Extreme k-Center Clustering.

[BibT_eX]

[DOI]

Manuela Fischer

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Contextual Reserve Price Optimization in Auctions.

[BibT_eX]

[DOI]

CoRR, 2020

Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Prophets, Secretaries, and Maximizing the Probability of Choosing the Best.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond.

[BibT_eX]

[DOI]

CoRR, 2019

Batched Multi-Armed Bandits with Optimal Regret.

[BibT_eX]

[DOI]

CoRR, 2019

Streaming Balanced Clustering.

[BibT_eX]

[DOI]

Peilin Zhong

CoRR, 2019

On-Device Algorithms for Public-Private Data with Absolute Privacy.

[BibT_eX]

[DOI]

Alessandro Epasto

Proceedings of the World Wide Web Conference, 2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Categorical Feature Compression via Submodular Optimization.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Near-Optimal Massively Parallel Graph Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Online Pandora's Boxes and Bandits.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Michael Mitzenmacher

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.

[BibT_eX]

[DOI]

Nitish Korula

ACM Trans. Economics and Comput., 2018

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.

[BibT_eX]

[DOI]

Vahid Liaghat

Krzysztof Onak

ACM Trans. Algorithms, 2018

A bounded-risk mechanism for the kidney exchange game.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Optimal Distributed Submodular Optimization via Sketching.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Parallel and Streaming Algorithms for K-Core Decomposition.

[BibT_eX]

[DOI]

Silvio Lattanzi

Proceedings of the 35th International Conference on Machine Learning, 2018

Metric Sublinear Algorithms via Linear Sampling.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Allocations in Large Markets.

[BibT_eX]

[DOI]

PhD thesis, 2017

Prophet Secretary.

[BibT_eX]

[DOI]

Vahid Liaghat

SIAM J. Discret. Math., 2017

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.

[BibT_eX]

[DOI]

Rajesh Chitnis

Mohammad Taghi Hajiaghayi

Rohit Khandekar

Saeed Seddighin

Algorithmica, 2017

Beating 1-1/e for ordered prophets.

[BibT_eX]

[DOI]

Soheil Ehsani

Robert D. Kleinberg

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Brief Announcement: Graph Matching in Massive Datasets.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Almost Optimal Streaming Algorithms for Coverage Problems.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A Study of Compact Reserve Pricing Languages.

[BibT_eX]

[DOI]

Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Market Pricing for Data Streams.

[BibT_eX]

[DOI]

Hadi Yami

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Distributed Coverage Maximization via Sketching.

[BibT_eX]

[DOI]

CoRR, 2016

Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond.

[BibT_eX]

[DOI]

David P. Woodruff

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams.

[BibT_eX]

[DOI]

Rajesh Chitnis

Graham Cormode

Andrew McGregor

Sofya Vorotnikova

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Bi-Objective Online Matching and Submodular Allocations.

[BibT_eX]

[DOI]

Nitish Korula

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Finding Large Matchings in Semi-Streaming.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.

[BibT_eX]

[DOI]

Hamid Mahini

Xiaowei Wu

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Low-Risk Mechanisms for the Kidney Exchange Game.

[BibT_eX]

[DOI]

CoRR, 2015

Applications of Uniform Sampling: Densest Subgraph and Beyond.

[BibT_eX]

[DOI]

David P. Woodruff

CoRR, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Graham Cormode

Andrew McGregor

Sofya Vorotnikova

CoRR, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Graham Cormode

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.

[BibT_eX]

[DOI]

Nitish Korula

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Brief Announcement: New Mechanisms for Pairwise Kidney Exchange.

[BibT_eX]

[DOI]

Hossein Efsandiari

Mohammad Taghi Hajiaghayi

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Approximate Deadline-Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Hossein Efsandiari

Proceedings of the Algorithms - ESA 2015, 2015

Selling Tomorrow's Bargains Today.

[BibT_eX]

[DOI]

Hamid Mahini

David L. Malec

Aravind Srinivasan

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

On the Erdös-Gyárfás conjecture in claw-free graphs.

[BibT_eX]

[DOI]

Khodakhast Bibak

Pouria Salehi Nowbandegani

Mohammad Hassan Shirdareh Haghighi

Discuss. Math. Graph Theory, 2014

Some bounds for the signed edge domination number of a graph.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Rohit Khandekar

Saeed Seddighin

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Online Stochastic Reordering Buffer Scheduling.

[BibT_eX]

[DOI]