Miguel A. Mosteiro

Peer-Reviewed Publications (newest first)

• Verifiable Crowd Computing: Coping with Bounded Rationality.
  Joint work with L. Dong, and S. Singh.
  In Elsevier Theoretical Computer Science (TCS), © Elsevier, 2024.
  [ DOI, bibtex ]
• Distributed Station Assignment through Learning.
  Joint work with L. Dong and M. Wang.
  In Proc. of The 12th Edition of The International Conference of Networked Systems (Netys 2024),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2024.
  [ DOI, bibtex, slides, source-code ]
• Algebraic Computations in Anonymous VANET.
  Joint work with D. R. Kowalski and Austin Powlette.
  In Proc. of The 12th Edition of The International Conference of Networked Systems (Netys 2024),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2024.
  [ DOI, bibtex, slides, source-code ]
• Dynamic Multiple-message Broadcast: Bounding Throughput in the Affectance Model.
  Joint work with D. R. Kowalski and K. Zaki.
  In Springer Theory of Computing Systems (ToCS), © Springer, 2023.
  [ DOI, bibtex ]
• Graph Ranking and the Cost of Sybil Defense.
  Joint work with G. Farach-Colton, M. Farach-Colton, L. Goldberg, H. Komlos, J. Lapinskas, R. Levi, and M. Medina.
  In Proc. of The 24th ACM Conference on Economics and Computation (EC 2023), © ACM, 2023.
  [ DOI, bibtex, slides (by G. Farach-Colton) ]
• The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference.
  Joint work with D. R. Kowalski.
  In Proc. of The 2023 IEEE International Symposium on Information Theory (ISIT 2023), © IEEE, 2023.
  [ DOI, bibtex, slides ]
• Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks.
  Joint work with A. Kamenev, and D. R. Kowalski.
  In ACM Transactions on Parallel Computation (ToPC), © ACM, 2023.
  [ DOI, bibtex ]
• Verifiable Crowd Computing: Coping with Bounded Rationality.
  Joint work with L. Dong, and S. Singh.
  In Proc. of The International Joint Conference on Theoretical Computer Science (IJTCS-2022),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2022.
  [ DOI, bibtex, slides (by L. Dong) ]
• Information Dissemination in Wireless Ad-hoc Networks under the Weighted-TIM Framework.
  Joint work with L. Dong, D. R. Kowalski, and H. Kudaravalli.
  In Elsevier Theoretical Computer Science (TCS), © Elsevier, 2022.
  [ DOI, bibtex ]
• Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader.
  Joint work with D. R. Kowalski.
  In Elsevier Journal of Computing and System Sciences (JCSS), © Elsevier, 2022.
  [ DOI, bibtex ]
• Dynamic Windows Scheduling with Reallocation.
  Joint work with M. Farach-Colton, K. Leal, and C. Thraves.
  In ACM Journal of Experimental Algorithmics (JEA), © ACM, 2021.
  [ DOI, bibtex ]
• Supervised Consensus in Anonymous Dynamic Networks.
  Joint work with D. R. Kowalski.
  In Proc. of The 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-2021), © ACM, 2021.
  [ DOI, bibtex, slides ]
• Time and Communication Complexity of Leader Election in Anonymous Networks.
  Joint work with D. R. Kowalski.
  In Proc. of The 41st IEEE International Conference on Distributed Computing Systems (ICDCS-2021), © IEEE, 2021.
  [ DOI, bibtex, slides ]
• Heuristically Speeding up Anonymous Dynamic Network Computations.
  Joint work with A. Halper and D. R. Kowalski.
  In Proc. of The 19th IEEE International Conference on Ubiquitous Computing and Communications (IUCC-2020), © IEEE, 2020.
  [ DOI, bibtex ]
