Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Nikolaos Mavridis

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 Kamill Gusmanov

> Home > Persons > Nikolaos Mavridis

Publications

2017
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/aina/KhandaSGMM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aina/KhandaSGMM17
Kevin Khanda, Dilshat Salikhov, Kamill Gusmanov, Manuel Mazzara, Nikolaos Mavridis:
Microservice-Based IoT for Smart Buildings. AINA Workshops 2017: 302-308
2016
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/SalikhovKGMM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/SalikhovKGMM16
Dilshat Salikhov, Kevin Khanda, Kamill Gusmanov, Manuel Mazzara, Nikolaos Mavridis:
Microservice-based IoT for Smart Buildings. CoRR abs/1610.09480 (2016)
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GusmanovKSMM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GusmanovKSMM16
Kamill Gusmanov, Kevin Khanda, Dilshat Salikhov, Manuel Mazzara, Nikolaos Mavridis:
Jolie Good Buildings: Internet of things for smart building infrastructure supporting concurrent apps utilizing distributed microservices. CoRR abs/1611.08995 (2016)

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.