IRIS Institutional Research Information System - AIR Archivio Istituzionale della Ricerca

PIGHIZZINI, GIOVANNI
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 7.808
NA - Nord America 6.094
AS - Asia 5.526
SA - Sud America 507
AF - Africa 78
Continente sconosciuto - Info sul continente non disponibili 10
OC - Oceania 10
Totale 20.033
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.960
GB - Regno Unito 2.788
IT - Italia 1.773
SG - Singapore 1.768
CN - Cina 1.705
SE - Svezia 731
RU - Federazione Russa 586
HK - Hong Kong 464
DE - Germania 447
BR - Brasile 360
VN - Vietnam 356
FR - Francia 349
IN - India 280
UA - Ucraina 280
KR - Corea 239
NL - Olanda 231
IE - Irlanda 214
TR - Turchia 207
BD - Bangladesh 201
FI - Finlandia 139
EU - Europa 91
ID - Indonesia 84
CA - Canada 82
JP - Giappone 65
CO - Colombia 54
DK - Danimarca 45
AT - Austria 38
AR - Argentina 37
IQ - Iraq 28
PL - Polonia 24
CH - Svizzera 23
ES - Italia 23
MX - Messico 23
CZ - Repubblica Ceca 22
BE - Belgio 21
EC - Ecuador 19
SA - Arabia Saudita 19
ZA - Sudafrica 17
CI - Costa d'Avorio 14
MA - Marocco 13
PH - Filippine 12
PK - Pakistan 12
IR - Iran 10
RO - Romania 10
UZ - Uzbekistan 10
AE - Emirati Arabi Uniti 9
CL - Cile 9
GR - Grecia 9
HU - Ungheria 9
LU - Lussemburgo 9
NP - Nepal 9
AU - Australia 8
MY - Malesia 8
SK - Slovacchia (Repubblica Slovacca) 8
VE - Venezuela 8
AZ - Azerbaigian 7
PE - Perù 7
PY - Paraguay 6
SC - Seychelles 6
BG - Bulgaria 5
JM - Giamaica 5
KE - Kenya 5
LV - Lettonia 5
NO - Norvegia 5
TN - Tunisia 5
BO - Bolivia 4
CR - Costa Rica 4
DZ - Algeria 4
KZ - Kazakistan 4
TW - Taiwan 4
AL - Albania 3
HN - Honduras 3
PA - Panama 3
SN - Senegal 3
TH - Thailandia 3
TT - Trinidad e Tobago 3
BB - Barbados 2
CG - Congo 2
DO - Repubblica Dominicana 2
EE - Estonia 2
EG - Egitto 2
GA - Gabon 2
IL - Israele 2
KG - Kirghizistan 2
KW - Kuwait 2
LB - Libano 2
LT - Lituania 2
MK - Macedonia 2
NZ - Nuova Zelanda 2
PT - Portogallo 2
QA - Qatar 2
SY - Repubblica araba siriana 2
UY - Uruguay 2
XK - ???statistics.table.value.countryCode.XK??? 2
AM - Armenia 1
AO - Angola 1
AW - Aruba 1
BH - Bahrain 1
BM - Bermuda 1
BN - Brunei Darussalam 1
Totale 20.096
Salva come PNG Salva come JPEG
Città #
Southend 2.643
Singapore 1.007
Milan 773
Chandler 458
Hong Kong 442
Dallas 426
Ashburn 382
Seattle 370
San Jose 323
Beijing 277
Princeton 276
Council Bluffs 261
Wilmington 242
Santa Clara 220
Dublin 212
Fairfield 189
Jacksonville 180
Bengaluru 148
Lauterbourg 133
Redmond 132
Los Angeles 125
Ann Arbor 115
Woodbridge 114
Mountain View 112
Des Moines 111
Hefei 111
Phoenix 100
Buffalo 99
Nanjing 99
Cambridge 98
Houston 95
Moscow 90
Hanoi 85
Ho Chi Minh City 79
Medford 75
Rome 70
Sakarya 69
Guangzhou 66
Boardman 65
New York 65
Seoul 57
Andover 56
Shanghai 52
Serra 50
Bogotá 46
Dearborn 45
Jakarta 45
Cangzhou 44
Tianjin 43
Nanchang 42
Frankfurt am Main 40
Hebei 37
The Dalles 37
Columbus 35
Ottawa 33
Tokyo 33
Helsinki 32
Jinan 31
Shenyang 30
Turin 29
Somerville 27
São Paulo 26
Eitensheim 22
San Diego 22
Seongnam 22
Changsha 21
Brescia 20
Dong Ket 20
Naples 20
Nuremberg 20
Sunnyvale 20
Vienna 19
Shenzhen 18
Warsaw 18
Zhengzhou 18
Ōmizo 18
Brussels 17
Bühl 17
Berlin 16
Chicago 15
Redwood City 15
Abidjan 14
Genoa 14
Kunming 14
London 14
Mcallen 14
Palermo 14
Palaiseau 13
Brooklyn 12
Fuzhou 12
Karlsruhe 12
Ningbo 12
North Bergen 12
Saint Petersburg 12
Brno 11
Da Nang 11
Darmstadt 11
Kiez 11
Monza 11
Verona 11
Totale 12.400
Salva come PNG Salva come JPEG
Nome #
Dai Fondamenti agli Oggetti. Corso di Programmazione Java. Terza edizione. 314
Sublogarithmic bounds on space and reversals 294
Optimal simulations between unary automata 276
Il linguaggio Java. Manuale ufficiale 271
Dai fondamenti agli oggetti : corso di programmazione Java. - Seconda Edizione 269
Descriptional complexity of limited automata 262
Alberto Bertoni: a Scientist and a Friend 248
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata 234
Minimal and reduced reversible automata 225
Optimal state reductions of automata with partially specified behaviors 224
Unary Language Operations, State Complexity and Jacobsthal's Function 212
Limited automata and context-free languages 204
On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages 203
Alberto Bertoni: a Scientist and a Friend 202
Two-way automata simulations and unary languages 201
Tight bounds on the simulation of unary probabilistic automata by deterministic automata 200
Limited automata and unary languages 199
On the size of unary probabilistic and nondeterministic automata 197
Two-way automata characterizations of L/poly versus NL 196
Converting two-way nondeterministic unary automata into simpler automata 195
Limited automata and unary languages 193
Two-Way Automata and Bounded Languages 190
Complementing two-way finite automata 189
Dai fondamenti agli oggetti : corso di programmazione Java 188
Complementing two-way finite automata 186
Usefulness of Information and Unary Languages 185
Two-way finite automata: old and recent results 179
Weakly and strongly irreversible regular languages 177
On Inverse Operations and Their Descriptional Complexity 176
Probabilistic vs. nondeterministic unary automata 174
Turn Complexity of Context-Free Languages, Pushdown and One-Counter Automata 173
The world of unary languages : a quick tour 172
Optimal simulations between unary automata 172
Pushdown Automata and Constant Height: Decidability and Bounds 170
Deterministic Pushdown Automata and Unary Languages 167
A pumping condition for ultralinear languages 167
THE COMPLEXITY OF COMPUTING MAXIMAL WORD FUNCTIONS 166
Normal forms for unary probabilistic automata 165
One pebble versus log n bits 163
Parikh’s theorem and descriptional complexity 163
How Hard Is Computing the Edit Distance? 162
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata 161
One pebble versus ε · log n bits [One pebble versus epsilon.log n bits] 160
Converting self-verifying automata into deterministic automata 159
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata 158
Chair di Steering Committee of the International Workshop "Descriptional Complexity of Formal Systems" 157
Limited Automata: Properties, Complexity and Variants 157
String distances and intrusion detection: bridging the gap between formal languages and computer security 156
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds 156
Two-Way Automata and One-Tape Machines: Read Only Versus Linear Time 156
Complementing unary nondeterministic automata 155
Deterministic Pushdown Automata and Unary Languages 155
Normal forms for unary probabilistic automata 155
Guest Editor (con Hing Leung) del numero speciale "Descriptional Complexity of Formal Systems", volume 387, numero 2, 12 novembre 2007 di Theoretical Computer Science 153
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages 153
Minimal and reduced reversible automata 153
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata 152
Strongly limited automata 152
Minimal and Reduced Reversible Automata 152
Converting nondeterministic two-way automata into small deterministic linear-time machines 149
Strong optimal lower bounds for Turing machines that accept nonregular languages 149
9th International Workshop on Descriptional Complexity of Formal Systems : High tatras, Slovakia, July 2o-22 2007 : Proceedings 147
On inverse operations and their descriptional complexity 147
Non-self-embedding grammars, constant-height pushdown automata, and limited automata 147
Unary automata simulations and cyclic languages 146
Operational State Complexity under Parikh Equivalence (Extended Abstract) 145
ASYNCHRONOUS AUTOMATA VERSUS ASYNCHRONOUS CELLULAR-AUTOMATA 144
An optimal lower-bound for nonregular languages 144
One-tape Turing Machine variants and language recognition 144
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata 140
Two-way automata making choices only at the endmarkers 139
Descriptional complexity of formal systems : Tenth International Workshop, DCFS 2008, July 16–18, 2008, Charlottetown, PE, Canada 138
Oblivious two-way finite automata: decidability and complexity 136
Converting nondeterministic automata and context-free grammars into Parikh equivalent deterministic automata 135
A remark on middle space bounded alternating Turing machines 135
Guest editor of the special issue devoted to the international workshop: Descriptional Complexity of Formal Systems (DCFS 2008) di Theoretical Computer Science 134
The complexity of computing maximal word functions 134
Co-chair del comitato di programma di 10th International Workshop on Descriptional Complexity of Formal Systems 133
Membro del Comitato di Programma di 13th International Conference on Implementation and Application of Automata, San Francisco 132
Descriptional Complexity of Bounded Context-Free Languages 132
Nondeterministic one-tape off-line Turing machines and their time complexity 131
Membro del comitato di programma di 12th International Conference "Automata and Formal Languages", AFL 2008, Balatonfured, Hungary 130
Two-way unary automata versus logarithmic space 128
Probabilistic asynchronous automata 127
Non-Self-Embedding Grammars and Descriptional Complexity 126
Preface 125
Descriptional Complexity of Formal Systems 125
Performing Regular Operations with 1-Limited Automata 124
Non-Self-Embedding Grammars and Descriptional Complexity 123
Push Complexity: Optimal Bounds and Unary Inputs 121
Distances between languages and reflexivity of relations 121
Converting two-way nondeterministic unary automata into simpler automata 121
On some succinct representations of regular languages : extended abstract 121
Two-way automata making choices only at the endmarkers 120
Investigations on automata and languages over a unary alphabet 119
Performing Regular Operations with 1-Limited Automata 118
Mathematical foundations of computer science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015; proceedings. 1 118
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines 117
Two-way automata characterizations of L/poly versus NL 116
On the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata 116
Totale 16.500
Salva come PNG Salva come JPEG
Categoria #
all - tutte 57.587
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 57.587
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021101 0 0 0 0 0 0 0 0 0 0 0 101
2021/20221.510 113 68 42 101 128 92 131 57 79 135 139 425
2022/20231.834 261 164 171 185 227 332 55 118 210 20 63 28
2023/2024866 19 107 43 36 140 85 29 47 23 71 120 146
2024/20252.889 110 368 39 261 261 126 44 423 123 263 257 614
2025/20265.585 401 305 833 501 545 363 580 444 517 575 403 118
Totale 21.287