Miguel A. Mosteiro

From MaRDI portal
Person:362556

Available identifiers

zbMath Open mosteiro.miguel-aMaRDI QIDQ362556

List of research outcomes





PublicationDate of PublicationType
Verifiable crowd computing: coping with bounded rationality2024-06-19Paper
Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model2023-10-30Paper
Dynamic multiple-message broadcast: bounding throughput in the affectance model2023-08-17Paper
Verifiable crowd computing: coping with bounded rationality2023-08-03Paper
Dynamic Windows Scheduling with Reallocation2022-09-06Paper
Polynomial anonymous dynamic distributed computing without a unique leader2022-07-21Paper
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework2022-01-18Paper
Polynomial anonymous dynamic distributed computing without a unique leader2021-10-28Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations2021-07-28Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations2020-11-11Paper
Station assignment with reallocation2019-03-11Paper
A faster exact-counting protocol for anonymous dynamic networks2019-01-11Paper
Station assignment with applications to sensing2018-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45801942018-08-13Paper
https://portal.mardi4nfdi.de/entity/Q53638192017-09-29Paper
Fault-tolerant aggregation: flow-updating meets mass-distribution2017-09-04Paper
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing2017-06-20Paper
Initializing sensor networks of non-uniform density in the weak sensor model2015-09-03Paper
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions2015-03-06Paper
Brief announcement2014-12-05Paper
Bootstrapping a hop-optimal network in the weak sensor model2014-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54030572014-03-25Paper
Unbounded contention resolution in multiple-access channels2013-11-11Paper
An early-stopping protocol for computing aggregate functions in Sensor Networks2013-08-22Paper
Crowd computing as a cooperation problem: An evolutionary approach2013-06-07Paper
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)2013-03-04Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony2013-02-04Paper
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism2012-06-29Paper
Deterministic recurrent communication in restricted sensor networks2012-03-13Paper
Unbounded contention resolution in multiple-access channels2011-10-28Paper
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS2011-03-25Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony2010-09-10Paper
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks2010-07-20Paper
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model2009-02-17Paper
Lower Bounds for Clear Transmissions in Radio Networks2008-09-18Paper
Sensor Network Gossiping or How to Break the Broadcast Lower Bound2008-05-27Paper
INSERTION SORT is \(O(n \log n)\)2007-02-13Paper
Algorithms – ESA 20052006-06-27Paper

Research outcomes over time

This page was built for person: Miguel A. Mosteiro