Eric Rémila


liste de publications 


Publications dans une revue internationale


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 (2002) 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.

Ch. Dürr, 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 (2004) vol. 322 p. 409-422.

O. Bodini, E. Rémila, Tilings with trichromatic colored-edges triangles, Theoretical Computer Science (2004) vol 319 p. 59-70.

S. Desreux, M. Matamala, I. Rapaport, E. Rémila, Domino tilings and related models: space of configurations of domains with holes, Theoretical Computer Science (2004) vol 319 p. 83-101.

C. Nichitiu, C. Papazian, E. Rémila, Leader election in plane cellular automata, only with left-right global convention, Theoretical Computer Science (2004) vol 319 p. 367-384.

M. Dorkenoo, M. Ch. Eglin-Leclerc, E. Rémila, Algebraic tools for the construction of colored flows with boundary constraints, RAIRO - Theoretical Information and Applications (2004) vol. 38. p. 229-243.

B. Nouvel, E. Rémila, Configurations induced by discrete rotations: periodicity and quasiperiodicity properties, Discrete Applied Mathematics (2005) vol.147, p. 325-343.

F. Chavanon, M. Latapy, M. Morvan, E. Rémila, L. Vuillon, Graph encoding of 2D-gon tilings,  Theoretical Computer Science (2005) vol 346,  p. 226-253

S. Desreux, E. Rémila, An optimal algorithm to generate tilings, Journal of Discrete Algorithms(2006)  vol. 4, p.  168-180.

E. Rémila, Tiling a polygon with two kinds of rectangles, Discrete and Computational Geometry (2005) vol. 34, p. 313 - 330.

F. Chavanon,  E. Rémila, Rhombus tilings: decomposition and space structure, Discrete and Computational Geometry  (2006) vol. 35, p.  329-358.   

M. Morvan, E. Rémila, E. Thierry, A note on the structure of spaces of domino tilings, Discrete Mathematics (2007) vol. 307, p.  769-773. 

O. Bodini, T. Fernique, E. Rémila,  A Characterization of flip-accessibility for Lozenge tilings of the whole plane, Information and Computation (2008) vol. 206 p. 1065-1073.

S. Béal, E. Rémila, P. Solal, Rooted-tree solutions for tree games, European Journal of Operation Research (2010) vol 203, p. 404-408. 

F. Becker, I. Rapaport, S. Rajsbaum, E. Rémila, Average binary long-lived Consensus: quantifying the stabilization role played by memory, Theoretical Computer Science (2010) vol 411, p. 1558-1566. 

R. Baron, S. Béal, E. Rémila, P. Solal, Average tree solutions and the Distribution of  Harsanyi Dividends, International Journal of Game Theory (2011). vol 40 (2) p. 331-349.


O. Bodini, T. Fernique, M. Rao, E. Rémila,  Distances on rhombus  tilings,  Theoretical Computer Science (2011) vol. 412 (36) p. 4787-4794.


S. Béal, E. Rémila, P. Solal, Compensations in the Shapley Value and the compensation solutions for graph games, International Journal of Game Theory  (2012) vol. 41 p. 157-178.


S. Béal, A. Lardon, E. Rémila, P. Solal, The Average Tree Solution for Multi-choice Forest Games. Annals of Operations Research, (2012) vol. 196 p. 27-51.


S. Béal, E. Rémila, P. Solal, On the number of blocks required to access the core, Discrete Applied Mathematics  (2012) vol 160 p.25-932.


S. Béal, E. Rémila, P. Solal, Fairness and Fairness for Neighbors : The Difference between the Myerson Value and Component-Wise Egalitarian Solutions, Economics Letters, (2012)  vol. 117; p. 263-267  

S. Béal, A. Ghintran, E. Rémila, P. Solal, The River Sharing Problem : a Survey, International Game Theory Review, (2013) 
vol 15, p. 1-19.

S. Béal, E. Rémila, P. Solal, An optimal bound to access the Core, Games an Economic Behavior, (2013)  vol. 80; p. 1-9  

K. Perrot, E. Rémila,  Kadanoff sand pile model. Avalanche structure and wave shape. Theoretical Computer Science (2013)  vol 504,     p. 52-72.

S. Béal, E. Rémila, P. Solal, Accessibility and Stability of the Coalition Structure Core, Mathematical Methods of Operation Research, (2013) vol 78(2) ;  p. 187-202.

S. Béal, A. Ghintran, E. Rémila, P. Solal, The Sequential Equal Surplus Division for Rooted Forest Games and an Application to Sharing a River with Bifurcations, Theory and Decision. (2015)
vol. 279, p. 251-283.

S. Béal, André Casajus, Frank Huettner, E. Rémila, P. Solal, Solidarity within a fixed community, Economics Letters (2014)
vol. 125, p.440-443..

S. Béal, E. Rémila, P. Solal, Preserving or removing special players: what keeps your payoff unchanged in TU-games ?  Mathematical Social Sciences (2015) vol. 73, p. 23-31.

S. Béal, E. Rémila, P. Solal, Decomposition of the space of TU-games, strong transfer invariance and the Banzhaf value,  Operations Research Letters (2015) vol. 43(2), p. 123-125.

S. Béal, E. Rémila, P. Solal, A decomposition of the space of TU-games using addition and transfer invariance,   Discrete Applied Mathematics (2015) vol. 184, p. 1-13.

Richard Baron, Mostapha Diss, Eric Rémila, Philippe Solal, A geometric examination of majorities based on difference in support, Social Choice and Welfare 
(2015) vol. 45(1)  p. 123-153.

S. Béal, E. Rémila, P. Solal, Axioms of Invariance for TU-games, International Journal of Game Theory,  (2015) vol. 44, p. 891-902.

