Carlo Alberto Boano

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 Lothar Thiele

> Home > Persons > Carlo Alberto Boano

Publications

2021
[j12]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jsys/JacobZBVT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsys/JacobZBVT21
Romain Jacob, Marco Zimmerling, Carlo Alberto Boano, Laurent Vanbever, Lothar Thiele:
[Tool] Designing Replicable Networking Experiments With Triscale. J. Syst. Res. 1(1) (2021)
2019
[c54]
- view
  authority control:
- export record
  dblp key:
  - conf/cpsweek/JacobBRZT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpsweek/JacobBRZT19
Romain Jacob, Carlo Alberto Boano, Usman Raza, Marco Zimmerling, Lothar Thiele:
Towards a methodology for experimental evaluation in low-power wireless networking. Bench@CPSIoTWeek 2019: 18-23
2016
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/sensys/DuquennoyLBZBCG16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sensys/DuquennoyLBZBCG16
Simon Duquennoy, Olaf Landsiedel, Carlo Alberto Boano, Marco Zimmerling, Jan Beutel, Mun Choon Chan, Omprakash Gnawali, Mobashir Mohammad, Luca Mottola, Lothar Thiele, Xavier Vilajosana, Thiemo Voigt, Thomas Watteyne:
A Benchmark for Low-power Wireless Networking: Poster Abstract. SenSys 2016: 332-333

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.