Our Faculty

Miguel Mosteiro

Associate Professor

Seidenberg School of CSIS

Computer Science NY

Location
  • @New York City
    163 William Street 232
Office Hours
New York City

Fall 2021

Tue 9:00am-12:00pm

Office Hours

Fall 2021

Office Hours
Virtual

Fall 2021

Thu 9:00am-11:00am

Biography


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 70+ 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 and the ICALP 2018 Best Paper Award.

Education


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

Awards and Honors


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


Publications


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. (2016, November 18).

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

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Kowalski, D. R. & Mosteiro, M. A. (2021). Elsevier Journal of Computer and System Sciences. http://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, August). ACM Journal of Experimental Algorithmics. http://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, July (3rd Quarter/Summer)). http://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, July (3rd Quarter/Summer)). http://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. (2021, January (1st Quarter/Winter)). IEEE Transactions on Mobile Computing. http://ieeexplore.ieee.org/document/8745537

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Kowalski, D. & Mosteiro, M. A. (2020, October (4th Quarter/Autumn)). Journal of the ACM. http://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. (2020, April (2nd Quarter/Spring)). http://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, September 2). http://drops.dagstuhl.de/opus/volltexte/2019/10723/

Station Assignment with Reallocation
Halper, A., Mosteiro, M. A., Rossikova, Y. & Wong, P. W. (2019, July (3rd Quarter/Summer) 12). Algorithmica. http://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. (2019, March). ACM Transactions on Parallel Computing. http://dl.acm.org/citation.cfm?id=3291529

A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
Chakraborty, M., Milani, A. & Mosteiro, M. A. (2018). Algorithmica. http://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). http://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, July (3rd Quarter/Summer)). http://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. (2018, May). http://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, August). Distributed Computing. http://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, August). http://doi.acm.org/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. (2017, April (2nd Quarter/Spring) 20). http://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). http://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, September 15). http://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, September 15). http://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, August). Future Generation Comp. Syst.. http://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. (2016, January (1st Quarter/Winter)). PLoS ONE. http://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. http://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). Comput. Geom.. http://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). http://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. (2015). IEEE Trans. Computers. http://dx.doi.org/10.1109/TC.2012.186

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). http://doi.acm.org/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). http://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). http://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. (2014). J. Parallel Distrib. Comput.. http://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. http://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. http://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.. http://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). http://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). http://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. http://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. (2013). http://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). http://doi.acm.org/10.1145/2332432.2332472

Deterministic recurrent communication in restricted Sensor Networks
Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2012). Theor. Comput. Sci.. http://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). http://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. http://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. (2012). http://dx.doi.org/10.1109/NCA.2011.46

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). http://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). http://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. http://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). http://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). http://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). http://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). http://doi.acm.org/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. (2011). http://dx.doi.org/10.1109/IPDPS.2010.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. http://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). http://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). http://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). http://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). http://www.ams.sunysb.edu/jsbm/fwcg10/papers/15.pdf

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. (2010). , pages 357–364. http://dx.doi.org/10.1109/PRDC.2009.63

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) http://doi.acm.org/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. (2009). , pages 504–506. http://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. http://dx.doi.org/10.1109/NCA.2008.41

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. (2008). , pages 119–131. http://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. http://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. http://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. (2007). Theory Comput. Syst.. Vol 39 (Issue 3) , pages 391–397. http://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. http://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. (2006). , pages 827–838. http://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. (2005). , pages 16–23.

PRESENTATIONS


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

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

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

Mosteiro, M. A. (2018, July 13). The 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018 Best Paper Award) . Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. EATCS - European Association of Theoretical Computer Science, Prague.

Mosteiro, M. A. (2018, June 5). The 3rd Highlights of Algorithms (HALG 2018). Closure Operators and Spam Resistance for PageRank. Vrije Universiteit Amsterdam, Amsterdam.

Mosteiro, M. A. (2017, November 11). 74th Graph Theory Day. Counting and other Algebraic Computations in Anonymous Dynamic Networks. The Metropolitan New York Section of The Mathematical Association of America , New York, NY.

Mosteiro, M. A. (2017, June 23). 16th International Symposium on Experimental Algorithms (SEA 2017). Ad-hoc Affectance-selective Families for Layer Dissemination. London, UK.

Mosteiro, M. A. (2017, June 8). University of Wroclaw Algorithms Seminar. Ad-hoc Affectance-selective Families for Layer Dissemination. Computer Science Department, University of Wroclaw.

Mosteiro, M. A. (2017, May 18). University of Liverpool NeST Seminar. Ad-hoc Affectance-selective Families for Layer Dissemination. Computer Science Department, University of Liverpool.

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

Mosteiro, M. A. (2016, November 5). 72nd Graph Theory Day. Ad-hoc Affectance-selective Families for Information Dissemination in Bipartite Graphs. The Metropolitan New York Section of The Mathematical Association of America , New York, NY.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Mosteiro, M. A. (2006, February 2). Bell Labs Networks Seminar. Upper and Lower Bounds in Radio Networks. Bell Labs Research, Murray Hill, NJ.

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

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

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

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

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

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


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

