|
Search the dblp DataBase
Jean-Claude Falmagne:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry
The Assessment of Knowledge, in Theory and in Practice. [Citation Graph (0, 0)][DBLP] ICFCA, 2006, pp:61-79 [Conf]
- David Eppstein, Jean-Claude Falmagne
Algorithms for Media [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- Jean-Claude Falmagne, Sergei Ovchinnikov
Media theory. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:103-118 [Journal]
- Jean-Paul Doignon, Jean-Claude Falmagne
Spaces for the Assessment of Knowledge. [Citation Graph (0, 0)][DBLP] International Journal of Man-Machine Studies, 1985, v:23, n:2, pp:175-196 [Journal]
- Maria Kambouri, Mathieu Koppen, Michael Villano, Jean-Claude Falmagne
Knowledge assessment: tapping human expertise by the QUERY routine. [Citation Graph (0, 0)][DBLP] Int. J. Hum.-Comput. Stud., 1994, v:40, n:1, pp:119-151 [Journal]
- Jean-Paul Doignon, Jean-Claude Falmagne
A Polynomial Time Algorithm for Unidimensional Unfolding Representations. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1994, v:16, n:2, pp:218-233 [Journal]
- Christopher Doble, Jean-Paul Doignon, Jean-Claude Falmagne, Peter C. Fishburn
Almost Connected Orders. [Citation Graph (0, 0)][DBLP] Order, 2001, v:18, n:4, pp:295-311 [Journal]
- David Eppstein, Jean-Claude Falmagne, Hasan Uzun
On Verifying and Engineering the Well-gradedness of a Union-closed Family [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal]
- Jean-Paul Doignon, Jean-Claude Falmagne
Well-graded families of relations. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:173, n:1-3, pp:35-44 [Journal]
Stochastic applications of media theory: Random walks on weak orders or partial orders. [Citation Graph (, )][DBLP]
Algorithms for media. [Citation Graph (, )][DBLP]
Parametrization of knowledge structures. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|