| Three notes on distributed property testing G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ... 31st International Symposium on Distributed Computing (DISC 2017), 2017 | 36 | 2017 |
| The complexity of the bootstraping percolation and other problems E Goles, P Montealegre-Barba, I Todinca Theoretical Computer Science 504, 73-82, 2013 | 34 | 2013 |
| Algorithms parameterized by vertex cover and modular width, through potential maximal cliques FV Fomin, M Liedloff, P Montealegre, I Todinca Algorithmica 80, 1146-1169, 2018 | 24 | 2018 |
| The simultaneous number-in-hand communication model for networks: Private coins, public coins and determinism F Becker, P Montealegre, I Rapaport, I Todinca Structural Information and Communication Complexity: 21st International …, 2014 | 24 | 2014 |
| Computational complexity of threshold automata networks under different updating schemes E Goles, P Montealegre Theoretical Computer Science 559, 3-19, 2014 | 23 | 2014 |
| Compact distributed certification of planar graphs L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 22 | 2020 |
| On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators P Montealegre, I Todinca Graph-Theoretic Concepts in Computer Science: 42nd International Workshop …, 2016 | 22 | 2016 |
| On the complexity of two-dimensional signed majority cellular automata E Goles, P Montealegre, K Perrot, G Theyssier Journal of Computer and System Sciences 91, 1-32, 2018 | 19 | 2018 |
| Local certification of graphs with bounded genus L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, E Rémila, I Todinca Discrete Applied Mathematics 325, 9-36, 2023 | 16 | 2023 |
| On distributed Merlin-Arthur decision protocols P Fraigniaud, P Montealegre, R Oshman, I Rapaport, I Todinca Structural Information and Communication Complexity: 26th International …, 2019 | 16 | 2019 |
| PSPACE-completeness of majority automata networks E Goles, P Montealegre, V Salo, I Törmä Theoretical Computer Science 609, 118-128, 2016 | 16 | 2016 |
| Brief announcement: deterministic graph connectivity in the broadcast congested clique P Montealegre, I Todinca Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 15 | 2016 |
| Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques M Liedloff, P Montealegre, I Todinca Algorithmica 81 (3), 986-1005, 2019 | 12 | 2019 |
| On the computational complexity of the freezing non-strict majority automata E Goles, D Maldonado, P Montealegre, N Ollinger Cellular Automata and Discrete Complex Systems: 23rd IFIP WG 1.5 …, 2017 | 12 | 2017 |
| Competing activists—political polarization L Böttcher, P Montealegre, E Goles, H Gersbach Physica A: Statistical Mechanics and its Applications 545, 123713, 2020 | 10 | 2020 |
| The impact of locality on the detection of cycles in the broadcast congested clique model F Becker, P Montealegre, I Rapaport, I Todinca LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 9 | 2018 |
| Distributed subgraph detection P Fraigniaud, P Montealegre, D Olivetti, I Rapaport, I Todinca arXiv preprint arXiv:1706.03996, 2017 | 9 | 2017 |
| The complexity of the asynchronous prediction of the majority automata E Goles, P Montealegre Information and Computation 274, 104537, 2020 | 8 | 2020 |
| The complexity of the majority rule on planar graphs E Goles, P Montealegre Advances in Applied Mathematics 64, 111-123, 2015 | 8 | 2015 |
| Finding connected secluded subgraphs PA Golovach, P Heggernes, PT Lima, P Montealegre Journal of Computer and System Sciences 113, 101-124, 2020 | 7 | 2020 |
Ioan TodincaUniv. Orleans, FranceVerified email at univ-orleans.fr
