Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Éric Rémila"'
Autor:
Éric Rémila
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
Rhombus tilings are tilings of zonotopes with rhombohedra. We study a class of \emphlexicographic rhombus tilings of zonotopes, which are deduced from higher Bruhat orders relaxing the unitarity condition. Precisely, we fix a sequence $(v_1, v_2,\dot
Externí odkaz:
https://doaj.org/article/3220a6ab10404b5f8db6bc796a771ac2
Autor:
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
Discrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
International audience; Naor, Parter, and Yogev [SODA 2020] recently designed a compiler for automatically translating standard centralized interactive protocols to distributed interactive protocols, as introduced by Kol, Oshman, and Saxena [PODC 201
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c0971027ec62ca9ef8590760d66456f
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
DMCS
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.103-116
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.103-116
ECO is a method for the enumeration of classes of combinatorial objects based on recursive constructions of such classes. In the first part of this paper we present a construction for the class of convex polyominoes based on the ECO method. Then we t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bb29eb3b6674133753f554270ab89e5
https://dmtcs.episciences.org/2307
https://dmtcs.episciences.org/2307
Autor:
Nazim Fatès
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.155-166
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.155-166, ⟨10.46298/dmtcs.2304⟩
DMCS
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.155-166
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.155-166, ⟨10.46298/dmtcs.2304⟩
DMCS
Classifying cellular automata in order to capture the notion of chaos algorithmically is a challenging problem than can be tackled in many ways.We here give a classification based on the computation of a macroscopic parameter, the $d$-spectrum, and s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2e7637f45776dc3929715b9a26ab8e7
https://dmtcs.episciences.org/2304
https://dmtcs.episciences.org/2304
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.141-154, ⟨10.46298/dmtcs.2303⟩
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.141-154
DMCS
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.141-154, ⟨10.46298/dmtcs.2303⟩
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.141-154
DMCS
In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications. This theory uses the psycho-social concep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1be0cb8aa1f60785db1e770d258775b
https://dmtcs.episciences.org/2303
https://dmtcs.episciences.org/2303
Autor:
Bodini, Olivier
Publikováno v:
DMCS
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.81-88
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.81-88
A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::225ed16b4329fef44f7599fdcb478d97
https://doi.org/10.46298/dmtcs.2313
https://doi.org/10.46298/dmtcs.2313
Autor:
Arnaud Dartois, Clémence Magnien
Publikováno v:
DMCS
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.89-102
Discrete Mathematics and Theoretical Computer Science
Discrete Models for Complex Systems, DMCS'03
Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.89-102
In this paper we study the identity of the Abelian Sandpile Model on a rectangular lattice.This configuration can be computed with the burning algorithm, which, starting from the empty lattice, computes a sequence of configurations, the last of which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f012ba3cabb4a5272f918931a7178a94
https://doi.org/10.46298/dmtcs.2308
https://doi.org/10.46298/dmtcs.2308