TRECOLOCOCO-References.docVIP

TRECOLOCOCO - References [ABCR94] M. R. Assous, V. Bouchitté, C. Charretton, B. Rozoy, Finite labelling problem in event structures, Theor. Comput. Sci. 123 (1) (1994) 9—19. [AM06] Marcelo Aguiar and Swapneel Mahajan. Coxeter groups and Hopf algebras, volume 23 of Fields Institute Monographs. American Mathematical Society, Providence, RI, 2006. [ANR11] K. Adaricheva, J.B. Nation, R. Rand, Ordered direct implicational basis of a finite closure system, submitted, arXiv:1110.5805v1, 2011. [Arn91] A. Arnold. An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355-393 [BB05] Anders Bj?rner and Francesco Brenti. Combinatorics of Coxeter groups, volume 231 of Graduate Texts in Mathematics. Springer, New York, 2005. [BB07] F. Brucker and J.-P. Barthélemy. Eléments de classification. Hermes, Londres, 2007. [BB08] J.-P. Barthélemy and F. Brucker. Binary clustering. Discrete Applied Mathematics, 156 :1237-- 1250, 2008. [BCC07] Claude Barbut, Nathalie Caspard, and Henry Crapo. Les arrangements de lignes des groupes de coxeter. Exposé à loccasion de la recontre Treillis Marsaillais, CIRM, Marseille, April 2007. [BDK97] Felipe Bracho, Manfred Droste, and Dietrich Kuske. Representation of computations in concurrent automata by dependence orders. Theor. Comput. Sci., 174(1-2) :67--96, 1997. [BDR99] E. Badouel, P. Darondeau, J.-C. Raoult, Context-free event domains are recognizable, Inf. Comput. 149 (2) (1999) 134–172. [BG09] F. Brucker, A. Gély, 2009, Parsimonious cluster Systems, Advances in Data Analysis and Classification, 3, 189-204. [BG10] F. Brucker, A. Gély, 2010,Crown free Lattices and their Related Graphs, Order, accepted. [BG11] Nick Bezhanishvili and Mai Gehrke, Finitely generated free Heyting algebras via Birkhoff duality and coalgebra. Logical Methods in Computer Science 7 (2:9) (2011), 1-24. [BGMM06] Guram Bezhanishvili, Mai Gehrke, Ray Mines, and Patrick Morandi. Profinite completions and canonical ex