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

Information for members: Please acknowledge the IRP in your publications with the following text «This work was partially/fully funded by the French-Argentinian IRP SINFIN.»

Book chapters

  1. Verónica Becher and 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, 2018.
  2. Eda Cesaratto and 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, and 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.

Editorial

  1. Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, and Mario Valencia-Pabon. LAGOS’17: IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M., Marseille, France – 2017. Special Issue of Discrete Applied Mathematics. Volume 281, 2020.
  2. 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. Luciano Grippo, Adrián Pastine, Pablo Torres, Mario Valencia-Pabon, Juan Vera. On the P₃-hull number of Kneser graphs. The Electronic Journal of Combinatorics, 28(3) P3.32, 2021.
  2. Stéphane Demri, Raúl Fervari, and Alessio Mansutti. Internal Proof Calculi for Modal Logics with Separating Conjunction. Journal of Logic and Computation, exab016, 2021.
  3. Eda Cesaratto and Brigitte Vallée. Gaussian behavior of quadratic irrationals. Acta Arithmetica 197:159-205, 2021.
  4. Olivier Carton and Elisa Orduna. Preservation of normality by transducers. Information and Computation, In Press, 2020.
  5. Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, and Annegret K. Wagler. On graph classes related to perfect graphs: A survey. Discrete Applied Mathematics 281:42-60, 2020.
  6. Nicolás Alvarez, and Olivier Carton. On Normality in Shifts of Finite Type. Theory Computing Systems 64:783–798, 2020.
  7. Stéphane Demri and Raul Fervari. The Power of Modal Separation Logics. Journal of Logic and Computation 29(8):1139–1184, 2019.
  8. Flavia Bonomo-Braberman, Mitre C. Dourado, Mario Valencia-Pabon, and Juan C. Vera. A note on homomorphisms of Kneser hypergraphs. Applied Mathematics and Computation 366:124764, 2019.
  9. Verónica Becher and Olivier Carton. Normal numbers and nested perfect necklaces. Journal of Complexity 54:101403, 2019.
  10. Verónica Becher, Olivier Carton, and Ignacio Mollo Cunningham. Low discrepancy sequences failing Poissonian pair correlations. Archiv der Mathematik 113(2):169–178, 2019.
  11. Alejandro Díaz-Caro, Gilles Dowek, and Juan Pablo Rinaldi. Two linearities for quantum computing in the lambda calculus. BioSystems 186:104012, 2019.
  12. Nicolás Alvarez, Verónica Becher, and Olivier Carton. Finite-state independence and normal sequences. Journal of Computer and System Sciences 103:1-17, 2019.
  13. Christoph Aistleitner, Verónica Becher, and Olivier Carton. Normal numbers with digit dependencies. Transactions of American Mathematical Society 372(6):4425-4446, 2019.
  14. Guido Chari, Diego Garbervetsky, Stefan Marr, and Stephane Ducasse. Fully Reflective Execution Environments: Virtual Machines for More Flexible Software. IEEE Transactions on Software Engineering 45(9):858-876, 2018.
  15. Flavia Bonomo, Ivo Koch, Pablo Torres, and Mario Valencia-Pabon. k-tuple colorings of the cartesian product of graphs. Discrete Applied Mathematics 245:177-182, 2018.
  16. Verónica Becher, Olivier Carton, and Pablo Ariel Heiber. Finite-state independence. Theory of Computing Systems 62(7):1555-1572, 2018.
  17. Pablo Torres and Mario Valencia-Pabon. Shifts of the stable Kneser graphs and hom-idempotence. European Journal of Combinatorics 62:50-57, 2017.
  18. Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro Ríos. On abstract normalisation beyond neededness. Theoretical Computer Science. 672:36-63, 2017.
  19. Pablo Arrighi, Alejandro Díaz-Caro, and Benoît Valiron. The vectorial λ-calculus. Information and Computation 254(1):105-139, 2017.
  20. Pablo Torres and Mario Valencia-Pabon. The packing chromatic number of hypercubes. Discrete Applied Mathematics 190-191:127-140, 2015.
  21. 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.
  22. Verónica Becher, Olivier Carton, and Pablo Ariel Heiber. Normality and automata. Journal of Computer and System Sciences. 81(8): 1592-1613, 2015.
  23. Verónica Becher and 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.
  24. Verónica Becher and Serge Grigorieff. Wadge hardness in Scott spaces and its effectivization. Mathematical Structures in Computer Science, 25(7): 1520-1545, 2015.
  25. 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.
  26. Flavia Bonomo, Guillermo Durán, and Mario Valencia-Pabon. Complexity of the cluster deletion problem on subclasses of chordal graphs. Theoretical Computer Science 600: 59-69, 2015.
  27. 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.
  28. 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.
  29. Olivier Carton and Pablo Ariel Heiber. Normality and two-way automata. Information and Computation. 241: 264-276, 2015.
  30. Eda Cesaratto, Brigitte Vallée. Gaussian Distribution of Trie Depth for Strongly Tame Sources. Combinatorics, Probability and Computing, 24(3) : 54-103, 2015.
  31. 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.
  32. Ali Assaf, Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, and Benoît Valiron. Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus. Logical Methods in Computer Science 10(4:8), 2014.
  33. Flavia Bonomo and Mario Valencia-Pabon. On the Minimum Sum Coloring of P4-sparse graphs. Graphs and Combinatorics 30(2):303-314, 2014.
  34. Vıctor Braberman, Diego Garbervetsky, Samuel Hym, and Sergio Yovine. Summary based inference of quantitative bounds of live heap objects. Science of Computer Programming 92(A):56-84, 2014.
  35. Flavia Bonomo, Denis Cornaz, Tinaz Ekim, and Bernard Ries. Perfectness of clustered graphs. Discrete Optimization 10:296-303, 2013.
  36. Verónica Becher and 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.
  37. Verónica Becher and Serge Grigorieff. Random reals à la Chaitin with or without prefix freeness. Theoretical Computer Science 385(1-3):193-201, 2007.
  38. Verónica Becher, Santiago Figueira, Serge Grigorieff, and Joseph S. Miller. Randomness and halting probabilities. Journal of Symbolic Logic 71(4):1411-1430, 2006.
  39. Verónica Becher and Serge Grigorieff. Random reals and possibly infinite computations. Part I: Randomness in the Halting Problem. Journal of Symbolic Logic 70(3):891-913, 2005.
  40. Verónica Becher and 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 and Gilles Dowek. A new connective in natural deduction, and its application to quantum computing. In: 18th International Colloquium on Theoretical Aspects of Computing (ICTAC 2021). LNCS 12819:175-193, 2021.
  2. Adrián Pastine, Pablo Torres, and Mario Valencia. On the diameter of Schrijver graphs. In: XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021). To appear in ENTCS, 2021.
  3. Delia Kesner, Eduardo Bonelli, and Andrés Viso. Strong Bisimulation for Control Operators (Invited Talk). In: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). LIPIcs 152(4), 2020.
  4. Diego Figueira, Santiago Figueira, and Edwin Pin Baque. Finite Controllability for Ontology-Mediated Query Answering of CRPQ. In: 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Main Track, pages 381-391, 2020.
  5. Bartosz Bednarczyk, Stéphane Demri, Raúl Fervari, and Alessio Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity. In: 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), IEEE, 2020.
  6. Valérie Berthé, Eda Cesaratto, Frédéric Paccaut, Pablo Rotondo, Martín Safe, and Brigitte Vallée. Two  arithmetical sources and their associated  tries. In: 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020). LIPIcs 159(4), 2020.
  7. Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, and Andrés Viso. The Bang Calculus Revisited. In: 15th International Symposium on Functional and Logic Programming (FLOPS 2020). LNCS 12073:13-32, 2020.
  8. Beniamino Accattoli and Alejandro Díaz-Caro. Functional Pearl: The Distributive λ-Calculus. In: 15th International Symposium on Functional and Logic Programming (FLOPS 2020). LNCS 12073:33-49, 2020.
  9. María Emilia Descotte, Diego Figueira, and Santiago Figueira. Closure properties of synchronized relations. In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). LIPICS 126(22), 2019.
  10. Stéphane Demri, Raul Fervari, and Alessio Mansutti. Axiomatising Logics with Separating Conjunction and Modalities. In: Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA 2019). LNCS 11468:692-708, 2019.
  11. Alejandro Díaz-Caro and Gilles Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions. In: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019). LIPICS 131(14), 2019.
  12. Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, and Benoît Valiron. Realizability in the Unitary Sphere. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019), IEEE, 2019.
  13. Stéphane Demri and Raúl Fervari. On the complexity of modal separation logics. In: 12th Conference on Advances in Modal Logic (AIML 2018), pages 179–198. College Publications, 2018.
  14. Delia Kesner, Alejandro Rios, and Andres Viso. Call-by-need, neededness and all that. In: 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018). LNCS 10803:241-257, 2018.
  15. Alejandro Díaz-Caro and Gilles Dowek. Typing quantum superpositions and measurement. In: 6th International Conference on the Theory and Practice of Natural Computing (TPNC 2017). LNCS 10687:281-293, 2017.
  16. Sergio Abriola, Pablo Barceló, Diego Figueira, and Santiago Figueira. Bisimulations on Data Graphs. In: 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016). ACM, pages 309-318, 2016.
  17. Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, and Gabriel Senno. Robust Bell Inequalities from Communication Complexity. In: 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016). LIPIcs 61:1-24, 2016.
  18. Beniamino Accattoli, Pablo Barenbaum, and Damiano Mazza. A Strong Distillery. In: The 13th Asian Symposium on Programming Languages and Systems (APLAS 2015). LNCS 9458:231-250, 2015.
  19. Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, and Alfredo Viola. Recurrence function on Sturmian words: a probabilistic study. In: The 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015). LNCS 9234:116-128, 2015.
  20. Guido Chari, Diego Garbervetsky, Stefan Marr, and Stéphane Ducasse. Towards fully reflective environments. In: ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), ACM, pages 240-253, 2015.
  21. Diego Figueira, Santiago Figueira, and Carlos Areces. Basic Model Theory of XPath on Data Trees. In: 17th International Conference on Database Theory (ICDT 2014), 2014.
  22. Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, and Carlos Lombardi. A Nonstandard Standardization Theorem. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), pages 659-670, 2014.
  23. Carlos Areces, Hans van Ditmarsch, Raúl Fervari, and François Schwarzentruber. Logics with Copy and Remove. In: 21th Workshop of Logic, Language, Information and Computation (WoLLIC 2014), LNCS 8652:51-65, 2014.
  24. Flavia Bonomo, Oliver Schaudt, Maya Stein, and Mario Valencia-Pabon. b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. In: 3rd International Symposium on Combinatorial Optimization (ISCO 2014). LNCS 8596:100-111, 2014.
  25. Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, and Gautier Stauffer. Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property. In: 16th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), LNCS 7801:86-97, 2013.
  26. Carlos Areces and Pascal Fontaine. Combining Theories: The Ackerman and Guarded Fragments. In: 8th International Symposium on Frontiers of Combining Systems (FroCos 2011), LNCS 6989:40-54, 2011.

Peer-reviewed international workshop publications

  1. Flavia Bonomo, Ivan Koch, and Mario Valencia-Pabon. A linear algorithm for the k-tuple chromatic number of partner limited graphs. In: VII Latin American Workshop on Cliques in Graphs, La Plata, Argentina, November 2016.
  2. Carlos Areces, David Deharbe, Pascal Fontaine, and Ezequiel Orbe. SyMT: finding symmetries in SMT formulas. In: International Workshop on Satisfiability Modulo Theories (SMT 2013), Helsinki, Finland, July 2013.
  3. Alejandro Díaz-Caro and Gilles Dowek. The probability of non-confluent systems. In: 9th International Workshop on Developments in Computational Models (DCM 2013). EPTCS 144:1-15, 2014.
  4. Alejandro Díaz-Caro and Gilles Dowek. Non determinism through type isomorphism. In: 7th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012). EPTCS 113:137-144, 2013.
  5. Delia Kesner, Carlos Lombardi, and Alejandro Ríos. A Standardisation proof for algebraic pattern calculi. In: 5th International Workshop on Higher-Order Rewriting (HOR 2010). EPTCS 49:58-72, 2010.