Vincent Vajnovszki
Vincent Vajnovszki
Computer Science, Universite de Bourgogne, Dijon, France
Adresse e-mail validée de u-bourgogne.fr - Page d'accueil
TitreCitée parAnnée
On the loopless generation of binary tree sequences
V Vajnovszki
Information Processing Letters 68 (3), 113-117, 1998
541998
Gray code for derangements
JL Baril, V Vajnovszki
Discrete Applied Mathematics 140 (1-3), 207-221, 2004
402004
A loopless algorithm for generating the permutations of a multiset
V Vajnovszki
Theoretical Computer Science 307 (2), 415-431, 2003
322003
Combinatorial Gray codes for classes of pattern avoiding permutations
WMB Dukes, MF Flanagan, T Mansour, V Vajnovszki
Theoretical Computer Science 396 (1-3), 35-49, 2008
252008
Generating a Gray code for P-sequences
V Vajnovszki
Journal of Mathematical Modelling and Algorithms 1 (1), 31-41, 2002
242002
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
V Vajnovszki, T Walsh
Journal of Discrete Algorithms 4 (4), 633-648, 2006
19*2006
Minimal change list for Lucas strings and some graph theoretic consequences
JL Baril, V Vajnovszki
Theoretical computer science 346 (2-3), 189-199, 2005
192005
A Loopless Generation of Bitstrings without p Consecutive Ones
V Vajnovszki
Combinatorics, computability and logic, 227-240, 2001
192001
Generating binary trees in A-order from codewords defined on a four-letter alphabet
V Vajnovszki, J Pallo
Journal of Information and Optimization Sciences 15 (3), 345-357, 1994
181994
More restrictive Gray codes for necklaces and Lyndon words
V Vajnovszki
Information Processing Letters 106 (3), 96-99, 2008
162008
Gray code order for Lyndon words
V Vajnovszki
Discrete Mathematics and Theoretical Computer Science 9 (2), 145--151, 2007
162007
Gray codes for necklaces and Lyndon words of arbitrary base
M Weston, V Vajnovszki
Pure Math. Appl.(PU. MA) 17 (1-2), 175-182, 2006
152006
Gray visiting motzkins
V Vajnovszki
Acta Informatica 38 (11-12), 793-811, 2002
152002
Lossless image compression using Burrows Wheeler Transform (methods and techniques)
E Syahrul, J Dubois, V Vajnovszki, T Saidani, M Atri
Signal Image Technology and Internet Based Systems, 2008. SITIS'08. IEEE …, 2008
132008
Lehmer code transforms and Mahonian statistics on permutations
V Vajnovszki
Discrete Mathematics 313 (5), 581-589, 2013
122013
Restricted compositions and permutations: from old to new Gray codes
V Vajnovszki, R Vernay
Information Processing Letters 111 (13), 650-655, 2011
122011
Prefix partitioned gray codes for particular cross-bifix-free sets
A Bernini, S Bilotta, R Pinzani, A Sabri, V Vajnovszki
Cryptography and Communications 6 (4), 359-369, 2014
112014
A new Euler–Mahonian constructive bijection
V Vajnovszki
Discrete Applied Mathematics 159 (14), 1453-1459, 2011
102011
A Gray code for cross-bifix-free sets
A Bernini, S Bilotta, R Pinzani, V Vajnovszki
Mathematical Structures in Computer Science 27 (2), 184-196, 2017
82017
Generating involutions, derangements, and relatives by ECO
V Vajnovszki
Discrete Mathematics and Theoretical Computer Science 12 (1), 109-122, 2010
82010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20