Follow
Miguel A. Mosteiro
Miguel A. Mosteiro
Associate Professor, Computer Science Department, Pace University
Verified email at pace.edu - Homepage
Title
Cited by
Year
Verifiable Crowd Computing: Coping with Bounded Rationality
L Dong, MA Mosteiro, S Singh
Theoretical Computer Science 1004, 114631, 2024
2024
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
DR Kowalski, MA Mosteiro, K Zaki
Theory of Computing Systems 67 (5), 1131-1131, 2023
2023
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
DR Kowalski, MA Mosteiro, K Zaki
Theory of Computing Systems 67 (4), 825-854, 2023
2023
Graph Ranking and the Cost of Sybil Defense
G Farach-Colton, M Farach-Colton, LA Goldberg, H Komlos, J Lapinskas, ...
Proceedings of the 24th ACM Conference on Economics and Computation, 586-625, 2023
12023
The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary Interference
DR Kowalski, MA Mosteiro
2023 IEEE International Symposium on Information Theory (ISIT), 2685-2690, 2023
2023
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
13*2023
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity
DR Kowalski, MA Mosteiro
arXiv preprint arXiv:2202.07167, 2022
42022
Polynomial anonymous dynamic distributed computing without a unique leader
DR Kowalski, MA Mosteiro
Journal of Computer and System Sciences 123, 37-63, 2022
122022
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
L Dong, DR Kowalski, H Kudaravalli, MA Mosteiro
Theoretical Computer Science 901, 19-34, 2022
32022
Dynamic Windows Scheduling with Reallocation
M Farach-Colton, K Leal, MA Mosteiro, CT Caro
Journal of Experimental Algorithmics (JEA) 26, 1-19, 2021
2021
Time and communication complexity of leader election in anonymous networks
DR Kowalski, MA Mosteiro
2021 IEEE 41st International Conference on Distributed Computing Systems …, 2021
82021
Heuristically speeding up anonymous dynamic network computations
A Halper, DR Kowalski, MA Mosteiro
2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications …, 2020
2020
Generic Framework for Optimization of Local Dissemination in Wireless Networks
DR Kowalski, MA Mosteiro, K Wadhwa
International Conference on Networked Systems, 244-260, 2020
2020
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
222020
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
322019
Mmwave wireless backhaul scheduling of stochastic packet arrivals
P Garncarek, T Jurdziński, D Kowalski, M Mosteiro
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
12019
Station assignment with reallocation
A Halper, MA Mosteiro, Y Rossikova, PWH Wong
Algorithmica 81, 1096-1125, 2019
22019
Scheduling dynamic parallel workload of mobile devices with access guarantees
AF Anta, DR Kowalski, MA Mosteiro, PWH Wong
ACM Transactions on Parallel Computing (TOPC) 5 (2), 1-19, 2018
82018
A faster exact-counting protocol for anonymous dynamic networks
M Chakraborty, A Milani, MA Mosteiro
Algorithmica 80, 3023-3049, 2018
17*2018
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings
MA Bender, M Farach-Colton, MA Mosteiro
Springer, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20