Undergraduate Student - Faculty Research Program
Mosteiro, M. 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,$15,055.00.Funded.https://www.pace.edu/mypace/research-internet-things?mpc=fs

DUE-S-STEM: Project ASK: Applying Student Knowledge for Success in Computer Science
Mosteiro, M. A. 2014 - 2019.National Science Foundation,Federal,$621,925.00.Funded.https://www.nsf.gov/awardsearch/showAward?AWD_ID=1355582

CCF-AF: Small: Collaborative Research: Algorithms for Reallocation Problems
Mosteiro, M. A. 2011 - 2014.National Science Foundation,Federal,$249,990.00.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,$82,000.00.Funded.

PROFESSIONAL MEMBERSHIPS


Association for Computer Machinery[Member]

COLLEGE SERVICE


  • Seidenberg School Freshman Peer-mentoring Program[Faculty Advisor]
  • Personalized Student Training on Job Interviews[Faculty Mentor]
    Desc: Guidance and readings for Seidenberg students in the process of applying for industry jobs.
  • Seidenberg School Meetings[Attendee, Meeting]
  • Visiting Scholars Host[Other]
    Desc: 10/6/2016 Dr. Vincenzo Mancuso (IMDEA Networks Institute) 2/20-21/2017 Dr. Antonio Fernandez Anta (IMDEA Networks Institute) 11/6/2017 Dr. Martin Farach-Colton (Rutgers University)
  • Seidenberg School Faculty Search Committee[Committee Chair]
  • Pramp Inc. Job Interviews Training Service[Attendee, Meeting]
    Desc: Meeting with a Pramp Inc representative to discuss potential agreement.
  • 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


  • Pace University Research Day[Faculty Advisor]
    Desc: Poster presentation by students.
  • 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]
    Desc: (05/2017, 06/2018) Paths to complete a PhD dissertation. PhD programs at Pace.

PUBLIC SERVICE


  • Scientific Symposia Technical Program Committee[Committee Chair]
    Desc: ALGOSENSORS 2017, LATIN 2018, DiADN 2019
  • Scientific Symposia Technical Program Committee[Committee Member]
    Desc: SOFSEM 2021, Fun with Algorithms 2020, SIAM SOSA 2020, NETYS 2020, IEEE DCOSS 2019-2021, Algosensors 2016-2017 & 2020, IEEE ISPA 2015-2018 & 2020, IEEE CSE 2020, IEEE ICDCS 2011, 2014 & 2016, ACM SIGACT-SIGOPS PODC 2015, IEEE NCA 2013, OPODIS 2011, ACM FOMC 2011.
  • ACM Transactions on Algorithms[Assistant of the Editorial Board]
  • Scientific Journals[Reviewer]
    Desc: IEEE: Signal Processing Letters, Transactions on Communications, Communication Letters, Transactions on Computers, Transactions on Parallel and Distributed Systems; Elsevier: Theoretical Computer Science, Journal of Computing and System Sciences, Computing, Journal of Parallel and Distributed Computing, Information Processing Letters, Journal of Discrete Algorithms, Discrete Applied Mathematics; Springer: Distributed Computing, Algorithmica, Journal of Supercomputing; ACM: Transactions on Sensor Networks, Transactions on Algorithms; Siam Journal of Computing; Computational Intelligence and Neuroscience.
  • Scientific Symposia[Reviewer]
    Desc: ACM-SIAM Symposium on Discrete Algorithms (SODA), Algorithms and Data Structures Symposium (WADS), IEEE Wireless Communications and Networking Conference (WCNC), European Symposium on Algorithms (ESA), Symposium on Parallel Algorithms and Architectures (SPAA), International Symposium on Algorithms and Computation (ISAAC), IEEE International Conference on Smart Grid Communications (SmartGridComm), International Colloquium on Automata, Languages and Programming (ICALP), ACM Symposium on Principles of Distributed Computing (PODC), IEEE International Parallel & Distributed Processing Symposium (IPDPS), International European Conference on Parallel and Distributed Computing (Europar), International Conference On Principles Of Distributed Systems (OPODIS), International Symposium on Distributed Computing (DISC), Annual Conference on Theory and Applications of Models of Computation (TAMC), Annual International Conference, Computing and Combinatorics (COCOON), Latin American Theoretical Informatics Symposium (LATIN), IEEE International Symposium on Network Computing and Applications (NCA), International Conference on Distributed Computing and Networking (ICDCN).
  • National Agency of Scientific and Technological Promotion (Argentina) FONCyT-PICT[Grant Proposal Reviewer, External]
  • National Science Foundation (NSF) CCF-AF[Grant Proposal Reviewer, External]
More Faculty Members