91ÊÓƵ

Faculty Bio

Before joining 91ÊÓƵ in Fall 2016, Dr. Mosteiro was Assistant Professor at Kean University, Research Professor at Rutgers University, and Research Associate at Universidad Rey Juan Carlos. He received his MS and PhD degrees in Computer Science from Rutgers University. He has 80+ peer-reviewed publications, international collaborations, publications with undergraduate students, he has been a member of multiple scientific committees and panels, and he has received the 2016 Kean University Faculty Research Mentor of the Year Award, the ICALP 2018 Best Paper Award, and he was Keynote Speaker at Fun with Algorithms 2022. He currently serves in the editorial board of Oxford - The Computer Journal.

Awards and Honors

• 11th International Conference on Fun with Algorithms 2022, 2022, Keynote Speaker
• EATCS ICALP, 2018, Best Paper Award
• Kean University, 2016, Faculty Research Mentor of the Year Award
• The Honor Society of Phi Kappa Phi, 2016, Kean University Chapter Member
• University of Liverpool, 2014, Honorary Research Fellow

PhD, Rutgers University, New Brunswick, NJ, 2007
Computer Science

MS, Rutgers University, New Brunswick, NJ, 2003
Computer Science

Bachelor of Engineering, Universidad Tecnologica Nacional, Buenos Aires, Argentina, 1984
Electronics

Research Interest

Prof. Mosteiro's research interests are in various aspects of algorithms, from theoretical analysis to experimental algorithms. A main theme of his work is distributed computing in harshly-constrained environments due to limitations on energy, cost, reliability, and/or physical conditions. In his research, Mosteiro applies a variety of techniques, including Machine Learning, Game Theory, Combinatorics, and Probability. Areas of application of his work include the Internet of Things, Ad-hoc Networks, Crowd Computing, Cloud Computing, and others.

Grants, Sponsored Research and Contracts

Undergraduate Student - Faculty Research Program
Mosteiro, M. A. & Roger, F. M. September 2021 - May 2025. 91ÊÓƵ. Funded.

Kenan Fund
Mosteiro, M. A. 2016 - 2024. 91ÊÓƵ. Funded.

NYFC Scholarly Research Grant
Mosteiro, M. A. 2016 - 2024. 91ÊÓƵ. Funded.

Undergraduate Student - Faculty Research Program
Mosteiro, M. A. & Halper, A. September 2019 - May 2020. 91ÊÓƵ. Funded.

Algorithms for the Internet of Things
Mosteiro, M. A. & Martin, R. March 2018 - February 2020. UK Royal Society, Other. Funded.

DUE-S-STEM: Project ASK: Applying Student Knowledge for Success in Computer Science
Mosteiro, M. A. & Morreale, P. 2014 - 2019. NSF, Federal. Funded. https://www.nsf.gov/awardsearch/showAward?AWD_ID=1355582

CCF-AF: Small: Collaborative Research: Algorithms for Reallocation Problems
Mosteiro, M. A., Farach-Colton, M. & Bender, M. 2011 - 2014. NSF, Federal. Funded. https://www.nsf.gov/awardsearch/showAward?AWD_ID=1114930&ActiveAwards=true&ExpiredAwards=true

Marie-Curie International Reintegration Grant PEOPLE- 2007-4-3-IRG: Adversarial Models in Sensor Networks
Mosteiro, M. A. 2007 - 2010. European Commission, Other. Funded.

Past Courses

CS 241: Data Structures/Algorithms
CS 242: Algorithms & Computing Theory
CS 398: Advncd Dta Strctrs & Comp Gmtr
CS 490: Ind Study in Computer Science
CS 600: Indpndnt Study in Grad CS
CS 608: Algorithms & Computing Theory
CS 701: Advanced Algorithms
CS 801: Advanced Algorithms
CS 802: Research Seminar
CS 804: Independent Research
CS 806: Dissertation Preparation

Publications

Verifiable Crowd Computing: Coping with Bounded Rationality
Mosteiro, M. A., Singh, S. & Dong, L. (2024). Theoretical Computer Science.

Algebraic Computations in Anonymous VANET - The 12th Edition of The International Conference on Networked Systems (NETyS 2024)
Mosteiro, M. A., Kowalski, D. & Powlette, A. (2024).

Distributed Station Assignment through Learning - The 12th Edition of The International Conference of Networked Systems (NETyS 2024)
Mosteiro, M. A., Dong, L. & Wang, M. (2024).

Dynamic Multiple-message Broadcast: Bounding Throughput in the Affectance Model
Mosteiro, M. A., Kowalski, D. & Zaki, K. (2023). Theory of Computing Systems. Vol 67 , pages 825-854.

Graph Ranking and the Cost of Sybil Defense. In Proc. of The 24th ACM Conference on Economics and Computation (EC 2023)
Farach-Colton, G., Farach-Colton, M., Goldberg, L., Komlos, H., Lapinskas, J., Levi, R., Medina, M. & Mosteiro, M. A. (2023).

The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference. In Proc. of The 2023 IEEE International Symposium on Information Theory (ISIT 2023)
Kowalski, D. & Mosteiro, M. A. (2023).

Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks
Kamenev, A., Kowalski, D. & Mosteiro, M. A. (2023). ACM Transactions on Parallel Computing. Vol 10 (Issue 2) , pages 1-35.

Verifiable Crowd Computing: Coping with Bounded Rationality. In Proc. of The International Joint Conference on Theoretical Computer Science (IJTCS-2022)
Mosteiro, M. A., Dong, L. & Singh, S. (2023).

Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
Dong, L., Kowalski, D., Kudaravalli, H. & Mosteiro, M. A. (2022). Theoretical Computer Science.

Time and Communication Complexity of Leader Election in Anonymous Networks. In Proc. of The 41st IEEE International Conference on Distributed Computing Systems (ICDCS 2021)
Kowalski, D. R. & Mosteiro, M. A. (2021).

Heuristically Speeding up Anonymous Dynamic Network Computations. In Proc. of The 19th IEEE International Conference on Ubiquitous Computing and Communications (IUCC-2020)
Halper, A., Kowalski, D. & Mosteiro, M. A. (2021).

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Kowalski, D. R. & Mosteiro, M. A. (2021). Journal of Computer and System Sciences.

Dynamic Windows Scheduling with Reallocation
Farach-Colton, M., Leal, K., Mosteiro, M. A. & Thraves Caro, C. (2021). ACM Journal of Experimental Algorithmics..

Supervised Consensus in Anonymous Dynamic Networks. In Proc. of The 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-2021)
Kowalski, D. R. & Mosteiro, M. A. (2021).

Generic Framework for Optimization of Local Dissemination in Wireless Networks. In Proc. of The 8th Edition of the International Conference on Networked Systems (NETYS 2020)
Mosteiro, M. A., Kowalski, D. R. & Wadhwa, K. (2021).

Optimizing mmWave Wireless Backhaul Scheduling
Arribas Gimeno, E., Fernandez-Anta, A., Kowalski, D., Mancuso, V., Mosteiro, M. A., Widmer, J. & Wong, P. (2020). IEEE Transactions on Mobile Computing.

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Kowalski, D. & Mosteiro, M. A. (2020). Journal of the ACM.

MmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals. In Proc. of The 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2019)
Garncarek, P., Jurdzinski, T., Kowalski, D. R. & Mosteiro, M. A. (2019).

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader. In Proc. of The 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Mosteiro, M. A. & Kowalski, D. (2019).

Station Assignment with Reallocation
Halper, A., Mosteiro, M. A., Rossikova, Y. & Wong, P. W. (2019). Algorithmica.

Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees
Mosteiro, M. A., Fernandez-Anta, A., Kowalski, D. & Wong, P. (2018). ACM Transactions on Parallel Computing.

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
Chakraborty, M., Milani, A. & Mosteiro, M. A. (2018). Algorithmica.

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations, In Proc. of The 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018 Best paper award)
Kowalski, D. R. & Mosteiro, M. A. (2018).

A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem. In Proc. of the 15th IEEE International Symposium on Parallel and Distributed Processing with Applications (IEEE ISPA 2017)
Rashid, M. H. & Mosteiro, M. A. (2018).

Ad-hoc Affectance-selective Families for Layer Dissemination. In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017)
Kudaravalli, H. & Mosteiro, M. A. (2017).

