default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahram Saeidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Shahram Saeidi
:
Identifying personality traits of WhatsApp users based on frequently used emojis using deep learning. Multim. Tools Appl. 83(5): 13873-13886 (2024)- 2022
- [j10]Fariba Najafzade, Sahar Khoshfetrat, Shahram Saeidi:
A cross-efficiency model using bargaining theory in a two-stage network DEA. Comput. Appl. Math. 41(7) (2022) - 2020
- [j9]Samira Alizdeh, Shahram Saeidi:
Fuzzy project scheduling with critical path including risk and resource constraints using linear programming. Int. J. Adv. Intell. Paradigms 16(1): 4-17 (2020) - [j8]Mohsen Hoseini, Shahram Saeidi, Do Sang Kim:
On perturbed hybrid steepest descent method with minimization or superiorization for subdifferentiable functions. Numer. Algorithms 85(1): 353-374 (2020)
2010 – 2019
- 2019
- [j7]Bahareh Bahrami, Mohammad Ali Jabraeil Jamali, Shahram Saeidi:
A hierarchical architecture based on traveling salesman problem for hybrid wireless network-on-chip. Wirel. Networks 25(5): 2187-2200 (2019) - 2018
- [j6]Bahareh Bahrami, Mohammad Ali Jabraeil Jamali, Shahram Saeidi:
A novel hierarchical architecture for Wireless Network-on-Chip. J. Parallel Distributed Comput. 120: 307-321 (2018) - 2017
- [j5]Bahareh Bahrami, Mohammad Ali Jabraeil Jamali, Shahram Saeidi:
A Demand-Based Structure for the Architecture of Wireless Networks on Chip. Wirel. Pers. Commun. 96(1): 455-473 (2017) - 2016
- [j4]Bahareh Bahrami, Mohammad Ali Jabraeil Jamali, Shahram Saeidi:
Proposing an optimal structure for the architecture of wireless networks on chip. Telecommun. Syst. 62(1): 199-214 (2016) - 2014
- [j3]Shahram Saeidi, Do Sang Kim:
Combination of the Hybrid Steepest-Descent Method and the Viscosity Approximation. J. Optim. Theory Appl. 160(3): 911-930 (2014) - 2010
- [j2]Shahram Saeidi:
Modified hybrid steepest-descent methods for variational inequalities and fixed points. Math. Comput. Model. 52(1-2): 134-142 (2010)
2000 – 2009
- 2006
- [j1]Shahram Saeidi:
A counterexample to the article "On the fixed points of affine nonexpansive mappings". Int. J. Math. Math. Sci. 2006: 89475:1-89475:2 (2006)
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 2024-04-25 05:52 CEST 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:
