Sledovat
Miguel A. Mosteiro
Miguel A. Mosteiro
Associate Professor, Computer Science Department, Pace University
E-mailová adresa ověřena na: pace.edu - Domovská stránka
Název
Citace
Citace
Rok
Insertion sort is O (n log n)
MA Bender, M Farach-Colton, MA Mosteiro
Theory of Computing systems 39, 391-397, 2006
992006
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
38*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
342019
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
262013
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
252020
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
22*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
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
Designing mechanisms for reliable Internet-based computing
AF Anta, C Georgiou, MA Mosteiro
2008 Seventh IEEE International Symposium on Network Computing and …, 2008
192008
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
18*2010
A faster exact-counting protocol for anonymous dynamic networks
M Chakraborty, A Milani, MA Mosteiro
Algorithmica 80, 3023-3049, 2018
17*2018
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
16*2013
Polynomial anonymous dynamic distributed computing without a unique leader
DR Kowalski, MA Mosteiro
Journal of Computer and System Sciences 123, 37-63, 2022
152022
Faster supervised average consensus in adversarial and stochastic anonymous dynamic networks
A Kamenev, DR Kowalski, MA Mosteiro
ACM Transactions on Parallel Computing 10 (2), 1-35, 2023
14*2023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20