Partenaires


Rechercher

Sur ce site

Sur le Web du CNRS


Accueil du site > Membres > Membres Permanents > Professeurs des Universités > Vincent Vajnovszki

Vincent Vajnovszki

Professeur

AILE DE L''INGENIEUR
LABORATOIRE Le2i
Faculté Mirande
21000 DIJON

Email : Vincent.Vajnovszki u-bourgogne.fr
Web : http://www.u-bourgogne.fr/v.vincent/

Projets :


Publications

Revues (38)

  • "Reflected Gray code based orders on some restricted growth sequences", Sabri Ahmad, Vincent Vajnovszki, The Computer Journal, 58 (5), pp. 1099-1111, 2015 lien sur HAL
  • "Reflected Gray codes for q-ary words avoiding a given factor", Vincent Vajnovszki, Stefano Bilotta, Renzo Pinzani, Sabri Ahmad, Antonio Bernini, Acta Informatica, 52 (7), pp. 573-592, 2015 lien sur HAL
  • "Generating permutations with a given major index", Vincent Vajnovszki, Journal of Discrete Algorithm, 26, 77-88, 2014 lien sur HAL
  • "Prefix partitioned Gray codes for particular cross-bifix-free sets", Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Sabri Ahmad, Vincent Vajnovszki, Cryptography and Communications, 6 (4), pp. 359-369, 2014 lien sur HAL
  • "Lehmer code transforms and Mahonian statistics on permutations", Vincent Vajnovszki, Discrete Mathematics 313, (2013) 581-589, 2013 lien sur HAL
  • "Efficient generation of restricted growth words", Vincent Vajnovszki, Toufik Mansour, Information Processing Letters 113, 17(2013) 613-616, 2013 lien sur HAL
  • "Generalized Schröder permutations", Vincent Vajnovszki, Elena Barcucci, Journal of Theoretical Computer Science (TCS) 502, (2013) 209-216, 2013 lien sur HAL
  • "Restricted compositions and permutations: From old to new Gray codes", Vincent Vajnovszki, Rémi Vernay, Information Processing Letters, Vol. 111 (Issue 13), pp. 650-655, 1 July 2011 lien sur HAL http://v.vincent.u-bourgogne.fr/0ABS/0ARTS/bound_comp_rev2.pdf
  • "Combinatorial Transforms : Application in Lossless Image Compression", Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Discrete Mathematical Sciences & Cryptography 14, 2(129-147), 2011 lien sur HAL
  • "Loop-free Gray code algorithm for e-restricted growth fonctions", Vincent Vajnovszki, Toufik Mansour, Information Processin Letters 111, 11(2011) 541-544., 2011 lien sur HAL
  • "A new Euler-Mahonian constructive bijection", Vincent Vajnovszki, Discrete Applied Mathematics 159, (2011) 1453-1459, 2011 lien sur HAL
  • "Generating restricted classes of involutions, Bell and Stirling permutations", M. Poneti, Vincent Vajnovszki, European Journal of Combinatorics, 31, pp 553-564, 2010, 2010
  • "Generating involutions, derangements, and relatives by ECO", Vincent Vajnovszki, Discrete Mathematics and Theoretical Computer Science 12, 1(2010) 109-122, 2010 lien sur HAL
  • "Combinatorial Isomorphism Between Fibonacci Classes", Asep Juarna, Vincent Vajnovszki, Journal of Discrete Mathematical Science and Cryptography, 11 (2), pp. 147-158, 2008
  • "More restrictive Gray codes for necklaces and Lyndon words", Vincent Vajnovszki, Information Processing Letters, 106 (3), pp. 96-99, 2008
  • "Combinatorial Gray codes for classes of pattern avoiding permutations", W.M.B. Dukes, M.F. Flanagan, Toufik Mansour, Vincent Vajnovszki, Theoretical Computer Science, 396 , pp. 35-49, 2008
  • "Gray code order for Lyndon words", Vincent Vajnovszki, Discrete Mathematics and Theoretical Computer Science, 9 (2), pp. 145-152, 2007 lien sur HAL
  • "Some Generalization of a Simion-Schmidt's Bijection", Asep Juarna, Vincent Vajnovszki, The Computer Journal, 50 (5), pp. 574-580, 2007
  • "Restricted 123-avoiding Baxter permutations and Padovan numbers", Toufik Mansour, Vincent Vajnovszki, Discrete Applied Mathematics, 155 (11), pp. 1430-1444, 2007
  • "A loop-free two-close Gray-code algorithm for listing k-ary Dyck words", Vincent Vajnovszki, Timothy Walsh, Journal of Discrete Algorithms, 4 (4), pp. 633-648, 2006
  • "Gray code for necklaces and Lyndon words of arbitrary base", Mark Weston, Vincent Vajnovszki, PUMA, 17 (1-2), pp. 175-182, 2006
  • "Minimal changes list for Lucas Strings", Jean-Luc Baril, Vincent Vajnovszki, Theoretical Computer Science, 346 , pp. 189-199, 2005
  • "Gray code for derangements", Jean-Luc Baril, Vincent Vajnovszki, Discrete Applied Mathematics, 140 (1-3), pp. 207-221, 15 May 2004
  • "A Loopless Algorithm for Generating the Permutations of a Multiset", Vincent Vajnovszki, Theoretical Computer Science, pp. 415-431, 2003
  • "On the Reconstruction of a Motzkin Tree from its Code", Ronny Pattisina, Vincent Vajnovszki, Journal of Information and Optimization Sciences, 24 (3), pp. 583-589, 2003
  • "Gray visiting Motzkins", Vincent Vajnovszki, Acta Informatica, 38 , pp. 793-811, Springer-Verlag, 2002
  • "Generating a Gray Code for P-sequences", Vincent Vajnovszki, The Journal of Mathematical Modelling and Algorithms, 1 , pp. 31-41, 2002
  • "A loopless generation of bitstrings without p consecutive ones", Vincent Vajnovszki, Discrete Mathematics and Theoretical Computer Science, pp. 227-240, 2001
  • "Systolic generation of k-ary trees", Vincent Vajnovszki, Chris Phillips, Parallel Processing Letters, 9 (1), pp. 93-101, 1999
  • "On the Parallel Generation of P-Sequences", Vincent Vajnovszki, Chris Phillips, International Journal of Computers and Their Applications, 6 (1), pp. 120-125, 1999
  • "Parallel algorithms for generating well-formed parentheses strings", Vincent Vajnovszki, Jean Marcel Pallo, Parallel Processing Letters, 8 (1), pp. 19-28, 1998
  • "On the Loopless Generation of Binary Tree Sequences", Vincent Vajnovszki, Information Processing Letters, 68 , pp. 113-117, 1998
  • "Ranking and Unranking of k-ary trees with 4k-4 letter alphabet", Vincent Vajnovszki, Jean Marcel Pallo, Journal of Information and Optimization Science, 18 (2), pp. 271-279, 1997
  • "Constant Time Algorithm for Generating Binary Trees Gray Codes", Vincent Vajnovszki, Studies in Informatics and Control, 5 (1), pp. 15-21, 1996
  • "Listing and Random Generation of Neuronal Trees Coded by Six Letters", Vincent Vajnovszki, ACAM, 4 (1), pp. 29-40, 1995
  • "Constant time generation of binary unordered trees", Vincent Vajnovszki, Bulletin of EATCS, 57 , pp. 221-229, 1995
  • "Le codage des arbres binaires", Vincent Vajnovszki, Comput. Sci. J. Moldova , 3 (2), pp. 194-209, 1995
  • "Generating binary trees in A-order from codewords defined on four-letter alphabet", Vincent Vajnovszki, Jean Marcel Pallo, Journal of Information and Optimization Science, 15 (3), pp. 345-357, 1994

