A Simple Semi-Streaming Algorithm for Global Minimum Cuts

von Assadi, Sepehr
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)

Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity

von Assadi, Sepehr
Veröffentlicht in NeurIPS (36. : 2022 : New Orleans, La.; Online) 36th Conference on Neural Information Processing Systems (NeurIPS 2022 ; Volume 43 of 50 (2023)

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier

von Assadi, Sepehr
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

SECRETARY RANKING WITH MINIMAL INVERSIONS

von Assadi, Sepehr
Veröffentlicht in NeurIPS (33. : 2019 : Vancouver, British Columbia) 32nd Conference on Neural Information Processing Systems (NeurIPS 2019) ; Volume 2 of 20 (2020)

Distributed and Streaming Linear Programming in Low Dimensions

von Assadi, Sepehr
Veröffentlicht in ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (38. : 2019 : Amsterdam) PODS '19 (2019)

Tight Bounds for Monotone Minimal Perfect Hashing

von Assadi, Sepehr
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models

von Assadi, Sepehr
Veröffentlicht in SIAM Symposium on Simplicity in Algorithms (4. : 2021 : Online) Fourth Symposium on Simplicity in Algorithms (SOSA 2021) (2021)