Alexander Olshevsky

ORCID

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 7

Top Venues

CoRR

ICML

IEEE Trans. Autom. Control.

AISTATS

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Claudio Altafini, Giacomo Como, Julien M. Hendrickx, Alexander Olshevsky, Alireza Tahbaz-Salehi
Guest Editorial Special Issue on Dynamics and Behaviors in Social Networks. IEEE Trans. Control. Netw. Syst. 9 (3) (2022)
Milad Siami, Alexander Olshevsky, Ali Jadbabaie
Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds. IEEE Trans. Autom. Control. 66 (4) (2021)
Venkatesh Saligrama, Alexander Olshevsky, Julien M. Hendrickx
Minimax Rank-$1$ Matrix Factorization. AISTATS (2020)
Julien M. Hendrickx, Alexander Olshevsky, Venkatesh Saligrama
Graph Resistance and Learning from Pairwise Comparisons. ICML (2019)
Ali Jadbabaie, Alexander Olshevsky, George J. Pappas, Vasileios Tzoumas
Minimal Reachability is Hard To Approximate. IEEE Trans. Autom. Control. 64 (2) (2019)
Yao Ma, Alexander Olshevsky, Csaba Szepesvári, Venkatesh Saligrama
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers. ICML (2018)
Ali Jadbabaie, Alexander Olshevsky, George J. Pappas, Vasileios Tzoumas
Minimal Reachability is Hard To Approximate. CoRR (2017)
Julien M. Hendrickx, Raphaël M. Jungers, Alexander Olshevsky, Guillaume Vankeerberghen
Graph diameter, eigenvalues, and minimum-time consensus. Autom. 50 (2) (2014)
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis
NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137 (1-2) (2013)
Angelia Nedic, Alexander Olshevsky
Distributed optimization over time-varying directed graphs CoRR (2013)
Naomi Ehrich Leonard, Alexander Olshevsky
Cooperative learning in multi-agent systems from intermittent measurements CoRR (2012)
Julien M. Hendrickx, Raphaël M. Jungers, Alexander Olshevsky, Guillaume Vankeerberghen
Diameter, Optimal Consensus, and Graph Eigenvalues CoRR (2012)
Naomi Ehrich Leonard, Alexander Olshevsky
Nonuniform coverage control on the line. CDC/ECC (2011)
Alexander Olshevsky, John N. Tsitsiklis
A Lower Bound for Distributed Averaging Algorithms on the Line Graph. IEEE Trans. Autom. Control. 56 (11) (2011)
Alexander Olshevsky, John N. Tsitsiklis
Degree Fluctuations and the Convergence Time of Consensus Algorithms CoRR (2011)
Alexander Olshevsky, John N. Tsitsiklis
Degree fluctuations and the convergence time of consensus algorithms. CDC/ECC (2011)
Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis
Distributed Anonymous Discrete Function Computation. IEEE Trans. Autom. Control. 56 (10) (2011)
Alexander Olshevsky, John N. Tsitsiklis
Convergence Speed in Distributed Consensus and Averaging. SIAM Rev. 53 (4) (2011)
Naomi Ehrich Leonard, Alexander Olshevsky
Nonuniform Coverage Control on the Line CoRR (2011)
Alexander Olshevsky, John N. Tsitsiklis
A lower bound for distributed averaging algorithms on the line graph. CDC (2010)
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems CoRR (2010)
Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis
Distributed anonymous discrete function computation CoRR (2010)
Julien M. Hendrickx, Alexander Olshevsky
Matrix p-Norms Are NP-Hard to Approximate If p!=q1, 2, INFINITY. SIAM J. Matrix Anal. Appl. 31 (5) (2010)
Alexander Olshevsky, John N. Tsitsiklis
Convergence Speed in Distributed Consensus and Averaging. SIAM J. Control. Optim. 48 (1) (2009)
Leonid Gurvits, Alexander Olshevsky
On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability. IEEE Trans. Autom. Control. 54 (2) (2009)
Julien M. Hendrickx, Alexander Olshevsky
Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty CoRR (2009)
Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis
Distributed anonymous function computation in information fusion and multiagent systems CoRR (2009)
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis
On Distributed Averaging Algorithms and Quantization Effects. IEEE Trans. Autom. Control. 54 (11) (2009)
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis
Distributed subgradient methods and quantization effects. CDC (2008)
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis
On distributed averaging algorithms and quantization effects. CDC (2008)
Alexander Olshevsky, John N. Tsitsiklis
On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms. IEEE Trans. Autom. Control. 53 (11) (2008)
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem. Algorithmica 42 (2) (2005)
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA (2003)
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem. WADS (2003)
Gruia Calinescu, Cristina G. Fernandes, Ion I. Mandoiu, Alexander Olshevsky, K. Yang, Alexander Zelikovsky
Primal-dual algorithms for QoS multimedia multicast. GLOBECOM (2003)

Alexander Olshevsky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexander Olshevsky