From Logic to Logic Programming. - Michel de Rougemont (AIMSA, 1984)

Uniform Definability on Finite Structures with Successor - Michel de Rougemont (STOC, 1984)

Intégrité des Bases de Données logiques. - Michel de Rougemont (BDA, 1985)

On the Quantification of Knowledge. - Michel de Rougemont (AIMSA, 1986)

Théorie et pratique de la compilation intensionnelle de requêtes. - Michel de Rougemont (BDA, 1986)

Constructive Second-Order Proofs in Logical Databases. - Michel de Rougemont (IJCAI, 1987)

Second-order and Inductive Definability on Finite Structures. - Michel de Rougemont (Math. Log. Q., 1987)

Fixed-point semantics and the representation of algorithms on large data. - Michel de Rougemont (VLDB, 1988)

A theory of robust planning. - Michel de Rougemont; Juan Francisco Díaz-Frías (ICRA, 1992)

The Functional Dimension of Inductive Definitions. - Michel de Rougemont (Theor. Comput. Sci., 1992)

On the Interactive Complexity of Graph Reliability. - Jean Marc Couveignes; Juan Francisco Díaz-Frías; Michel de Rougemont; Miklos Santha (FSTTCS, 1994)

The Reliability of Queries. - Michel de Rougemont (PODS, 1995)

On the Complexity of Partially Observed Markov Decision Processes. - Dima Burago; Michel de Rougemont; Anatol Slissenko (Theor. Comput. Sci., 1996)

Spatial Navigation with Uncertain Deviations. - Michel de Rougemont; Christoph Schlieder (AAAI/IAAI, 1997)

The Expressiveness of Datalog Circuits (DAC). - Foto N. Afrati; Irène Guessarian; Michel de Rougemont (MFCS, 1997)

Interactive Protocols on the Reals. - Sergei Ivanov 001; Michel de Rougemont (STACS, 1998)

On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions. - Dima Burago; Michel de Rougemont (Fundam. Informaticae, 1998)

Interactive protocols over the reals. - Sergei Ivanov 001; Michel de Rougemont (Comput. Complex., 1999)

Probabilistic abstraction for model checking: An approach based on property testing - Sophie Laplante; Richard Lassaigne; Frédéric Magniez; Sylvain Peyronnet; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2001)

The expressiveness of DAC. - Foto N. Afrati; Irène Guessarian; Michel de Rougemont (Theor. Comput. Sci., 2002)

Automata on Lempel-ziv Compressed Strings. - Hans Leiß; Michel de Rougemont (CSL, 2003)

Definability and Compression. - Foto N. Afrati; Hans Leiß; Michel de Rougemont (Fundam. Informaticae, 2003)

Logic and complexity. - Richard Lassaigne; Michel de Rougemont (Springer, 2004)

Correctors for XML Data. - Utsav Boobna; Michel de Rougemont (XSym, 2004)

Property and Equivalence Testing on Strings - Eldar Fischer; Frédéric Magniez; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2004)

Logic, Randomness and Cognition. - Michel de Rougemont (Logic, Thought and Action, 2005)

Uniform generation in spatial constraint databases and applications. - David Gross-Amblard; Michel de Rougemont (J. Comput. Syst. Sci., 2006)

A Model of Uncertainty for Near-Duplicates in Document Reference Networks. - Claudia Hess; Michel de Rougemont (ECDL, 2007)

Approximate Data Exchange. - Michel de Rougemont; Adrien Vieilleribière (ICDT, 2007)

Property Testing of Regular Tree Languages. - Frédéric Magniez; Michel de Rougemont (Algorithmica, 2007)

Approximate Nash Equilibria for Multi-player Games. - Sébastien Hémon; Michel de Rougemont; Miklos Santha (SAGT, 2008)

Approximate Validity of XML Streaming Data. - Huang Cheng; Li Jun; Michel de Rougemont (WAIM, 2008)

Approximate schemas, source-consistency and query answering. - Michel de Rougemont; Adrien Vieilleribière (J. Intell. Inf. Syst., 2008)

Statistic Analysis for Probabilistic Processes. - Michel de Rougemont; Mathieu Tracol (LICS, 2009)

Approximate Structural Consistency. - Michel de Rougemont; Adrien Vieilleribière (SOFSEM, 2010)

Approximate Satisfiability and Equivalence. - Eldar Fischer; Frédéric Magniez; Michel de Rougemont (SIAM J. Comput., 2010)

The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. - Frédéric Magniez; Michel de Rougemont; Miklos Santha; Xavier Zeitoun (WINE, 2011)

Approximate answers to OLAP queries on streaming data warehouses. - Michel de Rougemont; Phuong Thao Cao (DOLAP, 2012)

Approximate Verification and Enumeration Problems. - Sylvain Peyronnet; Michel de Rougemont; Yann Strozecki (ICTAC, 2012)

Approximation of Large Probabilistic Networks by Structured Population Protocols. - Michel de Rougemont; Mathieu Tracol (CAI, 2013)

Some approximations in Model Checking and Testing - Marie-Claude Gaudel; Richard Lassaigne; Frédéric Magniez; Michel de Rougemont (CoRR, 2013)

StatsReduce in the cloud for approximate Analytics. - Michel de Rougemont (DSAA, 2014)

The value of analytical queries on Social Networks. - Michel de Rougemont; Guillaume Vimont (IEEE BigData, 2015)

Streaming Property Testing of Visibly Pushdown Languages. - Nathanaël François; Frédéric Magniez; Olivier Serre; Michel de Rougemont (Electron. Colloquium Comput. Complex., 2015)

Approximate consistency for transformations on words and trees. - Michel de Rougemont; Adrien Vieilleribière (Theor. Comput. Sci., 2016)

The content correlation of multiple streaming edges. - Michel de Rougemont; Guillaume Vimont (IEEE BigData, 2018)

Approximate Integration of Streaming Data. - Michel de Rougemont; Guillaume Vimont (ISIP, 2018)

Large very dense subgraphs in a stream of edges. - Claire Mathieu; Michel de Rougemont (Netw. Sci., 2021)

Testing frequency distributions in a stream. - Claire Mathieu; Michel de Rougemont (CoRR, 2023)

A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions. - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Claire Mathieu; Ahmed Metwally 001; Michel de Rougemont (CoRR, 2023)

Testing membership for timed automata. - Richard Lassaigne; Michel de Rougemont (Acta Informatica, 2023)

Errata for "SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model". - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Ahmed Metwally 001; Claire Mathieu; Michel de Rougemont (Proc. VLDB Endow., 2023)

The SpaceSaving± Family of Algorithms for Data Streams with Bounded Deletions. - Fuheng Zhao; Divyakant Agrawal; Amr El Abbadi; Claire Mathieu; Ahmed Metwally 001; Michel de Rougemont (ICDE, 2025)