default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTasho D. Tashev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c15]Tasho D. Tashev, Alexander K. Alexandrov
, Dimitar D. Arnaudov, Radostina P. Tasheva:
Large-Scale Computer Simulation of the Performance of the Generalized Nets Model of the LPF-algorithm. LSSC 2021: 480-486
2010 – 2019
- 2019
- [c14]Tasho D. Tashev, Radostina P. Tasheva, Petar Petrov:
Determination of the Computer Modelling Precision for Throughput of Switch Node with LPF-algorithm. CompSysTech 2019: 141-145 - [c13]Alexander Alexandrov, Vladimir V. Monov, Tasho D. Tashev:
Generalized Nets Model of Data Parallel Processing in Large Scale Wireless Sensor Networks. LSSC 2019: 475-483 - 2016
- [c12]Tasho D. Tashev, Marin B. Marinov, Vladimir V. Monov, Radostina P. Tasheva:
Modeling of the MiMa-algorithm for crossbar switch by means of Generalized Nets. IEEE Conf. on Intelligent Systems 2016: 593-598 - [c11]Tasho D. Tashev, Vladimir V. Monov, Radostina P. Tasheva:
High Performance Computations for Study the Stability of a Numerical Procedure for Crossbar Switch Node. NAA 2016: 665-673 - 2014
- [c10]Tasho D. Tashev, Vladimir V. Monov:
Computer simulations of a modified MiMa-algorithm for a crossbar packet switch. CompSysTech 2014: 94-99 - [c9]Tasho D. Tashev, Vladimir V. Monov:
A Numerical Study of the Upper Bound of the Throughput of a Crossbar Switch Utilizing MiMa-Algorithm. NMA 2014: 295-303 - 2013
- [c8]Tasho D. Tashev, Vladimir V. Monov:
A computer modeling of the throughput of a crossbar switch by PI-patterns for uniform traffic with variable intensity. CompSysTech 2013: 53-58 - [c7]Tasho D. Tashev, Vladimir V. Monov:
Large-Scale Simulation of Non-uniform Load Traffic in Studying the Throughput of a Crossbar Packed Switch. LSSC 2013: 644-651 - 2012
- [c6]Tasho D. Tashev, Vladimir V. Monov:
A simulation study of the throughput of a crossbar switch node by means of periodic input patterns. CompSysTech 2012: 238-244 - [c5]Kiril Kolchakov, Tasho D. Tashev:
An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix. CompSysTech 2012: 245-250 - [c4]Tasho D. Tashev, Vladimir V. Monov:
Modeling of the hotspot load traffic for crossbar switch node by means of Generalized Nets. IEEE Conf. of Intelligent Systems 2012: 187-191 - 2011
- [c3]Tasho D. Tashev, Vladimir V. Monov:
A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5. CompSysTech 2011: 466-471 - [c2]Tasho D. Tashev, Vladimir V. Monov:
Large-Scale Simulation of Uniform Load Traffic for Modeling of Throughput on a Crossbar Switch Node. LSSC 2011: 638-645 - 2010
- [c1]Tasho D. Tashev:
Computering simulation of schedule algorithm for high performance packet switch node modelled by the apparatus of generalized nets. CompSysTech 2010: 240-245
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-24 23:00 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:
