Gordana Gardasevic

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Igor Radusinovic

> Home > Persons > Gordana Gardasevic

Publications

2017
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/wpc/GardasevicVMVRT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/wpc/GardasevicVMVRT17
Gordana Gardasevic, Mladen Veletic, Nebojsa Maletic, Dragan Vasiljevic, Igor Radusinovic, Slavica Tomovic, Milutin Radonjic:
The IoT Architectural Framework, Design Issues and Application Domains. Wirel. Pers. Commun. 92(1): 127-148 (2017)
2015
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/GardasevicDRR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/GardasevicDRR15
Gordana Gardasevic, Soko Divanovic, Milutin Radonjic, Igor Radusinovic:
A QoS-Aware Dual Crosspoint Queued Switch with Largest Weighted Occupancy First Scheduling Algorithm. IEICE Trans. Commun. 98-B(1): 201-208 (2015)
2013
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iscc/DivanovicRRG13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscc/DivanovicRRG13
Soko Divanovic, Milutin Radonjic, Igor Radusinovic, Gordana Gardasevic:
Performance analysis of crosspoint queued crossbar switch with weighted round robin scheduling algorithm under unbalanced bursty traffic. ISCC 2013: 120-124

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.