Miguel Mosteiro

Faculty Bio

Before joining Pace 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 75+ 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.

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 focuses on algorithmic problems arising in computational environments that are harshly-constrained due to limitations on energy, cost, reliability, and/or physical conditions. Areas of application of his work include the Internet of Things, 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 2022. Pace University. Funded.

Kenan Fund
Mosteiro, M. A. 2016 - 2021. Pace University. Funded.

NYFC Scholarly Research Grant
Mosteiro, M. A. 2016 - 2021. Pace University. Funded.

Undergraduate Student - Faculty Research Program
Mosteiro, M. A. & Halper, A. September 2019 - May 2020. Pace University. 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=t…

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

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).

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

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. https://www.sciencedirect.com/science/article/abs/pii/S0304397521006988?via%3Dihub

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). https://ieeexplore.ieee.org/document/9443712

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Kowalski, D. R. & Mosteiro, M. A. (2021). Journal of Computer and System Sciences. https://www.sciencedirect.com/science/article/pii/S0022000021000660

Dynamic Windows Scheduling with Reallocation
Farach-Colton, M., Leal, K., Mosteiro, M. A. & Thraves Caro, C. (2021). ACM Journal of Experimental Algorithmics.. https://dl.acm.org/doi/10.1145/3462208

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). https://dl.acm.org/doi/10.1145/3409964.3461811

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). https://link.springer.com/chapter/10.1007%2F978-3-030-67087-0_16

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. https://ieeexplore.ieee.org/document/8745537

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Kowalski, D. & Mosteiro, M. A. (2020). Journal of the ACM. https://dl.acm.org/doi/abs/10.1145/3385075

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). https://ieeexplore.ieee.org/document/8820979

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). https://drops.dagstuhl.de/opus/volltexte/2019/10723/

Station Assignment with Reallocation
Halper, A., Mosteiro, M. A., Rossikova, Y. & Wong, P. W. (2019). Algorithmica. https://link.springer.com/article/10.1007%2Fs00453-018-0459-9

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. https://dl.acm.org/doi/10.1145/3291529

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
Chakraborty, M., Milani, A. & Mosteiro, M. A. (2018). Algorithmica. https://link.springer.com/article/10.1007%2Fs00453-017-0367-4

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). https://drops.dagstuhl.de/opus/volltexte/2018/9160/

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). https://ieeexplore.ieee.org/document/8367362

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). https://drops.dagstuhl.de/opus/volltexte/2017/7606/

Fault-Tolerant Aggregation: Flow Update Meets Mass Distribution
Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P. & Mosteiro, M. A. (2017). Distributed Computing. https://doi.org/10.1007/s00446-016-0288-5

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). https://dl.acm.org/doi/10.1145/3054977.3057292

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). https://ieeexplore.ieee.org/document/7794327/

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). https://link.springer.com/chapter/10.1007%2F978-3-319-46140-3_10

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). https://link.springer.com/chapter/10.1007%2F978-3-319-46140-3_11

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). https://drops.dagstuhl.de/opus/volltexte/2016/6617/

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. https://dx.doi.org/10.1016/j.future.2015.01.006

Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion
Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Pareja, D. (2015). PLoS ONE. https://dx.doi.org/10.1371/journal.pone.0116520

Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Farach-Colton, M. & Mosteiro, M. A. (2015). Algorithmica. https://dx.doi.org/10.1007/s00453-014-9905-5

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. https://dx.doi.org/10.1016/j.comgeo.2014.08.008

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). https://dx.doi.org/10.1007/978-3-319-20086-6_12

Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2014). IEEE Trans. Computers. https://ieeexplore.ieee.org/document/6256665

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). https://dl.acm.org/doi/10.1145/2634274.2634279

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). https://dx.doi.org/10.1007/978-3-319-07959-2_9

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). https://dx.doi.org/10.1007/978-3-319-13464-2_6

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.. https://dx.doi.org/10.1016/j.jpdc.2012.09.013

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. https://dx.doi.org/10.1002/cpe.3104

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. https://dx.doi.org/10.1007/s10955-012-0661-0

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.. https://dx.doi.org/10.1016/j.tcs.2012.11.030

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). https://dx.doi.org/10.1007/978-3-319-03850-6_8

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). https://dx.doi.org/10.1007/978-3-642-45346-5_12

Unbounded Contention Resolution in Multiple-Access Channels
Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2013). Algorithmica. https://dx.doi.org/10.1007/s00453-013-9816-x

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). https://dx.doi.org/10.1007/978-3-642-32820-6_45

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). https://dl.acm.org/doi/10.1145/2332432.2332472

Deterministic recurrent communication in restricted Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2012). Theor. Comput. Sci.. https://dx.doi.org/10.1016/j.tcs.2011.10.018

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). https://dx.doi.org/10.1007/978-3-642-29344-3_26

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. https://dx.doi.org/10.1007/s00446-012-0165-9

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). https://ieeexplore.ieee.org/document/6038615

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). https://dx.doi.org/10.1007/978-3-642-24100-0_13

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). https://dx.doi.org/10.1007/978-3-642-24100-0_19

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2011). Discrete Mathematics & Theoretical Computer Science. https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1748.1.html

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). https://dx.doi.org/10.1007/978-3-642-25873-2_35

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). https://www.cccg.ca/proceedings/2011/papers/paper42.pdf

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). https://dx.doi.org/10.1007/978-3-642-24100-0_23

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). https://dl.acm.org/doi/10.1145/1993806.1993838

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). https://ieeexplore.ieee.org/document/5470409

Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
Fernández Anta, A. & Mosteiro, M. A. (2010). Discrete Mathematics, Algorithms and Applications. https://www.worldscientific.com/doi/abs/10.1142/S1793830910000796

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). https://dx.doi.org/10.1007/978-3-642-14031-0_41

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). https://dx.doi.org/10.1007/978-3-642-16988-5_6

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). https://dx.doi.org/10.1007/978-3-642-15763-9_34

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). https://dspace.networks.imdea.org/bitstream/handle/20.500.12761/156/Length-of-the-Longest-Edge-2010-EN.pdf?sequence=1

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. https://ieeexplore.ieee.org/document/5368190

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) https://dl.acm.org/doi/10.1145/1597036.1597040

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. https://dx.doi.org/10.1007/978-3-540-87779-0_38

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. https://ieeexplore.ieee.org/document/4579679

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. https://dx.doi.org/10.1007/978-3-540-77096-1_9

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. https://dx.doi.org/10.1007/978-3-540-73951-7_49

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. https://dx.doi.org/10.1007/978-3-540-77120-3_22

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. https://dx.doi.org/10.1007/s00224-005-1237-z

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. https://dx.doi.org/10.1007/11682462_42

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. https://dx.doi.org/10.1007/11561071_73

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

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

• Tenure and Promotion [Committee Member]
• Curriculum [Committee Member]
• Course Coordination [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

• Student Experience [Committee Member]
• Tenure and Promotion [Committee Member]
• Tenure and Promotion [Committee Member]
• PhD and MS Dissertation [Committee Member]
• Graduate , Undergraduate, Pace 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]
• Pace University 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]
• Pace University 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]