default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Jamaloddin Golestani
Person information
- affiliation: Sharif University of Technology, Iran
Other persons with the same name
- Jamal Golestani 0002 — Bell Laboratories, Networking Software Research Department, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2024
[j17]Arsalan Sharif-Nassab
, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions. IEEE Trans. Inf. Theory 70(4): 2807-2830 (2024)- 2021
- [j16]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them. J. Mach. Learn. Res. 22: 189:1-189:47 (2021) - 2020
- [j15]Kamran Kalbasi, S. Jamaloddin Golestani:
On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes. Signal Process. 175: 107653 (2020) - [j14]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. IEEE Trans. Autom. Control. 65(3): 1057-1072 (2020) - 2019
- [j13]Mohammad Hossein Bateni, S. Jamaloddin Golestani, Ali Mohammad Doost-Hoseini:
Optimizing floor reservation and contention resolution in wireless random access. Ad Hoc Networks 82: 31-45 (2019) - [j12]Farzaneh Farhadi, Hamidreza Tavafoghi, Demosthenis Teneketzis, S. Jamaloddin Golestani:
An Efficient Dynamic Allocation Mechanism for Security in Networks of Interdependent Strategic Agents. Dyn. Games Appl. 9(4): 914-941 (2019) - [j11]Farzaneh Farhadi, S. Jamaloddin Golestani, Demosthenis Teneketzis:
A Surrogate Optimization-Based Mechanism for Resource Allocation and Routing in Networks With Strategic Agents. IEEE Trans. Autom. Control. 64(2): 464-479 (2019) - 2017
- [j10]Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
On the Possibility of Network Scheduling With Polynomial Complexity and Delay. IEEE/ACM Trans. Netw. 25(6): 3850-3862 (2017) - 2016
- [j9]Saber Salehkaleybar, Sayyed Jamaloddin Golestani:
Distributed binary majority voting via exponential distribution. IET Signal Process. 10(5): 532-542 (2016) - [j8]Saber Salehkaleybar, S. Jamaloddin Golestani:
Token-Based Function Computation with Memory. IEEE Trans. Parallel Distributed Syst. 27(6): 1811-1823 (2016) - 2015
- [j7]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
Distributed Voting/Ranking With Optimal Number of States per Node. IEEE Trans. Signal Inf. Process. over Networks 1(4): 259-267 (2015) - 2010
- [j6]S. Jamaloddin Golestani, Rajeev Rastogi, Mark A. Smith:
Optimal scheduling for dynamic channel allocation in wireless LANs. Wirel. Networks 16(6): 1569-1586 (2010) - 2003
- [j5]Mark J. Karol, S. Jamaloddin Golestani, David Lee:
Prevention of deadlocks and livelocks in lossless backpressured packet networks. IEEE/ACM Trans. Netw. 11(6): 923-934 (2003) - 1995
- [j4]S. Jamaloddin Golestani:
Network Delay Analysis of a Class of Fair Queueing Algorithms. IEEE J. Sel. Areas Commun. 13(6): 1057-1070 (1995) - 1992
- [j3]Ljiljana Trajkovic, S. Jamaloddin Golestani:
Congestion control for multimedia services. IEEE Netw. 6(5): 20-26 (1992) - 1991
- [j2]S. Jamaloddin Golestani:
A Framing Strategy for Congestion Management. IEEE J. Sel. Areas Commun. 9(7): 1064-1077 (1991) - [j1]S. Jamaloddin Golestani:
Congestion-free communication in high-speed packet networks. IEEE Trans. Commun. 39(12): 1802-1812 (1991)
Conference and Workshop Papers
- 2021
- [c19]Majid Raeis, S. Jamaloddin Golestani:
Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems. ICAPS 2021: 281-289 - 2020
- [c18]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks. ICLR 2020 - 2019
- [c17]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Distributed Learning. NeurIPS 2019: 2165-2174 - 2018
- [c16]Farzaneh Farhadi, Demosthenis Teneketzis, S. Jamaloddin Golestani:
Static and Dynamic Informational Incentive Mechanisms for Security Enhancement. ECC 2018: 1048-1055 - 2017
- [c15]Farzaneh Farhadi, Hamidreza Tavafoghi, Demosthenis Teneketzis, Jamal Golestani:
A Dynamic Incentive Mechanism for Security in Networks of Interdependent Agents. GAMENETS 2017: 86-96 - 2013
- [c14]Saber Salehkaleybar, S. Jamaloddin Golestani:
Averaging consensus over erasure channels via local synchronization. ISIT 2013: 1092-1096 - [c13]Jalal Khamse Ashar, S. Jamaloddin Golestani:
Network delay analysis of a (¿, ¿) ¿ Regular traffic stream over multiple paths in a network of fair-queuing servers. IWCIT 2013: 1-6 - [c12]Farzan Farnia, S. Jamaloddin Golestani:
Asymptotic behavior of network capacity under spatial network coding. WCNC 2013: 2434-2439 - 2009
- [c11]Naghmeh Sadat Moayedian, S. Jamaloddin Golestani:
A Unified Theory of Scheduling, Flow Control and Routing in Wireless Networks. ICNP 2009: 344-353 - [c10]Naghmeh Sadat Moayedian, S. Jamaloddin Golestani:
Optimal scheduling and routing in wireless networks: a new approach. WCNC 2009: 2444-2449 - 2007
- [c9]S. Jamaloddin Golestani, Rajeev Rastogi, Mark A. Smith:
Optimal Scheduling for Dynamic Channel Allocation in Wireless LANs. COMSWARE 2007 - 2000
- [c8]Mark J. Karol, S. Jamaloddin Golestani, David Lee:
Prevention of Deadlocks and Livelocks in Lossless, Backpressured Packet Networks. INFOCOM 2000: 1333-1342 - 1999
- [c7]S. Jamaloddin Golestani, Krishan K. Sabnani:
Fundamental Observations on Multicast Congestion Control in the Internet. INFOCOM 1999: 990-1000 - 1998
- [c6]S. Jamaloddin Golestani, Supratik Bhattacharyya:
A Class of End-to-End Congestion Control Algorithms for the Internet. ICNP 1998: 137-150 - 1996
- [c5]S. Jamaloddin Golestani:
Fair Queueing Algorithms for Packet Scheduling in BISDN. International Zurich Seminar on Digital Communications 1996: 39-51 - 1994
- [c4]S. Jamaloddin Golestani:
A Self-Clocked Fair Queueing Scheme for Broadband Applications. INFOCOM 1994: 636-646 - 1991
- [c3]S. Jamaloddin Golestani:
Duration-Limited Statistical Multiplexing of Delay-Sensitive Traffic in Packet Networks. INFOCOM 1991: 323-332 - 1990
- [c2]S. Jamaloddin Golestani:
Congestion-Free Transmission of Real-Time Traffic in Packet Networks. INFOCOM 1990: 527-536 - [c1]S. Jamaloddin Golestani:
A Stop-and-Go Queueing Framework for Congestion Management. SIGCOMM 1990: 8-18
Informal and Other Publications
- 2021
- [i11]Majid Raeis, S. Jamaloddin Golestani:
Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems. CoRR abs/2102.08814 (2021) - [i10]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Federated Learning for non-Convex Loss Functions. CoRR abs/2108.08677 (2021) - 2019
- [i9]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
Theoretical Limits of One-Shot Distributed Learning. CoRR abs/1905.04634 (2019) - [i8]Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
When do Trajectories have Bounded Sensitivity to Cumulative Perturbations. CoRR abs/1905.11746 (2019) - [i7]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Nonexpansive Piecewise Constant Hybrid Systems are Conservative. CoRR abs/1905.12361 (2019) - [i6]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Distributed Learning. CoRR abs/1911.00731 (2019) - 2018
- [i5]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. CoRR abs/1807.08139 (2018) - [i4]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse. CoRR abs/1810.09180 (2018) - 2017
- [i3]Saber Salehkaleybar, S. Jamaloddin Golestani:
Token-based Function Computation with Memory. CoRR abs/1703.08831 (2017) - [i2]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
Distributed Voting/Ranking with Optimal Number of States per Node. CoRR abs/1703.08838 (2017) - [i1]Kamran Kalbasi, S. Jamaloddin Golestani:
On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes. CoRR abs/1707.01063 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
