Lawrence L. Larmore

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 Benjamin Depardon

> Home > Persons > Lawrence L. Larmore

Publications

2011
[j52]
- view
  authority control:
- export record
  dblp key:
  - journals/tsi/CaronDDL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsi/CaronDDL11
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore:
Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. Tech. Sci. Informatiques 30(10): 1191-1216 (2011)
[c48]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/CaronDDL11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/CaronDDL11
Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore:
On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops 2011: 1919-1929
2010
[j50]
- view
  authority control:
- export record
  dblp key:
  - journals/jpdc/CaronDDL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jpdc/CaronDDL10
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore:
A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distributed Comput. 70(11): 1159-1173 (2010)
2009
[c42]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/CaronDDL09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/CaronDDL09
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore:
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. Euro-Par 2009: 602-614

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.