• Optimizing mmWave Wireless Backhaul Scheduling.
  Joint work with E. Arribas-Gimeno, A. Fernández-Anta, D. R. Kowalski, V. Mancuso, J. Widmer and P. Wong.
  In IEEE Transactions on Mobile Computing (ToMC), © IEEE, 2020.
  [ DOI, bibtex ]
• Generic Framework for Optimization of Local Dissemination in Wireless Networks.
  Joint work with D. R. Kowalski and K. Wadhwa.
  In Proc. of The 8th Edition of the International Conference on Networked Systems (NETYS 2020),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2020.
  [ DOI, bibtex, video presentation (by K. Wadhwa) ]
• Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
  Joint work with D. R. Kowalski.
  In Journal of the ACM (JACM), © ACM, 2020.
  [ DOI, bibtex, full text ]
• Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader.
  Joint work with D. R. Kowalski.
  In Proc. of The 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019),
  in Leibniz International Proceedings in Informatics (LIPIcs), 2019.
  [ DOI, bibtex, full text, slides ]
• mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals.
  Joint work with P. Garncarek, T. Jurdzinski, and D. R. Kowalski.
  In Proc. of The 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2019), © IEEE, 2019.
  [ DOI, bibtex, slides (by P. Garncarek) ]
• Station Assignment with Reallocation.
  Joint work with A. Halper, Y. Rossikova, and P. W. H. Wong.
  In Algorithmica (Algorithmica), © Springer, 2019.
  [ DOI, bibtex, full-text ]
• Schedulling Dynamic Parallel Workload of Mobile Devices with Access Guarantees.
  Joint work with A. Fernández-Anta, D. R. Kowalski, and P. W. H. Wong.
  In ACM Transactions on Parallel Computing (ToPC), © ACM, 2018.
  [ DOI, bibtex ]
• Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
  Joint work with D. R. Kowalski.
  In Proc. of The 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018 Best paper award),
  in Leibniz International Proceedings in Informatics (LIPIcs), 2018.
  [ DOI, bibtex, full-text, slides ]
• A Faster Exact-Counting Protocol for Anonymous Dynamic Networks.
  Joint work with M. Chakraborty and A. Milani.
  In Algorithmica (Algorithmica), © Springer, 2017.
  [ DOI, bibtex, full-text ]
• Fault-Tolerant Aggregation: Flow Update Meets Mass Distribution.
  Joint work with P. S. Almeida, C. Baquero, M. Farach-Colton, and P. Jesus.
  In Distributed Computing (DC), © Springer, 2017.
  [ DOI, bibtex, full-text ]
• Ad-hoc Affectance-selective Families for Layer Dissemination.
  Joint work with H. Kudaravalli.
  In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017),
  in Leibniz International Proceedings in Informatics (LIPIcs), 2017.
  [ DOI, bibtex, full-text, slides, source-code ]
• Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets.
  Joint work with D. R. Kowalski and H. Kudaravalli.
  In Proc. of the 2nd ACM/IEEE International Conference on Internet-of-Things Design and Implementation (IOTDI 2017), © ACM/IEEE, 2017.
  [ DOI, bibtex, slides ]
• Multi-round Master-Worker Computing: a Repeated Game Approach.
  Joint work with A. Fernández-Anta, C. Georgiou, and D. Pareja.
  In Proc. of the 2006 IEEE 35th Symposium on Reliable Distributed Systems (SRDS 2016), © IEEE, 2016.
  [ DOI, bibtex, slides (by C. Georgiou) ]
• Counting in Practical Anonymous Dynamic Networks is Polynomial.
  Joint work with M. Chakraborty, and A. Milani.
  In Proc. of the 4th International Conference On Networked Systems (NETYS 2016),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2016.
  [ DOI, bibtex, slides]
• Internet Computing: Using Reputation to Select Workers from a Pool.
  Joint work with E. Christoforou, A. Fernández-Anta, and C. Georgiou.
  In Proc. of the 4th International Conference On Networked Systems (NETYS 2016),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2016.
  [ DOI, bibtex, slides]
