The visibility parameter for words and permutations

Central European Journal of Mathematics

Volumn 11, Issue 2, 2013, Pages 283-295

  Cristea, Ligia L ^a   Prodinger, Helmut ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b STELLENBOSCH UNIVERSITY   (South Africa)

Author keywords

Permutations; q enumeration; Words

Indexed keywords

EID: 84870391213     PISSN: 18951074     EISSN: 16443616     Source Type: Journal    
DOI: 10.2478/s11533-012-0135-2     Document Type: Article

References (7)

1. Flajolet Ph., Martin G. N., Probabilistic counting algorithms for data base applications, J. Comput. System Sci., 1985, 31(2), 182-209.
2. Graham R. L., Knuth D. E., Patashnik O., Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, 1994.
3. Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics on words, Phys. A, 2011, 390(12), 2421-2428.
4. Prodinger H., Combinatorics of geometrically distributed random variables: left-to-right maxima, In: 5th Conference on Formal Power Series and Algebraic Combinatorics, Florence, June 21-25, 1993, Discrete Math., Elsevier, Amsterdam, 1996, 153(1-3), 253-270.
5. Prodinger H., A q-analogue of the path length of binary search trees, Algorithmica, 2001, 31(3), 433-441.
6. Prodinger H., Combinatorics of geometrically distributed random variables: inversions and a parameter of Knuth, Ann. Comb., 2001, 5(2), 241-250.
7. Pugh W., Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, 1990, 33(6), 668-676.