default search action
Vincent Vajnovszki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong:
Greedy Gray Codes for some Restricted Classes of Binary Words. GASCom 2024: 108-112 - 2023
- [c5]Vincent Vajnovszki, Dennis Wong:
Greedy Gray Codes for Dyck Words and Ballot Sequences. COCOON (2) 2023: 29-40 - 2022
- [j44]Phan-Thuan Do, Thi Thu Huong Tran
, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. Discret. Math. 345(2): 112684 (2022) - [j43]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Gray codes for Fibonacci q-decreasing words. Theor. Comput. Sci. 927: 120-132 (2022) - [i18]Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki:
Enumeration of Dyck paths with air pockets. CoRR abs/2202.06893 (2022) - [i17]Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki:
Grand Dyck paths with air pockets. CoRR abs/2211.04914 (2022) - 2021
- [j42]Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki:
Catalan words avoiding pairs of length three patterns. Discret. Math. Theor. Comput. Sci. 22(2) (2021) - [j41]Jean-Luc Baril, Giulio Cerbai
Catalan and Schröder permutations sortable by two restricted stacks. Inf. Process. Lett. 171: 106138 (2021) - [i16]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. CoRR abs/2103.10357 (2021) - [i15]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Asymptotic bit frequency in Fibonacci words. CoRR abs/2106.13550 (2021) - 2020
- [j40]Jean-Luc Baril, Vincent Vajnovszki:
Popularity of patterns over d-equivalence classes of words and permutations. Theor. Comput. Sci. 814: 249-258 (2020) - [i14]Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki:
Catalan and Schröder permutations sortable by two restricted stacks. CoRR abs/2004.01812 (2020) - [i13]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Gray codes for Fibonacci q-decreasing words. CoRR abs/2010.09505 (2020)
2010 – 2019
- 2019
- [j39]Sergey Kitaev
On shortening u-cycles and u-words for permutations. Discret. Appl. Math. 260: 203-213 (2019) - [j38]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding (colored) regular sets of patterns. Discret. Appl. Math. 268: 44-53 (2019) - [j37]Shishuo Fu
Mahonian STAT on rearrangement class of words. Discret. Appl. Math. 270: 134-141 (2019) - [i12]Jean-Luc Baril, Vincent Vajnovszki:
Popularity of patterns over d-equivalence classes of words and permutations. CoRR abs/1911.05067 (2019) - [i11]Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki:
Catalan words avoiding pairs of length three patterns. CoRR abs/1912.10447 (2019) - 2018
- [j36]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Descent distribution on Catalan words avoiding a pattern of length at most three. Discret. Math. 341(9): 2608-2615 (2018) - [j35]Vincent Vajnovszki:
The equidistribution of some length-three vincular patterns on Sn(132). Inf. Process. Lett. 130: 40-45 (2018) - [c4]Ahmad Sabri, Vincent Vajnovszki:
Exhaustive generation for ballot sequences in lexicographic and Gray code order. GASCom 2018: 195-201 - [i10]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Descent distribution on Catalan words avoiding a pattern of length at most three. CoRR abs/1803.06706 (2018) - [i9]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding a (colored) regular sets of patterns. CoRR abs/1809.00742 (2018) - 2017
- [j34]Jean-Luc Baril, Vincent Vajnovszki:
A permutation code preserving a double Eulerian bistatistic. Discret. Appl. Math. 224: 9-15 (2017) - [j33]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Patterns in treeshelves. Discret. Math. 340(12): 2946-2954 (2017) - [j32]Ahmad Sabri
More Restricted Growth Functions: Gray Codes and Exhaustive Generation. Graphs Comb. 33(3): 573-582 (2017) - [j31]Antonio Bernini
A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27(2): 184-196 (2017) - [c3]Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations. MACIS 2017: 306-319 - [i8]Shishuo Fu, Ting Hua, Vincent Vajnovszki:
Mahonian STAT on rearrangement class of words. CoRR abs/1708.07928 (2017) - 2016
- [j30]Sergey Kitaev
Mahonian STAT on words. Inf. Process. Lett. 116(2): 157-162 (2016) - [j29]Sergey V. Avgustinovich, Sergey Kitaev
Gray coding cubic planar maps. Theor. Comput. Sci. 616: 59-69 (2016) - [i7]Jean-Luc Baril, Vincent Vajnovszki:
A permutation code preserving a double Eulerian bistatistic. CoRR abs/1606.07913 (2016) - [i6]Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Patterns in treeshelves. CoRR abs/1611.07793 (2016) - 2015
- [j28]Antonio Bernini
Gray code orders for q-ary words avoiding a given factor. Acta Informatica 52(7-8): 573-592 (2015) - [j27]Ahmad Sabri
Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences. Comput. J. 58(5): 1099-1111 (2015) - [i5]Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki:
Gray coding planar maps. CoRR abs/1509.05807 (2015) - 2014
- [j26]Antonio Bernini
Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6(4): 359-369 (2014) - [j25]Vincent Vajnovszki:
An efficient Gray code algorithm for generating all permutations with a given major index. J. Discrete Algorithms 26: 77-88 (2014) - [i4]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki:
A Gray Code for cross-bifix-free sets. CoRR abs/1401.4650 (2014) - [i3]Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki:
Gray code orders for $q$-ary words avoiding a given factor. CoRR abs/1404.0823 (2014) - [i2]Sergey Kitaev, Vincent Vajnovszki:
Mahonian STAT on words. CoRR abs/1408.4290 (2014) - [i1]Vincent Vajnovszki:
The equidistribution of some length three vincular patterns on $S_n(132)$. CoRR abs/1412.3512 (2014) - 2013
- [j24]Vincent Vajnovszki:
Lehmer code transforms and Mahonian statistics on permutations. Discret. Math. 313(5): 581-589 (2013) - [j23]Toufik Mansour
Efficient generation of restricted growth words. Inf. Process. Lett. 113(17): 613-616 (2013) - [j22]Elena Barcucci, Vincent Vajnovszki:
Generalized Schröder permutations. Theor. Comput. Sci. 502: 210-216 (2013) - 2011
- [j21]Vincent Vajnovszki:
A new Euler-Mahonian constructive bijection. Discret. Appl. Math. 159(14): 1453-1459 (2011) - [j20]Toufik Mansour
Loop-free Gray code algorithm for the e-restricted growth functions. Inf. Process. Lett. 111(11): 541-544 (2011) - [j19]Vincent Vajnovszki, Rémi Vernay:
Restricted compositions and permutations: From old to new Gray codes. Inf. Process. Lett. 111(13): 650-655 (2011) - 2010
- [j18]Vincent Vajnovszki:
Generating involutions, derangements, and relatives by ECO. Discret. Math. Theor. Comput. Sci. 12(1): 109-122 (2010) - [j17]Maddalena Poneti, Vincent Vajnovszki:
Generating restricted classes of involutions, Bell and Stirling permutations. Eur. J. Comb. 31(2): 553-564 (2010)
2000 – 2009
- 2008
- [j16]Vincent Vajnovszki:
More restrictive Gray codes for necklaces and Lyndon words. Inf. Process. Lett. 106(3): 96-99 (2008) - [j15]W. M. B. Dukes
Combinatorial Gray codes for classes of pattern avoiding permutations. Theor. Comput. Sci. 396(1-3): 35-49 (2008) - [c2]Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Taoufik Saidani
Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques). SITIS 2008: 338-343 - 2007
- [j14]Asep Juarna, Vincent Vajnovszki:
Some Generalizations of a Simion-Schmidt Bijection. Comput. J. 50(5): 574-580 (2007) - [j13]Toufik Mansour
Restricted 123-avoiding Baxter permutations and the Padovan numbers. Discret. Appl. Math. 155(11): 1430-1440 (2007) - [j12]Vincent Vajnovszki:
Gray Code Order for Lyndon Words. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - 2006
- [j11]Vincent Vajnovszki, Timothy Walsh:
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. J. Discrete Algorithms 4(4): 633-648 (2006) - 2005
- [j10]Jean-Luc Baril, Vincent Vajnovszki:
Minimal change list for Lucas strings and some graph theoretic consequences. Theor. Comput. Sci. 346(2-3): 189-199 (2005) - 2004
- [j9]Jean-Luc Baril, Vincent Vajnovszki:
Gray code for derangements. Discret. Appl. Math. 140(1-3): 207-221 (2004) - 2003
- [j8]Vincent Vajnovszki:
A loopless algorithm for generating the permutations of a multiset. Theor. Comput. Sci. 307(2): 415-431 (2003) - [e1]Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki:
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings. Lecture Notes in Computer Science 2731, Springer 2003, ISBN 3-540-40505-4 [contents] - 2002
- [j7]Vincent Vajnovszki:
Gray visiting Motzkins. Acta Informatica 38(11/12): 793-811 (2002) - [j6]Vincent Vajnovszki:
Generating a Gray Code for P-Sequences. J. Math. Model. Algorithms 1(1): 31-41 (2002) - 2001
- [c1]Vincent Vajnovszki:
A Loopless Generation of Bitstrings without p Consecutive Ones. DMTCS 2001: 227-240
1990 – 1999
- 1999
- [j5]Vincent Vajnovszki, Chris Phillips:
Systolic Generation of k-Ary Trees. Parallel Process. Lett. 9(1): 93-101 (1999) - 1998
- [j4]Vincent Vajnovszki:
On the Loopless Generation of Binary Tree Sequences. Inf. Process. Lett. 68(3): 113-117 (1998) - [j3]Vincent Vajnovszki, Jean Marcel Pallo:
Parallel Algorithms for Listing Well-Formed Parentheses Strings. Parallel Process. Lett. 8(1): 19-28 (1998) - 1995
- [j2]Vincent Vajnovszki:
Le codage des arbres binaires. Comput. Sci. J. Moldova 3(2): 194-209 (1995) - [j1]Vincent Vajnovszki:
Constant Time Generation of Binary Unordered Trees. Bull. EATCS 57 (1995)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: