Antonios Symvonis

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 Fillia Makedon

> Home > Persons > Antonios Symvonis

Publications

1996
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/MakedonS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/MakedonS96
Fillia Makedon, Antonios Symvonis:
Flit-Serial Packet Routing on Meshes and Tori. Math. Syst. Theory 29(4): 311-330 (1996)
1994
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jpdc/MakedonS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/MakedonS94
Fillia Makedon, Antonios Symvonis:
Optimal-Algorithms for Multipacket Routing Problems on Rings. J. Parallel Distributed Comput. 22(1): 37-43 (1994)
1993
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/mam/MakedonS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mam/MakedonS93
Fillia Makedon, Antonios Symvonis:
Optimal algorithms for the many-to-one routing problem on two-dimensional meshes. Microprocess. Microsystems 17(6): 361-367 (1993)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/MakedonS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/MakedonS93
Fillia Makedon, Antonios Symvonis:
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements. IEEE Trans. Parallel Distributed Syst. 4(3): 270-276 (1993)

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.