Recherche - Archive ouverte HAL

	Pour les 41 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page : Page précédente 1 2 Page suivante	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		An introduction to Dyck paths with air pockets Jean-Luc Baril , Sergey Kirgizov , Rémi Maréchal , Vincent Vajnovszki Journées ALEA, 2023, Marseille, France Communication dans un congrès hal-04474032v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Generalized Schröder permutations Elena Barcucci , Vincent Vajnovszki Theoretical Computer Science, 2013, 502, pp.209-216. ⟨10.1016/j.tcs.2012.02.039⟩ Article dans une revue hal-00863369v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Reflected Gray code based orders on some restricted growth sequences Ahmad Sabri , Vincent Vajnovszki The Computer Journal, 2015, 58 (5), pp.1099-1111. ⟨10.1093/comjnl/bxu018⟩ Article dans une revue hal-01202879v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Patterns in treeshelves Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki Discrete Mathematics, 2017, 340 (12), pp.2946 - 2954. ⟨10.1016/j.disc.2017.07.021⟩ Article dans une revue hal-01588383v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Asymptotic bit frequency in Fibonacci words Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki GASCom 2022, Jun 2022, Varese, Italy Communication dans un congrès hal-03731276v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Gray code order for Lyndon words Vincent Vajnovszki Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.145--151. ⟨10.46298/dmtcs.393⟩ Article dans une revue hal-00966527v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		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, Sep 2013, Palermo, Italy Communication dans un congrès hal-00844211v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On shortening u-cycles and u-words for permutations Sergey Kitaev , Vladimir Potapov , Vincent Vajnovszki Discrete Applied Mathematics, 2019, 260, pp.203-213. ⟨10.1016/j.dam.2019.01.025⟩ Article dans une revue hal-02416426v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Gray codes for Fibonacci q-decreasing words Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki Theoretical Computer Science, 2022, 927, pp.120-132. ⟨10.1016/j.tcs.2022.06.003⟩ Article dans une revue hal-03114503v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Gray coding cubic planar maps Sergey Avgustinovich , Sergey Kitaev , Vladimir N. Potapov , Vincent Vajnovszki Theoretical Computer Science, 2016, 616, pp.59 - 69. ⟨10.1016/j.tcs.2015.12.013⟩ Article dans une revue hal-01431171v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Generating involutions, derangements, and relatives by ECO Vincent Vajnovszki Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.109-122. ⟨10.46298/dmtcs.479⟩ Article dans une revue hal-00824068v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		The equidistribution of some length-three vincular patterns on S n (132) Vincent Vajnovszki Information Processing Letters, 2018, 130, pp.40 - 45. ⟨10.1016/j.ipl.2017.10.005⟩ Article dans une revue hal-01862223v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A permutation code preserving a double Eulerian bistatistic Jean-Luc Baril , Vincent Vajnovszki Discrete Applied Mathematics, 2016, 224, pp.9-15. ⟨10.1016/j.dam.2017.02.014⟩ Article dans une revue hal-02415298v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Restricted Steinhaus-Johnson-Trotter list Ahmad Sabri , Vincent Vajnovszki ICGT, Jun 2014, Grenoble, France Communication dans un congrès hal-01202881v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A Gray Code for cross-bifix-free sets Antonio Bernini , Stefano Bilotta , Renzo Pinzani , Vincent Vajnovszki Mathematical Structures in Computer Science, 2014, ⟨10.1017/S0960129515000067⟩ Article dans une revue hal-01071362v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Mahonian STAT on rearrangement class of words Shishuo Fu , Ting Hua , Vincent Vajnovszki Discrete Applied Mathematics, 2019, 270, pp.134-141. ⟨10.1016/j.dam.2019.06.010⟩ Article dans une revue hal-02416400v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Loop-free Gray code algorithm for e-restricted growth fonctions Vincent Vajnovszki , Toufik Mansour , Georges Nassar Information Processing Letters, 2011, 111 (11), pp.541-544. ⟨10.1016/j.ipl.2011.03.006⟩ Article dans une revue istex hal-00790765v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Descent distribution on Catalan words avoiding a pattern of length at most three Jean-Luc Baril , Sergey Kirgizov Kirgizov , Vincent Vajnovszki Discrete Mathematics, 2018, 341 (9), pp.2608 - 2615. ⟨10.1016/j.disc.2018.06.001⟩ Article dans une revue hal-01923911v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		An efficient Gray code algorithm for generating all permutations with a given major index Vincent Vajnovszki Journal of Discrete Algorithms, 2014, 26, pp.77-88. ⟨10.1016/j.jda.2014.01.001⟩ Article dans une revue hal-01001561v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Mahonian STAT on words Sergey Kitaev , Vincent Vajnovszki Information Processing Letters, 2016, 116 (2), pp.157 - 162. ⟨10.1016/j.ipl.2015.09.006⟩ Article dans une revue hal-01418254v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Equipopularity of descent-equivalent patterns over descent-equivalence classes of words and permutations Jean-Luc Baril , Vincent Vajnovszki Graph Theory, Combinatorics and Applications, GTCA, Oct 2019, Al Ain, United Arab Emirates Communication dans un congrès hal-02418786v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Gray codes for order p Lucas strings Jean-Luc Baril , Vincent Vajnovszki International Conference on Combinatorics on Words, Aug 2003, Turku, Finland Communication dans un congrès hal-02415322v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A new vincular pattern based Mahonian statistic on words Vincent Vajnovszki , Srečko Brlek Kolloquium über Kombinatorik, Nov 2013, Ilmenau, Germany. pp.32 Communication dans un congrès hal-00906715v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		More Restricted Growth Functions: Gray Codes and Exhaustive Generation Ahmad Sabri , Vincent Vajnovszki Graphs and Combinatorics, 2017, 33 (3), pp.573 - 582. ⟨10.1007/s00373-017-1774-7⟩ Article dans une revue hal-01552981v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Minimal change list for Lucas Strings and some graph theoritic consequences Jean-Luc Baril , Vincent Vajnovszki Theoretical Computer Science, 2005, 346 (2-3), pp.189-199. ⟨10.1016/j.tcs.2005.08.020⟩ Article dans une revue istex hal-02413711v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Reflected Gray codes for q-ary words avoiding a given factor Vincent Vajnovszki , Stefano Bilotta , Renzo Pinzani , Ahmad Sabri , Antonio Bernini Acta Informatica, 2015, 52 (7), pp.573-592. ⟨10.1007/s00236-015-0225-2⟩ Article dans une revue hal-01202888v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order Ahmad Sabri , Vincent Vajnovszki Pure Mathematics and Applications, 2019, 28 (1), pp.109-119. ⟨10.1515/puma-2015-0035⟩ Article dans une revue hal-02416502v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Popularity of patterns over d-equivalence classes of words and permutations Jean-Luc Baril , Vincent Vajnovszki Theoretical Computer Science, 2020, 814, pp.249-258. ⟨10.1016/j.tcs.2020.02.005⟩ Article dans une revue hal-02639981v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Restricted compositions and permutations: from old to new Gray codes Vajnovszki Vincent , Rémi Vernay Information Processing Letters, 2011, 111 (13), pp.650-655. ⟨10.1016/j.ipl.2011.03.022⟩ Article dans une revue istex hal-00790762v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		ECO-based Gray codes generation for particular classes of words Vincent Vajnovszki GASCom, Jun 2012, Bordeaux, France Communication dans un congrès hal-00824065v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More