Fault-Tolerant Aggregation: Flow Update Meets Mass Distribution
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P. & Mosteiro, M. A. (2017). Distributed Computing.

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract. In Proc. of the 2nd IEEE/ACM International Conference on Internet-of-Things Design and Implementation (IoTDI 2017)
Kowalski, D. R., Kudaravalli, H. & Mosteiro, M. A. (2017).

Multi-round Master-Worker Computing: a Repeated Game Approach. In Proc. of the IEEE 35th Symposium on Reliable Distributed Systems - SRDS 2016
Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Pareja, D. (2016).

Counting in Practical Anonymous Dynamic Networks is Polynomial. In Proc. of the 4th International Conference On Networked Systems - NETYS 2016
Chakraborty, M., Milani, A. & Mosteiro, M. A. (2016).

Internet Computing: Using Reputation to Select Workers from a Pool. In Proc. of the 4th International Conference On Networked Systems - NETYS 2016
Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2016).

Faster Counting in Anonymous Dynamic Networks. In Proc. of the 19th International Conference On Principles Of Distributed Systems - OPODIS 2015
Milani, A. & Mosteiro, M. A. (2016).

Power-efficient assignment of virtual machines to physical machines
Arjona Aroca, J., Fernández Anta, A., Mosteiro, M. A., Thraves, C. & Wang, L. (2016). Journal of Future Generation Computer Systems.

Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion
Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Pareja, D. (2015). PLoS ONE.

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

Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions
Arkin, E. M., Fernández Anta, A., Mitchell, J. S. & Mosteiro, M. A. (2015). Computational Geometry.

Station Assignment with Reallocation. In Proc. of the 14th International Symposium on Experimental Algorithms - SEA 2015
Mosteiro, M. A., Rossikova, Y. & Wong, P. W. (2015).

Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2014). IEEE Trans. Computers.

Dynamic multiple-message broadcast: bounding throughput in the affectance model. In Proc. of the 10th ACM International Workshop on Foundations of Mobile Computing - FOMC 2014 @ MobiHoc 2014
Kowalski, D. R., Mosteiro, M. A. & Rouse, T. (2014).

Dynamic Windows Scheduling with Reallocation. In Proc. 13th International Symposium on Experimental Algorithms - SEA 2014
Farach-Colton, M., Leal, K., Mosteiro, M. A. & Thraves, C. (2014).

Power-Efficient Assignment of Virtual Machines to Physical Machines. In Proc. of the First International Workshop on Adaptive Resource Management and Scheduling for Cloud Computing ARMS-CC 2014, held in Conjunction with ACM Symposium on Principles of Distributed Computing - PODC 2014
Arjona Aroca, J., Fernández Anta, A., Mosteiro, M. A., Thraves, C. & Wang, L. (2014).

An early-stopping protocol for computing aggregate functions in Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2013). J. Parallel Distrib. Comput..

Applying the dynamics of evolution to achieve reliability in master-worker computing
Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013). Concurrency and Computation: Practice and Experience.

Crowd Computing as a Cooperation Problem: An Evolutionary Approach
Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013). Journal of Statistical Physics.

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

Reputation-Based Mechanisms for Evolutionary Master-Worker Computing. In Proc. of the 17th International Conference on Principles of Distributed Systems - OPODIS 2013
Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013).

Station Assignment with Applications to Sensing. In Proc. of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics - ALGOSENSORS 2013
Fernández Anta, A., Kowalski, D. R., Mosteiro, M. A. & Wong, P. W. (2013).

Unbounded Contention Resolution in Multiple-Access Channels
Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2013). Algorithmica.

Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics. In Proc. of the 18th International Conference on Parallel Processing - Euro-Par 2012
Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2012).

Brief announcement: achieving reliability in master-worker computing via evolutionary dynamics. In Proc. of the ACM Symposium on Principles of Distributed Computing - PODC 2012
Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2012).

