Lower Bounds for Clear Transmissions in Radio Networks. - Martin Farach-Colton; Rohan J. Fernandes; Miguel A. Mosteiro (LATIN, 2006)

Insertion Sort is O(n log n). - Michael A. Bender; Martin Farach-Colton; Miguel A. Mosteiro (Theory Comput. Syst., 2006)

Sensor Network Gossiping or How to Break the Broadcast Lower Bound. - Martin Farach-Colton; Miguel A. Mosteiro (ISAAC, 2007)

Deterministic Communication in the Weak Sensor Model. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (OPODIS, 2007)

Designing Mechanisms for Reliable Internet-based Computing. - Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (NCA, 2008)

Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (DISC, 2008)

Bootstrapping a hop-optimal network in the weak sensor model. - Martin Farach-Colton; Rohan J. Fernandes; Miguel A. Mosteiro (ACM Trans. Algorithms, 2009)

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. - Antonio Fernández Anta; Miguel A. Mosteiro (COCOON, 2010)

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers. - Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (IPDPS, 2010)

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. - Antonio Fernández Anta; Miguel A. Mosteiro (Discret. Math. Algorithms Appl., 2010)

Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (NCA, 2011)

Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (DISC, 2011)

Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. - Martin Farach-Colton; Antonio Fernández Anta; Alessia Milani; Miguel A. Mosteiro; Shmuel Zaks (DISC, 2011)

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (Discret. Math. Theor. Comput. Sci., 2011)

Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro; Ángel Sánchez (Euro-Par, 2012)

Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. - Martin Farach-Colton; Antonio Fernández Anta; Alessia Milani; Miguel A. Mosteiro; Shmuel Zaks (LATIN, 2012)

Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro; Ángel Sánchez (PODC, 2012)

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony. - Antonio Fernández Anta; Alessia Milani; Miguel A. Mosteiro; Shmuel Zaks (Distributed Comput., 2012)

Deterministic recurrent communication in restricted Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (Theor. Comput. Sci., 2012)

Station Assignment with Applications to Sensing. - Antonio Fernández Anta; Dariusz R. Kowalski; Miguel A. Mosteiro; Prudence W. H. Wong (ALGOSENSORS, 2013)

Reputation-Based Mechanisms for Evolutionary Master-Worker Computing. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro; Ángel Sánchez (OPODIS, 2013)

Unbounded Contention Resolution in Multiple-Access Channels. - Antonio Fernández Anta; Miguel A. Mosteiro; Jorge Ramón Muñoz (Algorithmica, 2013)

Applying the dynamics of evolution to achieve reliability in master-worker computing. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro; Ángel Sánchez (Concurr. Comput. Pract. Exp., 2013)

Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion. - Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (CoRR, 2013)

Power-efficient Assignment of Virtual Machines to Physical Machines - Jordi Arjona Aroca; Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (CoRR, 2013)

An early-stopping protocol for computing aggregate functions in Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (J. Parallel Distributed Comput., 2013)

Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). - Martin Farach-Colton; Antonio Fernández Anta; Miguel A. Mosteiro (Theor. Comput. Sci., 2013)

Dynamic multiple-message broadcast: bounding throughput in the affectance model. - Dariusz R. Kowalski; Miguel A. Mosteiro; Tevin Rouse (FOMC, 2014)

Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (IEEE Trans. Computers, 2014)

A Faster Counting Protocol for Anonymous Dynamic Networks. - Alessia Milani; Miguel A. Mosteiro (OPODIS, 2015)

Station Assignment with Reallocation. - Miguel A. Mosteiro; Yulia Rossikova; Prudence W. H. Wong (SEA, 2015)

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. - Martin Farach-Colton; Miguel A. Mosteiro (Algorithmica, 2015)

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. - Esther M. Arkin; Antonio Fernández Anta; Joseph S. B. Mitchell; Miguel A. Mosteiro (Comput. Geom., 2015)

Counting in Practical Anonymous Dynamic Networks is Polynomial. - Maitri Chakraborty; Alessia Milani; Miguel A. Mosteiro (NETYS, 2016)

Internet Computing: Using Reputation to Select Workers from a Pool. - Evgenia Christoforou; Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro (NETYS, 2016)

Multi-round Master-Worker Computing: A Repeated Game Approach. - Antonio Fernández Anta; Chryssis Georgiou; Miguel A. Mosteiro; Daniel Pareja (SRDS, 2016)

Power-efficient assignment of virtual machines to physical machines. - Jordi Arjona Aroca; Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves; Lin Wang 015 (Future Gener. Comput. Syst., 2016)

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract. - Dariusz R. Kowalski; Harshita Kudaravalli; Miguel A. Mosteiro (IoTDI, 2017)

A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem. - Mohammad Harun Rashid; Miguel A. Mosteiro (ISPA/IUCC, 2017)

