Our Faculty

Miguel Mosteiro

Assistant Professor

Seidenberg School of CSIS

Computer Science NY

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

Tue 9:30am-12:00pm

Thu 9:30pm-12:00pm

Biography


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

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

  • 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


Chakraborty, M., Milani, A. & Mosteiro, M. A. Faster Exact-Counting in Anonymous Dynamic Networks. Algorithmica.

Kudaravalli, H. & Mosteiro, M. A. (2017, August). Ad-hoc Affectance-selective Families for Layer Dissemination. In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017). , pages 33:1-33:16. http://drops.dagstuhl.de/opus/volltexte/2017/7606/

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

Kowalski, D. R., Kudaravalli, H. & Mosteiro, M. A. (2017, April (2nd Quarter/Spring) 20). 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). , pages 313-314. http://doi.acm.org/10.1145/3054977.3057292

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

Chakraborty, M., Milani, A. & Mosteiro, M. A. (2016, September 15). Counting in Practical Anonymous Dynamic Networks is Polynomial. In Proc. of the 4th International Conference On Networked Systems - NETYS 2016. , pages 131-136. http://link.springer.com/chapter/10.1007%2F978-3-319-46140-3_10

Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2016, September 15). Internet Computing: Using Reputation to Select Workers from a Pool. In Proc. of the 4th International Conference On Networked Systems - NETYS 2016. , pages 137-153. http://link.springer.com/chapter/10.1007%2F978-3-319-46140-3_11

Milani, A. & Mosteiro, M. A. (2016, August). Faster Counting in Anonymous Dynamic Networks. In Proc. of the 19th International Conference On Principles Of Distributed Systems - OPODIS 2015. , pages 1-13. http://drops.dagstuhl.de/opus/volltexte/2016/6617/

Arjona Aroca, J., Fernández Anta, A., Mosteiro, M. A., Thraves, C. & Wang, L. (2016, January (1st Quarter/Winter)). Power-efficient assignment of virtual machines to physical machines. Future Generation Comp. Syst.. Vol 54 , pages 82–94. http://dx.doi.org/10.1016/j.future.2015.01.006

Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Pareja, D. (2015). Algorithmic Mechanisms for Reliable Crowdsourcing Computation under Collusion. PLoS ONE. Vol 10 (Issue 3) , pages 1-22. http://dx.doi.org/10.1371/journal.pone.0116520

Farach-Colton, M. & Mosteiro, M. A. (2015). Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. Algorithmica. Vol 73 (Issue 1) , pages 87–114. http://dx.doi.org/10.1007/s00453-014-9905-5

Arkin, E. M., Fernández Anta, A., Mitchell, J. S. & Mosteiro, M. A. (2015). Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. Comput. Geom.. Vol 48 (Issue 2) , pages 134–146. http://dx.doi.org/10.1016/j.comgeo.2014.08.008

Mosteiro, M. A., Rossikova, Y. & Wong, P. W. (2015). Station Assignment with Reallocation. In Proc. of the 14th International Symposium on Experimental Algorithms - SEA 2015. , pages 151–164. http://dx.doi.org/10.1007/978-3-319-20086-6_12

Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2014). Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing. IEEE Trans. Computers. Vol 63 (Issue 1) , pages 179–195. http://dx.doi.org/10.1109/TC.2012.186

Kowalski, D. R., Mosteiro, M. A. & Rouse, T. (2014). 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. , pages 39–46. http://doi.acm.org/10.1145/2634274.2634279

Farach-Colton, M., Leal, K., Mosteiro, M. A. & Thraves, C. (2014). Dynamic Windows Scheduling with Reallocation. In Proc. 13th International Symposium on Experimental Algorithms - SEA 2014. , pages 99–110. http://dx.doi.org/10.1007/978-3-319-07959-2_9

Arjona Aroca, J., Fernández Anta, A., Mosteiro, M. A., Thraves, C. & Wang, L. (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. , pages 71–88. http://dx.doi.org/10.1007/978-3-319-13464-2_6

Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2013). An early-stopping protocol for computing aggregate functions in Sensor Networks. J. Parallel Distrib. Comput.. Vol 73 (Issue 2) , pages 111–121. http://dx.doi.org/10.1016/j.jpdc.2012.09.013

Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013). Applying the dynamics of evolution to achieve reliability in master-worker computing. Concurrency and Computation: Practice and Experience. Vol 25 (Issue 17) , pages 2363–2380. http://dx.doi.org/10.1002/cpe.3104

Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013). Crowd Computing as a Cooperation Problem: An Evolutionary Approach. Journal of Statistical Physics. Vol 151 (Issue 3) , pages 654–672. http://dx.doi.org/10.1007/s10955-012-0661-0

Farach-Colton, M., Fernández Anta, A. & Mosteiro, M. A. (2013). Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). Theor. Comput. Sci.. Vol 472 , pages 60–80. http://dx.doi.org/10.1016/j.tcs.2012.11.030

Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2013). Reputation-Based Mechanisms for Evolutionary Master-Worker Computing. In Proc. of the 17th International Conference on Principles of Distributed Systems - OPODIS 2013. , pages 98–113. http://dx.doi.org/10.1007/978-3-319-03850-6_8