An introduction to Dyck paths with air pockets

Jean-Luc Baril , Sergey Kirgizov , Rémi Maréchal , Vincent Vajnovszki

Journées ALEA, 2023, Marseille, France

Communication dans un congrès hal-04474032v1

Generalized Schröder permutations

Elena Barcucci , Vincent Vajnovszki

Theoretical Computer Science, 2013, 502, pp.209-216. ⟨10.1016/j.tcs.2012.02.039⟩

Article dans une revue hal-00863369v1

Reflected Gray code based orders on some restricted growth sequences

Ahmad Sabri , Vincent Vajnovszki

The Computer Journal, 2015, 58 (5), pp.1099-1111. ⟨10.1093/comjnl/bxu018⟩

Article dans une revue hal-01202879v1

Patterns in treeshelves

Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki

Discrete Mathematics, 2017, 340 (12), pp.2946 - 2954. ⟨10.1016/j.disc.2017.07.021⟩

Article dans une revue hal-01588383v1

Asymptotic bit frequency in Fibonacci words

Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki

GASCom 2022, Jun 2022, Varese, Italy

Communication dans un congrès hal-03731276v1

Gray code order for Lyndon words

Vincent Vajnovszki

Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 2 (2), pp.145--151. ⟨10.46298/dmtcs.393⟩

