Miguel A. Mosteiro
Miguel A. Mosteiro
Associate Professor, Computer Science Department, Pace University
Verified email at pace.edu - Homepage
Title
Cited by
Cited by
Year
Insertion sort is O (n log n)
MA Bender, M Farach-Colton, MA Mosteiro
Theory of Computing Systems 39 (3), 391-397, 2006
692006
Unbounded contention resolution in multiple-access channels
AF Anta, MA Mosteiro, JR Muñoz
Algorithmica 67 (3), 295-314, 2013
462013
Bootstrapping a hop-optimal network in the weak sensor model
M Farach-Colton, RJ Fernandes, MA Mosteiro
ACM Transactions on Algorithms (TALG) 5 (4), 1-30, 2009
32*2009
Power-efficient assignment of virtual machines to physical machines
JA Aroca, AF Anta, MA Mosteiro, C Thraves, L Wang
Future Generation Computer Systems 54, 82-94, 2016
302016
Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound)
M Farach-Colton, AF Anta, MA Mosteiro
Theoretical Computer Science 472, 60-80, 2013
29*2013
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
AF Anta, A Milani, MA Mosteiro, S Zaks
Distributed Computing 25 (4), 279-296, 2012
292012
Lower bounds for clear transmissions in radio networks
M Farach-Colton, RJ Fernandes, MA Mosteiro
Latin American Symposium on Theoretical Informatics, 447-454, 2006
242006
Applying the dynamics of evolution to achieve reliability in master–worker computing
E Christoforou, AF Anta, C Georgiou, MA Mosteiro, A Sánchez
Concurrency and Computation: Practice and Experience 25 (17), 2363-2380, 2013
212013
Fault-tolerant aggregation: Flow-updating meets mass-distribution
PS Almeida, C Baquero, M Farach-Colton, P Jesus, MA Mosteiro
International Conference On Principles Of Distributed Systems, 513-527, 2011
20*2011
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers
AF Anta, C Georgiou, MA Mosteiro
2010 IEEE International Symposium on Parallel & Distributed Processing …, 2010
202010
Algorithmic mechanisms for reliable crowdsourcing computation under collusion
AF Anta, C Georgiou, MA Mosteiro, D Pareja
PloS one 10 (3), e0116520, 2015
17*2015
Designing mechanisms for reliable Internet-based computing
AF Anta, C Georgiou, MA Mosteiro
2008 Seventh IEEE International Symposium on Network Computing and …, 2008
172008
Deterministic recurrent communication in restricted sensor networks
AF Anta, MA Mosteiro, C Thraves
Theoretical Computer Science 418, 37-47, 2012
16*2012
Initializing sensor networks of non-uniform density in the weak sensor model
M Farach-Colton, MA Mosteiro
Algorithmica 73 (1), 87-114, 2015
14*2015
Probabilistic bounds on the length of a longest edge in delaunay graphs of random points in d-dimensions
EM Arkin, AF Anta, JSB Mitchell, MA Mosteiro
Computational Geometry 48 (2), 134-146, 2015
132015
Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
AF Anta, MA Mosteiro
International Computing and Combinatorics Conference, 378-388, 2010
13*2010
Algorithmic mechanisms for reliable master-worker internet-based computing
E Christoforou, AF Anta, C Georgiou, MA Mosteiro
IEEE Transactions on Computers 63 (1), 179-195, 2012
122012
Reputation-based mechanisms for evolutionary master-worker computing
E Christoforou, AF Anta, C Georgiou, MA Mosteiro, AA Sánchez
International Conference On Principles Of Distributed Systems, 98-113, 2013
10*2013
Algorithmic mechanisms for internet supercomputing under unreliable communication
E Christoforou, A Fern, C Georgiou, MA Mosteiro
2011 IEEE 10th International Symposium on Network Computing and Applications …, 2011
82011
Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
DR Kowalski, MA Mosteiro
Journal of the ACM (JACM) 67 (2), 1-17, 2020
72020
The system can't perform the operation now. Try again later.
Articles 1–20