CRESCENZI, PIERLUIGI
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.202
EU - Europa 4.591
AS - Asia 1.564
SA - Sud America 114
OC - Oceania 92
AF - Africa 55
Continente sconosciuto - Info sul continente non disponibili 3
Totale 16.621
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.182
RU - Federazione Russa 1.210
IT - Italia 984
HK - Hong Kong 761
IE - Irlanda 507
SG - Singapore 475
SE - Svezia 379
UA - Ucraina 372
PL - Polonia 293
DE - Germania 233
CH - Svizzera 200
FI - Finlandia 143
GB - Regno Unito 118
CN - Cina 115
BR - Brasile 103
AU - Australia 91
IN - India 87
FR - Francia 41
JO - Giordania 41
TR - Turchia 40
AT - Austria 32
NL - Olanda 26
CI - Costa d'Avorio 21
ES - Italia 19
SC - Seychelles 17
CA - Canada 15
BE - Belgio 12
ID - Indonesia 8
IL - Israele 7
MA - Marocco 7
VN - Vietnam 6
MX - Messico 5
CL - Cile 4
IR - Iran 4
RO - Romania 4
EU - Europa 3
PK - Pakistan 3
PT - Portogallo 3
SA - Arabia Saudita 3
ZA - Sudafrica 3
BD - Bangladesh 2
BO - Bolivia 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
DZ - Algeria 2
EC - Ecuador 2
EG - Egitto 2
GR - Grecia 2
IQ - Iraq 2
KR - Corea 2
LV - Lettonia 2
MD - Moldavia 2
TW - Taiwan 2
AZ - Azerbaigian 1
BY - Bielorussia 1
CO - Colombia 1
EE - Estonia 1
HR - Croazia 1
HU - Ungheria 1
JP - Giappone 1
KE - Kenya 1
KG - Kirghizistan 1
LK - Sri Lanka 1
LU - Lussemburgo 1
MU - Mauritius 1
NG - Nigeria 1
NZ - Nuova Zelanda 1
PE - Perù 1
PH - Filippine 1
UZ - Uzbekistan 1
VE - Venezuela 1
Totale 16.621
Salva come PNG Salva come JPEG
Città #
Santa Clara 3.237
Fairfield 1.142
Woodbridge 540
Jacksonville 525
Dublin 503
Chandler 500
Cambridge 490
Seattle 474
Ashburn 470
Hong Kong 432
Houston 411
Wilmington 359
Warsaw 289
Florence 263
Singapore 236
Ann Arbor 187
Bern 182
Princeton 154
Boston 111
Lawrence 90
Melbourne 89
Altamura 86
Boardman 64
Mumbai 62
Milan 61
San Diego 61
Medford 57
Buffalo 54
Beijing 41
Moscow 36
Izmir 32
Norwalk 32
Vienna 31
West Jordan 28
Rome 25
Los Angeles 24
Shanghai 24
Abidjan 21
Frankfurt Am Main 19
Hillsboro 19
Barcelona 18
Turin 17
New York 16
Verona 16
Falls Church 15
Kent 15
Helsinki 14
Auburn Hills 13
Naples 13
Saint Petersburg 13
Scandicci 13
Brussels 12
Arezzo 11
Toronto 11
Andover 10
Dearborn 10
Guangzhou 10
London 10
Zurich 10
Munich 9
The Dalles 9
Jakarta 8
Padova 8
Paris 8
Castel Rozzone 7
São Paulo 7
Philadelphia 6
Siena 6
Bengaluru 5
Cedar Knolls 5
Giussano 5
Laurel 5
Salerno 5
Treviso 5
Bologna 4
Camerino 4
Castelfiorentino 4
Chiswick 4
Dong Ket 4
Genoa 4
Kilburn 4
La Spezia 4
Montopoli in Val d'Arno 4
Rio de Janeiro 4
Seriate 4
Wroclaw 4
Wuhan 4
Yubileyny 4
Amsterdam 3
Appignano 3
Cagliari 3
Chennai 3
Cinisello Balsamo 3
Copertino 3
Cosenza 3
Edinburgh 3
Erzurum 3
Guidonia Montecelio 3
Kashan 3
Marnate 3
Totale 11.898
Salva come PNG Salva come JPEG
Nome #
C : C++ = JAVAMM: JAVA 491
EUCALYPT: efficient tree reconciliation enumerator 269
On two collateral effects of using algorithm visualizations 260
MeDuSa: a multi-draft based scaffolder 222
GOCCE DI JAVA 213
TOWARDS A TAXONOMY OF NETWORK PROTOCOL VISUALIZATION TOOLS 206
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses 196
An Eclipse IDE for Teaching Java-- 170
STRUTTURE DI DATI E ALGORITMI. PROGETTAZIONE, ANALISI E VISUALIZZAZIONE 169
Greedily improving our own closeness centrality in a network 162
Playful learning for kids with special educational needs 161
DEVELOPMENT OF AN ECB ON COMPUTER NETWORKS BASED ON WWW TECHNOLOGIES 160
Smooth movement and Manhattan path based random waypoint mobility 154
A UNIFORM APPROACH TO DEFINE COMPLEXITY CLASSES 150
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs 150
Computing top-k Closeness Centrality Faster in Unweighted Graphs 147
NETPRIDE: AN INTEGRATED ENVIRONMENT FOR DEVELOPING AND VISUALIZING COMPUTER NETWORK PROTOCOLS 145
COMPLEXITY AND APPROXIMATION. COMBINATORIAL OPTIMIZATION PROBLEMS AND THEIR APPROXIMABILITY PROPERTIES 144
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 143
APPROXIMATE SOLUTION OF NP OPTIMIZATION PROBLEMS 142
A TOOL TO DEVELOP ELECTRONIC COURSE BOOKS BASED ON WWW TECHNOLOGIES, RESOURCES AND USABILITY CRITERIA 139
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 139
Cophylogeny reconstruction via an approximate bayesian computation 139
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 139
An ant-colony based approach for real-time implicit collaborative information seeking 139
A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM 137
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 137
Blind image clustering based on the Normalized Cuts criterion for camera identification 136
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach 135
ON THE COMPLEXITY OF COMPUTING MINIMUM ENERGY CONSUMPTION BROADCAST SUBGRAPHS 135
ON COMPUTING AD-HOC SELECTIVE FAMILIES 135
SEARCH DATA STRUCTURES FOR SKEWED STRINGS 134
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 134
A SHORT GUIDE TO APPROXIMATION PRESERVING REDUCTIONS 134
On computing the diameter of real-world undirected graphs 134
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 134
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 133
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS 132
A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS 132
Rumor spreading in random evolving graphs 131
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY 131
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs 131
A NOTE ON OPTIMAL AREA ALGORITHMS FOR UPWARD DRAWINGS OF BINARY TREES 130
TEXT SPARSIFICATION VIA LOCAL MAXIMA 129
Performance Evaluation of a Chord-Based JXTA Implementation 129
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 128
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 127
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 126
SPERNER'S LEMMA AND ROBUST MACHINES 126
FULLY INTEGRATING ALGORITHM VISUALIZATION INTO A CS2 COURSE 125
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 124
ON THE HAMMING DISTANCE OF CONSTRAINT SATISFACTION PROBLEMS 124
ON WEIGHTED VS UNWEIGHTED VERSIONS OF COMBINATORIAL OPTIMIZATION PROBLEMS 123
RELATIVE COMPLEXITY OF EVALUATING THE OPTIMUM COST AND CONSTRUCTING THE OPTIMUM FOR MAXIMIZATION PROBLEMS 123
Degrees of Separation and Diameter in Large Graphs 123
MINIMUM VERTEX COVER, DISTRIBUTED DECISION-MAKING, AND COMMUNICATION COMPLEXITY 123
INTRODUCTION TO THE THEORY OF COMPLEXITY 123
Assessing CS1 Java Skills: A Three-Year Experience 122
LINEAR AREA UPWARD DRAWINGS OF AVL TREES 121
OPTIMAL COVERING DESIGNS: COMPLEXITY RESULTS AND NEW BOUNDS 120
OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES 120
AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS 119
COMPLETENESS IN APPROXIMATION CLASSES 119
ADDING TEST GENERATION TO THE TEACHING MACHINE 119
TEXT SPARSIFICATION VIA LOCAL MAXIMA 118
PARALLEL APPROXIMATION OF OPTIMIZATION PROBLEMS 118
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 118
On the complexity of the shortest-path broadcast problem 118
COMPLEXITY CLASSES AND SPARSE ORACLES 118
Greedily improving our own centrality in a network 118
ADAPTING MOODLE TO BETTER SUPPORT CS EDUCATION 117
STRUCTURE IN APPROXIMATION CLASSES 116
Synchronous context-free grammars and optimal linear parsing strategies 116
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 116
THE MINIMUM LIKELY COLUMN COVER PROBLEM 115
IP ADDRESS LOOKUP MADE FAST AND SIMPLE 115
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 115
REVERSIBLE EXECUTION AND VISUALIZATION OF PROGRAMS WITH LEONARDO 115
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING 114
STRICTLY-UPWARD DRAWINGS OF ORDERED SEARCH TREES 114
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 114
ON THE COMPLEXITY OF PROTEIN FOLDING 114
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 113
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 113
MAKING TURING MACHINES ACCESSIBLE TO BLIND STUDENTS 113
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 113
Flooding in dynamic graphs with arbitrary degree sequence 113
Requirements and design strategies for open source interactive computer science ebooks 113
Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course 112
On computing the hyperbolicity of real-world graphs 112
MINIMUM-DELAY SCHEDULES IN LAYERED NETWORKS 111
MINIMUM-AREA H-V DRAWINGS OF COMPLETE BINARY TREES 111
PLATFORM INDEPENDENT VIRTUAL LABORATORY SYSTEM: SIMULATION OF GRADIENT ELUTION HPLC 111
Efficient Bubble Enumeration in Directed Graphs 111
EQUILIBRIA FOR BROADCAST RANGE ASSIGNMENT GAMES IN AD-HOC NETWORKS 110
USING AVS TO EXPLAIN NP-COMPLETENESS 110
Integrating test generation functionality into the Teaching Machine environment 109
MAKING ROLE ASSIGNMENT FEASIBLE: A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING ECOLOGICAL COLORINGS 109
ON THE COMPLEXITY OF PROTEIN FOLDING 108
APPROXIMATION ALGORITHMS 108
Totale 13.636
Salva come PNG Salva come JPEG
Categoria #
all - tutte 43.601
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 43.601
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020230 0 0 0 0 0 0 0 0 0 0 179 51
2020/20211.543 128 87 144 148 36 181 25 166 206 209 91 122
2021/2022953 33 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.229 187 547 268 676 2.234 1.422 71 430 259 84 51 0
Totale 16.753