Deterministic recurrent communication in restricted Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2012). Theor. Comput. Sci..

Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. In Proc. of the 10th Latin American Symposium on Theoretical Informatics - LATIN 2012
Farach-Colton, M., Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (2012).

Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (2012). Distributed Computing.

Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a d-Ball. In Proc. of the 28th European Workshop on Computational Geometry - EuroCG 2012
Mosteiro, M. A. (2012).

Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication. In Proc. of the 10th IEEE International Symposium on Networking Computing and Applications - NCA 2011
Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2011).

Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication. In Proc. of the 25th International Symposium on Distributed Computing - DISC 2011
Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2011).

Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. In Proc. of the 25th International Symposium on Distributed Computing - DISC 2011
Farach-Colton, M., Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (2011).

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2011). Discrete Mathematics & Theoretical Computer Science.

Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. In Proc. of the 15th International Conference on Principles of Distributed Systems - OPODIS 2011
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P. & Mosteiro, M. A. (2011).

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. In Proc. of the 23rd Annual Canadian Conference on Computational Geometry - CCCG 2011
Arkin, E. M., Fernández Anta, A., Mitchell, J. S. & Mosteiro, M. A. (2011).

Unbounded Contention Resolution in Multiple-Access Channels. In Proc. of the 25th International Symposium on Distributed Computing - DISC 2011
Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2011).

Unbounded contention resolution in multiple-access channels. In Proc. of the 30th Annual ACM Symposium on Principles of Distributed Computing - PODC 2011
Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2011).

Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers. In Proc. of the 24th IEEE International Symposium on Parallel and Distributed Processing - IPDPS 2010
Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2010).

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
Fernández Anta, A. & Mosteiro, M. A. (2010). Discrete Mathematics, Algorithms and Applications.

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. In Proc. of the 16th Annual International Conference on Computing and Combinatorics - COCOON 2010
Fernández Anta, A. & Mosteiro, M. A. (2010).

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. In Proc. of the 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities - ALGOSENSORS 2010
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2010).

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony. In Proc. of the 24th International Symposium on Distributed Computing - DISC 2010
Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (2010).

The Length of the Longest Edge in Multidimensional Delaunay Graphs (Extended Abstract). In Proc. of the 20th Annual Fall Workshop on Computational Geometry - FWCG 2010
Arkin, E. M., Fernández Anta, A., Mitchell, J. S. & Mosteiro, M. A. (2010).

An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. In Proc. of the 15th IEEE Pacific Rim International Symposium on Dependable Computing - PRDC 2009
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2009). , pages 357–364.

Bootstrapping a hop-optimal network in the weak sensor model
Farach-Colton, M., Fernandes, R. J. & Mosteiro, M. A. (2009). ACM Trans. Algorithms. Vol 5 (Issue 4)

Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. In Proc. of the 22nd International Symposium on Distributed Computing - DISC 2008
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2008). , pages 504–506.

Designing Mechanisms for Reliable Internet-based Computing. In Proc. of The 7th IEEE International Symposium on Networking Computing and Applications - NCA 2008
Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2008). , pages 315–324.

Deterministic Communication in the Weak Sensor Model. In Proc. of the 11th International Conference on Principles of Distributed Systems - OPODIS 2007
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2007). , pages 119–131.

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. In Proc. of the 10th International Workshop Algorithms and Data Structures - WADS 2007
Farach-Colton, M. & Mosteiro, M. A. (2007). , pages 565–576.

Sensor Network Gossiping or How to Break the Broadcast Lower Bound. In Proc. of the 18th International Symposium on Algorithms and Computation - ISAAC 2007
Farach-Colton, M. & Mosteiro, M. A. (2007). , pages 232–243.

Insertion Sort is O(n log n)
Bender, M. A., Farach-Colton, M. & Mosteiro, M. A. (2006). Theory Comput. Syst.. Vol 39 (Issue 3) , pages 391–397.

Lower Bounds for Clear Transmissions in Radio Networks. In Proc. of the 7th Latin American Symposium on Theoretical Informatics - LATIN 2006
Farach-Colton, M., Fernandes, R. J. & Mosteiro, M. A. (2006). , pages 447–454.

Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. In Proc. of the 13th Annual European Symposium on Algorithms - ESA 2005
Farach-Colton, M., Fernandes, R. J. & Mosteiro, M. A. (2005). , pages 827–838.

Insertion Sort is O(n log n). In Proc. of the 3rd Intl. Conference on Fun with Algorithms - FUN 2004
Bender, M. A., Farach-Colton, M. & Mosteiro, M. A. (2004). , pages 16–23.

Presentations

Distributed Station Assignment through Learning
Mosteiro, M. A., Dong, L. & Wong, M. (2024). The 12th Edition of the International Conference of Networked Systems. Morocco.