Article dans une revue hal-00966527v1

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, Sep 2013, Palermo, Italy

Communication dans un congrès hal-00844211v1

On shortening u-cycles and u-words for permutations

Sergey Kitaev , Vladimir Potapov , Vincent Vajnovszki

Discrete Applied Mathematics, 2019, 260, pp.203-213. ⟨10.1016/j.dam.2019.01.025⟩

Article dans une revue hal-02416426v1

Gray codes for Fibonacci q-decreasing words

Jean-Luc Baril , Sergey Kirgizov , Vincent Vajnovszki

Theoretical Computer Science, 2022, 927, pp.120-132. ⟨10.1016/j.tcs.2022.06.003⟩

Article dans une revue hal-03114503v1

Gray coding cubic planar maps

Sergey Avgustinovich , Sergey Kitaev , Vladimir N. Potapov , Vincent Vajnovszki

Theoretical Computer Science, 2016, 616, pp.59 - 69. ⟨10.1016/j.tcs.2015.12.013⟩

Article dans une revue hal-01431171v1

Generating involutions, derangements, and relatives by ECO

Vincent Vajnovszki

Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.109-122. ⟨10.46298/dmtcs.479⟩

Article dans une revue hal-00824068v1

The equidistribution of some length-three vincular patterns on S n (132)

Vincent Vajnovszki

Information Processing Letters, 2018, 130, pp.40 - 45. ⟨10.1016/j.ipl.2017.10.005⟩

Article dans une revue hal-01862223v1

A permutation code preserving a double Eulerian bistatistic

Jean-Luc Baril , Vincent Vajnovszki

Discrete Applied Mathematics, 2016, 224, pp.9-15. ⟨10.1016/j.dam.2017.02.014⟩

Article dans une revue hal-02415298v1

Restricted Steinhaus-Johnson-Trotter list

Ahmad Sabri , Vincent Vajnovszki

ICGT, Jun 2014, Grenoble, France

Communication dans un congrès hal-01202881v1

A Gray Code for cross-bifix-free sets

Antonio Bernini , Stefano Bilotta , Renzo Pinzani , Vincent Vajnovszki

Mathematical Structures in Computer Science, 2014, ⟨10.1017/S0960129515000067⟩

Article dans une revue hal-01071362v1

Mahonian STAT on rearrangement class of words

Shishuo Fu , Ting Hua , Vincent Vajnovszki

Discrete Applied Mathematics, 2019, 270, pp.134-141. ⟨10.1016/j.dam.2019.06.010⟩

Article dans une revue hal-02416400v1

Loop-free Gray code algorithm for e-restricted growth fonctions

Vincent Vajnovszki , Toufik Mansour , Georges Nassar

Information Processing Letters, 2011, 111 (11), pp.541-544. ⟨10.1016/j.ipl.2011.03.006⟩

Article dans une revue istex hal-00790765v1

Descent distribution on Catalan words avoiding a pattern of length at most three

Jean-Luc Baril , Sergey Kirgizov Kirgizov , Vincent Vajnovszki

Discrete Mathematics, 2018, 341 (9), pp.2608 - 2615. ⟨10.1016/j.disc.2018.06.001⟩

Article dans une revue hal-01923911v1

An efficient Gray code algorithm for generating all permutations with a given major index

Vincent Vajnovszki

Journal of Discrete Algorithms, 2014, 26, pp.77-88. ⟨10.1016/j.jda.2014.01.001⟩

Article dans une revue hal-01001561v1

Mahonian STAT on words

Sergey Kitaev , Vincent Vajnovszki

Information Processing Letters, 2016, 116 (2), pp.157 - 162. ⟨10.1016/j.ipl.2015.09.006⟩

Article dans une revue hal-01418254v1

Equipopularity of descent-equivalent patterns over descent-equivalence classes of words and permutations

Jean-Luc Baril , Vincent Vajnovszki

Graph Theory, Combinatorics and Applications, GTCA, Oct 2019, Al Ain, United Arab Emirates

Communication dans un congrès hal-02418786v1

Gray codes for order p Lucas strings

Jean-Luc Baril , Vincent Vajnovszki

International Conference on Combinatorics on Words, Aug 2003, Turku, Finland

Communication dans un congrès hal-02415322v1

A new vincular pattern based Mahonian statistic on words

Vincent Vajnovszki , Srečko Brlek

Kolloquium über Kombinatorik, Nov 2013, Ilmenau, Germany. pp.32

Communication dans un congrès hal-00906715v1

More Restricted Growth Functions: Gray Codes and Exhaustive Generation

Ahmad Sabri , Vincent Vajnovszki

Graphs and Combinatorics, 2017, 33 (3), pp.573 - 582. ⟨10.1007/s00373-017-1774-7⟩

Article dans une revue hal-01552981v1

Minimal change list for Lucas Strings and some graph theoritic consequences

Jean-Luc Baril , Vincent Vajnovszki

Theoretical Computer Science, 2005, 346 (2-3), pp.189-199. ⟨10.1016/j.tcs.2005.08.020⟩

Article dans une revue istex hal-02413711v1

Reflected Gray codes for q-ary words avoiding a given factor

Vincent Vajnovszki , Stefano Bilotta , Renzo Pinzani , Ahmad Sabri , Antonio Bernini

Acta Informatica, 2015, 52 (7), pp.573-592. ⟨10.1007/s00236-015-0225-2⟩

Article dans une revue hal-01202888v1

On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order

Ahmad Sabri , Vincent Vajnovszki

Pure Mathematics and Applications, 2019, 28 (1), pp.109-119. ⟨10.1515/puma-2015-0035⟩

Article dans une revue hal-02416502v1

Popularity of patterns over d-equivalence classes of words and permutations

Jean-Luc Baril , Vincent Vajnovszki

Theoretical Computer Science, 2020, 814, pp.249-258. ⟨10.1016/j.tcs.2020.02.005⟩

Article dans une revue hal-02639981v1

Restricted compositions and permutations: from old to new Gray codes

Vajnovszki Vincent , Rémi Vernay

Information Processing Letters, 2011, 111 (13), pp.650-655. ⟨10.1016/j.ipl.2011.03.022⟩

Article dans une revue istex hal-00790762v1

ECO-based Gray codes generation for particular classes of words

Vincent Vajnovszki

GASCom, Jun 2012, Bordeaux, France

Communication dans un congrès hal-00824065v1

Filtrer vos résultats

An introduction to Dyck paths with air pockets

Generalized Schröder permutations

Reflected Gray code based orders on some restricted growth sequences

Patterns in treeshelves

Asymptotic bit frequency in Fibonacci words

Gray code order for Lyndon words

Two Gray codes for q-ary k-generalized Fibonacci strings

On shortening u-cycles and u-words for permutations

Gray codes for Fibonacci q-decreasing words

Gray coding cubic planar maps

Generating involutions, derangements, and relatives by ECO

The equidistribution of some length-three vincular patterns on S n (132)

A permutation code preserving a double Eulerian bistatistic

Restricted Steinhaus-Johnson-Trotter list

A Gray Code for cross-bifix-free sets

Mahonian STAT on rearrangement class of words

Loop-free Gray code algorithm for e-restricted growth fonctions

Descent distribution on Catalan words avoiding a pattern of length at most three

An efficient Gray code algorithm for generating all permutations with a given major index

Mahonian STAT on words

Equipopularity of descent-equivalent patterns over descent-equivalence classes of words and permutations

Gray codes for order p Lucas strings

A new vincular pattern based Mahonian statistic on words

More Restricted Growth Functions: Gray Codes and Exhaustive Generation

Minimal change list for Lucas Strings and some graph theoritic consequences

Reflected Gray codes for q-ary words avoiding a given factor

On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order

Popularity of patterns over d-equivalence classes of words and permutations

Restricted compositions and permutations: from old to new Gray codes

ECO-based Gray codes generation for particular classes of words