Livres (2)

  • "Proceedings of GASCOM 2007", Elisabetta Grazini, Vincent Vajnovszki, PUMA, to appear, 2007
  • "Proceedings of 4th Internationa Conference on Discrete Mathematics and Theoretical Computer Science", Vincent Vajnovszki, LNCS, Springer, 2003

Conférences internationales (27)

  • "Restricted Steinhaus-Johnson-Trotter list", Sabri Ahmad, Vincent Vajnovszki, ICGT, Grenoble, fr, 2014 lien sur HAL
  • "Two Gray codes for q-ary k-generalized Fibonacci strings", Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki, 14th Italian Conference on Theoretical Computer Science, Palermo : Italie, 2013 lien sur HAL
  • "A new vincular pattern based Mahonian statistic on words", Vincent Vajnovszki, Sre?ko Brlek, Kolloquium über Kombinatorik, Ilmenau : Allemagne, 2013 lien sur HAL
  • "ECO-based Gray codes generation for particular classes of words", Vincent Vajnovszki, GASCom, Bordeaux : France, 2012 lien sur HAL
  • "Lehmer code transforms and Mahonian statistics on permutations", Vincent Vajnovszki, Permutation Patterns, Strathclyde : Royaume-Uni, 2012 lien sur HAL
  • "Lossless Compression Based on Combinatorial Transform : Application to Medical Images", Elfitrin Syahrul, Julien Dubois, Asep Juarna, Vincent Vajnovszki, International Congress on Computer Applications and Computational Science (CACS), Singapore, December 2010
  • "Burrows Wheeler Compression Algorithm (BWCA) in Lossless image Compression", Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, International Conference on Soft Computing, Intelligent System and Information Technology (2nd ICSIIT), Bali, Indonesia, July 2010
  • "Restricted compositions and permutations: from old to new Gray codes", Vincent Vajnovszki, Rémi Vernay, French Combinatorial Conference, Orsay, France, 30 Juin 2010
  • "Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques)", Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Taoufik Saidani, Mohamed Atri, Proceedings of IEEE International Conference on Signal-Image Technology & Internet-Based Systems (SITIS'08), Bali , Indonesia, December 2008
  • "Gray codes - from old to new order relations (invited lecture)", Vincent Vajnovszki, GasCom 2008, pp. 223-225, Bibbiena, Italy, 2008
  • "Simple Gray codes constructed by ECO method", Vincent Vajnovszki, JMIT 2008, Mons, Belgique, 2008
  • "CAT generation of Dyck words and relatives", Phan Thuan Do, Vincent Vajnovszki, International Combinatorics, Geometry and Computer Science Conference CGCS2007, Marseille - Luminy, France, 2007
  • "Generating involutions, Bell and Stirling permutations", Irene Fanti, M. Poneti, Vincent Vajnovszki, CGCS2007, 2007
  • "Exhaustive generation of some classes of pattern avoiding permutations using succession functions", Phan Thuan Do, Vincent Vajnovszki, Conference in honor of Donald E. Knuth, Bordeaux, France, 2007
  • "Combinatorial isomorphism beyond a Simion-Schmidt's bijection", Asep Juarna, Vincent Vajnovszki, CANT 2006, Université de Liège (ULG) BELGIQUE, 2006
  • "Gray code for necklaces and Lyndon words of arbitray base", Mark Weston, Vincent Vajnovszki, Gascom, 2006
  • "Exhaustive generation of involutions, derangements and relatives by Eco", Vincent Vajnovszki, Gascom, 2006
  • "Isomorphism Between Classes Counted by Fibonacci Numbers", Asep Juarna, Vincent Vajnovszki, Words 2005, Université du Québec à Montréal (UQAM) CANADA, pp. 51-62, 2005
  • "Gray viziting Lyndons", Vincent Vajnovszki, Journées Montoise d'informatique Théorique à Liège, 2004
  • "Gray codes for p Lucas strings", Jean-Luc Baril, Vincent Vajnovszki, Proceedings of the 4th International Conference on Combinatorics on Words, pp. 149-158, Turku, Finland, TUCS General Publication,, September 2003
  • "Gray code for P-Sequences", Vincent Vajnovszki, Gascom, 1999
  • "Parallel Generation of Nondecreasing Paths and Applications", Vincent Vajnovszki, 11th International Conference on Computer Applications in Industry and Engineering, pp. 183-187, 1998
  • "Génération aléatoire des arbres binaires par des algorithmes de rang inverse", Vincent Vajnovszki, Gascom, 1997
  • "Optimal Parallel Algorithm for Generating k-ary trees", Vincent Vajnovszki, Chris Phillips, 12th International Conference on Computers and Their Applications, 1997
  • "Generating k-ary trees in parallel", Vincent Vajnovszki, Chris Phillips, Hight Performace Computing-IEEE, 1997
  • "An optimal systolic algorithm for generation of P-sequences", Vincent Vajnovszki, Chris Phillips, 10th International Conference on Parallel and Distributed Computing Systems, pp. 209-212, 1997
  • "Two optimal parallel algorithms for generating P-sequences", Vincent Vajnovszki, Chris Phillips, Proceedings of the 9th International Conference on Parallel and Distributed Computing Systems, pp. 819-821, 1996

Conférences nationales (3)

  • "Single length three pattern-avoiding permutations and Catalan numbers", Asep Juarna, Vincent Vajnovszki, KOMMIT 2004, Gunadarma University, Jakarta INDONESIA, 2004
  • "Permutations avoiding double patterns of length three", Asep Juarna, Vincent Vajnovszki, KOMMIT 2004, Gunadarma University, Jakarta INDONESIA, 2004
  • "Hamiltonisme du cube de Lucas d'ordre $p$, ", Jean-Luc Baril, Vincent Vajnovszki, Journées Graphes 2003, Dijon, 2003

Séminaires invités (1)

  • "Pattern-based permutation statistics and code transforms", Vincent Vajnovszki, Workshop on recent results in Graph Theory and Combinatorics, Italie (2012), 2013 lien sur HAL

Autres (3)

  • "Combinaorial Gray codes for classes of pattern avoiing permutations", W.M.B. Dukes, M.F. Flanagan, Toufik Mansour, Vincent Vajnovszki, arXiv:0704.2048v1, 2007
  • "Fast Generation of Fibonacci Permutations", Asep Juarna, Vincent Vajnovszki, CDMTCS, Research Report Series, University of Aukland, 2004
  • "A loopless two-close Gray-code algorithm for listing k-ary Dyck words", Vincent Vajnovszki, Timothy Walsh, Rapport de Reccherche, 3 , UQAM, 2003

Derniers billets publiés


Archives


LE2I - Laboratoire Electronique, Informatique et Image | webmestre : Antoine Trapet | info légales | logo SPIP 2