Goran Lj. Djordjevic

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 Milorad Tosic

> Home > Persons > Goran Lj. Djordjevic

Publications

2001
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/jsac/VasicDT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsac/VasicDT01
Bane Vasic, Goran Lj. Djordjevic, Milorad B. Tosic:
Loose composite constraint codes and their application in DVD. IEEE J. Sel. Areas Commun. 19(4): 765-773 (2001)
1998
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jsa/TosicSMD98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsa/TosicSMD98
Milorad B. Tosic, Mile K. Stojcev, Dejan M. Maksimovic, Goran Lj. Djordjevic:
The asynchronous counterflow pipeline bit-serial multiplier. J. Syst. Archit. 44(12): 985-1004 (1998)
1996
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cj/DjordjevicT96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/DjordjevicT96
Goran Lj. Djordjevic, Milorad B. Tosic:
A Compile-Time Scheduling Heuristic for Multiprocessor Architectures. Comput. J. 39(8): 663-674 (1996)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/pc/DjordjevicT96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/DjordjevicT96
Goran Lj. Djordjevic, Milorad B. Tosic:
A Heuristic for Scheduling Task Graphs with Communication Delays Onto Multiprocessors. Parallel Comput. 22(9): 1197-1214 (1996)

a service of

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.