Peter Rost

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 Vincenzo Sciancalepore

> Home > Persons > Peter Rost

Publications

2017
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/cm/RostMMSSSHTHBAB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cm/RostMMSSSHTHBAB17
Peter Rost, Christian Mannweiler, Diomidis S. Michalopoulos, Cinzia Sartori, Vincenzo Sciancalepore, Nishanth Sastry, Oliver Holland, Shreya Tayade, Bin Han, Dario Bega, Danish Aziz, Hajo Bakker:
Network Slicing to Enable Scalability and Flexibility in 5G Mobile Networks. IEEE Commun. Mag. 55(5): 72-79 (2017)
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/pimrc/MichalopoulosDS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pimrc/MichalopoulosDS17
Diomidis S. Michalopoulos, Mark Doll, Vincenzo Sciancalepore, Dario Bega, Peter Schneider, Peter Rost:
Network slicing via function decomposition and flexible network design. PIMRC 2017: 1-6
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/RostMMSSSHTHBAB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/RostMMSSSHTHBAB17
Peter Rost, Christian Mannweiler, Diomidis S. Michalopoulos, Cinzia Sartori, Vincenzo Sciancalepore, Nishanth Sastry, Oliver Holland, Shreya Tayade, Bin Han, Dario Bega, Danish Aziz, Hajo Bakker:
Network Slicing to Enable Scalability and Flexibility in 5G Mobile Networks. CoRR abs/1704.02129 (2017)

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.