| Toward optimal bounds in the congested clique: Graph connectivity and MST JW Hegeman, G Pandurangan, SV Pemmaraju, VB Sardeshmukh, ... Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing …, 2015 | 112 | 2015 |
| A time- and message-optimal distributed algorithm for minimum spanning trees G Pandurangan, P Robinson, M Scquizzato Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 64 | 2017 |
| On the Distributed Complexity of Large-Scale Graph Computations G Pandurangan, P Robinson, M Scquizzato Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and …, 2018 | 53 | 2018 |
| Fast distributed algorithms for connectivity and MST in large graphs G Pandurangan, P Robinson, M Scquizzato ACM Transactions on Parallel Computing (TOPC) 5 (1), 4, 2018 | 51 | 2018 |
| A -competitive deterministic algorithm for online matching on a line A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato Approximation and Online Algorithms: 12th International Workshop, WAOA 2014 …, 2015 | 39* | 2015 |
| Chasing convex bodies and functions A Antoniadis, N Barcelo, M Nugent, K Pruhs, K Schewior, M Scquizzato LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 37 | 2016 |
| Communication lower bounds for distributed-memory computations M Scquizzato, F Silvestri International Symposium on Theoretical Aspects of Computer Science, 627-638, 2014 | 27 | 2014 |
| Equivalence classes and conditional hardness in massively parallel computations D Nanongkai, M Scquizzato Distributed Computing 35 (2), 165-183, 2022 | 25 | 2022 |
| Matching on the line admits no o (√ log n)-competitive algorithm E Peserico, M Scquizzato 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 25 | 2021 |
| The distributed minimum spanning tree problem G Pandurangan, P Robinson, M Scquizzato Bulletin of EATCS 2 (125), 2018 | 25 | 2018 |
| A Lower Bound Technique for Communication on BSP with Application to the FFT G Bilardi, M Scquizzato, F Silvestri European Conference on Parallel Processing, 676-687, 2012 | 20 | 2012 |
| A -Competitive Deterministic Algorithm for Online Matching on a Line A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato Algorithmica 81 (7), 2917-2933, 2019 | 18 | 2019 |
| Tight bounds for distributed graph computations G Pandurangan, P Robinson, M Scquizzato CoRR, abs/1602.08481, 2016 | 16 | 2016 |
| Energy-efficient circuit design A Antoniadis, N Barcelo, M Nugent, K Pruhs, M Scquizzato Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 14 | 2014 |
| Tight bounds for parallel paging and green paging K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 13 | 2021 |
| Message lower bounds via efficient network synchronization G Pandurangan, D Peleg, M Scquizzato International Colloquium on Structural Information and Communication …, 2016 | 12 | 2016 |
| On the complexity of speed scaling N Barcelo, P Kling, M Nugent, K Pruhs, M Scquizzato Mathematical Foundations of Computer Science 2015: 40th International …, 2015 | 12 | 2015 |
| Efficient computation of optimal energy and fractional weighted flow trade-off schedules A Antoniadis, N Barcelo, ME Consuegra, P Kling, M Nugent, K Pruhs, ... 31st International Symposium on Theoretical Aspects of Computer Science …, 2014 | 12 | 2014 |
| Green paging and parallel paging K Agrawal, MA Bender, R Das, W Kuszmaul, E Peserico, M Scquizzato Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 10 | 2020 |
| A time- and message-optimal distributed algorithm for minimum spanning trees G Pandurangan, P Robinson, M Scquizzato ACM Transactions on Algorithms (TALG) 16 (1), 1-27, 2019 | 7 | 2019 |
Gopal PanduranganProfessor of Computer Science, University of Houston在 cs.uh.edu 的电子邮件经过验证