• Power-efficient Assignment of Virtual Machines to Physical Machines.
  Joint work with J. Arjona-Aroca, A. Fernández-Anta, C. Thraves, and L. Wang.
  In Future Generation Computer Systems (FGCS), © Elsevier, 2016.
  [ DOI, bibtex ]
• Faster Counting in Anonymous Dynamic Networks.
  Joint work with A. Milani.
  In Proc. of the 19th International Conference On Principles Of Distributed Systems (OPODIS 2015),
  in Leibniz International Proceedings in Informatics (LIPIcs), 2016.
  [DOI, bibtex, full-text ]
• Station Assignment with Reallocation
  Joint work with Y. Rossikova, and P. W. H. Wong.
  In Proc. of the 14th International Symposium on Experimental Algorithms (SEA 2015),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2015.
  [DOI, bibtex, slides, source-code]
• Initialiazing Sensor Networks of Non-uniform Density in The Weak Sensor Model.
  Joint work with M. Farach-Colton.
  In Algorithmica (Algorithmica), © Springer, 2015.
  [DOI, bibtex, full-text ]
• Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion
  Joint work with A. Fernández-Anta, C. Georgiou, and D. Pareja.
  In Public Library of Science One (PLoS ONE), 2015.
  [DOI, bibtex, full-text]
• Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
  Joint work with E. M. Arkin, A. Fernández-Anta, and J. S. B. Mitchell.
  In Computational Geometry: Theory and Applications (CGTA), © Elsevier, 2015.
  [DOI, bibtex ]
• Dynamic Multiple-message Broadcast: Bounding Throughput in the Affectance Model.
  Joint work with D. R. Kowalski and T. Rouse.
  In Proc. of the 10th ACM International Workshop on Foundations of Mobile Computing (FOMC 2014 @ MobiHoc 2014) , © ACM, 2014.
  [DOI, bibtex, slides]
• Power-efficient Assignment of Virtual Machines to Physical Machines.
  Joint work with J. Arjona-Aroca, A. Fernández-Anta, C. Thraves, and L. Wang.
  In Proc. of the 1st ACM Workshop on Adaptive Resource Management and Scheduling for Cloud Computing (ARMS-CC 2014 @ PODC 2014),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2014.
  [DOI, bibtex, slides (by A. Fernández-Anta)]
• Dynamic Windows Scheduling with Reallocation
  Joint work with M. Farach-Colton, K. Leal, and C. Thraves.
  In Proc. of the 13th International Symposium on Experimental Algorithms (SEA 2014),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2014.
  [DOI, bibtex, slides]
• Algorithmic Mechanisms for Reliable Master-Worker Internet-based Computing.
  Joint work with E. Christoforou, A. Fernández-Anta, and C. Georgiou.
  In Transactions on Computers (TC), © IEEE, 2014.
  [DOI, bibtex]
• Reputation-based Mechanisms for Evolutionary Master-Worker Computing.
  Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, and A. Sánchez.
  In Proc. of the 17th International Conference On Principles Of Distributed Systems (OPODIS 2013),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2013.
  [DOI, bibtex, slides (by E. Christoforou)]
• Station Assignment with Applications to Sensing.
  Joint work with A. Fernández-Anta, D. R. Kowalski, and P. W. H. Wong.
  In Proc. of the 9th Intl. Symp. on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2013.
  [DOI, bibtex, slides (by A. Fernández-Anta)]
• Unbounded Contention Resolution in Multiple-Access Channels.
  Joint work with A. Fernández-Anta and J.Ramón-Muñoz.
  In Algorithmica (Algorithmica), © Springer, 2013.
  [DOI, bibtex, full-text]
• Applying the dynamics of evolution to achieve reliability in master-worker computing.
  Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, and A. Sánchez.
  In Concurrency and Computation: Practice and Experience (CCPE), © Wiley, 2013.
  [DOI, bibtex]
