Abhinav Srivastav

According to our database1, Abhinav Srivastav authored at least 14 papers between 2014 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A stochastic conditional gradient algorithm for decentralized online convex optimization.
J. Parallel Distributed Comput., 2022

2021
Online Non-preemptive Scheduling on Unrelated Machines with Rejections.
ACM Trans. Parallel Comput., 2021

Online Non-Monotone DR-Submodular Maximization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Non-monotone DR-submodular Maximization over General Convex Sets.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees.
CoRR, 2019

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Covering Clients with Types and Budgets.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Sur les aspects théoriques et pratiques des compromis dans les problèmes d'allocation des ressources. (On theoretical and practical aspects of trade-offs in resource allocation problems).
PhD thesis, 2017

2016
Double archive Pareto local search.
Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence, 2016

Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

From Preemptive to Non-preemptive Scheduling Using Rejections.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2014
Competitive Analysis for sum stretch on single and identical parallel machines.
CoRR, 2014


  Loading...