Congestion-Free Transmission of Real-Time Traffic in Packet Networks. - S. Jamaloddin Golestani (INFOCOM, 1990)

A Stop-and-Go Queueing Framework for Congestion Management. - S. Jamaloddin Golestani (SIGCOMM, 1990)

Duration-Limited Statistical Multiplexing of Delay-Sensitive Traffic in Packet Networks. - S. Jamaloddin Golestani (INFOCOM, 1991)

A Framing Strategy for Congestion Management. - S. Jamaloddin Golestani (IEEE J. Sel. Areas Commun., 1991)

Congestion-free communication in high-speed packet networks. - S. Jamaloddin Golestani (IEEE Trans. Commun., 1991)

Congestion control for multimedia services. - Ljiljana Trajkovic; S. Jamaloddin Golestani (IEEE Netw., 1992)

A Self-Clocked Fair Queueing Scheme for Broadband Applications. - S. Jamaloddin Golestani (INFOCOM, 1994)

Network Delay Analysis of a Class of Fair Queueing Algorithms. - S. Jamaloddin Golestani (IEEE J. Sel. Areas Commun., 1995)

Fair Queueing Algorithms for Packet Scheduling in BISDN. - S. Jamaloddin Golestani (International Zurich Seminar on Digital Communications, 1996)

A Class of End-to-End Congestion Control Algorithms for the Internet. - S. Jamaloddin Golestani; Supratik Bhattacharyya (ICNP, 1998)

Fundamental Observations on Multicast Congestion Control in the Internet. - S. Jamaloddin Golestani; Krishan K. Sabnani (INFOCOM, 1999)

Prevention of deadlocks and livelocks in lossless backpressured packet networks. - Mark J. Karol; S. Jamaloddin Golestani; David Lee (IEEE/ACM Trans. Netw., 2003)

A Unified Theory of Scheduling, Flow Control and Routing in Wireless Networks. - Naghmeh Sadat Moayedian; S. Jamaloddin Golestani (ICNP, 2009)

Optimal scheduling and routing in wireless networks: a new approach. - Naghmeh Sadat Moayedian; S. Jamaloddin Golestani (WCNC, 2009)

Optimal scheduling for dynamic channel allocation in wireless LANs. - S. Jamaloddin Golestani; Rajeev Rastogi; Mark A. Smith (Wirel. Networks, 2010)

Averaging consensus over erasure channels via local synchronization. - Saber Salehkaleybar; S. Jamaloddin Golestani (ISIT, 2013)

Network delay analysis of a (¿, ¿) ¿ Regular traffic stream over multiple paths in a network of fair-queuing servers. - Jalal Khamse Ashar; S. Jamaloddin Golestani (IWCIT, 2013)

Asymptotic behavior of network capacity under spatial network coding. - Farzan Farnia; S. Jamaloddin Golestani (WCNC, 2013)

Distributed Voting/Ranking With Optimal Number of States per Node. - Saber Salehkaleybar; Arsalan Sharif-Nassab; S. Jamaloddin Golestani (IEEE Trans. Signal Inf. Process. over Networks, 2015)

Distributed binary majority voting via exponential distribution. - Saber Salehkaleybar; Sayyed Jamaloddin Golestani (IET Signal Process., 2016)

Token-Based Function Computation with Memory. - Saber Salehkaleybar; S. Jamaloddin Golestani (IEEE Trans. Parallel Distributed Syst., 2016)

A Dynamic Incentive Mechanism for Security in Networks of Interdependent Agents. - Farzaneh Farhadi; Hamidreza Tavafoghi; Demosthenis Teneketzis; Jamal Golestani 001 (GAMENETS, 2017)

On the Possibility of Network Scheduling With Polynomial Complexity and Delay. - Arsalan Sharif-Nassab; S. Jamaloddin Golestani (IEEE/ACM Trans. Netw., 2017)

Static and Dynamic Informational Incentive Mechanisms for Security Enhancement. - Farzaneh Farhadi; Demosthenis Teneketzis; S. Jamaloddin Golestani (ECC, 2018)

Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse. - Arsalan Sharif-Nassab; John N. Tsitsiklis; S. Jamaloddin Golestani (CoRR, 2018)

Order Optimal One-Shot Distributed Learning. - Arsalan Sharif-Nassab; Saber Salehkaleybar; S. Jamaloddin Golestani (NeurIPS, 2019)

Optimizing floor reservation and contention resolution in wireless random access. - Mohammad Hossein Bateni 002; S. Jamaloddin Golestani; Ali Mohammad Doost-Hoseini (Ad Hoc Networks, 2019)

Theoretical Limits of One-Shot Distributed Learning. - Saber Salehkaleybar; Arsalan Sharif-Nassab; S. Jamaloddin Golestani (CoRR, 2019)

When do Trajectories have Bounded Sensitivity to Cumulative Perturbations. - Arsalan Sharif-Nassab; S. Jamaloddin Golestani (CoRR, 2019)

Nonexpansive Piecewise Constant Hybrid Systems are Conservative. - Arsalan Sharif-Nassab; John N. Tsitsiklis; S. Jamaloddin Golestani (CoRR, 2019)

An Efficient Dynamic Allocation Mechanism for Security in Networks of Interdependent Strategic Agents. - Farzaneh Farhadi; Hamidreza Tavafoghi; Demosthenis Teneketzis; S. Jamaloddin Golestani (Dyn. Games Appl., 2019)

A Surrogate Optimization-Based Mechanism for Resource Allocation and Routing in Networks With Strategic Agents. - Farzaneh Farhadi; S. Jamaloddin Golestani; Demosthenis Teneketzis (IEEE Trans. Autom. Control., 2019)

Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks. - Arsalan Sharif-Nassab; Saber Salehkaleybar; S. Jamaloddin Golestani (ICLR, 2020)

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes. - Kamran Kalbasi; S. Jamaloddin Golestani (Signal Process., 2020)

Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. - Arsalan Sharif-Nassab; John N. Tsitsiklis; S. Jamaloddin Golestani (IEEE Trans. Autom. Control., 2020)

Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems. - Majid Raeis; S. Jamaloddin Golestani (ICAPS, 2021)

Order Optimal One-Shot Federated Learning for non-Convex Loss Functions. - Arsalan Sharif-Nassab; Saber Salehkaleybar; S. Jamaloddin Golestani (CoRR, 2021)

One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them. - Saber Salehkaleybar; Arsalan Sharif-Nassab; S. Jamaloddin Golestani (J. Mach. Learn. Res., 2021)

Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions. - Arsalan Sharif-Nassab; Saber Salehkaleybar; S. Jamaloddin Golestani (IEEE Trans. Inf. Theory, 2024)