S. Béal, E. Rémila, P. Solal, Characterization of the Average Tree solution and its kernel,  (2015)  Journal of Mathematical Economics, vol 60, P;159-165.

S. Béal, André Casajus, Frank Huettner, E. Rémila, P. Solal, Characterizations of weighted and equal division values, Theory and Decision. à paraitre.







Publications dans les actes d'une conférence internationale


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.

F. Chavanon, E. Rémila, Rhombus tilings: decomposition and space structure (extended abstract), proceedings of the Latin American conference on Combinattorics, Graphs and Applications (LACGA, Electronic Notes in Discrete Mathematics (2004) vol. 18, p. 81-87.

E. Rémila, Tiling a polygon with two kinds of rectangles (extended abstract), proceedings of the 12th European Symposium on Algorithms (ESA) LNCS 3221 Springer (2004) p. 578-579.

B. Nouvel, E. Rémila, Characterization of bijective discretized rotations, proceedings of the 10th International Workshop on Combinatorial Image Analysis (IWCIA) LNCS 3322 Springer (2004) p. 248-259.

E. Rémila, Structure of spaces of rhombus tilings in the lexicographic case, proceedings of the 3rd European Conference on Combinatorics, Graph Theory and Applications (EuroComb) DMTCS Proceedings AE (2005) p. 145-150.

B. Nouvel, E. Rémila, Incremental and transitive discretized rotations, proceedings of the 11th International Workshop on Combinatorial Image Analysis (IWCIA) LNCS 4040 Springer (2006) p. 199-213.

F. Becker, I. Rapaport, E. Rémila, Self-assembling classes of shapes, fast and with a minimal number of tiles, proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) LNCS 4337 Springer (2006) p. 45-56.

O. Bodini, T. Fernique, E. Rémila, Characterizations of flip-accessibility for Domino tilings of the whole plane,  proceedings of the 19th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC), electronical  publication (2007) 10 pages

O. Bodini, T. Fernique, E. Rémila,  A Characterization of flip-accessibility for Lozenge tilings of the whole plane, proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA), (2007) 10 pages


F. Becker, E. Rémila, N. Schabanel, Time Optimal Self-assembly of 2D and 3D shapes: the Case of Squares and Cubes, proceedings of the 14th International Conference on DNA Computing (DNA), LNCS 5347 Springer (2009) p. 144-155.


F. Becker, I. Rapaport, S. Rajsbaum, E. Rémila, Average binary long-lived Consensus: quantifying the stabilization role played by memory, proceedings of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 5058 Springer (2008) p. 48-60.

 


R. Baron, S. Béal, E. Rémila, P. Solal, Average tree solution for graph games,  proceedings of the 5th European Conférence on Complex Systems (ECCS), electronical  publication (2008) 22 pages


S. Béal, E. Rémila, P. Solal, Tree solutions for graph games,  23rd European Conference on Operational Research, Bonn, Germany, electronical publication (2009) 16 pages


S. Béal, E. Rémila, P. Solal, Weighted component fairness for forest games, 5th Spain, Italy, Netherlands Meeting on Game Theory (SING5), Amsterdam, electronical publication (2009) 18 pages 


O. Bodini, T. Fernique, E. Rémila,  Distances on lozenge tilings, proceedings of the 15th conference on Discrete Geometry for Computer Imagery (DGCI), LNCS 5810 Springer (2009) p. 240-251.


I. Rapaport, E. Rémila, Average long-lived Consensus: the Three-Value Case, proceedings of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 6058 Springer (2010) p. 114-126. 


S. Béal, E. Rémila, P. Solal, Compensations in the Shapley value and the compensation solutions for forest games,  proceedings of the 7th European Conférence on Complex Systems (ECCS), electronical  publication (2010) 12 pages


K. Perrot, E. Rémila, Avalanche Structure in the Kadanoff Sand Pile Model, proceedings of the 5th International Conference on Language and Automata Theory and Applications (LATA),  LNCS 6638 Springer (2011) p. 427-439.

E. Rémila, The  Optimal Strategy for the Average  Long-Lived  Consensus, proceedings of the 6th International Computer Science Symposium in Russia (CSR),  LNCS 6651 Springer (2011) p. 415-428.

 

K. Perrot, E. Rémila, Transduction on Kadanoff Sand Pile  Model Avalanches, and Application to Wave Emergence, proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS)  LNCS 6907 Springer (2011) p. 508-519.


   
S. Béal, E. Rémila, P. Solal, An optimal bound to access the core in TU-games. proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)  LNCS 7615 Springer (2012) p. 649-60.

K. Perrot, E. Rémila, Emergence of wave patterns on Kadanoff Sandpiles, proceedings of the 11th International Conference : Latin American Theoretical Informatics (LATIN), LNCS 8392 Springer (2014) p. 634-647.


K. Perrot, E. Formenti, E. Rémila, Computational complexity of the avalanche problem on one dimensional Kadanoff sandpiles, proceedings of the 20th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA) (2014) LNCS 8996 Springer
, p. 21-30.

Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila, Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. Proceedings of the  ACM Symposium on Principles of Distributed Computing (PODC) (2015) p. 167-169.

Kevin Perrot, Eric Rémila, Emergence on Decreasing Sandpile Models. 
proceedings of the 40 th International Symposium  on Mathematical Foundations of Computer Science (MFCS)  LNCS 9234 Springer (2015) p. 419-431.

Damien Regnault, Eric Rémila, Lost in Self-Stabilization.
proceedings of the 40 th International Symposium  on Mathematical Foundations of Computer Science (MFCS)  LNCS 9234 Springer (2015) p. 432-443.




Chapitres d'un livre


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 grâce à 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