Miguel A. Mosteiro

103 papers A* 5A 11B 18C 4Misc 2Journal 51Unranked 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
Anonymous adversarial dynamic networks with logarithmic memory and communication.
Theor. Comput. Sci.
Dariusz R. Kowalski, Miguel A. Mosteiro
2025 A conf
Beeping Deterministic CONGEST Algorithms in Graphs.
ESA
Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro
2025 J jnl
Beeping Deterministic CONGEST Algorithms in Graphs.
CoRR
Pawel Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro
2025 B conf
Deterministic Local Problems in Radio Networks: On the Impact of Local Domination and a Bit of Advice.
ISAAC
Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro
2025 J jnl
On the Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference.
IEEE Trans. Inf. Theory
Dariusz R. Kowalski, Miguel A. Mosteiro
2025 A conf
On the Complexity of Deterministic Distributed Wireless Link Scheduling.
ICDCS
Dariusz R. Kowalski, Miguel A. Mosteiro
2024 — conf
Algebraic Computations in Anonymous VANET.
NETYS
Dariusz R. Kowalski, Miguel A. Mosteiro, Austin Powlette
2024 — conf
Distributed Station Assignment Through Learning.
NETYS
Lu Dong, Miguel A. Mosteiro, Michelle Wang
2024 J jnl
Verifiable Crowd Computing: Coping with bounded rationality.
Theor. Comput. Sci.
Lu Dong, Miguel A. Mosteiro, Shikha Singh
2023 J jnl
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
Theory Comput. Syst.
Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
2023 J jnl
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
Theory Comput. Syst.
Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
2023 J jnl
Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks.
ACM Trans. Parallel Comput.
Aleksandar Kamenev, Dariusz R. Kowalski, Miguel A. Mosteiro
2023 A* conf
Graph Ranking and the Cost of Sybil Defense.
EC
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg, Hanna Komlós, John Lapinskas, Reut Levi, Moti Medina, Miguel A. Mosteiro
2023 B conf
The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference.
ISIT
Dariusz R. Kowalski, Miguel A. Mosteiro
2022 J jnl
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity.
CoRR
Dariusz R. Kowalski, Miguel A. Mosteiro
2022 J jnl
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework.
Theor. Comput. Sci.
Lu Dong, Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro
2022 J jnl
Polynomial anonymous dynamic distributed computing without a unique leader.
J. Comput. Syst. Sci.
Dariusz R. Kowalski, Miguel A. Mosteiro
2022 Misc conf
Verifiable Crowd Computing: Coping with Bounded Rationality.
FAW
Lu Dong, Miguel A. Mosteiro, Shikha Singh
2021 J jnl
Dynamic Windows Scheduling with Reallocation.
ACM J. Exp. Algorithmics
Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves Caro
2021 J jnl
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader.
CoRR
Dariusz R. Kowalski, Miguel A. Mosteiro
2021 B conf
Supervised Average Consensus in Anonymous Dynamic Networks.
SPAA
Dariusz R. Kowalski, Miguel A. Mosteiro
2021 A conf
Time and Communication Complexity of Leader Election in Anonymous Networks.
ICDCS
Dariusz R. Kowalski, Miguel A. Mosteiro
2021 J jnl
Time and Communication Complexity of Leader Election in Anonymous Networks.
CoRR
Dariusz R. Kowalski, Miguel A. Mosteiro
2020 — conf
Generic Framework for Optimization of Local Dissemination in Wireless Networks.
NETYS
Dariusz R. Kowalski, Miguel A. Mosteiro, Krutika Wadhwa
2020 — conf
Heuristically Speeding up Anonymous Dynamic Network Computations.
ISPA/BDCloud/SocialCom/SustainCom
Austin Halper, Dariusz R. Kowalski, Miguel A. Mosteiro
2020 J jnl
Optimizing mmWave Wireless Backhaul Scheduling.
IEEE Trans. Mob. Comput.
Edgar Arribas, Antonio Fernández Anta, Dariusz R. Kowalski, Vincenzo Mancuso, Miguel A. Mosteiro, Joerg Widmer, Prudence W. H. Wong
2020 J jnl
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
J. ACM
Dariusz R. Kowalski, Miguel A. Mosteiro
2019 A* conf
Polynomial Anonymous Dynamic Distributed Computing Without a Unique Leader.
ICALP
Dariusz R. Kowalski, Miguel A. Mosteiro
2019 J jnl
Station Assignment with Reallocation.
Algorithmica
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong
2019 A conf
mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals.
IPDPS
Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Miguel A. Mosteiro
2018 J jnl
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.
Algorithmica
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
2018 J jnl
Closure Operators and Spam Resistance for PageRank.
CoRR
Lucas Farach-Colton, Martin Farach-Colton, Reut Levi, Moti Medina, Miguel A. Mosteiro
2018 B ed.
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings
LATIN
Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
2018 A* conf
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
ICALP
Dariusz R. Kowalski, Miguel A. Mosteiro
2018 J jnl
Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees.
ACM Trans. Parallel Comput.
Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong
2018 J jnl
Station Assignment with Reallocation.
CoRR
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong
2017 — conf
A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem.
ISPA/IUCC
Mohammad Harun Rashid, Miguel A. Mosteiro
2017 B conf
Ad-Hoc Affectance-Selective Families for Layer Dissemination.
SEA
Harshita Kudaravalli, Miguel A. Mosteiro
2017 — conf
Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract.
IoTDI
Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro
2017 J jnl
Ad-hoc Affectance-selective Families for Layer Dissemination.
CoRR
Dariusz R. Kowalski, Harshita Kudaravalli, Miguel A. Mosteiro
2017 C ed.
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers
ALGOSENSORS
Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, Yanyong Zhang
2017 J jnl
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution.
Distributed Comput.
Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro
2017 J jnl
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
CoRR
Dariusz R. Kowalski, Miguel A. Mosteiro
2016 — conf
Counting in Practical Anonymous Dynamic Networks is Polynomial.
NETYS
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
2016 J jnl
Counting in Practical Anonymous Dynamic Networks is Polynomial.
CoRR
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
2016 — conf
Internet Computing: Using Reputation to Select Workers from a Pool.
NETYS
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2016 J jnl
Internet Computing: Using Reputation to Select Workers from a Pool.
CoRR
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2016 B conf
Multi-round Master-Worker Computing: A Repeated Game Approach.
SRDS
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja
2016 J jnl
Power-efficient assignment of virtual machines to physical machines.
Future Gener. Comput. Syst.
Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang
2015 B conf
A Faster Counting Protocol for Anonymous Dynamic Networks.
OPODIS
Alessia Milani, Miguel A. Mosteiro
2015 J jnl
A Faster Counting Protocol for Anonymous Dynamic Networks.
CoRR
Alessia Milani, Miguel A. Mosteiro
2015 J jnl
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
CoRR
Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
2015 J jnl
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.
Algorithmica
Martin Farach-Colton, Miguel A. Mosteiro
2015 J jnl
Multi-round Master-Worker Computing: a Repeated Game Approach.
CoRR
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Daniel Pareja
2015 J jnl
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions.
Comput. Geom.
Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro
2015 B conf
Station Assignment with Reallocation.
SEA
Miguel A. Mosteiro, Yulia Rossikova, Prudence W. H. Wong
2014 J jnl
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing.
IEEE Trans. Computers
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2014 B conf
Dynamic Windows Scheduling with Reallocation.
SEA
Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves
2014 J jnl
Dynamic Windows Scheduling with Reallocation.
CoRR
Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves
2014 — conf
Dynamic multiple-message broadcast: bounding throughput in the affectance model.
FOMC
Dariusz R. Kowalski, Miguel A. Mosteiro, Tevin Rouse
2014 — conf
Power-Efficient Assignment of Virtual Machines to Physical Machines.
ARMS-CC@PODC
Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves, Lin Wang
2013 J jnl
Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion.
CoRR
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2013 J jnl
An early-stopping protocol for computing aggregate functions in Sensor Networks.
J. Parallel Distributed Comput.
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2013 J jnl
Applying the dynamics of evolution to achieve reliability in master-worker computing.
Concurr. Comput. Pract. Exp.
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2013 J jnl
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound).
Theor. Comput. Sci.
Martin Farach-Colton, Antonio Fernández Anta, Miguel A. Mosteiro
2013 J jnl
Power-efficient Assignment of Virtual Machines to Physical Machines
CoRR
Jordi Arjona Aroca, Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2013 B conf
Reputation-Based Mechanisms for Evolutionary Master-Worker Computing.
OPODIS
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2013 J jnl
Reputation-based Mechanisms for Evolutionary Master-Worker Computing.
CoRR
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2013 C conf
Station Assignment with Applications to Sensing.
ALGOSENSORS
Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong
2013 J jnl
Unbounded Contention Resolution in Multiple-Access Channels.
Algorithmica
Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz
2012 — conf
Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics.
Euro-Par
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2012 A* conf
Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics.
PODC
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro, Ángel Sánchez
2012 J jnl
Deterministic recurrent communication in restricted Sensor Networks.
Theor. Comput. Sci.
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2012 B conf
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
LATIN
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2012 J jnl
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony.
Distributed Comput.
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 B conf
Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication.
NCA
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2011 A conf
Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication.
DISC
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2011 A conf
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism.
DISC
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 J jnl
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
Discret. Math. Theor. Comput. Sci.
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2011 J jnl
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution
CoRR
Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro
2011 B conf
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution.
OPODIS
Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro
2011 J jnl
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
CoRR
Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 J jnl
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
CoRR
Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro
2011 — conf
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
CCCG
Esther M. Arkin, Antonio Fernández Anta, Joseph S. B. Mitchell, Miguel A. Mosteiro
2011 J jnl
Unbounded Contention Resolution in Multiple-Access Channels
CoRR
Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz
2011 A conf
Unbounded Contention Resolution in Multiple-Access Channels.
DISC
Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz
2011 A* conf
Unbounded contention resolution in multiple-access channels.
PODC
Miguel A. Mosteiro, Antonio Fernández Anta, Jorge Ramón Muñoz
2010 A conf
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers.
IPDPS
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2010 Misc conf
Contention Resolution in Multiple-Access Channels:
COCOON
Antonio Fernández Anta, Miguel A. Mosteiro
2010 J jnl
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
Discret. Math. Algorithms Appl.
Antonio Fernández Anta, Miguel A. Mosteiro
2010 C conf
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
ALGOSENSORS
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2010 A conf
Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
DISC
Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2009 C conf
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.
PRDC
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2009 J jnl
Bootstrapping a hop-optimal network in the weak sensor model.
ACM Trans. Algorithms
Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
2008 A conf
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.
DISC
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2008 B conf
Designing Mechanisms for Reliable Internet-based Computing.
NCA
Antonio Fernández Anta, Chryssis Georgiou, Miguel A. Mosteiro
2007 B conf
Deterministic Communication in the Weak Sensor Model.
OPODIS
Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
2007 B conf
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.
WADS
Martin Farach-Colton, Miguel A. Mosteiro
2007 B conf
Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
ISAAC
Martin Farach-Colton, Miguel A. Mosteiro
2006 J jnl
Insertion Sort is O(n log n).
Theory Comput. Syst.
Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
2006 B conf
Lower Bounds for Clear Transmissions in Radio Networks.
LATIN
Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
2005 A conf
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model.
ESA
Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
2004 J jnl
Insertion Sort is O(n log n)
CoRR
Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro