Nombre de documents


CV de Pedro Montealegre

Communication dans un congrès7 documents

  • Pedro Montealegre, Ioan Todinca. Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. PODC Principles of Distributed Computing, Jul 2016, Chicago, United States. PODC '16 Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp.245-247, 2016, <10.1145/2933057.2933066>. <hal-01369335>
  • Pedro Montealegre, Ioan Todinca. On Distance-d Independent Set and other problems in graphs with few minimal separators.. Graph-Theoretic Concepts in Computer Science - 42st International Workshop, WG 2016, Jun 2016, Istanbul, Turkey. To appear 2016. <hal-01369337>
  • Eric Goles Chacc, Pedro Montealegre. A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton. 12th International Conference on Cellular Automata for Research and Industry, ACRI , Sep 2016, Fès, Morocco. Springer, Lecture Notes in Computer Science, 9863, pp.166-175, 2016, <10.1007/978-3-319-44365-2_16>. <hal-01369334>
  • Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliques. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. to appear, Lecture Notes in Computer Science. <hal-01216955>
  • Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca. The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. <hal-01148013>
  • Fedor Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Scandinavian Symposium and Workshops on Algorithm Theory, 2014, Denmark. To appear, 2014. <hal-00984059>
  • Pedro Montealegre-Barba, Ivan Rapaport, Ioan Todinca. The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. Structural Information and Communication Complexity - 21st International Colloquium (SIROCCO), 2014, Takayama, Japan. Springer, LNCS 8576, pp.83-95, <10.1007/978-3-319-09620-9_8>. <hal-01136022>

Article dans une revue5 documents

  • Eric Goles Chacc, Pedro Montealegre, Ville Salo, Ilkka Törmä. PSPACE-completeness of majority automata networks. Journal of Theoretical Computer Science (TCS), Elsevier, 2016, 609, pp.118-128. <10.1016/j.tcs.2015.09.014>. <hal-01315324>
  • Eric Goles Chacc, Pedro Montealegre. Naming Game Automata Network. Journal of Cellular Automata, Old City Publishing, 2016, 11 (5-6), pp.497-521. <hal-01369333>
  • Eric Goles Chacc, Pedro Montealegre. The complexity of the majority rule on planar graphs. Advances in Applied Mathematics, Elsevier, 2015, 64, pp.111-123. <10.1016/j.aam.2014.11.005>. <hal-01315322>
  • Eric Goles Chacc, Pedro Montealegre. Computational complexity of threshold automata networks under different updating schemes. Journal of Theoretical Computer Science (TCS), Elsevier, 2014, 559, pp.3-19. <10.1016/j.tcs.2014.09.010>. <hal-01315323>
  • Eric Goles, Pedro Montealegre-Barba, Ioan Todinca. The complexity of the bootstraping percolation and other problems. Theoretical Computer Science, Elsevier, 2013, 504, pp.73-82. <10.1016/j.tcs.2012.08.001>. <hal-00914603>

Pré-publication, Document de travail1 document

  • Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier. On the complexity of two-dimensional signed majority cellular automata. 2017. <hal-01472161>