In this page we detail only the co-publications, that is, publications co-authored by both Argentinean and French members of INFINIS.

Book chapters

  1. Verónica Becher, Olivier Carton. Normal numbers and computer science. Chapter of Sequences, Groups and Number Theory, ed: Valérie Berthé and Michel Rigó. Trends in Mathematics Series. Birkhauser/Springer (to appear in 2018).
  2. Eda Cesaratto, Brigitte Vallée. Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis. Chapitre 11 (pp 405-448) in Combinatorics, Words and Symbolic Dynamics, Encyclopedia of mathematics and its applications 159, ed: M. Rigo et V. Berthé, Cambridge University Press, 2016.
  3. Carlos Areces, Pascal Fontaine, and Stephan Merz. Modal Satisfiability via SMT Solving. In R. De Nicola, and R. Hennicker, editors, Software, Services, and Systems, LNCS 8950, pp. 30-45, Springer International Publishing, 2015.
  4. Philippe Clauss, Diego Gabervetsky, Vincent Loechner, Sven Verdoolaege. Polyhedral Techniques for Parametric Memory Requirement Estimation. Chapter of Energy Aware Memory Management for Embedded Multimedia Systems : a Computer-Aided Design Approach, ed: Florin Balasa. Chapman & Hall/CRC Press, 2011.


  1. Verónica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo. Report from Dagstuhl Seminar Computability, Complexity and Randomness 2012. Schloss Dagstuhl, Seminar 12021, January 8-13, 2012.

Journal publications

  1. Flavia Bonomo, Ivo Koch, Pablo Torres, Mario Valencia-Pabon: k-tuple colorings of the cartesian product of graphs. Discrete Applied Mathematics, In Press, 2017.
  2. Verónica Becher, Olivier Carton, Pablo Ariel Heiber. Finite-state independence. Theory of Computing Systems (To appear).
  3. Pablo Torres, Mario Valencia-Pabon: Shifts of the stable Kneser graphs and hom-idempotence. European Journal of Combinatorics 62: 50-57 (2017)
  4. Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos. On abstract normalisation beyond neededness. Theoretical Computer Science. 672:36-63, 2017.
  5. Pablo Torres, Mario Valencia-Pabon: The packing chromatic number of hypercubes. Discrete Applied Mathematics 190-191: 127-140 (2015)
  6. Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, Maria Pia Mazzoleni, Bernard Ries and Mario Valencia-Pabon. On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electronic Notes in Discrete Mathematics 50: 249-254, 2015.
  7. Verónica Becher, Olivier Carton, Pablo Ariel Heiber. Normality and automata. Journal of Computer and System Sciences. 81(8): 1592-1613, 2015.
  8. Verónica Becher, Serge Grigorieff. Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Mathematical Structures in Computer Science, 25(7): 1490-1519, 2015.
  9. Verónica Becher, Serge Grigorieff. Wadge hardness in Scott spaces and its effectivization. Mathematical Structures in Computer Science, 25(7): 1520-1545, 2015.
  10. Flavia Bonomo, Ivo Koch, Pablo Torres and Mario Valencia-Pabon. K-tuple chromatic number of the cartesian product of graphs. Electronic Notes in Discrete Mathematics 50, 243-248, 2015.
  11. Flavia Bonomo, Guillermo Durán and Mario Valencia-Pabon Mariow. Complexity of the cluster deletion problem on subclasses of chordal graphs. Theoretical Computer Science 600: 59-69, 2015.
  12. Flavia Bonomo, Durán Guillermo, Amedeo Napoli and Mario Valencia-Pabon. A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs. Information Processing Letters 115 (6-8): 600-603, 2015.
  13. Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein and Mario Valencia-Pabon. b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Algorithmica 73(2): 289-305, 2015.
  14. Olivier Carton, Pablo Ariel Heiber. Normality and two-way automata. Information and Computation. 241: 264-276, 2015.
  15. Eda Cesaratto, Brigitte Vallée. Gaussian Distribution of Trie Depth for Strongly Tame Sources. Combinatorics, Probability and Computing, 24 (3) : 54-103, 2015.
  16. Diego Figueira, Santiago Figueira and Carlos Areces. Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization. Journal of Artificial Intelligence Research 53:271-314, 2015.
  17. Flavia Bonomo, Mario Valencia-Pabon. On the Minimum Sum Coloring of P4-sparse graphs. Graphs and Combinatorics 30(2):303-314, 2014.
  18. Vıctor Braberman, Diego Garbervetsky, Samuel Hym, Sergio Yovine. Summary based inference of quantitative bounds of live heap objects. Science of Computer Programming 92(A):56-84, 2014.
  19. Flavia Bonomo, Denis Cornaz, Tinaz Ekim, Bernard Ries. Perfectness of clustered graphs. Discrete Optimization 10:296-303, 2013.
  20. Verónica Becher, Serge Grigorieff. From index sets to randomness in the n-th jump of the halting problem: Random reals and possibly infinite computations part II. Journal of Symbolic Logic, 74(1):124–156, 2009.
  21. Verónica Becher, Serge Grigorieff. Random reals à la Chaitin with or without prefix freeness. Theoretical Computer Science 385(1-3):193-201, 2007.
  22. Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller. Randomness and halting probabilities. Journal of Symbolic Logic 71(4):1411-1430, 2006.
  23. Verónica Becher, Serge Grigorieff. Random reals and possibly infinite computations. Part I: Randomness in the Halting Problem. Journal of Symbolic Logic 70(3):891-913, 2005.
  24. Verónica Becher, Serge Grigorieff. Recursion and topology on the space of finite and infinite words for possibly infinite computations. Theoretical Computer Science, 322(1):85-136, 2004.

Peer-reviewed international conference publications

  1. Alejandro Díaz-Caro, Gilles Dowek. Typing quantum superpositions and measurement. 6th International Conference on the Theory and Practice of Natural Computing (TPNC), Prague, Czech Republic. To appear in LNCS, 2017.
  2. Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira. Bisimulations on Data Graphs. Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa. AAAI Press, pages 309-318, 2016.
  3. Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno. Robust Bell Inequalities from Communication Complexity. Proceedings of the 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, Berlin, Germany. LIPIcs, Volume 61, pages 1-24, 2016.
  4. Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza. A Strong Distillery. The 13th Asian Symposium on Programming Languages and Systems (APLAS), Poang, Korea. LNCS 9458, pages 231-250, 2015.
  5. Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola. Recurrence function on Sturmian words: a probabilistic study. The 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), Milano, Italy. LNCS 9234, pages 116-128, 2015.
  6. Guido Chari, Diego Garbervetsky, Stefan Marr, Stéphane Ducasse. Towards fully reflective environments. ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), ACM, pages 240-253, PA, USA, 2015.
  7. Diego Figueira, Santiago Figueira, Carlos Areces. Basic Model Theory of XPath on Data Trees. International Conference on Database Theory (ICDT), Athens, Greece, March 2014.
  8. Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi. A Nonstandard Standardization Theorem. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). ACM SIGPLAN-SIGACT, pages 659-670, San Diego, USA, 2014.
  9. Carlos Areces, Hans van Ditmarsch, Raúl Fervari, François Schwarzentruber. Logics with Copy and Remove. Workshop of Logic, Language, Information and Computation (WoLLIC), LNCS, Valparaıso, Chile, 2014.
  10. Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon. b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. International Symposium on Combinatorial Optimization (ISCO), LNCS 8596, Lisbonne, Portugal, 2014.
  11. Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer. Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property. Conference on Integer Programming and Combinatorial Optimization (IPCO), LNCS 7801, pages 86-97, Valparaıso, Chile, 2013.
  12. Carlos Areces, Pascal Fontaine. Combining Theories: The Ackerman and Guarded Fragments. International Symposium on Frontiers of Combining Systems (FroCos), LNCS 6989, pages 40-54, Saarbrücken, Allemagne, 2011.

Peer-reviewed international workshop publications

  1. Flavia Bonomo, Ivan Koch, Mario Valencia-Pabon. A linear algorithm for the k-tuple chromatic number of partner limited graphs. Proceedings of the VII Latin American Workshop on Cliques in Graphs, La Plata, Argentina, November 2016. (To appear in Matemática Contemporânea).
  2. Carlos Areces, David Deharbe, Pascal Fontaine, Ezequiel Orbe. SyMT: finding symmetries in SMT formulas. International Workshop on Satisfiability Modulo Theories (SMT), Helsinki, Finland, July 2013.
  3. Alejandro Díaz-Caro, Gilles Dowek. The probability of non-confluent systems. 9th International Workshop on Developments in Computational Models (DCM), Buenos Aires, Argentina, August, 2013.
  4. Alejandro Díaz-Caro, Gilles Dowek. Non determinism through type isomorphism. 7th Workshop on Logical and Semantic Frameworks, with Applications (LSFA), Rio de Janeiro, Brazil, September 2012.
  5. Delia Kesner, Carlos Lombardi, Alejandro Ríos. A Standardisation proof for algebraic pattern calculi. 5th International Workshop on Higher-Order Rewriting (HOR), Edinburgh, UK, July 2010.

Comments are closed.