Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mosteiro, Miguel A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Martín Farach-Colton
,
Antonio Fernández Anta
,
Miguel A. Mosteiro
Theoretical Computer Science
472
, 2013, pp. 60-80
Unbounded contention resolution in multiple-access channels
Antonio Fernández Anta
,
Miguel A. Mosteiro
,
Jorge Ramón Muñoz
Algorithmica
67
(3), 2013, pp. 295-314
An early-stopping protocol for computing aggregate functions in sensor networks
Antonio Fernández Anta
,
Miguel A. Mosteiro
,
Christopher Thraves
Journal Parallel Distributed Computing
73
(2), 2013, pp. 111-121
Deterministic recurrent communication in restricted Sensor Networks
Antonio Fernández Anta
,
Miguel A. Mosteiro
,
Christopher Thraves
Theoretical Computer Science
418
, 2012, pp. 37-47
Contention resolution in multiple-access channels:
k
-selection in radio networks
Antonio Fernández Anta
,
Miguel A. Mosteiro
Lecture Notes in Computer Science
6196
, 2010, pp. 378-388
Initializing sensor networks of non-uniform density in the weak sensor model
Martín Farach-Colton
,
Miguel A. Mosteiro
Lecture Notes in Computer Science
4619
, 2007, pp. 565-576
Sensor network gossiping or how to break the broadcast lower bound
Martín Farach-Colton
,
Miguel A. Mosteiro
Lecture Notes in Computer Science
4835
, 2007, pp. 232-243
Insertion sort is
O(n \log n)
Michael A. Bender
,
Martin Farach-Colton
,
Miguel A. Mosteiro
Theory of Computing Systems
39
(3), 2006, pp. 391-397
Bootstrapping a hop-optimal network in the weak sensor model
Martín Farach-Colton
,
Rohan J. Fernandes
,
Miguel A. Mosteiro
Lecture Notes in Computer Science
3669
, 2005, pp. 827-838