activity
20042021
most citedNP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems

123 citations · 411 across the 36 of their papers we have counts for

collaborators

38 papers

eess.SY2021

Jumping Fluid Models and Delay Stability of Max-Weight Dynamics under Heavy-Tailed Traffic

Arsalan Sharifnassab, John N. Tsitsiklis

We say that a random variable is - if moments of order are finite for some ; otherwise, we say that it is -. We study queueing networks tha…

cs.PF2020

Stability, memory, and messaging tradeoffs in heterogeneous service systems

David Gamarnik, John N. Tsitsiklis, Martin Zubeldia

We consider a heterogeneous distributed service system, consisting of servers with unknown and possibly different processing rates. Jobs with unit mean and independent processi…

eess.SY2019★ 1 cited

Nonexpansive Piecewise Constant Hybrid Systems are Conservative

Arsalan Sharifnassab, John N. Tsitsiklis, S. Jamaloddin Golestani

Consider a partition of into finitely many polyhedral regions and associated drift vectors . We study ``hybrid'' dynamical systems whose trajectories have a…

cs.LG2019★ 25 cited

Blind identification of stochastic block models from dynamical observations

Michael T. Schaub, Santiago Segarra, John N. Tsitsiklis

We consider a blind identification problem in which we aim to recover a statistical model of a network without knowledge of the network's edges, but based solely on nodal observati…

cs.NI2018

Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse

Arsalan Sharifnassab, John N. Tsitsiklis, S. Jamaloddin Golestani

We consider a multi-hop switched network operating under a Max-Weight (MW) scheduling policy, and show that the distance between the queue length process and a fluid solution remai…

math.PR2018

A lower bound on the queueing delay in resource constrained load balancing

David Gamarnik, John N. Tsitsiklis, Martin Zubeldia

We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate , with $0<λ…