Seguir
Miguel A. Mosteiro
Miguel A. Mosteiro
Associate Professor, Computer Science Department, Pace University
Dirección de correo verificada de pace.edu - Página principal
Título
Citado por
Citado por
Año
Insertion sort is O (n log n)
MA Bender, M Farach-Colton, MA Mosteiro
Theory of Computing systems 39, 391-397, 2006
982006
Unbounded contention resolution in multiple-access channels
A Fernández Anta, MA Mosteiro, J Ramón Muñoz
Algorithmica 67 (3), 295-314, 2013
622013
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
38*2016
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
35*2009
Optimizing mmWave wireless backhaul scheduling
E Arribas, AF Anta, DR Kowalski, V Mancuso, MA Mosteiro, J Widmer, ...
IEEE Transactions on Mobile Computing 19 (10), 2409-2428, 2019
332019
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
A Fernández Anta, A Milani, MA Mosteiro, S Zaks
Distributed Computing 25, 279-296, 2012
332012
Lower bounds for clear transmissions in radio networks
M Farach-Colton, RJ Fernandes, MA Mosteiro
Latin American Symposium on Theoretical Informatics, 447-454, 2006
312006
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
30*2013
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
252013
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
222010
Algorithmic mechanisms for reliable crowdsourcing computation under collusion
A Fernández Anta, C Georgiou, MA Mosteiro, D Pareja
PloS one 10 (3), e0116520, 2015
202015
Fault-tolerant aggregation: Flow-updating meets mass-distribution
PS Almeida, C Baquero, M Farach-Colton, P Jesus, MA Mosteiro
Principles of Distributed Systems: 15th International Conference, OPODIS …, 2011
20*2011
Designing mechanisms for reliable Internet-based computing
AF Anta, C Georgiou, MA Mosteiro
2008 Seventh IEEE International Symposium on Network Computing and …, 2008
192008
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
182020
Initializing sensor networks of non-uniform density in the weak sensor model
M Farach-Colton, MA Mosteiro
Algorithmica 73 (1), 87-114, 2015
18*2015
CONTENTION RESOLUTION IN MULTIPLE-ACCESS CHANNELS: k-SELECTION IN RADIO NETWORKS
A FERNÁNDEZ ANTA, MA MOSTEIRO
Discrete Mathematics, Algorithms and Applications 2 (4), 445-456, 2010
17*2010
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
142015
An early-stopping protocol for computing aggregate functions in sensor networks
AF Anta, MA Mosteiro, C Thraves
Journal of Parallel and Distributed Computing 73 (2), 111-121, 2013
14*2013
Deterministic recurrent communication in restricted sensor networks
AF Anta, MA Mosteiro, C Thraves
Theoretical Computer Science 418, 37-47, 2012
14*2012
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
132012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20