default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaber Jafarizadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Saber Jafarizadeh
:
Achieving Network Stability via Optimal Pinning Control in Weighted Complex Networks. IEEE Access 12: 195256-195278 (2024)- [j18]Saber Jafarizadeh:
Convergence rate of Markov chains over switching distance regular networks. J. Frankl. Inst. 361(17): 107151 (2024) - [j17]Saber Jafarizadeh:
Undirected Weighted Network Topologies With Best Possible Pinning Controllability. IEEE Trans. Autom. Control. 69(9): 6285-6292 (2024) - [i17]Saber Jafarizadeh:
Optimal Diffusion Processes. CoRR abs/2412.20934 (2024) - 2023
- [j16]David Soldani, Petrit Nahi, Hamideh Bour, Saber Jafarizadeh, Mohammed F. Soliman, Leonardo Di Giovanna, Francesco Monaco, Giuseppe Ognibene, Fulvio Risso:
eBPF: A New Approach to Cloud-Native Observability, Networking and Security for Current (5G) and Future Mobile Networks (6G and Beyond). IEEE Access 11: 57174-57202 (2023) - [j15]Saber Jafarizadeh, Darryl Veitch:
Optimal curing resource allocation for epidemic spreading processes. Autom. 150: 110851 (2023) - [j14]Saber Jafarizadeh, Darryl Veitch:
Robust Weighted-Average Continuous-Time Consensus With Communication Time Delay. IEEE Trans. Cybern. 53(4): 2074-2086 (2023) - [j13]Saber Jafarizadeh:
Convergence Speed and Robustness Analysis of Epidemic Spreading Processes With Time-Delay. IEEE Trans. Netw. Sci. Eng. 10(6): 3818-3833 (2023) - 2022
- [j12]Hamideh Bour, Mehran Abolhasan, Saber Jafarizadeh, Justin Lipman, Imran Makhdoom:
A multi-layered intrusion detection system for software defined networking☆. Comput. Electr. Eng. 101: 108042 (2022) - [j11]Saber Jafarizadeh:
Pinning Control of Dynamical Networks With Optimal Convergence Rate. IEEE Trans. Syst. Man Cybern. Syst. 52(11): 7160-7172 (2022) - 2021
- [j10]Saber Jafarizadeh, Darryl Veitch, Farzad Tofigh, Justin Lipman, Mehran Abolhasan:
Optimal Synchronizability in Networks of Coupled Systems: Topological View. IEEE Trans. Netw. Sci. Eng. 8(2): 1517-1530 (2021) - [j9]Saber Jafarizadeh:
Weighted Average Consensus-Based Optimization of Advection-Diffusion Systems. IEEE Trans. Signal Inf. Process. over Networks 7: 45-61 (2021) - 2020
- [j8]Saber Jafarizadeh, Farzad Tofigh, Justin Lipman, Mehran Abolhasan:
Optimizing synchronizability in networks of coupled systems. Autom. 112 (2020) - [j7]Saber Jafarizadeh:
Fastest Mixing Reversible Markov Chain: Clique Lifted Graphs and Subgraphs. IEEE Trans. Signal Inf. Process. over Networks 6: 88-104 (2020) - [c8]Saber Jafarizadeh:
Pinning Control of Dynamical Networks with Optimal Cost. LCN 2020: 33-41
2010 – 2019
- 2019
- [j6]Saber Jafarizadeh:
Fastest mixing reversible Markov chain on friendship graph: Trade-off between transition probabilities among friends and convergence rate. Syst. Control. Lett. 130: 13-22 (2019) - [c7]Mahmoud Gamal, Mehran Abolhasan, Saber Jafarizadeh, Justin Lipman, Wei Ni:
Mapping and Scheduling of Virtual Network Functions using Multi Objective Optimization Algorithm. ISCIT 2019: 328-333 - [c6]Mahmoud Gamal, Saber Jafarizadeh, Mehran Abolhasan, Justin Lipman, Wei Ni:
Mapping and Scheduling for Non-Uniform Arrival of Virtual Network Function (VNF) Requests. VTC Fall 2019: 1-6 - 2018
- [j5]Saber Jafarizadeh:
Optimal Diffusion Processes. IEEE Control. Syst. Lett. 2(3): 465-470 (2018) - 2017
- [j4]Saber Jafarizadeh:
Optimizing the Diffusion System Based on Continuous-Time Consensus Algorithm. SIAM J. Control. Optim. 55(3): 2024-2051 (2017) - [j3]Saber Jafarizadeh:
Optimizing the Convergence Rate of the Continuous-Time Quantum Consensus. IEEE Trans. Autom. Control. 62(12): 6122-6135 (2017) - 2016
- [j2]Saber Jafarizadeh:
Optimizing the convergence rate of the quantum consensus: A discrete-time model. Autom. 73: 237-247 (2016) - [c5]Saber Jafarizadeh:
Continuous time quantum consensus & quantum synchronisation. AuCC 2016: 375-380 - [i16]Saber Jafarizadeh:
Optimizing the Diffusion System Based on Continuous-Time Consensus Algorithm. CoRR abs/1604.00634 (2016) - [i15]Saber Jafarizadeh:
Continuous Time Quantum Consensus & Quantum Synchronisation. CoRR abs/1605.06976 (2016) - 2015
- [b1]Saber Jafarizadeh:
Distributed coding and algorithm optimization for large-scale networked systems. University of Sydney, Australia, 2015 - [j1]Saber Jafarizadeh, Abbas Jamalipour:
Adapting Distributed LT codes to Y-Networks: An Abstraction of Collection Tree in Sensor Networks. ACM Trans. Sens. Networks 11(4): 54:1-54:24 (2015) - [i14]Saber Jafarizadeh:
Optimizing the Convergence Rate of the Continuous Time Quantum Consensus. CoRR abs/1509.05823 (2015) - [i13]Saber Jafarizadeh:
Optimizing the Convergence Rate of the Quantum Consensus: A Discrete Time Model. CoRR abs/1510.05178 (2015) - [i12]Saber Jafarizadeh:
Optimizing the Gossip Algorithm with Non-Uniform Clock Distribution over Classical & Quantum Networks. CoRR abs/1512.03551 (2015) - 2014
- [c4]Saber Jafarizadeh, Abbas Jamalipour:
An exact solution to degree distribution optimization in LT codes. WCNC 2014: 764-768 - 2012
- [c3]Saber Jafarizadeh, Abbas Jamalipour:
Distributed data storage in sensor networks based on Raptor codes. PIMRC 2012: 1509-1514 - [i11]Saber Jafarizadeh, Abbas Jamalipour:
Distributed Data Storage in Large-Scale Sensor Networks Based on LT Codes. CoRR abs/1201.4479 (2012) - [i10]Saber Jafarizadeh, Abbas Jamalipour:
A Solution to Fastest Distributed Consensus Problem for Generic Star & K-cored Star Networks. CoRR abs/1201.4480 (2012) - 2011
- [c2]Saber Jafarizadeh, Abbas Jamalipour:
Fastest Distributed Consensus on Star-Mesh Hybrid Sensor Networks. ICC 2011: 1-5 - [c1]Saber Jafarizadeh, Abbas Jamalipour:
Fastest mixing Markov chain on symmetric K-partite sensor networks. IWCMC 2011: 1883-1888 - 2010
- [i9]Saber Jafarizadeh:
Exact Determination of Optimal Weights for Fastest Distribution Consensus Algorithm in Star and CCS Networks via SDP. CoRR abs/1001.4278 (2010) - [i8]Saber Jafarizadeh:
Exact Determination of Optimal Weights for Fastest Distributed Consensus Algorithm in Path Network via SDP. CoRR abs/1002.0722 (2010) - [i7]Saber Jafarizadeh:
Fastest Distributed Consensus Problem on Fusion of Two Star Networks. CoRR abs/1003.3543 (2010) - [i6]Saber Jafarizadeh:
Optimal Weights of Certain Branches of an Arbitrary Connected Network for Fastest Distributed Consensus Averaging Problem. CoRR abs/1004.5094 (2010) - [i5]Saber Jafarizadeh:
Fastest Distributed Consensus Averaging Problem on Perfect and Complete n-ary Tree networks. CoRR abs/1005.2662 (2010) - [i4]Saber Jafarizadeh:
Fastest Distributed Consensus Averaging Problem on Chain of Rhombus Networks. CoRR abs/1006.3537 (2010) - [i3]Saber Jafarizadeh:
Fastest Mixing Markov Chain on Symmetric K-Partite Network. CoRR abs/1008.2588 (2010) - [i2]Saber Jafarizadeh, Abbas Jamalipour:
Fastest Distributed Consensus on Star-Mesh Hybrid Sensor Networks. CoRR abs/1009.4569 (2010) - [i1]Saber Jafarizadeh:
Fastest Distributed Consensus on Petal Networks. CoRR abs/1009.4971 (2010)
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-27 21:42 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:
