Hossein Esfandiari

Orcid: 0000-0001-8130-6631

Affiliations:
  • Google Research, New York City, USA
  • Harvard University, Cambridge, USA (former)
  • University of Maryland, College Park, USA (former)


According to our database1, Hossein Esfandiari authored at least 76 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Communication for Classic Functions in the Coordinator Model and Beyond.
CoRR, 2024

Smooth Anonymity for Sparse Graphs.
Proceedings of the Companion Proceedings of the ACM on Web Conference 2024, 2024

Optimal Communication Bounds for Classic Functions in the Coordinator Model and Beyond.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Improved Active Covering via Density-Based Space Transformation.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Resilient k-Clustering.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

High-Dimensional Geometric Streaming for Nearly Low Rank Data.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023
Tackling Provably Hard Representative Selection via Graph Neural Networks.
Trans. Mach. Learn. Res., 2023

Robust Load Balancing with Machine Learned Advice.
J. Mach. Learn. Res., 2023

Robust and differentially private stochastic linear bandits.
CoRR, 2023

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

Brief Announcement: Streaming Balanced Clustering.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal Fully Dynamic <i>k</i>-Center Clustering for Adaptive and Oblivious Adversaries.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Replicable Clustering.
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.
Proceedings of the International Conference on Machine Learning, 2023

Replicable Bandits.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Seeding with Costly Network Information.
Oper. Res., 2022

Reproducible Bandits.
CoRR, 2022

Smooth Anonymity for Sparse Binary Matrices.
CoRR, 2022

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

Online Allocation and Display Ads Optimization with Surplus Supply.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Improved approximations for Euclidean <i>k</i>-means and <i>k</i>-median, via nested quasi-independent sets.
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.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Anonymous Bandits for Multi-User Systems.
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.
Proceedings of the International Conference on Machine Learning, 2022

Label differential privacy via clustering.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Massively Parallel Computation via Remote Memory Access.
ACM Trans. Parallel Comput., 2021

Optimal Fully Dynamic k-Centers Clustering.
CoRR, 2021

Feature Cross Search via Submodular Optimization.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Adaptivity in Adaptive Submodularity.
Proceedings of the Conference on Learning Theory, 2021

Almost Linear Time Density Level Set Estimation via DBSCAN.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Regret Bounds for Batched Bandits.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Extreme k-Center Clustering.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.
Proc. VLDB Endow., 2020

Contextual Reserve Price Optimization in Auctions.
CoRR, 2020

Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming.
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.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

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

Batched Multi-Armed Bandits with Optimal Regret.
CoRR, 2019

Streaming Balanced Clustering.
CoRR, 2019

On-Device Algorithms for Public-Private Data with Absolute Privacy.
Proceedings of the World Wide Web Conference, 2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond.
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.
Proceedings of the 36th International Conference on Machine Learning, 2019

Near-Optimal Massively Parallel Graph Connectivity.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Online Pandora's Boxes and Bandits.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
ACM Trans. Economics and Comput., 2018

Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond.
ACM Trans. Algorithms, 2018

A bounded-risk mechanism for the kidney exchange game.
Discret. Appl. Math., 2018

Optimal Distributed Submodular Optimization via Sketching.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Parallel and Streaming Algorithms for K-Core Decomposition.
Proceedings of the 35th International Conference on Machine Learning, 2018

Metric Sublinear Algorithms via Linear Sampling.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Allocations in Large Markets.
PhD thesis, 2017

Prophet Secretary.
SIAM J. Discret. Math., 2017

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

Beating 1-1/e for ordered prophets.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Brief Announcement: Graph Matching in Massive Datasets.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Almost Optimal Streaming Algorithms for Coverage Problems.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A Study of Compact Reserve Pricing Languages.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Market Pricing for Data Streams.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Distributed Coverage Maximization via Sketching.
CoRR, 2016

Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond.
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.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Bi-Objective Online Matching and Submodular Allocations.
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.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Low-Risk Mechanisms for the Kidney Exchange Game.
CoRR, 2015

Applications of Uniform Sampling: Densest Subgraph and Beyond.
CoRR, 2015

Kernelization via Sampling with Applications to Dynamic Graph Streams.
CoRR, 2015

Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Brief Announcement: New Mechanisms for Pairwise Kidney Exchange.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Approximate Deadline-Scheduling with Precedence Constraints.
Proceedings of the Algorithms - ESA 2015, 2015

Selling Tomorrow's Bargains Today.
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.
Discuss. Math. Graph Theory, 2014

Some bounds for the signed edge domination number of a graph.
Australas. J Comb., 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Online Stochastic Reordering Buffer Scheduling.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014


  Loading...