


default search action
Electronic Notes in Discrete Mathematics, Volume 59
Volume 59, June 2017
- Jean-Marc Fedou, Luca Ferrari

:
Preface. 1-2 - Samy Abbes

:
Toward uniform random generation in 1-safe Petri nets. 3-17 - Martin Loebl

, Pavel Rytír
:
Binary linear codes, dimers and hypermatrices. 19-35 - Pascal Préa, Mathieu Rouault, François Brucker:

An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension. 37-50 - Malvina Vamvakari

:
A q-random walk approximated by a q-Brownian motion. 51-63 - Stephen Desalvo:

Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method. 65-77 - Enrico Formenti

, Paolo Massazza:
From Tetris to polyominoes generation. 79-98 - Jérémie O. Lumbroso

, Marni Mishna
, Yann Ponty
:
Taming reluctant random walks in the positive quadrant. 99-114 - Riccardo Biagioli, Frédéric Jouhet, Philippe Nadeau

:
321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes. 115-130 - Cyril Banderier, Michael Wallner

:
Lattice paths with catastrophes. 131-146 - Adrien Boussicault, Veronica Guerrini:

A new occurrence of Catalan numbers: cap permutations. 147-164 - Alexandre Blondin Massé, Éric Marcotte:

Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z2. 165-176 - Adrien Boussicault, Patxi Laborde-Zubieta:

Periodic parallelogram polyominoes. 177-188 - Olivier Bodini, Antoine Genitrini, Nicolas Rolin:

Extended boxed product and application to synchronized trees. 189-202

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














