PINZANI, RENZO
 Distribuzione geografica
Continente #
NA - Nord America 10.570
EU - Europa 5.478
AS - Asia 3.694
SA - Sud America 443
Continente sconosciuto - Info sul continente non disponibili 170
AF - Africa 104
OC - Oceania 81
Totale 20.540
Nazione #
US - Stati Uniti d'America 10.453
RU - Federazione Russa 1.712
IT - Italia 1.503
SG - Singapore 1.024
CN - Cina 974
HK - Hong Kong 610
IE - Irlanda 471
SE - Svezia 364
BR - Brasile 352
VN - Vietnam 325
KR - Corea 319
PL - Polonia 302
UA - Ucraina 293
DE - Germania 272
FR - Francia 200
FI - Finlandia 136
IN - India 117
GB - Regno Unito 103
AU - Australia 81
CA - Canada 63
JP - Giappone 49
BD - Bangladesh 47
TR - Turchia 42
AR - Argentina 32
JO - Giordania 32
ID - Indonesia 31
IQ - Iraq 31
CH - Svizzera 25
CI - Costa d'Avorio 24
CO - Colombia 24
MX - Messico 23
NL - Olanda 20
EC - Ecuador 15
ES - Italia 14
SC - Seychelles 14
ZA - Sudafrica 14
BE - Belgio 13
PK - Pakistan 13
IS - Islanda 11
MA - Marocco 10
VE - Venezuela 10
PH - Filippine 9
SA - Arabia Saudita 9
NG - Nigeria 8
CR - Costa Rica 7
EE - Estonia 7
MG - Madagascar 7
EG - Egitto 6
IR - Iran 6
DZ - Algeria 5
JM - Giamaica 5
MY - Malesia 5
AE - Emirati Arabi Uniti 4
AL - Albania 4
AT - Austria 4
AZ - Azerbaigian 4
BJ - Benin 4
BY - Bielorussia 4
PR - Porto Rico 4
PY - Paraguay 4
UZ - Uzbekistan 4
BG - Bulgaria 3
DK - Danimarca 3
GT - Guatemala 3
HN - Honduras 3
IL - Israele 3
KE - Kenya 3
KG - Kirghizistan 3
KW - Kuwait 3
KZ - Kazakistan 3
NP - Nepal 3
OM - Oman 3
PS - Palestinian Territory 3
TH - Thailandia 3
TW - Taiwan 3
UY - Uruguay 3
AM - Armenia 2
BB - Barbados 2
BH - Bahrain 2
GE - Georgia 2
HU - Ungheria 2
LV - Lettonia 2
MD - Moldavia 2
MO - Macao, regione amministrativa speciale della Cina 2
MU - Mauritius 2
NI - Nicaragua 2
NO - Norvegia 2
PA - Panama 2
PT - Portogallo 2
AO - Angola 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BZ - Belize 1
CG - Congo 1
CL - Cile 1
ET - Etiopia 1
EU - Europa 1
GA - Gabon 1
LK - Sri Lanka 1
LU - Lussemburgo 1
Totale 20.360
Città #
Santa Clara 3.275
Singapore 700
Fairfield 666
Ashburn 646
San Jose 605
Chandler 552
Hong Kong 531
Dublin 471
Jacksonville 402
Seoul 317
Florence 314
Woodbridge 307
Warsaw 300
Seattle 289
Hefei 272
Cambridge 242
Houston 222
Wilmington 219
Milan 207
Beijing 170
Los Angeles 157
Princeton 139
Kent 133
Council Bluffs 122
Lauterbourg 122
Ann Arbor 121
Buffalo 120
The Dalles 120
Ho Chi Minh City 115
Altamura 109
Lawrence 95
Dallas 94
Boston 85
Melbourne 81
Mumbai 79
Rome 75
Hanoi 73
Staranzano 64
Boardman 55
Moscow 54
New York 52
Munich 50
San Diego 50
Medford 48
Clifton 38
West Jordan 36
Phoenix 31
Shanghai 31
Columbus 28
São Paulo 28
Izmir 27
Jakarta 26
Tokyo 25
Abidjan 24
Helsinki 24
Bern 22
Bologna 22
Frankfurt Am Main 22
Frankfurt am Main 21
Osaka 20
Yubileyny 19
Haiphong 18
Naples 18
Brooklyn 17
Chicago 17
Paris 17
Figino 16
Prato 16
Andover 14
Capannori 14
Da Nang 14
Falls Church 14
Hillsboro 14
Siena 14
Turin 14
Bari 13
Bogotá 13
Chennai 13
Norwalk 13
Orem 13
Portsmouth 13
Redondo Beach 13
Tianjin 13
Palermo 12
Philadelphia 12
Venice 12
Auburn Hills 11
Belo Horizonte 11
Miano 11
Montreal 11
Padua 11
Brussels 10
Catania 10
Figline Valdarno 10
Guangzhou 10
London 10
Rio de Janeiro 10
Toronto 10
Verona 10
Curitiba 9
Totale 13.865
Nome #
Recurrence relations, succession rules and the positivity problem 297
CHARACTERIZATION AND ENUMERATION OF SOME CLASSES OF PERMUTOMINOES 292
A 2D non-overlapping code over a q-ary alphabet 285
Cross-bifix-free sets in two dimensions 265
Pattern-avoiding Dyck paths 256
Cross-bifix-free sets generation via Motzkin paths 251
ECO: a methodology for the enumeration of combinatorial objects 250
A GENERAL EXHAUSTIVE GENERATION ALGORITHM FOR GRAY STRUCTURES 242
DIRECTED COLUMN-CONVEX POLYOMINOES BY RECURRENCE RELATIONS 239
A CHARACTERIZATION OF BINARY SEARCH NETWORKS 230
The Motzkin family 228
A new approach to cross-bifix-free sets 225
A Gray code for cross-bifix-free sets 218
The random generation of underdiagonal walks 216
Non-overlapping matrices 213
A PHYSICAL STRUCTURE FOR EFFICIENT PROCESSING OF RELATIONAL QUERIES 211
A linear operator approach to succession rules 207
TOWARDS A METHODOLOGY FOR TREE ENUMERATION 206
A methodology for plane tree enumeration 204
Enumerating permutations avoiding three Babson-Steingrimsson patterns 203
A generating function for bit strings with no Grand Dyck pattern matching 203
A closed formula for the number of convex permutominoes 202
Recurrence relations, succession rules, and the positivity problem 202
A bijective approach to the area of generalized Motzkin paths 201
Exhaustive generation of some lattice paths and their prefixes 201
Avoiding cross-bifix-free binary words 201
ABOUT HALF THE MIDDLE BINOMIAL COEFFICIENT 198
A Bijection for Some Paths on the Slit Plane 197
Catalan pairs: a relational-theoretic approach to Catalan numbers 197
A BIJECTION FOR DIRECTED-CONVEX POLYOMINOES 196
An algebraic characterization of the set of succession rules 194
Catalan structures and Catalan pairs 193
A gray code for a regular language 192
The random generation of directed animals 190
THE RANDOM GENERATION OF UNDERDIAGONAL WALKS 189
Catalan structures and Catalan pairs 188
Reconstructing digital sets from X-rays 187
A COMBINATORIAL INTERPRETATION OF THE AREA OF SCHRÖDER PATHS 184
Prefix partitioned gray codes for particular cross-bifix-free sets 183
Catalan lattices on series parallel interval orders 182
INDEX SELECTION IN A DISTRIBUTED DATA BASE 181
Combinatorial properties of Catalan pairs 180
Approximating algebraic functions by means of rational ones 178
Gray code orders for q-ary words avoiding a given factor 173
A CONSTRUCTION FOR ENUMERATING K-COLORED MOTZKIN PATHS 173
RECONSTRUCTING CONVEX POLYOMINOES FROM HORIZONTAL AND VERTICAL PROJECTIONS II 173
A Construction for Variable Dimension Strong Non-Overlapping Matrices 172
A trace partitioned Gray code forq-ary generalized Fibonacci strings 172
X-rays characterizing some classes of discrete sets 171
Polyominoes defined by their vertical and horizontal projections 170
A bijection for the total area of parallelogram polyominoes 170
From Motzkin to Catalan permutations 169
Optimal selection of secondary indexes 169
Jumping succession rules and their generating functions 168
Enumeration of some classes of words avoiding two generalized patterns of length 3 167
Generation and Enumeration of Some Classes of Interval Orders 166
DENOMBREMENT DES COUPLES DE VECTEURS DEFINISSANT DES POLYOMINOS 166
A note on rational succession rules 164
Index selection in a distributed relational database 162
Polyominoes determined by permutations: enumeration via bijections 162
Exhaustive generation of positive lattice paths 162
Binary words avoiding a pattern and marked succession rule 161
Stirling numbers interpolation using permutations with forbidden subsequences 160
A construction for a class of binary words avoiding 1^j 0^i 158
The average height of directed column-convex polyominoes having square, hexagonal and triangular cells 158
Une série géneratrice pour la hauteur des polyominos dvc 157
Vexillary involutions are enumerated by Motzkin numbers 157
Enumerative results on integer partitions using the ECO method 156
Pattern 1^j 0^i avoiding binary words 156
Some combinatorial interpretations of q-analogs of Schröder numbers 155
Catalan-like numbers and succession rules 154
Catalan-like numbers and succession rules 154
Medians of polyominoes: a property for the reconstruction 153
Pattern 1^{j+1}0^j avoiding binary words 152
A Strong Non-overlapping Dyck Code 152
Dyck Paths Enumerated by the Q-bonacci Numbers 151
A SET OF WELL-DEFINED OPERATIONS ON SUCCESSION RULES 151
THE INVERSION NUMBER OF SOME PERMUTATIONS WITH FORBIDDEN SUBSEQUENCES 151
OPTIMAL SELECTION OF SECONDARY INDICES IN RELATIONAL DATABASES 151
Some permutation with forbidden subsequences and their inversion number 151
Nondecreasing Dyck paths and q-Fibonacci numbers 151
A positivity condition for C-finite recurrences 151
Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method 150
Steep polyominoes, q-Motzkin numbers and q-Bessel functions 150
From C_n to n!: permutations avoiding S_j(j+1)(j+2) 148
EXHAUSTIVE GENERATION OF SOME REGULAR LANGUAGES BY USING NUMERATION SYSTEMS 148
SOME COMBINATORIAL INTERPRETATIONS OF Q-ANALOGUES OF SCHROEDER NUMBERS 147
Enumeration of some classes of words avoiding two generalized patterns 146
Lattice paths moments by cut and paste 145
Permutations avoiding an increasing number of length-increasing forbidden subsequences 144
CHEMINS DE SCHRÖDER ET HIÉRARCHIES ALÉATOIRES 143
Mixed succession rules: the commutative case 143
A tiling system for the class of L-convex polyominoes 142
Sequences from Fibonacci to Catalan: A combinatorial interpretation via Dyck paths 139
Reconstructing convex polyominoes from their vertical and horizontal projections 139
Lattices of lattice paths 139
Strings from Linear Recurrences: A Gray Code 138
Strings from linear recurrences and permutations: A Gray code 137
Polyominoes determined by permutations 136
Permutations Defining Convex Permutominoes 136
Totale 17.996
Categoria #
all - tutte 54.548
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 54.548


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022638 0 0 20 36 39 56 61 49 28 24 132 193
2022/20232.077 202 319 48 196 205 400 265 124 211 14 46 47
2023/2024709 43 83 105 34 28 68 17 116 7 62 132 14
2024/20256.645 188 507 312 712 2.290 1.432 95 416 211 102 216 164
2025/20265.440 541 836 623 327 502 155 628 201 531 255 106 735
2026/2027686 139 181 366 0 0 0 0 0 0 0 0 0
Totale 20.540