Alina Ene
Orcid: 0000-0002-5818-1807Affiliations:
- Boston University, MA, USA
According to our database1,
Alina Ene
authored at least 73 papers
between 2008 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
ACM Trans. Algorithms, July, 2025
CoRR, April, 2025
Proceedings of the Approximation, 2025
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025
2024
Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems.
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
On the Generalization Error of Stochastic Mirror Descent for Quadratically-Bounded Losses: an Improved Analysis.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
On the Convergence of AdaGrad(Norm) on ℝ<sup>d</sup>: Beyond Convexity, Non-Asymptotic Rate and Acceleration.
Proceedings of the Eleventh International Conference on Learning Representations, 2023
2022
An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint.
Math. Oper. Res., November, 2022
CoRR, 2022
On the Convergence of AdaGrad on $\R^{d}$: Beyond Convexity, Non-Asymptotic Rate and Acceleration.
CoRR, 2022
Proceedings of the International Conference on Machine Learning, 2022
Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints.
Proceedings of the International Conference on Machine Learning, 2022
Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
CoRR, 2020
A note on maximizing the difference between a monotone submodular function and a linear function.
CoRR, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares.
CoRR, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Improved Convergence for $\ell_1$ and $\ell_∞$ Regression via Iteratively Reweighted Least Squares.
Proceedings of the 36th International Conference on Machine Learning, 2019
Towards Nearly-Linear Time Algorithms for Submodular Maximization with a Matroid Constraint.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018
2017
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017
2016
CoRR, 2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
Proceedings of the 19th International Conference on Information Visualisation, 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
Proceedings of the 32nd International Conference on Machine Learning, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Comparing interaction techniques for serious games through brain-computer interfaces: A user perception evaluation study.
Entertain. Comput., 2014
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements.
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Proceedings of the Algorithms - ESA 2014, 2014
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture.
Proceedings of the Approximation, 2014
2013
PhD thesis, 2013
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems
CoRR, 2013
Proceedings of the 5th International Conference on Games and Virtual Worlds for Serious Applications, 2013
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
2009
Proceedings of the Approximation, 2009
2008
Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, 2008