Algebraic Computations in Anonymous VANET
Mosteiro, M. A., Powlette, A. & Kowalski, D. (2024). The 12th Edition of The International Conference of Networked Systems (NETyS 2024). Morocco.

The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference
Kowalski, D. & Mosteiro, M. A. (2023). 2023 IEEE International Symposium on Information Theory (ISIT 2023). IEEE,

Counting in the Dark
Mosteiro, M. A. (2022). The 11th International Conference on Fun with Algorithms (FUN 2022). EATCS,

Time and Communication Complexity of Leader Election in Anonymous Networks
Mosteiro, M. A. (2021). The 41st IEEE International Conference on Distributed Computing Systems (ICDCS-2021). IEEE,

Supervised Consensus in Anonymous Dynamic Networks
Mosteiro, M. A. (2021). The 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-2021). ACM,

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Mosteiro, M. A. (2019). The 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). EATCS - European Association of Theoretical Computer Science,

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets
Mosteiro, M. A. (2017). 2nd ACM/IEEE International Conference on Internet-of-Things Design and Implementation (IoTDI 2017). IEEE/ACM,

Counting in Practical Anonymous Dynamic Networks is Polynomial
Mosteiro, M. A. (2016). 4th International Conference of Networked Systems (NETyS 2016). Marrakesh, Morocco.

Internet Computing: Using Reputation to Select Workers from a Pool
Mosteiro, M. A. (2016). 4th International Conference of Networked Systems (NETyS 2016). Marrakesh, Morocco.

Station Assignment with Reallocation
Mosteiro, M. A. (2015). University of Liverpool Complexity Theory and Algorithmics Seminar. University of Liverpool,

Station Assignment with Reallocation
Mosteiro, M. A. (2015). 14th International Symposium on Experimental Algorithms (SEA 2015). Paris, France.

Station Assignment with Reallocation
Mosteiro, M. A. (2015). University of Bordeaux Distributed Algorithms Working Group Seminar. University of Bordeaux,

Dynamic Multiple-message Broadcast: Bounding Throughput in the Affectance Model
Mosteiro, M. A. (2014). 10th ACM International Workshop on Foundations of Mobile Computing (FOMC 2014). ACM,

Dynamic Windows Scheduling with Reallocations
Mosteiro, M. A. (2014). 13th International Symposium on Experimental Algorithms (SEA 2014). Copenhagen, Denmark.

Dynamic Multiple Message Broadcast under Affectance
Mosteiro, M. A. (2014). 2014 Workshop on Wireless Communication. University of Liverpool,

Windows Scheduling, Multiple-Message Broadcast, and other Wireless Networks Problems
Mosteiro, M. A. (2014). University of Liverpool Computer Science Department Seminar. University of Liverpool,

The Length of a Longest Edge in Multidimensional Delaunay Graphs
Mosteiro, M. A. (2014). Stony Brook University Algorithms Seminar. Stony Brook University,

Unbounded Contention Resolution in Multiple-Access Channels
Mosteiro, M. A. (2012). University of Buenos Aires Computer Science Department Seminar. University of Buenos Aires,

Unbounded Contention Resolution in Multiple-Access Channels
Mosteiro, M. A. (2012). University of General Sarmiento Science Institute Seminar. Universidad de General Sarmiento,

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism
Mosteiro, M. A. (2012). 10th Latin American Theoretical Informatics Symposium (LATIN 2012). Arequipa, Peru.

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism
Mosteiro, M. A. (2012). DIMACS Theoretical CS seminar. Center for Discrete Mathematics & Theoretical Computer Science (DIMACS),

Probabilistic Lower Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in a d-Ball
Mosteiro, M. A. (2012). 28th European Workshop on Computational Geometry (EuroCG 2012). Assisi, Italy.

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism
Mosteiro, M. A. (2011). 25th International Symposium on Distributed Computing (DISC 2011). Roma, Italy.

Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions.
Mosteiro, M. A. (2011). 23rd Canadian Conference on Computational Geometry (CCCG 2011). Toronto, Canada.

Unbounded Contention Resolution in Multiple-Access Channels
Mosteiro, M. A. (2011). 30th ACM - SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2011). ACM,

Unbounded Contention Resolution in Multiple-Access Channels
Mosteiro, M. A. (2011). Institute IMDEA Networks - Universidad Carlos III Seminar. Institute IMDEA Networks,

