Mikael Johansson 0001

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 Maben Rabi

> Home > Persons > Mikael Johansson 0001

Publications

2009
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/siamjo/JohanssonRJ09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamjo/JohanssonRJ09
Björn Johansson, Maben Rabi, Mikael Johansson:
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems. SIAM J. Optim. 20(3): 1157-1170 (2009)
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/cdc/AlmstromRJ09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/AlmstromRJ09
Peter Almström, Maben Rabi, Mikael Johansson:
Networked state estimation over a Gilbert-Elliot type channel. CDC 2009: 2711-2716
2008
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/cdc/RabiJJ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/RabiJJ08
Maben Rabi, Karl Henrik Johansson, Mikael Johansson:
Optimal stopping for event-triggered sensing and actuation. CDC 2008: 3607-3612
2007
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/cdc/0003RJ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/0003RJ07
Björn Johansson, Maben Rabi, Mikael Johansson:
A simple peer-to-peer algorithm for distributed optimization in sensor networks. CDC 2007: 4705-4710

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.