1k citations
- A. Sopczak2 profiles64 · h 83
- B. Åsman9 profiles63 · h 98
- L. Mundim2 profiles61 · h 124
- M. Begalli5 profiles61 · h 68
- M. Besançon2 profiles61 · h 132
- Y. Arnoud2 profiles61 · h 42
- D. Wicke5 profiles60 · h 64
- P. Verdier2 profiles60 · h 114
- P. Jonsson5 profiles57 · h 54
- D. Schaile7 profiles54 · h 87
- A. Meyer3 profiles46 · h 142
- C. Bélanger-Champagne2 profiles46 · h 92
- Stockholm UniversitySE72 papers
- Centre National de la Recherche ScientifiqueFR71 papers
- Joint Institute for Nuclear ResearchRU69 papers
- Lund UniversitySE68 papers
- University of WuppertalDE65 papers
- Iowa State UniversityUS64 papers
- Sorbonne UniversitéFR64 papers
- Charles UniversityCZ63 papers
- Lancaster UniversityGB63 papers
- Lyon 1 UniversitéFR62 papers
- Universidade do Estado do Rio de JaneiroBR62 papers
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ59 papers
Showing 2008 · math.COShow all
3 papers · 2 filters
math.CO2008★ 1 cited
Generalized Stirling permutations, families of increasing trees and urn models
Svante Janson, Markus Kuba, Alois Panholzer
Bona [2007+] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [1978]. Recently, Janson [2008+] sho…
math.CO2008
On the size of identifying codes in binary hypercubes
Svante Janson, Tero Laihonen
We consider identifying codes in binary Hamming spaces F^n, i.e., in binary hypercubes. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 199…
math.CO2008★ 15 cited
Plane recursive trees, Stirling permutations and an urn model
Svante Janson
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for th…