( en | de | ru )

 

Disambiguation of "Medina, Raoul"

Author of the publication

copydeleteadd this publication to your clipboard
Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases.

, , , and . ICFCA, volume 3403 of Lecture Notes in Computer Science, page 235-248. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hélène Raoult

Olivier Raoult

Ramiro Medina

Eva Medina

Loreta Medina

 

Other publications of authors with the same name

A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules., and . ICFCA, volume 5548 of Lecture Notes in Computer Science, page 98-113. Springer, (2009)Incremental Garbage Collection for Causal Relationship Computation in Distributed Systems.. SPDP, page 650-655. IEEE Computer Society, (1993)Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases., , , and . ICFCA, volume 3403 of Lecture Notes in Computer Science, page 235-248. Springer, (2005)Efficient algorithms for clone items detection., , and . CLA, volume 162 of CEUR Workshop Proceedings, CEUR-WS.org, (2005)Efficient Reconstruction of the Causal Relationship in Distributed Systems., , , , and . Canada-France Conference on Parallel and Distributed Computing, volume 805 of Lecture Notes in Computer Science, page 101-113. Springer, (1994)Representing lattices using many-valued relations., , and . Inf. Sci., 179 (16): 2729-2739 (2009)About the Enumeration Algorithms of Closed Sets., , and . ICFCA, volume 5986 of Lecture Notes in Computer Science, page 1-16. Springer, (2010)Conditional Functional Dependencies: An FCA Point of View., and . ICFCA, volume 5986 of Lecture Notes in Computer Science, page 161-176. Springer, (2010)Interactive Association Rules Discovery., , and . ICFCA, volume 3874 of Lecture Notes in Computer Science, page 177-190. Springer, (2006)Efficient algorithms on distributive lattices., , , and . Discret. Appl. Math., 110 (2-3): 169-187 (2001)