• Crowd computing as a cooperation problem: an evolutionary approach.
  Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, and A. Sánchez.
  In Journal of Statistical Physics (JSP), © Springer, 2013.
  [DOI, bibtex(>Export citation>bibtex), full-text]
• Optimal Memory-aware Sensor Network Gossiping.
  Joint work with M. Farach-Colton and A. Fernández-Anta.
  In Theoretical Computer Science (TCS), © Elsevier, 2013.
  [DOI, bibtex]
• An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  Joint work with A. Fernández-Anta and C. Thraves.
  In Journal of Parallel and Distributed Computing (JPDC), © Elsevier, 2013.
  [DOI, bibtex]
• Achieving Reliability in Master-worker Computing via Evolutionary Dynamics.
  Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, M. A. Mosteiro and A. Sánchez.
  In Proceedings of the 18th International European Conference on Parallel and Distributed Computing (Euro-Par 2012),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2012.
  [DOI, bibtex, slides (by E. Christoforou)]
• Brief Announcement: Achieving Reliability in Master-worker Computing via Evolutionary Dynamics.
  Joint work with E. Christoforou, A. Fernández-Anta, C. Georgiou, and A. Sánchez.
  In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012), © ACM, 2012.
  [DOI, bibtex, slides (by C. Georgiou)]
• Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a d-Ball.
  In Proceedings of the 28th European Workshop on Computational Geometry (EuroCG 2012).
  [DOI, bibtex, full-text, slides]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
  Joint work with A. Fernández-Anta, A. Milani, and S. Zaks.
  In Distributed Computing (DC), © Springer, 2012.
  [DOI, bibtex, full-text]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
  Joint work with M. Farach-Colton, A. Fernández-Anta, A. Milani, and S. Zaks.
  In Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN 2012),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2012.
  [DOI, bibtex]
• Deterministic Recurrent Communication in Restricted Sensor Networks.
  Joint work with A. Fernández-Anta and C. Thraves.
  In Theoretical Computer Science (TCS), © Elsevier, 2012.
  [DOI, bibtex]
• Fault-Tolerant Aggregation: Flow Updating Meets Mass Distribution.
  Joint work with P. S. Almeida, C. Baquero, M. Farach-Colton, and P. Jesus.
  In Proceedings of the 15th International Conference On Principles Of Distributed Systems (OPODIS 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, slides (by C. Baquero and P. Jesus)]
• Unbounded Contention Resolution in Multiple-Access Channels.
  Joint work with A. Fernández-Anta and J. Ramón-Muñoz.
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, slides (by A. Fernández-Anta)]
• Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism.
  Joint work with M. Farach-Colton, A. Fernández-Anta, A. Milani, and S. Zaks.
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, slides]
• Brief Announcement: Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
  Joint work with E. Christoforou, A. Fernández-Anta, and C. Georgiou.
  In Proceedings of the 25th International Symposium on Distributed Computing (DISC 2011),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2011.
  [DOI, bibtex, slides (by E. Christoforou)]
• Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
  Joint work with E. M. Arkin, A. Fernández-Anta, and J. S. B. Mitchell)
  In Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011).
  [DOI, bibtex, full-text, slides]
• Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication
  Joint work with E. Christoforou, A. Fernández-Anta, and C. Georgiou.
  In Proceedings of the 10th IEEE International Symposium on Network Computing and Applications (NCA 2011), © IEEE, 2011.
  [DOI, bibtex, slides (by E. Christoforou)]
• Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
  Joint work with A. Fernández-Anta and C. Thraves.
  In Discrete Mathematics and Theoretical Computer Science (DMTCS), 2011.
  [DOI, bibtex, full-text]
• Brief Announcement: Unbounded Contention Resolution in Multiple-Access Channels.
  Joint work with A. Fernández-Anta and J. Ramón-Muñoz.
  In Proceedings of the 30th ACM - SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011), © ACM, 2011.
  [DOI, bibtex, slides]
