JBY's webspace

@inproceedings{Ballier2021,

title = {The SPECTRANS System Description for the WMT21 Terminology Task},

author = {N. Ballier and D. Cho and B. Faye and Z-Y. Ke and H. Martikainen and M. Pecman M. and G. Wisniewski and J-B. Yunès and L. Zhu and M. Zimina-Poirot},

url = {http://www.statmt.org/wmt21/pdf/2021.wmt-1.80.pdf},

year  = {2021},

date = {2021-11-11},

urldate = {2021-11-11},

booktitle = {Proceedings of the Sixth Conference on Machine Translation (WMT)},

pages = {818-825},

organization = {Association for Computational Linguistics},

abstract = {This paper discusses the WMT 2021 terminology shared task from a "meta" perspective. We present the results of our experiments using the terminology dataset and the OpenNMT (Klein et al., 2017) and JoeyNMT (Kreutzer et al., 2019) toolkits for the language direction English to French. Our experiment 1 compares the predictions of the two toolkits. Experiment 2 uses OpenNMT to fine-tune the model. We report our results for the task with the evaluation script but mostly discuss the linguistic properties of the terminology dataset provided for the task. We provide evidence of the importance of text genres across scores, having replicated the evaluation scripts.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{jadt2020,

title = {Approche textométrique des phases d'entraînement en traduction automatique neuronale (TAN) : étude de cas avec Europarl et OpenNMT},

author = {Maria Zimina and Nicolas Ballier and Jean-Baptiste Yunès},

url = {https://jadt2020.sciencesconf.org/},

year  = {2020},

date = {2020-06-16},

booktitle = {JADT 2020 15èmes Journées Internationales d'Analyse statistique des Données Textuelles, Toulouse, France, Jun. 16-19.},

school = {JADT 2020 15èmes Journées Internationales d'Analyse statistique des Données Textuelles, Toulouse, France, Jun. 16-19.},

howpublished = {Accepted},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Yunès2020,

title = {RELIA, un projet interdisciplinaire d'initiation à la recherche par le TAL},

author = {Nicolas Ballier

Jean-Baptiste Yunès},

url = {https://jep-taln2020.loria.fr

http://yunes.informatique.univ-paris-diderot.fr/accueil/enseignement/ireel-relia

https://videos.univ-lorraine.fr/index.php?act=view&id=9739

},

year  = {2020},

date = {2020-06-08},

organization = {JEP - TALN - RECITAL},

howpublished = {online due to COVID pandemic},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{reprolang2020,

title = {The learnability of the annotated input in NMT (Replicating Vanmassenhove et al. 2018 with OpenNMT)},

author = {Nicolas Ballier and Nabil Amari and Laure Mérat and Jean-Baptiste Yunès},

editor = {European Language Resources Association},

url = {https://www.clarin.eu/event/2020/reprolang-2020},

year  = {2020},

date = {2020-05-01},

booktitle = {Proceedings of the 12th Language Resources and Evaluation Conference},

pages = {5631–5640},

school = {REPROLANG 2020 — LREC 2020, Marseille, France, May 13-15},

abstract = {In this paper, we reproduce some of the experiments related to neural network training for Machine Translation as reported in (Vanmassenhove and Way, 2018). They annotated a sample from the EN-FR and EN-DE Europarl aligned corpora with syntactic and semantic annotations to train neural networks with the Nematus Neural Machine Translation (NMT) toolkit. Following the original publication, we obtained lower BLEU scores than the authors of the original paper, but on a more limited set of annotations. In the second half of the paper, we try to analyze the difference in the results obtained and suggest some methods to improve the results. We discuss the Byte Pair Encoding (BPE) used in the pre-processing phase and suggest feature ablation in relation to the granularity of syntactic and semantic annotations. The learnability of the annotated input is discussed in relation to existing resources for the target languages. We also discuss the feature representation likely to have been adopted for combining features.},

howpublished = {Accepted},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2018generalized,

title = {Generalized FSSP on Two Triangular Tilings},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

url = {https://ieeexplore.ieee.org/document/8590867

https://is-candar.org/candar18/},

doi = {10.1109/CANDARW.2018.00013},

year  = {2018},

date = {2018-11-27},

booktitle = {2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW), Hida Takayama, Japan, November 27-30, 2018},

pages = {27--31},

organization = {IEEE},

abstract = {Maignan and Yunes have already investigated solutions to the generalized firing squad synchronization problem for square tilings with both Moore and Von Neumann neighborhoods, and then shown that the same concepts could be used to handle hexagonal tilings. The communication grids for these cellular space are all very regular in a precise formal sense: they are Cayley graphs. In this paper we investigate the triangular tiling because it is very related to the hexagonal one but is not a Cayley graph. We also consider another tiling of triangles obtained by dividing every square of a square tiling into four triangles. We show that the same concepts still apply, therefore showing that the previous solutions can be extended to a broader class of spaces included in what we may call Cayley Graphs on Groupoïd.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2016synchronizing,

title = {Synchronizing the squad with (almost) arbitrary cut ratio},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

url = {http://is-candar.org/afca16

},

doi = {10.1109/CANDAR.2016.0048},

year  = {2016},

date = {2016-11-22},

booktitle = {2016 Fourth International Symposium on Computing and Networking (CANDAR), Hiroshima, Japan, November 22-25, 2016},

pages = {229--235},

organization = {IEEE},

abstract = {In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2016field,

title = {A field based solution of Mazoyer’s FSSP schema},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

editor = {Samira El Yacoubi and Jaroslaw Wąs and Stefania Bandini},

doi = {10.1007/978-3-319-44365-2_13},

isbn = {978-3-319-44365-2},

year  = {2016},

date = {2016-09-05},

booktitle = {International Conference on Cellular Automata,  ACRI 2016. Fez, Morocco, September 5-8, 2016},

pages = {134--143},

organization = {Springer, Cham},

abstract = {Continuing our line of work on field based cellular automata programming we, here, focus our attention on an implementation of Mazoyer’s schema for cellular synchronization problem. Due to its very special nature among the numerous solutions to the problem, we emphasize the power of cellular fields to construct cellular programs: clear semantic construction, modularity, automatic synthesis of finite state machines.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{ictcs2014,

title = {An Efficient Algorithm for Generating Symmetric Ice Piles},

author = {Roberto Mantaci and Paolo Massazza and Jean-Baptiste Yunès},

editor = {Stefano Bistarelli and Andrea Formisano},

url = {http://www.dmi.unipg.it/ictcs2014/},

issn = {1613-0073},

year  = {2014},

date = {2014-09-17},

booktitle = {15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014},

pages = {15--170},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2014generalized,

title = {Generalized FSSP on hexagonal tiling: Towards arbitrary regular spaces},

author = {Luidnel Maignan and Jean-Baptiste Yunè}s},

editor = {Teijiro Isokawa and Katsunobu Imai and Nobuyuki Matsui and Ferdinand Peper and Hiroshi Umeo},

doi = {10.1007/978-3-319-18812-6_7},

isbn = {978-3-319-18812-6},

year  = {2014},

date = {2014-07-07},

booktitle = {Cellular Automata and Discrete Complex Systems. AUTOMATA 2014. Himeji, Japan, July 7th-9th, 2014. LNCS 8996. },

pages = {83--96},

organization = {Springer, Cham},

abstract = {Here we present a solution to the generalized firing squad synchronization problem that works on some class of shapes in the hexagonal tiling of the plane. The solution is obtained from a previous solution which works on grids with either a von Neumann or a Moore neighborhood. Analyzing the construction of this previous solution, we were able to exhibit a parameter that leads us to abstract the solution. First, and for an arbitrary considered neighborhood, we focus our attention on a class of shapes built from this neighborhood, and determine the corresponding parameter value for them. Second, we apply our previous solution with the determined parameter value for the hexagonal neighborhood and show that, indeed, all the considered shapes on the hexagonal tiling synchronizes.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2014experimental,

title = {Experimental finitization of infinite field-based generalized FSSP solution},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

editor = {Jarosalw Wąs and Giorgos Sirakoulis and Stefania Bandini},

doi = {10.1007/978-3-319-11520-7_15},

isbn = {978-3-319-11520-7},

year  = {2014},

date = {2014-01-01},

booktitle = {International Conference on Cellular Automata, ACRI 2014: Cellular Automata, LNCS.},

volume = {8751},

pages = {136--145},

organization = {Springer, Cham},

abstract = {In a previous work (see [3]) we presented a general scheme to solve the 1D Generalized Firing Squad Synchronization Problem. We designed it in a modular way using the concept of fields (open CA). The solution was not designed as a finite cellular automaton because we needed unbounded integers as states for distance fields, and the recursive nature of the algorithm leaded to a unbounded number of fields. In this paper, we show as claimed, that this approach does lead to a finite cellular automaton. We exhibit a transformation function from infinite to finite states and write a program that generates the associated finite transition table while checking its validity and the conservation of the input-output behavior of the original cellular automaton.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2013moore,

title = {Moore and von Neumann neighborhood n-dimensional generalized firing squad solutions using fields},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

doi = {10.1109/CANDAR.2013.98},

year  = {2013},

date = {2013-12-04},

booktitle = {2013 First International Symposium on Computing and Networking, Matsuyama, Japan, 2013},

pages = {552--558},

organization = {IEEE},

abstract = {We present a solution to the Firing Squad Synchronization Problem that works both in Von Neumann and Moore neighborhood and whatever is the dimension of the space. That solution is based on fields that provide a clean modular decomposition of such cellular automata problem.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{ameisen2013stack,

title = {Stack or trash? Quality assessment of virtual slides},

author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Jean-Baptiste Yunès and Fatiha Bouhidel and Maxime Battistella and Luc Legrès and Anne Janin and Philippe Bertheau},

doi = {10.1186/1746-1596-8-S1-S23},

year  = {2013},

date = {2013-09-30},

booktitle = {Diagnostic Pathology: Proceedings of the 11th European Congress on Telepathology and 5th International Congress on Virtual Microscopy},

volume = {8},

number = {1},

pages = {S23},

organization = {BioMed Central},

abstract = {Since microscopic slides can now be automatically digitized and integrated in the clinical workflow, quality assessment of these Whole Slide Images (WSI) has become a crucial issue. At this time, the quality of a WSI is verified a posteriori by a technician or by a pathologist. There is however a significant amount of WSI that are too insufficient in quality (blurred, bad colors, poor contrast.) to be used for diagnoses. These slides have then to be scanned again with delay thus slowing down the diagnostic workflow.



To address this problem, we chose to design a method of quality assessment followed by reacquisition, as opposed to a process of enhancement or restoration [1, 2]. Such process indeed too frequently results in the degradation of image quality, a key factor in medical diagnosis.



The quality of a flat image can be defined by several quantifiable parameters such as color, brightness, and contrast. One of the most important parameters, yet difficult to assess, is the focus sharpness (i.e. the level of focus blur) [3]).



Quality assessment of WSI is much more complex than that of flat images because of their intrinsic structure made of multiple magnification levels (pyramidal structure) and resolutions above the gigapixel. One study [4] has shown the possibility of comparing the tiles’ contrast and entropy in two WSI obtained with two different scanners digitizing the same slide. Another work [5] assessed the focus sharpness of the tiles of a WSI with the generation of a focus assessment map of the WSI at a given magnification level. However, both these methods still require a human eye to assess if the WSI must be accepted or discarded after the scan.



We describe here a fast method to automatically assess quality and to accept or discard WSI at the time of acquisition.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{ameisen2012prendre,

title = {À prendre ou à laisser? Une évaluation automatique de la qualité des lames virtuelles en temps quasi-réel},

author = {David Ameisen and Christophe Deroulers and Valérie Perrier and Jean-Baptiste Yunès and F Bouhidel and M Battistella and L Legrès and Anne Janin and Philippe Bertheau},

year  = {2012},

date = {2012-11-01},

booktitle = {Annales de Pathologie},

volume = {32},

number = {5},

pages = {S151--S152},

organization = {Elsevier Masson},

abstract = {Discussion.–Notre prototype pourra notamment être amélioré en augmentant la vitesse d’analyse grâce à une architecture en grappe de serveurs (cluster). Un algorithme d’apprentissage permettrait par ailleurs d’affiner les seuils en fonction des colorations et du type de système d’acquisition.

Conclusion.–Notre méthode peut être utilisée en amont comme un outil de calibration ou d’assurance qualité pour les systèmes d’acquisition de LV ou comme outil en temps réel pour numériser à nouveau les tuiles lors de la numérisation. Elle peut également être utilisée en aval pour détecter les lames de qualité insuffisante et permettre leur renumérisation avant analyse par le pathologiste. Ces scores pourraient être intégrés, en tant qu’indicateurs de qualité, aux métadonnées des LV partagées dans les contextes de recherche, d’enseignement ou clinique.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{maignan2012spatio,

title = {A spatio-temporal algorithmic point of view on firing squad synchronisation problem},

author = {Luidnel Maignan and Jean-Baptiste Yunès},

editor = {Georgios Sirakoulis and Stefania Bandini},

doi = {10.1007/978-3-642-33350-7_11},

isbn = {978-3-642-33350-7},

year  = {2012},

date = {2012-01-01},

booktitle = {International Conference on Cellular Automata,  Cellular Automata. ACRI 2012, Santorini Island, Greece. Lecture Notes in Computer Science, LNCS.},

volume = {7495},

pages = {101--110},

organization = {Springer, Berlin, Heidelberg},

abstract = {Firing Squad Synchronization Problems are well known to be solvable by voluminous transition tables describing signals traveling and colliding. In this paper, we show that it is possible to solve it by expressing directly the fact that we want a recursive division of the space into two parts of equal size, and a notification when no further division is possible. Using fields – objects associating a value to every point in space and time – as primitive objects, the solution is designed algorithmically by a semantically-intuitive decomposition of the global evolution into simpler evolutions.



The system we obtain has several interesting characteristics : it is understandable, time-optimal, tackles many initial configurations, and allows a new interpretation of the traditional signals and collisions point of view. We will quickly sketch how we can obtain a finite state automaton by reduction of the system using the Lipschitz-continuity of involved fields, and a kind of tail-recursivity property of the dependencies.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{formenti20111,

title = {On 1-resilient, radius 2 elementary CA rules},

author = {Enrico Formenti and Katsunobu Imai and Bruno Martin and Jean-Baptiste Yunes},

editor = {Nazim Fatès and Eric Goles and Alejandro Maass and Ivan Rapaport

},

url = {https://hal.inria.fr/hal-00654706/document},

year  = {2011},

date = {2011-11-21},

booktitle = {AUTOMATA 2011, 17th International Workshop on Cellular Automata and Discrete Complex Systems, Nancy, France.},

journal = {AUTOMATA 2011},

pages = {41--54},

abstract = {The study of cellular automata rules suitable for cryptographic applications is under consideration. Cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link the study of cellular automata rules to the study of such Boolean functions. We illustrate our approach with 5-variable Boolean functions.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{formenti2011boolean,

title = {Cellular automata, Boolean functions, Pseudo-random generators, Symmetric cryptography.},

author = {Enrico Formenti and Katsunobu Imai and Bruno Martin and Jean-Baptiste Yunès},

editor = {Nazim Fatès and Eric Goles and Alejandro Maass and Ivan Rappaport},

year  = {2011},

date = {2011-11-21},

booktitle = {AUTOMATA 11, 17th International Workshop on Cellular Automata and Discrete Complex Systems, November 21—23, 2011, Santiago, Chile.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes2010achieving,

title = {Achieving universal computations on one-dimensional cellular automata (invited conference)},

author = {Jean-Baptiste Yunès},

editor = {Hiroshi Umeo and Stefania Bandini},

doi = {10.1007/978-3-642-15979-4_74},

isbn = {978-3-642-15979-4},

year  = {2010},

date = {2010-09-21},

booktitle = {Cellular Automata. ACRI 2010. Ascoli Piceno, Italy, Septembre 21-24, 2010. Lecture Notes in Computer Science, LNCS},

volume = {6350},

pages = {660--669},

organization = {Springer, Berlin, Heidelberg},

abstract = {We show how natural universal computations can be achieved on one-dimensional cellular automata. That model of computation is obviously Turing complete but how can we effectively program any given computation is far less known. In this paper we are interested in intrinsic universality; we want a CA in which any other CA can be represented and simulated with no intermediate coding relevant to another computation model. The first step is to abstract from the space-time diagram in favor of a more essential dependency graph. Then such dependency graph can be projected on grids. This work shows that grids put forward causality in place of space-time contingencies.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nomura2010note,

title = {A Note on Synchronization Steps in Firing Squad Synchronization Problem},

author = {Akira Nomura and Jean-Baptiste Yunès and Hiroshi Umeo},

doi = {10.1109/CSO.2010.124},

isbn = {978-1-4244-6812-6},

year  = {2010},

date = {2010-05-28},

booktitle = {2010 Third International Joint Conference on Computational Science and Optimization, Huangshan, China.},

volume = {1},

pages = {300--301},

organization = {IEEE},

abstract = {The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{umeo2009small,

title = {Small non optimum time firing squad synchronization protocols for one-dimensional rings},

author = {Hiroshi Umeo and Jean-Baptiste Yunès and Naoki Kamikawa and Juntarou Kurashiki},

year  = {2009},

date = {2009-10-18},

booktitle = {International Symposium on Nonlinear Theory and its Applications (NOLTA'09). Sapporo, Japan, October 18—21, 2009.},

volume = {9},

pages = {479--482},

abstract = {The synchronization in cellular automata has been known as a firing squad synchronization problem since its development, in which it was originally pro- posed by J. Myhill in Moore [1964] to synchronize all or some parts of self-reproducing cellular automata. The firing squad synchronization problem has been studied extensively for more than 40 years [1-22]. In the present article, we propose two six-state firing squad synchronization full protocols for rings, which are the smallest ones known at present for rings. In addition, we present a family of 4-state partial protocols that can synchronize any one-dimensional rings of length n = 2^k for any positive integer k. The number four is the smallest one in the class of synchronization protocols proposed so far. We also study state change complexities for those protocols.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{umeo2009simple,

title = {A simple optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays},

author = {Hiroshi Umeo and Jean-Baptiste Yunès and Takuya Yamawaki},

doi = {10.1109/CSSim.2009.58},

year  = {2009},

date = {2009-09-07},

booktitle = {2009 International Conference on Computational Intelligence, Modelling and Simulation, Brno, Czech Republic, September 7—9, 2009.},

pages = {120--125},

organization = {IEEE},

abstract = {The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a new and simpler optimum-time synchronization algorithm that can synchronize any rectangle array of size m × n with a general at one corner in m + n + max(m, n)-3 steps. An implementation for the algorithm in terms of local transition rules is also given.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{umeo20084,

title = {About 4-states solutions to the firing squad synchronization problem},

author = {Hiroshi Umeo and Jean-Baptiste Yunès and Naoki Kamikawa},

editor = {Hiroshi Umeo and Shin Morishita and Katsuhiro Nishinari and Toshihiko Komatsuzaki and Stefania Bandini},

doi = {10.1007/978-3-540-79992-4_14},

isbn = {978-3-540-79992-4},

year  = {2008},

date = {2008-09-23},

booktitle = {Cellular Automata, 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, Yokohama, Japan, September 23—26, 2008. Proceedings. Lecture Notes on Computer Science, LNCS},

volume = {5191},

pages = {108--113},

organization = {Springer, Berlin, Heidelberg},

abstract = {We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes2008goto,

title = {Goto's construction and Pascal's triangle: new insights into cellular automata synchronization},

author = {Jean-Baptiste Yunès},

url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/jac08/Jac.html},

isbn = {978-5-94057-377-7},

year  = {2008},

date = {2008-05-01},

booktitle = {Proceedings of the first symposium on cellular automata, "Journées Automates Cellulaires", JAC 2008, Uzès, France, 2008},

pages = {195--203},

organization = {Издательство МЦНМО},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes2007simpleb,

title = {Simple new algorithm which solve the FSSP: a 4n-steps 7-states solution},

author = {Jean-Baptiste Yunès},

doi = {10.1007/978-3-540-74593-8_27},

isbn = {978-3-540-74593-8},

year  = {2007},

date = {2007-09-10},

booktitle = {International Conference on Machines, Computations, and Universality. MCU 2007: Machines, Computations, and Universality. Université d'Orléans, France, September 10—13, 2007.},

pages = {316--324},

publisher = {Springer, Berlin, Heidelberg.},

abstract = {We present a new family of solutions to the firing squad synchronization problem. All these solutions are built with a few finite number of signals, which lead to simple implementations with 7 or 8 internal states. Using one of these schemes we are able to built a 7-states   4𝑛+O(log𝑛) -steps solution to the firing squad synchronization problem. These solutions not only solves the unrestricted problem (initiator at one of the two ends), but also the problem with initiators at both ends and the problem on a ring.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes2007new,

title = {New extensions to some firing squad synchronization solutions},

author = {Jean-Baptiste Yunès},

year  = {2007},

date = {2007-08-27},

booktitle = {AUTOMATA 2007. 13th International Workshop on Cellular Automata, Fields Institute, Toronto, Canada, August 27—29, 2007. IFIP TC1 WG 1.5.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes2007revisiting,

title = {Revisiting existing solutions to the firing squad synchronization problem},

author = {Jean-Baptiste Yunès},

year  = {2007},

date = {2007-07-02},

booktitle = {WSDC'07, Workshop on Symbolic Dynamic and Coding. Institut Gaspard Monge, Marne-la-Vallée, France, July 2—4, 2007.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes1999implementation,

title = {An Implementation of a Fault Tolerant Scheme of the FSSP},

author = {Jean-Baptiste Yunès},

year  = {1999},

date = {1999-01-01},

booktitle = {Automata 1999, IFIP WG1.5 Meeting, École Normale Supérieure de Lyon, Lyon, France.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes1995solutions,

title = {Solutions Tolérantes aux pannes pour le problème de la synchronisation d'une ligne de fusiliers.},

author = {Jean-Baptiste Yunès},

url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/roanne.pdf},

year  = {1995},

date = {1995-01-01},

booktitle = {ASMICS Workshop, Roanne, France.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{yunes1995fault,

title = {Fault tolerant solutions to the firing squad synchronization problem},

author = {Jean-Baptiste Yunès},

editor = {Jozef Gruska and Hiroshi Umeo and Roland Vollmar},

url = {http://yunes.informatique.univ-paris-diderot.fr/raw/publications/dagstuhl.pdf},

year  = {1995},

date = {1995-01-01},

booktitle = {Dagstuhl Seminar Report. Automata 1995, Schloss Dagstuhl 9510, Dagstuhl, Germany.},

pages = {28},

organization = {Dagstuhl},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}