( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards Tight Lower Bounds for Scheduling Problems.

, и . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Azin Ashkan

Ashkan Kalantary

Davoud Norouzi

Ashkan Tousimojarad

Constanze Farda

 

Другие публикации лиц с тем же именем

Fairness in Submodular Maximization over a Matroid Constraint., , , и . CoRR, (2023)Approximate Cluster Recovery from Noisy Labels., , , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 1463-1509. PMLR, (2022)Near-Optimal Correlation Clustering with Privacy., , , , , , и . NeurIPS, (2022)Fully Dynamic Submodular Maximization over Matroids., , , , и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 8821-8835. PMLR, (2023)Deletion Robust Non-Monotone Submodular Maximization over Matroids., , , , и . CoRR, (2022)Algorithms For Clustering Problems - Theoretical Guarantees and Empirical Evaluations.. EPFL, Switzerland, (2018)A Novel Probabilistic Key Management Algorithm for Large-Scale MANETs., , , и . AINA Workshops, стр. 349-356. IEEE Computer Society, (2013)Towards Tight Lower Bounds for Scheduling Problems., и . ESA, том 9294 из Lecture Notes in Computer Science, стр. 118-129. Springer, (2015)Submodular Maximization Subject to Matroid Intersection on the Fly., , , и . ESA, том 244 из LIPIcs, стр. 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fully Dynamic Algorithm for Constrained Submodular Optimization., , , , и . NeurIPS, (2020)