Eric Rémila

Member of team MC²

Research topics : Tilings,
                                 Graph Automata,
                                 Discrete Geometry

How to contact

Publications

International Journal

E. Rémila, A linear algorithm to tile the trapezes with hm and vn, Theoretical Computer Science (1994) vol. 123, p 151-165.

E. Rémila, On the tiling of a torus with two bars, Theoretical Computer Science (1994) vol. 134, p 415-426.

E. Rémila, Recognition of graphs by automata, Theoretical Computer Science (1994) vol. 136, p 291-332.

D. Beauquier, M. Nivat, E. Rémila, J. M. Robson, Tiling figures of the plane with two bars, a horizontal and a vertical one, Computational Geometry (1995) vol. 5  p 1-25.

C. Kenyon, E. Rémila, Perfect matchings in the triangular lattice, Discrete Mathematics (1996) vol 152, p 191-210.

E. Rémila, Tiling a simply connected figure with bars of length 2 or 3, Discrete Mathematics (1996) vol 160, p. 189-198.

E. Rémila, Tiling with bars and satisfaction of boolean formulas, European Journal of Combinatorics (1996) vol 17, p 485-891.

E. Rémila, Tiling groups : new applications in the triangular lattice, Discrete and Computational Geometry (1998) vol 20, p 189-204 .

C. Kenyon, E. Rémila, A near-optimal solution to a two dimensional cutting stock problem, Mathematics of Operations Research (2000) vol 25, p 645-656 .

C. Nichitiu, J. Mazoyer, E. Rémila, Algorithms for leader election by cellular automata, Journal of Algorithms (2001) vol 41, p. 302-329

C. Nichitiu, E. Rémila, Effective simulations on hyperbolic networks, Fundamenta Informaticae (2001) vol 53, p. 203-231.

E. Rémila, On the structure of some spaces of tilings, SIAM Journal on Discrete Mathematics (2002) vol 16, p. 1-19.

C. Durr, E. Goles, I. Rapaport, E. Rémila, Tiling with bars under tomographic constraints, Theoretical Computer Science, (2003) vol. 290 p. 1317-1329. 

E. Rémila, On the lattice structure of the set of tilings of a simply connected figure with dominoes, Theoretical Computer Science (accepted for publication in June 2003). 

O. Bodini, E. Rémila, Tilings with trichromatic colored-edges triangles, Theoretical Computer Science (accepted for publication in September 2003).

S. Desreux, M. Matamala, I. Rapaport, E. Rémila, Domino tilings  and  related models: space of configurations of domains with holes, Theoretical Computer Science (accepted for publication in September 2003).

C. Nichitiu, C. Papazian, E. Rémila, Leader election in plane cellular automata, only with left-right global convention, Theoretical Computer Science (accepted for publication in September 2003).

International Conference Proceedings

E. Rémila, Tiling with bars and satisfaction of boolean formulas, proceedings of the 10th conference on Fundamentals of Computer Science (FCT), LNCS 965 Springer-Verlag, Heidelberg (1995) p. 404-413.

E. Rémila, Tiling  a figure using a height in a tree, proceedings of the 7th annual ACM-SIAM Symposium On Discrete Algorithms (SODA), SIAM eds, Philadelphia, (1996) p. 168-174.

C. Kenyon, E. Rémila, Approximate strip packing, proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, California (1996) p. 31-36.

M. Dorkenoo, M. Ch. Eglin-Leclerc, E. Rémila, Construction of non-intersecting colored flows through a planar cellular figure, proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 1373 Springer.(1998) p. 587-595.

C. Nichitiu, E. Rémila, Simulations of graph automata, proceedings of the MFCS'98 satellite workshop on graph automata, Th Worsch and R. Wolmar Eds, Universität Karlsruhe (1998) p. 69-78.

J. Mazoyer, C. Nichitiu, E. Rémila, Compass permits leader election, proceedings of the 10th annual ACM-SIAM Symposium On Discrete Algorithms (SODA), SIAM eds, Philadelphia, (1999) p. 947-948.

C. Nichitiu, E. Rémila, Leader election by d-dimensional cellular automata, proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP) (1999) , LNCS 1645 Springer  p. 565-574.

E. Rémila, An algebraic method to compute a shortest path of local flips between two tilings, proceedings of the 11th annual ACM-SIAM Symposium On Discrete Algorithms (SODA) SIAM eds, Philadelphia, (2000) p 646-653.

E. Rémila, On functions which are limits of domino tilings, proceedings of the colloquium Formal Power Series and Algebraic Combinatorics (FPSAC) Sptinger (2000) p. 320-331

C. Papazian, E. Rémila, Some properties of hyperbolic networks, proceedings of the 10th conference on Dicrete Geometry for Computer Imagery (DGCI) LNCS 1953 Springer  (2000) p. 149-158.

C. Papazian, E. Rémila, Linear time recognizer for subsets of Z2, proceedings of the 13th conference on Fundamentals of Computation Theory (FCT) LNCS 1770 Springer  (2001) p. 400-403.

C. Moore, I. Rapaport, E. Rémila, Tiling groups for Wang tiles, proceedings of the 13th annual ACM-SIAM Symposium On Discrete Algorithms (SODA) SIAM eds  (2002) p. 330-342.

C. Papazian, E. Rémila,  Fast algorithm for graph automata recognition, proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP) (2002) , LNCS 2380 Springer  p. 330-342. 

B. Nouvel, E. Rémila, On colorations induced by discrete rotations, proceedings of the 13th Colloquium Discrete Geometry for Computer Imagery (DGCI), LNCS 2380 Springer (2003) p. 174-183.

Book Chapters

E. Rémila, An introduction to automata on graphs, chapitre du livre "Cellular automata, a parallel model" Mathematics and its applications, Kluwer, M. Delorme and J. Mazoyer editors (1999) p 345-352.

E. Rémila, Sur la structure de l'ensemble des pavages d'une figure par des dominos, Chapitre du livre "Science et technologie, regards croisés" (actes du colloque national "recherche en IUT"), L'Harmattan (1999) vol. 1, p 47-54.

C. Nichitiu, E. Rémila, Election d'un chef grace à une boussole, Chapitre du livre "Recherche et innovation" (actes du colloque national "recherche en IUT"), L'Harmattan (2000) vol. 2, p 329-337.

Comptes Rendus à l'Académie des Sciences

E. Rémila, Un algorithme en temps linéaire pour paver les pièces horizontalement convexes par h2 et v2, t. 314, Série I, (1992) p. 161-164.

E. Rémila, Un algorithme de pavage des trapèzes par hm et vn, t. 314, Série I (1992) p. 233-236.

E. Rémila, Sur le pavage du tore Ta x b par hm et vn, t. 316, Série I (1993) p. 949-952.