S. Jamaloddin Golestani

Orcid: 0000-0001-9797-0748

Affiliations:
  • Sharif University of Technology, Iran


According to our database1, S. Jamaloddin Golestani authored at least 39 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

IEEE Fellow

IEEE Fellow 2000, "For contributions to the theory of congestion control and provision of fairness and guaranteed services in packet networks.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions.
IEEE Trans. Inf. Theory, April, 2024

2021
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them.
J. Mach. Learn. Res., 2021

Order Optimal One-Shot Federated Learning for non-Convex Loss Functions.
CoRR, 2021

Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems.
IEEE Trans. Autom. Control., 2020

On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes.
Signal Process., 2020

Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
A Surrogate Optimization-Based Mechanism for Resource Allocation and Routing in Networks With Strategic Agents.
IEEE Trans. Autom. Control., 2019

An Efficient Dynamic Allocation Mechanism for Security in Networks of Interdependent Strategic Agents.
Dyn. Games Appl., 2019

Nonexpansive Piecewise Constant Hybrid Systems are Conservative.
CoRR, 2019

When do Trajectories have Bounded Sensitivity to Cumulative Perturbations.
CoRR, 2019

Theoretical Limits of One-Shot Distributed Learning.
CoRR, 2019

Optimizing floor reservation and contention resolution in wireless random access.
Ad Hoc Networks, 2019

Order Optimal One-Shot Distributed Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

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

Static and Dynamic Informational Incentive Mechanisms for Security Enhancement.
Proceedings of the 16th European Control Conference, 2018

2017
On the Possibility of Network Scheduling With Polynomial Complexity and Delay.
IEEE/ACM Trans. Netw., 2017

A Dynamic Incentive Mechanism for Security in Networks of Interdependent Agents.
Proceedings of the Game Theory for Networks - 7th International EAI Conference, 2017

2016
Token-Based Function Computation with Memory.
IEEE Trans. Parallel Distributed Syst., 2016

Distributed binary majority voting via exponential distribution.
IET Signal Process., 2016

2015
Distributed Voting/Ranking With Optimal Number of States per Node.
IEEE Trans. Signal Inf. Process. over Networks, 2015

2013
Asymptotic behavior of network capacity under spatial network coding.
Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

Network delay analysis of a (¿, ¿) ¿ Regular traffic stream over multiple paths in a network of fair-queuing servers.
Proceedings of the Iran Workshop on Communication and Information Theory, 2013

Averaging consensus over erasure channels via local synchronization.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2010
Optimal scheduling for dynamic channel allocation in wireless LANs.
Wirel. Networks, 2010

2009
Optimal scheduling and routing in wireless networks: a new approach.
Proceedings of the 2009 IEEE Wireless Communications and Networking Conference, 2009

A Unified Theory of Scheduling, Flow Control and Routing in Wireless Networks.
Proceedings of the 17th annual IEEE International Conference on Network Protocols, 2009

2003
Prevention of deadlocks and livelocks in lossless backpressured packet networks.
IEEE/ACM Trans. Netw., 2003

1999
Fundamental Observations on Multicast Congestion Control in the Internet.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998
A Class of End-to-End Congestion Control Algorithms for the Internet.
Proceedings of the 1998 International Conference on Network Protocols (ICNP '98), 1998

1996
Fair Queueing Algorithms for Packet Scheduling in BISDN.
Proceedings of the Broadband Communications, 1996

1995
Network Delay Analysis of a Class of Fair Queueing Algorithms.
IEEE J. Sel. Areas Commun., 1995

1994
A Self-Clocked Fair Queueing Scheme for Broadband Applications.
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1992
Congestion control for multimedia services.
IEEE Netw., 1992

1991
Congestion-free communication in high-speed packet networks.
IEEE Trans. Commun., 1991

A Framing Strategy for Congestion Management.
IEEE J. Sel. Areas Commun., 1991

Duration-Limited Statistical Multiplexing of Delay-Sensitive Traffic in Packet Networks.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1990
A Stop-and-Go Queueing Framework for Congestion Management.
Proceedings of the ACM Symposium on Communications Architectures & Protocols, 1990

Congestion-Free Transmission of Real-Time Traffic in Packet Networks.
Proceedings of the Proceedings IEEE INFOCOM '90, 1990


  Loading...