The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vincent Vajnovszki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vincent Vajnovszki
    Gray visiting Motzkins. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:11/12, pp:793-811 [Journal]
  2. Jean-Luc Baril, Vincent Vajnovszki
    Gray code for derangements. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:207-221 [Journal]
  3. Vincent Vajnovszki
    Constant Time Generation of Binary Unordered Trees. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:57, n:, pp:- [Journal]
  4. Vincent Vajnovszki
    On the Loopless Generation of Binary Tree Sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:3, pp:113-117 [Journal]
  5. Vincent Vajnovszki, Timothy Walsh
    A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:633-648 [Journal]
  6. Vincent Vajnovszki
    Generating a Gray Code for P-Sequences. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2002, v:1, n:1, pp:31-41 [Journal]
  7. Vincent Vajnovszki, Jean Marcel Pallo
    Parallel Algorithms for Listing Well-Formed Parentheses Strings. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:1, pp:19-28 [Journal]
  8. Vincent Vajnovszki, Chris Phillips
    Systolic Generation of k-Ary Trees. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:93-101 [Journal]
  9. Jean-Luc Baril, Vincent Vajnovszki
    Minimal change list for Lucas strings and some graph theoretic consequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:346, n:2-3, pp:189-199 [Journal]
  10. Vincent Vajnovszki
    A loopless algorithm for generating the permutations of a multiset. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:415-431 [Journal]
  11. Toufik Mansour, Vincent Vajnovszki
    Restricted 123-avoiding Baxter permutations and the Padovan numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1430-1440 [Journal]

  12. Some Generalizations of a Simion-Schmidt Bijection. [Citation Graph (, )][DBLP]


  13. Gray Code Order for Lyndon Words. [Citation Graph (, )][DBLP]


  14. Generating restricted classes of involutions, Bell and Stirling permutations. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002