TCS Journal 2021 Journal Article
influence: A partizan scoring game on graphs
- Eric Duchêne
- Stéphane Gonzalez
- Aline Parreau
- Eric Rémila
- Philippe Solal
Author name cluster
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
TCS Journal 2021 Journal Article
MFCS Conference 2011 Conference Paper
Abstract Sand pile models are dynamical systems describing the evolution from N stacked grains to a stable configuration. It uses local rules to depict grain moves and iterate it until reaching a fixed configuration from which no rule can be applied. The main interest of sand piles relies in their Self Organized Criticality (SOC), the property that a small perturbation | adding some sand grains | on a fixed configuration has uncontrolled consequences on the system, involving an arbitrary number of grain fall. Physicists L. Kadanoff et al inspire KSPM, a model presenting a sharp SOC behavior, extending the well known Sand Pile Model. In KSPM( D ), we start from a pile of N stacked grains and apply the rule: \(D\! -\! 1\) grains can fall from column i onto the \(D\! -\! 1\) adjacent columns to the right if the difference of height between columns i and \(i\! +\! 1\) is greater or equal to D. This paper develops a formal background for the study of KSPM fixed points. This background, resumed in a finite state word transducer, is used to provide a plain formula for fixed points of KSPM(3).
TCS Journal 2010 Journal Article
TCS Journal 2005 Journal Article
TCS Journal 2004 Journal Article
TCS Journal 2004 Journal Article
TCS Journal 2004 Journal Article
TCS Journal 2004 Journal Article
TCS Journal 2003 Journal Article
SODA Conference 2002 Conference Paper
SODA Conference 2000 Conference Paper
SODA Conference 1999 Conference Paper
FOCS Conference 1996 Conference Paper
We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packing, and can be performed by 5 stages of guillotine cuts.