Ad-Hoc Affectance-Selective Families for Layer Dissemination. - Harshita Kudaravalli; Miguel A. Mosteiro (SEA, 2017)

Ad-hoc Affectance-selective Families for Layer Dissemination. - Dariusz R. Kowalski; Harshita Kudaravalli; Miguel A. Mosteiro (CoRR, 2017)

Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution. - Paulo Sérgio Almeida; Carlos Baquero; Martin Farach-Colton; Paulo Jesus; Miguel A. Mosteiro (Distributed Comput., 2017)

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks. - Maitri Chakraborty; Alessia Milani; Miguel A. Mosteiro (Algorithmica, 2018)

Closure Operators and Spam Resistance for PageRank. - Lucas Farach-Colton; Martin Farach-Colton; Reut Levi; Moti Medina; Miguel A. Mosteiro (CoRR, 2018)

Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees. - Antonio Fernández Anta; Dariusz R. Kowalski; Miguel A. Mosteiro; Prudence W. H. Wong (ACM Trans. Parallel Comput., 2018)

mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals. - Pawel Garncarek; Tomasz Jurdzinski; Dariusz R. Kowalski; Miguel A. Mosteiro (IPDPS, 2019)

Station Assignment with Reallocation. - Austin Halper; Miguel A. Mosteiro; Yulia Rossikova; Prudence W. H. Wong (Algorithmica, 2019)

Heuristically Speeding up Anonymous Dynamic Network Computations. - Austin Halper; Dariusz R. Kowalski; Miguel A. Mosteiro (ISPA/BDCloud/SocialCom/SustainCom, 2020)

Generic Framework for Optimization of Local Dissemination in Wireless Networks. - Dariusz R. Kowalski; Miguel A. Mosteiro; Krutika Wadhwa (NETYS, 2020)

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. - Dariusz R. Kowalski; Miguel A. Mosteiro (J. ACM, 2020)

Optimizing mmWave Wireless Backhaul Scheduling. - Edgar Arribas; Antonio Fernández Anta; Dariusz R. Kowalski; Vincenzo Mancuso; Miguel A. Mosteiro; Joerg Widmer; Prudence W. H. Wong (IEEE Trans. Mob. Comput., 2020)

Time and Communication Complexity of Leader Election in Anonymous Networks. - Dariusz R. Kowalski; Miguel A. Mosteiro (ICDCS, 2021)

Supervised Average Consensus in Anonymous Dynamic Networks. - Dariusz R. Kowalski; Miguel A. Mosteiro (SPAA, 2021)

Dynamic Windows Scheduling with Reallocation. - Martin Farach-Colton; Katia Leal; Miguel A. Mosteiro; Christopher Thraves Caro (ACM J. Exp. Algorithmics, 2021)

Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity. - Dariusz R. Kowalski; Miguel A. Mosteiro (CoRR, 2022)

Polynomial anonymous dynamic distributed computing without a unique leader. - Dariusz R. Kowalski; Miguel A. Mosteiro (J. Comput. Syst. Sci., 2022)

Information dissemination in wireless ad-hoc networks under the weighted-TIM framework. - Lu Dong; Dariusz R. Kowalski; Harshita Kudaravalli; Miguel A. Mosteiro (Theor. Comput. Sci., 2022)

The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference. - Dariusz R. Kowalski; Miguel A. Mosteiro (ISIT, 2023)

Graph Ranking and the Cost of Sybil Defense. - Gwendolyn Farach-Colton; Martin Farach-Colton; Leslie Ann Goldberg; Hanna Komlós; John Lapinskas; Reut Levi; Moti Medina; Miguel A. Mosteiro (EC, 2023)

Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks. - Aleksandar Kamenev; Dariusz R. Kowalski; Miguel A. Mosteiro (ACM Trans. Parallel Comput., 2023)

Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. - Dariusz R. Kowalski; Miguel A. Mosteiro; Kevin Zaki (Theory Comput. Syst., 2023)

Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model. - Dariusz R. Kowalski; Miguel A. Mosteiro; Kevin Zaki (Theory Comput. Syst., 2023)

Distributed Station Assignment Through Learning. - Lu Dong; Miguel A. Mosteiro; Michelle Wang (NETYS, 2024)

Algebraic Computations in Anonymous VANET. - Dariusz R. Kowalski; Miguel A. Mosteiro; Austin Powlette (NETYS, 2024)

Verifiable Crowd Computing: Coping with bounded rationality. - Lu Dong; Miguel A. Mosteiro; Shikha Singh 002 (Theor. Comput. Sci., 2024)

Beeping Deterministic CONGEST Algorithms in Graphs. - Pawel Garncarek; Dariusz R. Kowalski; Shay Kutten; Miguel A. Mosteiro (CoRR, 2025)

On the Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference. - Dariusz R. Kowalski; Miguel A. Mosteiro (IEEE Trans. Inf. Theory, 2025)