• The Length of the Longest Edge in Multidimensional Delaunay Graphs (Extended Abstract).
  Joint work with E. M. Arkin, A. Fernández-Anta, and J. S. B. Mitchell)
  In Proceedings of the 20th Annual Fall Workshop on Computational Geometry (FWCG 2010).
  [DOI, bibtex, full-text, slides]
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
  Joint work with A. Fernández-Anta.
  In Discrete Mathematics, Algorithms and Applications (DMAA), © World Scientific Publishing Company, 2010.
  [DOI, bibtex]
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony.
  Joint work with A. Fernández-Anta, A. Milani, and S. Zaks.
  In Proceedings of the 24th International Symposium on Distributed Computing (DISC 2010),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2010.
  [DOI, bibtex, slides]
• Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
  Joint work with A. Fernández-Anta and C. Thraves.
  In Proceedings of the 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2010),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2010.
  [DOI, bibtex, slides (by C. Thraves)]
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks.
  Joint work with A. Fernández-Anta.
  In Proceedings of the 16th Annual International Computing and Combinatorics Conference (COCOON 2010),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2010.
  [DOI, bibtex, slides]
• Algorithmic Mechanisms for Internet-based Master-Worker Computing with Untrusted and Selfish Workers.
  Joint work with A. Fernández-Anta and C. Georgiou.
  In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), © IEEE, 2010.
  [DOI, bibtex, slides]
• An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  Joint work with A. Fernández-Anta and C. Thraves.
  In Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2009), © IEEE, 2009.
  [DOI, bibtex, slides]
• Bootstrapping Hop-optimal Networks in the Weak Sensor Model.
  Joint work with M. Farach-Colton and R. Fernandes.
  In ACM Transactions on Algorithms (TALG), © ACM, 2009.
  [DOI, bibtex]
• Brief Announcement: An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks.
  Joint work with A. Fernández-Anta and C. Thraves.}
  In Proceedings of the 22nd EATCS International Symposium on Distributed Computing (DISC 2008),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2008.
  [DOI, bibtex]
• Designing Mechanisms for Reliable Internet-based Computing.
  Joint work with A. Fernández-Anta and C. Georgiou.
  In Proceedings of the 7th IEEE International Symposium on Network Computing and Applications (NCA 2008), © IEEE, 2008.
  [DOI, bibtex, slides (by C. Georgiou)]
• Deterministic Communication in the Weak Sensor Model.
  Joint work with A. Fernández-Anta and C. Thraves.
  In Proceedings of the 11th International Conference On Principles Of Distributed Systems (OPODIS 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, slides]
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound.
  Joint work with M. Farach-Colton.
  In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, slides]
  
• Initialiazing Sensor Networks of Non-uniform Density in The Weak Sensor Model.
  Joint work with M. Farach-Colton.
  In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS 2007),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2007.
  [DOI, bibtex, slides]
  
• Lower Bounds for Clear Transmissions in Radio Networks.
  Joint work with M. Farach-Colton and R. Fernandes.
  In Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2006.
  [DOI, bibtex, slides (by R. Fernandes)]
  
• Insertion Sort is O(n log n).
  Joint work with M. A. Bender and M. Farach-Colton.
  In Theory of Computing Systems (ToCS), © Springer-Verlag, 2006.
  [DOI, bibtex, slides]
  
• Bootstrapping Hop-optimal Networks in the Weak Sensor Model.
  Joint work with M. Farach-Colton and R. Fernandes.
  In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005),
  in Lecture Notes in Computer Science, © Springer-Verlag, 2005.
  [DOI, bibtex, slides]
  
• Insertion Sort is O(n log n).
  Joint work with M. A. Bender and M. Farach-Colton.
  In Proceedings of the 3rd International Conference on Fun with Algorithms (FUN 2004), pages 16-23, 2004.
  [DOI, bibtex, full-text, slides (by M. A. Bender)]