Miguel A. Mosteiro

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 39

Top Topics

Traveling Salesman

Information Dissemination

Bounded Rationality

Distributed Computing

Top Venues

Publications

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