Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Vajnovszki, Vincent"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized Schröder permutations
Elena Barcucci
,
Vincent Vajnovszki
Theoretical Computer Science
502
, 2013, pp. 210-216
Efficient generation of restricted growth words
Toufik Mansour
,
Vincent Vajnovszki
Information Processing Letters
113
(17), 2013, pp. 613-616
Loop-free Gray code algorithm for the
\bf e
-restricted growth functions
Toufik Mansour
,
Ghalib Nassar
,
Vincent Vajnovszki
Information Processing Letters
111
(11), 2011, pp. 541-544
More restrictive Gray codes for necklaces and Lyndon words
Vincent Vajnovszki
Information Processing Letters
106
(3), 2008, pp. 96-99
Minimal change list for Lucas strings and some graph theoretic consequences
Jean-Luc Baril
,
Vincent Vajnovszki
Theoretical Computer Science
346
(2-3), 2005, pp. 189-199
A loopless algorithm for generating the permutations of a multiset
Vincent Vajnovszki
Theoretical Computer Science
307
(2), 2003, pp. 415-431
Systolic generation of
k
-ary trees
Vincent Vajnovszki
,
Chris Philips
Parallel Processing Letters
9
(1), 1999, pp. 93-101
Parallel algorithms for listing well-formed parentheses strings
Vincent Vajnovszki
,
Jean Pallo
Parallel Processing Letters
8
(1), 1998, pp. 19-28
On the loopless generation of binary tree sequences
Vincent Vajnovszki
Information Processing Letters
68
(3), 1998, pp. 113-117