default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel de Rougemont
Person information
- affiliation: University of Paris-Sud, Laboratory for Computer Science (LRI), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Richard Lassaigne, Michel de Rougemont
:
Testing membership for timed automata. Acta Informatica 60(4): 361-384 (2023)- [j15]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Ahmed Metwally, Claire Mathieu, Michel de Rougemont:
Errata for "SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model". Proc. VLDB Endow. 17(4): 643 (2023) - [i12]Claire Mathieu, Michel de Rougemont:
Testing frequency distributions in a stream. CoRR abs/2309.11175 (2023) - [i11]Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi, Claire Mathieu, Ahmed Metwally, Michel de Rougemont:
A Detailed Analysis of the SpaceSaving± Family of Algorithms with Bounded Deletions. CoRR abs/2309.12623 (2023) - 2021
- [j14]Claire Mathieu, Michel de Rougemont:
Large very dense subgraphs in a stream of edges. Netw. Sci. 9(4): 403-424 (2021) - 2020
- [c37]Claire Mathieu, Michel de Rougemont:
Large Very Dense Subgraphs in a Stream of Edges. FODS 2020: 107-117 - [i10]Claire Mathieu, Michel de Rougemont:
Large Very Dense Subgraphs in a Stream of Edges. CoRR abs/2010.07794 (2020)
2010 – 2019
- 2019
- [i9]Richard Lassaigne, Michel de Rougemont:
Testing Membership for Timed Automata. CoRR abs/1912.08277 (2019) - 2018
- [c36]Michel de Rougemont, Guillaume Vimont:
The content correlation of multiple streaming edges. IEEE BigData 2018: 1101-1106 - [c35]Michel de Rougemont, Guillaume Vimont:
Approximate Integration of Streaming Data. ISIP 2018: 3-22 - [i8]Michel de Rougemont, Guillaume Vimont:
The content correlation of multiple streaming edges. CoRR abs/1812.09867 (2018) - 2017
- [c34]Michel de Rougemont, Guillaume Vimont:
Approximate Integration of streaming data. EDA 2017: 37-52 - [i7]Michel de Rougemont, Guillaume Vimont:
Approximate Integration of streaming data. CoRR abs/1709.04290 (2017) - 2016
- [j13]Michel de Rougemont, Adrien Vieilleribière:
Approximate consistency for transformations on words and trees. Theor. Comput. Sci. 626: 13-39 (2016) - [c33]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. ESA 2016: 43:1-43:17 - 2015
- [c32]Michel de Rougemont, Guillaume Vimont:
The value of analytical queries on Social Networks. IEEE BigData 2015: 2374-2383 - [i6]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. CoRR abs/1505.03334 (2015) - [i5]Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont:
Streaming Property Testing of Visibly Pushdown Languages. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c31]Michel de Rougemont:
StatsReduce in the cloud for approximate Analytics. DSAA 2014: 593-599 - 2013
- [c30]Michel de Rougemont, Mathieu Tracol:
Approximation of Large Probabilistic Networks by Structured Population Protocols. CAI 2013: 199-210 - [i4]Marie-Claude Gaudel, Richard Lassaigne, Frédéric Magniez, Michel de Rougemont:
Some approximations in Model Checking and Testing. CoRR abs/1304.5199 (2013) - 2012
- [c29]Michel de Rougemont, Phuong Thao Cao:
Approximate answers to OLAP queries on streaming data warehouses. DOLAP 2012: 121-128 - [c28]Sylvain Peyronnet, Michel de Rougemont, Yann Strozecki:
Approximate Verification and Enumeration Problems. ICTAC 2012: 228-242 - 2011
- [c27]Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun:
The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. WINE 2011: 266-277 - [i3]Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun:
The complexity of approximate Nash equilibrium in congestion games with negative delays. CoRR abs/1102.1161 (2011) - 2010
- [j12]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. SIAM J. Comput. 39(6): 2251-2281 (2010) - [c26]Michel de Rougemont, Adrien Vieilleribière:
Approximate Structural Consistency. SOFSEM 2010: 685-696
2000 – 2009
- 2009
- [c25]Michel de Rougemont, Mathieu Tracol:
Statistic Analysis for Probabilistic Processes. LICS 2009: 299-308 - 2008
- [j11]Michel de Rougemont, Adrien Vieilleribière:
Approximate schemas, source-consistency and query answering. J. Intell. Inf. Syst. 31(2): 127-146 (2008) - [c24]Sébastien Hémon, Michel de Rougemont, Miklos Santha:
Approximate Nash Equilibria for Multi-player Games. SAGT 2008: 267-278 - [c23]Huang Cheng, Li Jun, Michel de Rougemont:
Approximate Validity of XML Streaming Data. WAIM 2008: 149-156 - 2007
- [j10]Frédéric Magniez, Michel de Rougemont:
Property Testing of Regular Tree Languages. Algorithmica 49(2): 127-146 (2007) - [j9]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. ACM Trans. Comput. Log. 8(4): 20 (2007) - [c22]Claudia Hess, Michel de Rougemont:
A Model of Uncertainty for Near-Duplicates in Document Reference Networks. ECDL 2007: 449-453 - [c21]Michel de Rougemont, Adrien Vieilleribière:
Approximate Data Exchange. ICDT 2007: 44-58 - 2006
- [j8]David Gross-Amblard, Michel de Rougemont:
Uniform generation in spatial constraint databases and applications. J. Comput. Syst. Sci. 72(4): 576-591 (2006) - [c20]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. LICS 2006: 421-430 - 2005
- [p1]Michel de Rougemont:
Logic, Randomness and Cognition. Logic, Thought and Action 2005: 497-506 - 2004
- [b1]Richard Lassaigne, Michel de Rougemont:
Logic and complexity. Discrete mathematics and theoretical computer science, Springer 2004, ISBN 978-1-85233-565-6, pp. I-X, 1-359 - [c19]Frédéric Magniez, Michel de Rougemont:
Property Testing of Regular Tree Languages. ICALP 2004: 932-944 - [c18]Utsav Boobna, Michel de Rougemont:
Correctors for XML Data. XSym 2004: 97-111 - [i2]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Property and Equivalence Testing on Strings. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j7]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. Fundam. Informaticae 56(1-2): 155-180 (2003) - [c17]Hans Leiß, Michel de Rougemont:
Automata on Lempel-ziv Compressed Strings. CSL 2003: 384-396 - 2002
- [j6]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The expressiveness of DAC. Theor. Comput. Sci. 286(1): 3-32 (2002) - [c16]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. LICS 2002: 30-39 - 2001
- [i1]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c15]Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression. LICS 2000: 63-73 - [c14]David Gross, Michel de Rougemont:
Uniform Generation in Spatial Constraint Databases and Applications. PODS 2000: 254-259
1990 – 1999
- 1999
- [j5]Sergei Ivanov, Michel de Rougemont:
Interactive protocols over the reals. Comput. Complex. 8(4): 330-345 (1999) - 1998
- [j4]Dima Burago, Michel de Rougemont:
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions. Fundam. Informaticae 36(4): 307-315 (1998) - [c13]Sergei Ivanov, Michel de Rougemont:
Interactive Protocols on the Reals. STACS 1998: 499-510 - 1997
- [c12]Michel de Rougemont, Christoph Schlieder:
Spatial Navigation with Uncertain Deviations. AAAI/IAAI 1997: 649-654 - [c11]Foto N. Afrati, Irène Guessarian, Michel de Rougemont:
The Expressiveness of Datalog Circuits (DAC). MFCS 1997: 119-128 - 1996
- [j3]Dima Burago, Michel de Rougemont, Anatol Slissenko:
On the Complexity of Partially Observed Markov Decision Processes. Theor. Comput. Sci. 157(2): 161-183 (1996) - 1995
- [c10]Michel de Rougemont:
The Reliability of Queries. PODS 1995: 286-291 - 1994
- [c9]Jean Marc Couveignes, Juan Francisco Díaz-Frías, Michel de Rougemont, Miklos Santha:
On the Interactive Complexity of Graph Reliability. FSTTCS 1994: 12-23 - 1992
- [j2]Michel de Rougemont:
The Functional Dimension of Inductive Definitions. Theor. Comput. Sci. 101(1): 143-158 (1992) - [c8]Michel de Rougemont, Juan Francisco Díaz-Frías:
A theory of robust planning. ICRA 1992: 2453-2458
1980 – 1989
- 1988
- [c7]Michel de Rougemont:
Fixed-point semantics and the representation of algorithms on large data. VLDB 1988: 264-272 - 1987
- [j1]Michel de Rougemont:
Second-order and Inductive Definability on Finite Structures. Math. Log. Q. 33(1): 47-63 (1987) - [c6]Michel de Rougemont:
Constructive Second-Order Proofs in Logical Databases. IJCAI 1987: 993-996 - 1986
- [c5]Michel de Rougemont:
On the Quantification of Knowledge. AIMSA 1986: 245-253 - [c4]Michel de Rougemont:
Théorie et pratique de la compilation intensionnelle de requêtes. BDA 1986: 109-132 - 1985
- [c3]Michel de Rougemont:
Intégrité des Bases de Données logiques. BDA 1985 - 1984
- [c2]Michel de Rougemont:
From Logic to Logic Programming. AIMSA 1984: 85-92 - [c1]Michel de Rougemont:
Uniform Definability on Finite Structures with Successor. STOC 1984: 409-417
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
