Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Stamatis Karnouskos

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 Frances Cleary

> Home > Persons > Stamatis Karnouskos

Publications

2012
[e3]
- view
  authority control:
- export record
  dblp key:
  - conf/fia/2012
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fia/2012
Federico Alvarez, Frances Cleary, Petros Daras, John Domingue, Alex Galis, Ana Garcia, Anastasius Gavras, Stamatis Karnouskos, Srdjan Krco, Man-Sze Li, Volkmar Lotz, Henning Müller, Elio Salvadori, Anne-Marie Sassen, Hans Schaffers, Burkhard Stiller, Georgios Tselentis, Petra Turkama, Theodore B. Zahariadis:
The Future Internet - Future Internet Assembly 2012: From Promises to Reality. Lecture Notes in Computer Science 7281, Springer 2012, ISBN 978-3-642-30240-4 [contents]
2011
[e2]
- view
  authority control:
- export record
  dblp key:
  - conf/fia/2011
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fia/2011
John Domingue, Alex Galis, Anastasius Gavras, Theodore B. Zahariadis, Dave Lambert, Frances Cleary, Petros Daras, Srdjan Krco, Henning Müller, Man-Sze Li, Hans Schaffers, Volkmar Lotz, Federico Alvarez, Burkhard Stiller, Stamatis Karnouskos, Susanna Avessta, Michael Nilsson:
The Future Internet - Future Internet Assembly 2011: Achievements and Technological Promises. Lecture Notes in Computer Science 6656, Springer 2011, ISBN 978-3-642-20897-3 [contents]

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.