The Length of the Longest Edge in Multidimensional Delaunay Graphs
Mosteiro, M. A. (2010). 20th Annual Fall Workshop on Computational Geometry (FWCG 2010). Stony Brook, NY.

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
Mosteiro, M. A. (2010). 24th International Symposium on Distributed Computing (DISC 2010). Cambridge, MA.

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
Mosteiro, M. A. (2010). 16th Annual International Computing and Combinatorics Conference (COCOON 2010). Nha Trang, Vietnam.

Algorithmic Mechanisms for Internet-based Master-Worker Computing with Untrusted and Selfish Workers
Mosteiro, M. A. (2010). 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010). IEEE,

An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks
Mosteiro, M. A. (2009). 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2009). Shanghai, China.

Unbounded Contention Resolution: k-Selection in Radio Networks
Mosteiro, M. A. (2009). Workshop on Reliability and Security in Wireless Networks 2009 (co-located with DISC 2009). Elx, Spain.

An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks
Mosteiro, M. A. (2009). Univ. Autonoma de Madrid Computer Science Seminar. Universidad Autonoma de Madrid,

Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Mosteiro, M. A. (2007). 18th International Symposium on Algorithms and Computation (ISAAC 2007). Sendai, Japan.

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Mosteiro, M. A. (2007). 10th International Workshop on Algorithms and Data Structures (WADS 2007). Halifax, Canada.

Deterministic Transmissions under Adversarial Behavior
Mosteiro, M. A. (2007). Department of Telematics Engineering and Electronics Technology Seminar. Universidad Rey Juan Carlos

Upper and Lower Bounds in Radio Networks
Mosteiro, M. A. (2006). AT&T Labs Research Seminar. AT&T Labs Research,

Upper and Lower Bounds in Radio Networks
Mosteiro, M. A. (2006). Bell Labs Networks Seminar. Bell Labs Research,

Upper and Lower Bounds in Radio Networks
Mosteiro, M. A. (2005). Applied Mathematics Department Seminar. Universidad Politecnica de Madrid,

Upper and Lower Bounds in Radio Networks
Mosteiro, M. A. (2005). Department of Telematics Engineering and Electronics Technology Seminar. Universidad Rey Juan Carlos,

Upper and Lower Bounds in Radio Networks
Mosteiro, M. A. (2005). Department of Languages and Informatics Systems Seminar. Universitat Politecnica de Catalunya,

Bootstrapping Hop-optimal Networks in the Weak Sensor Model
Mosteiro, M. A. (2005). 13th Annual European Symposium on Algorithms (ESA 2005). Mallorca, Spain.

Bootstrapping a Hop-optimal Network in the Weak Sensor Model
Mosteiro, M. A. (2005). Computer Science Department Seminar. Universidad de Buenos Aires,

Professional Memberships

• Association for Computer Machinery [Member]

Department Service

• Faculty Search [Committee Member]
• Curriculum [Committee Member]
• Course Coordination [Committee Member]
• Tenure and Promotion [Committee Member]
• CS 241 Data Structures and Algorithms [Course Coordinator]
• ABET certification efforts [active participation]
• Computer Science Department Faculty Meetings [Attendee, Meeting]
• Computer Science Department Teaching Observations [Other]
• CS 242 Algorithms and Theory of Computing [Course coordinator]
• Faculty Search [Committee Member]
• CS 398F - Advanced Data Structures and Computational Geometry [New course development]
• Computer Science Department PhD Program Examinations Committee [Faculty Advisor]
• Curriculum [Committee Member]
• Faculty Search [Committee Chair]
• CS 608 Algorithms and Theory of Computing [Course coordinator]
• Assessment [Committee Member]
• Programming Courses Task Force [Committee Member]
• Faculty Search [Committee Member]
• "Communication and Success" Workshop by Brian Evans [Host in the context of CS242 class]
• "Be the Recruiter" Workshop by Helene Marie Cruz [Host in the context of CS241 class]

College Service

