CRESCENZI, PIERLUIGI
 Distribuzione geografica
Continente #
NA - Nord America 12.285
EU - Europa 6.306
AS - Asia 4.118
SA - Sud America 473
Continente sconosciuto - Info sul continente non disponibili 138
AF - Africa 120
OC - Oceania 93
Totale 23.533
Nazione #
US - Stati Uniti d'America 12.168
IT - Italia 1.981
RU - Federazione Russa 1.676
SG - Singapore 1.121
HK - Hong Kong 918
CN - Cina 917
IE - Irlanda 509
SE - Svezia 386
VN - Vietnam 384
UA - Ucraina 376
BR - Brasile 371
KR - Corea 328
PL - Polonia 302
DE - Germania 253
CH - Svizzera 202
FR - Francia 180
FI - Finlandia 147
GB - Regno Unito 145
IN - India 133
AU - Australia 92
CA - Canada 73
TR - Turchia 52
BD - Bangladesh 51
JO - Giordania 45
AR - Argentina 42
NL - Olanda 35
JP - Giappone 34
AT - Austria 33
ES - Italia 28
CI - Costa d'Avorio 22
ID - Indonesia 22
MX - Messico 21
ZA - Sudafrica 20
BE - Belgio 18
MA - Marocco 17
SC - Seychelles 17
IQ - Iraq 16
SA - Arabia Saudita 15
CL - Cile 12
EC - Ecuador 12
PK - Pakistan 12
CO - Colombia 11
PE - Perù 10
DZ - Algeria 9
EG - Egitto 8
IL - Israele 8
NP - Nepal 8
UZ - Uzbekistan 8
KE - Kenya 7
PH - Filippine 7
PY - Paraguay 7
JM - Giamaica 6
RO - Romania 6
TH - Thailandia 6
TN - Tunisia 6
IR - Iran 5
TW - Taiwan 5
MD - Moldavia 4
NG - Nigeria 4
VE - Venezuela 4
AZ - Azerbaigian 3
DK - Danimarca 3
EU - Europa 3
GR - Grecia 3
GT - Guatemala 3
KZ - Kazakistan 3
MY - Malesia 3
PA - Panama 3
PR - Porto Rico 3
PT - Portogallo 3
BO - Bolivia 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
GE - Georgia 2
HN - Honduras 2
HU - Ungheria 2
LB - Libano 2
LK - Sri Lanka 2
LT - Lituania 2
LV - Lettonia 2
SN - Senegal 2
TT - Trinidad e Tobago 2
UY - Uruguay 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
AO - Angola 1
BG - Bulgaria 1
BH - Bahrain 1
BJ - Benin 1
BS - Bahamas 1
BW - Botswana 1
BY - Bielorussia 1
CG - Congo 1
DO - Repubblica Dominicana 1
EE - Estonia 1
ET - Etiopia 1
GA - Gabon 1
HR - Croazia 1
KG - Kirghizistan 1
KH - Cambogia 1
Totale 23.388
Città #
Santa Clara 3.277
Fairfield 1.142
Ashburn 1.036
Singapore 763
Hong Kong 585
Woodbridge 540
Jacksonville 527
Dublin 505
Chandler 500
Cambridge 490
Seattle 479
Houston 420
Wilmington 361
Milan 327
Seoul 322
Florence 296
Warsaw 294
San Jose 279
Hefei 221
Ann Arbor 187
Beijing 184
Bern 184
Rome 170
Council Bluffs 158
Princeton 155
Buffalo 151
Lauterbourg 126
The Dalles 123
Boston 115
Ho Chi Minh City 115
Los Angeles 115
Hanoi 97
Lawrence 90
Melbourne 89
Altamura 86
Mumbai 69
Boardman 65
Moscow 63
San Diego 61
Medford 58
Naples 49
Dallas 45
Turin 44
New York 41
Kent 34
Tokyo 33
Izmir 32
Norwalk 32
Vienna 32
Figino 31
Shanghai 30
Columbus 29
West Jordan 28
Clifton 23
Palermo 23
São Paulo 23
Abidjan 22
Verona 21
Bologna 20
Chicago 20
Frankfurt Am Main 19
Guangzhou 19
Haiphong 19
Hillsboro 19
Barcelona 18
Helsinki 18
Curitiba 17
Genoa 17
London 17
Toronto 17
Des Moines 16
Bari 15
Falls Church 15
Phoenix 15
Miano 14
Munich 14
Tianjin 14
Auburn Hills 13
Chennai 13
Da Nang 13
New Delhi 13
Saint Petersburg 13
Scandicci 13
Atlanta 12
Brussels 12
Rio de Janeiro 12
Arezzo 11
Frankfurt am Main 11
San Francisco 11
Andover 10
Belo Horizonte 10
Brescia 10
Dearborn 10
Johannesburg 10
Paris 10
Philadelphia 10
Redondo Beach 10
Zurich 10
Dhaka 9
Jakarta 9
Totale 15.975
Nome #
C : C++ = JAVAMM: JAVA 615
On two collateral effects of using algorithm visualizations 336
EUCALYPT: efficient tree reconciliation enumerator 329
MeDuSa: a multi-draft based scaffolder 300
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses 264
TOWARDS A TAXONOMY OF NETWORK PROTOCOL VISUALIZATION TOOLS 260
Greedily improving our own closeness centrality in a network 256
GOCCE DI JAVA 245
STRUTTURE DI DATI E ALGORITMI. PROGETTAZIONE, ANALISI E VISUALIZZAZIONE 241
An Eclipse IDE for Teaching Java-- 230
DEVELOPMENT OF AN ECB ON COMPUTER NETWORKS BASED ON WWW TECHNOLOGIES 222
Playful learning for kids with special educational needs 221
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 215
Computing top-k Closeness Centrality Faster in Unweighted Graphs 215
ON WEIGHTED VS UNWEIGHTED VERSIONS OF COMBINATORIAL OPTIMIZATION PROBLEMS 209
A UNIFORM APPROACH TO DEFINE COMPLEXITY CLASSES 206
APPROXIMATE SOLUTION OF NP OPTIMIZATION PROBLEMS 206
Blind image clustering based on the Normalized Cuts criterion for camera identification 205
A NOTE ON OPTIMAL AREA ALGORITHMS FOR UPWARD DRAWINGS OF BINARY TREES 204
A TOOL TO DEVELOP ELECTRONIC COURSE BOOKS BASED ON WWW TECHNOLOGIES, RESOURCES AND USABILITY CRITERIA 204
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs 202
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs 200
A SHORT GUIDE TO APPROXIMATION PRESERVING REDUCTIONS 199
ON COMPUTING AD-HOC SELECTIVE FAMILIES 199
Cophylogeny reconstruction via an approximate bayesian computation 198
A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM 196
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 193
Smooth movement and Manhattan path based random waypoint mobility 192
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 192
NETPRIDE: AN INTEGRATED ENVIRONMENT FOR DEVELOPING AND VISUALIZING COMPUTER NETWORK PROTOCOLS 189
TEXT SPARSIFICATION VIA LOCAL MAXIMA 188
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 186
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 186
Computing top-k closeness centrality faster in unweighted graphs 186
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 183
An ant-colony based approach for real-time implicit collaborative information seeking 183
OPTIMAL COVERING DESIGNS: COMPLEXITY RESULTS AND NEW BOUNDS 182
On computing the diameter of real-world undirected graphs 180
On computing the hyperbolicity of real-world graphs 180
SPERNER'S LEMMA AND ROBUST MACHINES 179
SEARCH DATA STRUCTURES FOR SKEWED STRINGS 178
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 178
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach 178
COMPLEXITY AND APPROXIMATION. COMBINATORIAL OPTIMIZATION PROBLEMS AND THEIR APPROXIMABILITY PROPERTIES 176
ON THE COMPLEXITY OF COMPUTING MINIMUM ENERGY CONSUMPTION BROADCAST SUBGRAPHS 176
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS 175
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 174
AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS 174
On the complexity of the shortest-path broadcast problem 174
A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS 174
RELATIVE COMPLEXITY OF EVALUATING THE OPTIMUM COST AND CONSTRUCTING THE OPTIMUM FOR MAXIMIZATION PROBLEMS 172
ON THE HAMMING DISTANCE OF CONSTRAINT SATISFACTION PROBLEMS 172
Performance Evaluation of a Chord-Based JXTA Implementation 172
THE MINIMUM LIKELY COLUMN COVER PROBLEM 171
TEXT SPARSIFICATION VIA LOCAL MAXIMA 171
IP ADDRESS LOOKUP MADE FAST AND SIMPLE 170
FULLY INTEGRATING ALGORITHM VISUALIZATION INTO A CS2 COURSE 170
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY 170
Degrees of Separation and Diameter in Large Graphs 170
LINEAR AREA UPWARD DRAWINGS OF AVL TREES 169
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 168
ADAPTING MOODLE TO BETTER SUPPORT CS EDUCATION 168
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 166
Assessing CS1 Java Skills: A Three-Year Experience 166
STRUCTURE IN APPROXIMATION CLASSES 165
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 165
COMPLETENESS IN APPROXIMATION CLASSES 163
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 162
MINIMUM-DELAY SCHEDULES IN LAYERED NETWORKS 161
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 161
Rumor spreading in random evolving graphs 160
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 157
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 157
ON THE COMPLEXITY OF PROTEIN FOLDING 157
MINIMUM-AREA H-V DRAWINGS OF COMPLETE BINARY TREES 156
STRICTLY-UPWARD DRAWINGS OF ORDERED SEARCH TREES 155
OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES 155
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 155
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 155
PARALLEL APPROXIMATION OF OPTIMIZATION PROBLEMS 154
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 154
Greedily improving our own centrality in a network 154
ADDING TEST GENERATION TO THE TEACHING MACHINE 153
MINIMUM VERTEX COVER, DISTRIBUTED DECISION-MAKING, AND COMMUNICATION COMPLEXITY 153
Requirements and design strategies for open source interactive computer science ebooks 153
EQUILIBRIA FOR BROADCAST RANGE ASSIGNMENT GAMES IN AD-HOC NETWORKS 152
PLATFORM INDEPENDENT VIRTUAL LABORATORY SYSTEM: SIMULATION OF GRADIENT ELUTION HPLC 152
REVERSIBLE EXECUTION AND VISUALIZATION OF PROGRAMS WITH LEONARDO 152
AN EXPERIMENTAL EVALUATION OF COVER DESIGN ALGORITHMS 151
ON THE COMPLEXITY OF PROTEIN FOLDING 150
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING 149
INTRODUCTION TO THE THEORY OF COMPLEXITY 149
Analyzing and comparing on-line news sources via (Two-Layer) incremental clustering 148
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 148
Synchronous context-free grammars and optimal linear parsing strategies 147
MAKING ROLE ASSIGNMENT FEASIBLE: A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING ECOLOGICAL COLORINGS 147
COMPLEXITY CLASSES AND SPARSE ORACLES 146
USING AVS TO EXPLAIN NP-COMPLETENESS 144
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course 144
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 144
Totale 18.636
Categoria #
all - tutte 62.267
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 62.267


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022920 0 59 53 45 62 52 31 47 80 60 186 245
2022/20232.551 254 238 88 125 221 415 288 383 217 17 93 212
2023/2024790 37 119 182 61 50 81 35 96 14 53 42 20
2024/20256.458 187 547 268 676 2.234 1.422 71 430 259 84 148 132
2025/20266.198 524 901 539 303 596 265 676 368 482 378 178 988
2026/2027353 163 190 0 0 0 0 0 0 0 0 0 0
Totale 23.533