The following pages link to Alexander Olshevsky (Q2415207):
Displayed 20 items.
- Decentralized consensus optimization and resource allocation (Q2415208) (← links)
- Improved approximation algorithms for the quality of service multicast tree problem (Q2484000) (← links)
- Graph diameter, eigenvalues, and minimum-time consensus (Q2628456) (← links)
- (Q4422514) (← links)
- Minimal Reachability is Hard To Approximate (Q4629833) (← links)
- On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability (Q4974461) (← links)
- Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds (Q4990277) (← links)
- Algorithms - ESA 2003 (Q5897239) (← links)
- Algorithms and Data Structures (Q5900771) (← links)
- A Small Gain Analysis of Single Timescale Actor Critic (Q6042800) (← links)
- A Sharp Estimate on the Transient Time of Distributed Stochastic Gradient Descent (Q6077156) (← links)
- Distributed Subgradient Methods and Quantization Effects (Q6208683) (← links)
- A lower bound for distributed averaging algorithms (Q6218262) (← links)
- Efficient Information Aggregation Strategies for Distributed Control and Signal Processing (Q6220955) (← links)
- Nonasymptotic Convergence Rates for Cooperative Learning Over Time-Varying Directed Graphs (Q6255305) (← links)
- Network Independent Rates in Distributed Learning (Q6265898) (← links)
- Fast Algorithms for Distributed Optimization and Hypothesis Testing: A Tutorial (Q6277482) (← links)
- On the geometric convergence rate of distributed economic dispatch/demand response in power networks (Q6277786) (← links)
- Fully Asynchronous Push-Sum With Growing Intercommunication Intervals (Q6298166) (← links)
- Stability Testing of Matrix Polytopes (Q6478166) (← links)