• Tenure and Promotion [Committee Member]
• Student Experience [Committee Member]
• Tenure and Promotion [Committee Member]
• PhD and MS Dissertation [Committee Member]
• Graduate , Undergraduate, 91ÊÓƵ Bound, Open House events [Attendee, Meeting]
• Personalized Student Training on Job Interviews [Faculty Mentor]
• Seidenberg School Faculty Council Meetings [Attendee, Meeting]
• Seidenberg School Meetings [Attendee, Meeting]
• Visiting Scholars Host [Other]
• Seidenberg Tech Leadership Series [Attendee, Meeting]
• CSIS/ITS Leadership [Attendee, Meeting]
• Seidenberg Innovation Awards [Attendee, Meeting]
• Seidenberg School Faculty Search Committee [Committee Chair]
• Seidenberg School Freshman Peer-mentoring Program [Faculty Advisor]
• Student Projects Showcase Events [Attendee, Meeting]
• Pramp Inc. Job Interviews Training Service [Attendee, Meeting]
• Guest Speaker: Dr. Pablo Mosteiro (Trip Advisor), Host [Other]
• Software Developer Job Interview Information Session, Speaker [Other]
• Seidenberg School Faculty Search Committee [Committee Member]
• 2018 Undergraduate Commencement Seidenberg Marshall [Attendee, Meeting]
• Gargano Research Day 2018 Student Presentation [Faculty Advisor]
• Seidenberg School Faculty Council Nominations Committee [Committee Member]
• FIRST Robot Tournament Judge [Other]
• Guest Speaker Dr. Martin Farach-Colton, Host [Other]
• Seidenberg School Technical Reports, Editor [Other]
• LST Awards Gala [Attendee, Meeting]
• Seidenberg School DPS Program Meeting [Attendee, Meeting]
• Google Job Interview Information Session, Speaker [Other]
• Guest Speaker Dr. Antonio Fernández-Anta, Host [Other]
• NSF-REU Information Session, Speaker [Other]
• Guest Speaker Dr. Vincenzo Mancuso, Host [Other]
• NYC Design Factory Grand Opening [Attendee, Meeting]

University Service

• NYFC Salary Review Board [Committee Member]
• Honors College students [Faculty Advisor]
• Seidenberg Dean Evaluation [Committee Chair]
• Strategic Plan Partnerships Team [Committee Member]
• Tenure-track Faculty Information Panel [Committee Member]
• 91ÊÓƵ Research Day [Faculty Advisor]
• Convocation, Graduation, and Awards ceremonies [Attendee, Meeting]
• New York Faculty Council Meetings [Attendee, Meeting]
• President and Provost Meetings [Attendee, Meeting]
• Library Master Plan [Committee Member]
• Seidenberg Dean Evaluation [Committee Member]
• 91ÊÓƵ President Inauguration Faculty Research Showcase [Attendee, Meeting]
• University of Liverpool PhD Seminar [Guest Speaker]

Professional Service

The Computer Journal [Editor, Associate Editor]
Scientific Symposia [Committee Member]
National Science Foundation (NSF) CCF-AF Grant Proposal Panel [Member]
Scientific Journals [Reviewer, Journal Article]
Scientific Symposia [Reviewer, Conference Paper]
10TH International Conference on Fun with Algorithms (FUN 2020) [Publicity Chair]
1st International Distributed Algorithms for Dynamic Networks Workshop (DiADN 2019) [Committee Chair]
ACM Transactions on Algorithms [Assistant of the Editorial Board]
Elsevier Theoretical Computer Science - Journal [Editor, Book]
Springer Lecture Notes in Computer Science [Editor, Conference Proceedings]
13th Latin American Theoretical Informatics Symposium (LATIN 2018) [Committee Chair]
Springer Lecture Notes in Computer Science [Editor, Conference Proceedings]
13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS 2017) [Committee Chair]
National Agency of Scientific and Technological Promotion (Argentina) [Committee Member]
National Science Foundation (NSF) CCF-AF Grant Proposal Panel [Member]

Public Service

• Oxford The Computer Journal [Editorial Board Member]
  
• Scientific Symposia Technical Program Committee [Committee Chair]
  
• Scientific Symposia Technical Program Committee [Committee Member]
  
• Scientific Journals [Reviewer]
  
• Scientific Symposia [Reviewer]
  
• ACM Transactions on Algorithms [Assistant of the Editorial Board]
  
• National Agency of Scientific and Technological Promotion (Argentina) FONCyT-PICT [Grant Proposal Reviewer, External]
  
• National Science Foundation (NSF) CCF-AF [Grant Proposal Reviewer, External]