Eric Rémila

According to our database1, Eric Rémila authored at least 87 papers between 1994 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 




On the emergence of regularities on one-dimensional decreasing sandpiles.
Theor. Comput. Sci., 2020

Cooperative games on intersection closed systems and the Shapley value.
Math. Soc. Sci., 2020

Local Certification of Graphs with Bounded Genus.
CoRR, 2020

INFLUENCE: a partizan scoring game on graphs.
CoRR, 2020

Compact Distributed Certification of Planar Graphs.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Harsanyi power solutions for cooperative games on voting structures.
Int. J. Gen. Syst., 2019

Lost in self-stabilization: A local process that aligns connected cells.
Theor. Comput. Sci., 2018

Axiomatization of an allocation rule for ordered tree TU-games.
Math. Soc. Sci., 2018

Computational Complexity of the Avalanche Problem for One Dimensional Decreasing Sandpiles.
J. Cell. Autom., 2018

The proportional Shapley value and applications.
Games Econ. Behav., 2018

Discounted tree solutions.
Discret. Appl. Math., 2017

Strong Emergence of Wave Patterns on Kadanoff Sandpiles.
Electron. J. Comb., 2017

A strategic implementation of the sequential equal surplus division rule for digraph cooperative games.
Ann. Oper. Res., 2017

Axiomatic characterizations under players nullification.
Math. Soc. Sci., 2016

Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form.
IGTR, 2016

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Piles de sable décroissantes 1D. Classification expérimentale d'émergences.
Tech. Sci. Informatiques, 2015

A geometric examination of majorities based on difference in support.
Soc. Choice Welf., 2015

Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value.
Oper. Res. Lett., 2015

Preserving or removing special players: What keeps your payoff unchanged in TU-games?
Math. Soc. Sci., 2015

Axioms of invariance for TU-games.
Int. J. Game Theory, 2015

A decomposition of the space of TU-games using addition and transfer invariance.
Discret. Appl. Math., 2015

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Lost in Self-Stabilization.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Emergence on Decreasing Sandpile Models.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Emergence of Wave Patterns on Kadanoff Sandpiles.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

Kadanoff sand pile model. Avalanche structure and wave shape.
Theor. Comput. Sci., 2013

Accessibility and stability of the coalition structure core.
Math. Methods Oper. Res., 2013

The River Sharing Problem: a Survey.
IGTR, 2013

An optimal bound to access the core in TU-games.
Games Econ. Behav., 2013

Kadanoff Sand Piles, following the snowball
CoRR, 2013

Weighted component fairness for forest games.
Math. Soc. Sci., 2012

Compensations in the Shapley value and the compensation solutions for graph games.
Int. J. Game Theory, 2012

On the number of blocks required to access the core.
Discret. Appl. Math., 2012

The average tree solution for multi-choice forest games.
Ann. Oper. Res., 2012

Distances on rhombus tilings.
Theor. Comput. Sci., 2011

Average tree solutions and the distribution of Harsanyi dividends.
Int. J. Game Theory, 2011

Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Avalanche Structure in the Kadanoff Sand Pile Model.
Proceedings of the Language and Automata Theory and Applications, 2011

The Optimal Strategy for the Average Long-Lived Consensus.
Proceedings of the Computer Science - Theory and Applications, 2011

Average long-lived binary consensus: Quantifying the stabilizing role played by memory.
Theor. Comput. Sci., 2010

Rooted-tree solutions for tree games.
Eur. J. Oper. Res., 2010

Average Long-Lived Memoryless Consensus: The Three-Value Case.
Proceedings of the Structural Information and Communication Complexity, 2010

Distances on Lozenge Tilings.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

A characterization of flip-accessibility for rhombus tilings of the whole plane.
Inf. Comput., 2008

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.
Proceedings of the Structural Information and Communication Complexity, 2008

Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.
Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

A note on the structure of spaces of domino tilings.
Discret. Math., 2007

An optimal algorithm to generate tilings.
J. Discrete Algorithms, 2006

Rhombus Tilings: Decomposition and Space Structure.
Discret. Comput. Geom., 2006

Incremental and Transitive Discrete Rotations.
Proceedings of the Combinatorial Image Analysis, 11th International Workshop, 2006

Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Graph encoding of 2<i>D</i>-gon tilings.
Theor. Comput. Sci., 2005

Tiling a Polygon with Two Kinds of Rectangles.
Discret. Comput. Geom., 2005

Configurations induced by discrete rotations: periodicity and quasi-periodicity properties.
Discret. Appl. Math., 2005

The lattice structure of the set of domino tilings of a polygon.
Theor. Comput. Sci., 2004

Leader election in plane cellular automata, only with left-right global convention.
Theor. Comput. Sci., 2004

Domino tilings and related models: space of configurations of domains with holes.
Theor. Comput. Sci., 2004

Tilings with trichromatic colored-edges triangles.
Theor. Comput. Sci., 2004

Algebraic tools for the construction of colored flows with boundary constraints.
RAIRO Theor. Informatics Appl., 2004

Rhombus tilings: decomposition and space structure: (extended abstract).
Electron. Notes Discret. Math., 2004

Characterization of Bijective Discretized Rotations.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

Tiling with bars under tomographic constraints.
Theor. Comput. Sci., 2003

On Colorations Induced by Discrete Rotations.
Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

On the Structure of Some Spaces of Tilings.
SIAM J. Discret. Math., 2002

Effective Simulations on Hyperbolic Networks.
Fundam. Informaticae, 2002

Tiling groups for Wang tiles.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Hyperbolic Recognition by Graph Automata.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Algorithms for Leader Election by Cellular Automata.
J. Algorithms, 2001

Linear Time Recognizer for Subsets of Z<sup>2</sup>.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem.
Math. Oper. Res., 2000

An algebraic method to compute a shortest path of local flips between two tilings.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Some Properties of Hyperbolic Networks.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Compass Permits Leader Election.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Leader Election by d Dimensional Cellular Automata.
Proceedings of the Automata, 1999

Tiling Groups: New Applications in the Triangular Lattice.
Discret. Comput. Geom., 1998

Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure.
Proceedings of the STACS 98, 1998

Tiling with Bars and Satisfaction of Boolean Formulas.
Eur. J. Comb., 1996

Tiling a simply connected figure with bars of length 2 or 3.
Discret. Math., 1996

Perfect matchings in the triangular lattice.
Discret. Math., 1996

Tiling a Figure Using a Height in a Tree.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Approximate Strip Packing.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Tiling Figures of the Plane with Two Bars.
Comput. Geom., 1995

Recognition of Graphs by Automata.
Theor. Comput. Sci., 1994

On the Tiling of a Torus with Two Bars.
Theor. Comput. Sci., 1994

A Linear Algorithm to Tile the Trapezes with h_m and v_n.
Theor. Comput. Sci., 1994