Fernández Anta, A., Kowalski, D. R., Mosteiro, M. A. & Wong, P. W. (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. , pages 155–169. http://dx.doi.org/10.1007/978-3-642-45346-5_12

Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2013). Unbounded Contention Resolution in Multiple-Access Channels. Algorithmica. Vol 67 (Issue 3) , pages 295–314. http://dx.doi.org/10.1007/s00453-013-9816-x

Christoforou, E., Fernández Anta, A., Georgiou, C., Mosteiro, M. A. & Sánchez, A. (2012). Achieving Reliability in Master-Worker Computing via Evolutionary Dynamics. In Proc. of the 18th International Conference on Parallel Processing - Euro-Par 2012. , pages 451–463. http://dx.doi.org/10.1007/978-3-642-32820-6_45

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. , pages 225–226. http://doi.acm.org/10.1145/2332432.2332472

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

Farach-Colton, M., Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (2012). 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. , pages 303–314. http://dx.doi.org/10.1007/978-3-642-29344-3_26

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. Distributed Computing. Vol 25 (Issue 4) , pages 279–296. http://dx.doi.org/10.1007/s00446-012-0165-9

Mosteiro, M. A. (2012). 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. , pages 163–168.

Christoforou, E., Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2011). Algorithmic Mechanisms for Internet Supercomputing under Unreliable Communication. In Proc. of the 10th IEEE International Symposium on Networking Computing and Applications - NCA 2011. , pages 275–280. http://dx.doi.org/10.1109/NCA.2011.46

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. , pages 147–149. http://dx.doi.org/10.1007/978-3-642-24100-0_13

Farach-Colton, M., Fernández Anta, A., Milani, A., Mosteiro, M. A. & Zaks, S. (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. , pages 202–204. http://dx.doi.org/10.1007/978-3-642-24100-0_19

Fernández Anta, A., Mosteiro, M. A. & Thraves, C. (2011). Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. Discrete Mathematics & Theoretical Computer Science. Vol 13 (Issue 1) , pages 95–112. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1748

Almeida, P. S., Baquero, C., Farach-Colton, M., Jesus, P. & Mosteiro, M. A. (2011). Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. In Proc. of the 15th International Conference on Principles of Distributed Systems - OPODIS 2011. , pages 513–527. http://dx.doi.org/10.1007/978-3-642-25873-2_35

Arkin, E. M., Fernández Anta, A., Mitchell, J. S. & 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. http://www.cccg.ca/proceedings/2011/papers/paper42.pdf

Fernández Anta, A., Mosteiro, M. A. & Ramón Muñoz, J. (2011). Unbounded Contention Resolution in Multiple-Access Channels. In Proc. of the 25th International Symposium on Distributed Computing - DISC 2011. , pages 225–236. http://dx.doi.org/10.1007/978-3-642-24100-0_23

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. , pages 211–212. http://doi.acm.org/10.1145/1993806.1993838

Fernández Anta, A., Georgiou, C. & Mosteiro, M. A. (2010). 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. , pages 1–11. http://dx.doi.org/10.1109/IPDPS.2010.5470409

Fernández Anta, A. & Mosteiro, M. A. (2010). Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks!!!. Discrete Mathematics, Algorithms and Applications. Vol 2 (Issue 4) , pages 445–456. http://www.worldscientific.com/doi/abs/10.1142/S1793830910000796

Fernández Anta, A. & Mosteiro, M. A. (2010). 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. , pag

PRESENTATIONS


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). Algorithms Seminar. Ad-hoc Affectance-selective Families for Layer Dissemination. Computer Science Department, University of Wroclaw

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

Mosteiro, M. A., Kudaravalli, H. & Kowalski, D. (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. (2016, April 26). 2016 Research Days. Counting in Anonymous Dynamic Networks. Kean University, Union, NJ

Mosteiro, M. A. (2015, July 16). 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). 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). 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). Algorithms Seminar. The Length of a Longest Edge in Multidimensional Delaunay Graphs. Stony Brook University, Stony Brook, NY

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

Mosteiro, M. A. (2012, August 16). 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). 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). Department of 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


My research interests are in various aspects of algorithms, from theoretical analysis to experimental algorithms. Specific areas of my research include algorithmic problems in radio networks and sensor networks, the application of game theory and reinforcement learning to crowd computing, online and reallocation algorithms in cloud computing and radio networks, etc.

Grants, Sponsored Research and Contracts

Mosteiro, M. A. (2014). DUE-S-STEM: Project ASK: Applying Student Knowledge for Success in Computer Science.
National Science Foundation , Federal , $621,925.00 . Funded,

Mosteiro, M. A. (2011). CCF-AF: Small: Collaborative Research: Algorithms for Reallocation Problems.
National Science Foundation , Federal , $249,990.00 . Funded,

COLLEGE SERVICE

  • Seidenberg School Faculty Council Nominations Committee [Committee Member]
  • Google Job Interview Information Session Speaker [Other]
  • Visiting Scholar Dr. Antonio Fernández-Anta Presentation Host [Other]
  • NSF-REU Information Session Speaker [Other]
  • Visiting Scholar Dr. Vincenzo Mancuso Presentation Host [Other]

PUBLIC SERVICE

  • Scientific Symposia Technical Program Committee [Committee Chair]
    Desc: ALGOSENSORS 2017, LATIN 2018
  • Scientific Symposia Technical Program Committee [Committee Member]
    Desc: Algosensors 2016 & 2017, IEEE ISPA 2015, 2016 & 2017, 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: 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