Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von Le Gall, François, Seddighin, Saeed

Volltext

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem von Seddighin, Masoud, Seddighin, Saeed

Volltext

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce von Boroujeni, Mahdi, Ehsani, Soheil, Ghodsi, Mohammad, Hajiaghayi, Mohammadtaghi, Seddighin, Saeed

Volltext

Fair allocation of indivisible goods: Beyond additive valuations von Ghodsi, Mohammad, HajiAghayi, MohammadTaghi, Seddighin, Masoud, Seddighin, Saeed, Yami, Hadi

Volltext

Improved MPC Algorithms for Edit Distance and Ulam Distance von Boroujeni, Mahdi, Ghodsi, Mohammad, Seddighin, Saeed

Volltext

Fast and Simple Solutions of Blotto Games von Behnezhad, Soheil, Dehghani, Sina, Derakhshan, Mahsa, Hajiaghayi, Mohammedtaghi, Seddighin, Saeed

Volltext

Fair Allocation of Indivisible Goods to Asymmetric Agents von Farhadi, Alireza, Ghodsi, Mohammad, Hajiaghayi, Mohammad Taghi, Lahaie, Sébastien, Pennock, David, Seddighin, Masoud, Seddighin, Saeed, Yami, Hadi

Volltext

Approximation Algorithms for LCS and LIS with Truly Improved Running Times von Rubinstein, Aviad, Seddighin, Saeed, Song, Zhao, Sun, Xiaorui

Volltext

Covering orthogonal polygons with sliding k-transmitters von Mahdavi, Salma Sadat, Seddighin, Saeed, Ghodsi, Mohammad

Volltext

Fair Allocation of Indivisible Goods: Improvement von Ghodsi, Mohammad, Hajiaghayi, Mohammad Taghi, Seddighin, Masoud, Seddighin, Saeed, Yami, Hadi

Volltext

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games von Ahmadinejad, AmirMahdi, Dehghani, Sina, Hajiaghayi, MohammadTaghi, Lucier, Brendan, Mahini, Hamid, Seddighin, Saeed

Volltext

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands von Chitnis, Rajesh, Esfandiari, Hossein, Hajiaghayi, MohammadTaghi, Khandekar, Rohit, Kortsarz, Guy, Seddighin, Saeed

Volltext

Revenue Maximization for Selling Multiple Correlated Items von Bateni, MohammadHossein, Dehghani, Sina, Hajiaghayi, MohammadTaghi, Seddighin, Saeed

Volltext

Dynamic Subset Sum with Truly Sublinear Processing Time von Saleh, Hamed, Seddighin, Saeed

Volltext bestellen

Dynamic Longest Increasing Subsequence and the Erd\"{o}s-Szekeres Partitioning Problem von Mitzenmacher, Michael, Seddighin, Saeed

Volltext bestellen

Improved Dynamic Algorithms for Longest Increasing Subsequence von Kociumaka, Tomasz, Seddighin, Saeed

Volltext bestellen

Erd\"{o}s-Szekeres Partitioning Problem von Mitzenmacher, Michael, Seddighin, Saeed

Volltext bestellen

Computing Stackelberg Equilibria of Large General-Sum Games von Blum, Avrim, Haghtalab, Nika, Hajiaghayi, MohammadTaghi, Seddighin, Saeed

Volltext

Dynamic Subset Sum with Truly Sublinear Processing Time von Saleh, Hamed, Seddighin, Saeed

Volltext

Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems von François Le Gall, Seddighin, Saeed

Volltext