Miguel A. Mosteiro

Available identifiers

zbMath Open mosteiro.miguel-aMaRDI QIDQ362556

List of research outcomes

Publication	Date of Publication	Type
Verifiable crowd computing: coping with bounded rationality	2024-06-19	Paper
Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model	2023-10-30	Paper
Dynamic multiple-message broadcast: bounding throughput in the affectance model	2023-08-17	Paper
Verifiable crowd computing: coping with bounded rationality	2023-08-03	Paper
Dynamic Windows Scheduling with Reallocation	2022-09-06	Paper
Polynomial anonymous dynamic distributed computing without a unique leader	2022-07-21	Paper
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework	2022-01-18	Paper
Polynomial anonymous dynamic distributed computing without a unique leader	2021-10-28	Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations	2021-07-28	Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations	2020-11-11	Paper
Station assignment with reallocation	2019-03-11	Paper
A faster exact-counting protocol for anonymous dynamic networks	2019-01-11	Paper
Station assignment with applications to sensing	2018-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q4580194	2018-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q5363819	2017-09-29	Paper
Fault-tolerant aggregation: flow-updating meets mass-distribution	2017-09-04	Paper
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing	2017-06-20	Paper
Initializing sensor networks of non-uniform density in the weak sensor model	2015-09-03	Paper
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions	2015-03-06	Paper
Brief announcement	2014-12-05	Paper
Bootstrapping a hop-optimal network in the weak sensor model	2014-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q5403057	2014-03-25	Paper
Unbounded contention resolution in multiple-access channels	2013-11-11	Paper
An early-stopping protocol for computing aggregate functions in Sensor Networks	2013-08-22	Paper
Crowd computing as a cooperation problem: An evolutionary approach	2013-06-07	Paper
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)	2013-03-04	Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony	2013-02-04	Paper
Opportunistic information dissemination in mobile ad-hoc networks: adaptiveness vs. obliviousness and randomization vs. determinism	2012-06-29	Paper
Deterministic recurrent communication in restricted sensor networks	2012-03-13	Paper
Unbounded contention resolution in multiple-access channels	2011-10-28	Paper
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS	2011-03-25	Paper
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony	2010-09-10	Paper
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks	2010-07-20	Paper
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model	2009-02-17	Paper
Lower Bounds for Clear Transmissions in Radio Networks	2008-09-18	Paper
Sensor Network Gossiping or How to Break the Broadcast Lower Bound	2008-05-27	Paper
INSERTION SORT is \(O(n \log n)\)	2007-02-13	Paper
Algorithms – ESA 2005	2006-06-27	Paper

Research outcomes over time

This page was built for person: Miguel A. Mosteiro