IRIS Institutional Research Information System - AIR Archivio Istituzionale della Ricerca

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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.951 401 305 833 501 545 363 580 444 517 575 403 484
2026/2027332 332 0 0 0 0 0 0 0 0 0 0 0
Totale 21.985