CRESCENZI, PIERLUIGI
 Distribuzione geografica
Continente #
NA - Nord America 8.570
EU - Europa 4.454
AS - Asia 939
AF - Africa 44
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 3
OC - Oceania 2
Totale 14.015
Nazione #
US - Stati Uniti d'America 8.554
RU - Federazione Russa 1.201
IT - Italia 905
IE - Irlanda 506
HK - Hong Kong 397
SE - Svezia 377
UA - Ucraina 372
PL - Polonia 292
SG - Singapore 265
DE - Germania 230
CH - Svizzera 200
FI - Finlandia 138
GB - Regno Unito 112
CN - Cina 109
IN - India 70
JO - Giordania 40
TR - Turchia 37
FR - Francia 33
AT - Austria 30
CI - Costa d'Avorio 21
ES - Italia 19
SC - Seychelles 17
CA - Canada 14
BE - Belgio 12
NL - Olanda 10
IL - Israele 6
VN - Vietnam 6
IR - Iran 4
RO - Romania 4
EU - Europa 3
PT - Portogallo 3
DZ - Algeria 2
GR - Grecia 2
KR - Corea 2
MD - Moldavia 2
MX - Messico 2
SA - Arabia Saudita 2
ZA - Sudafrica 2
AU - Australia 1
BO - Bolivia 1
BY - Bielorussia 1
CL - Cile 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
EC - Ecuador 1
EE - Estonia 1
HR - Croazia 1
HU - Ungheria 1
MU - Mauritius 1
NG - Nigeria 1
NZ - Nuova Zelanda 1
PH - Filippine 1
Totale 14.015
Città #
Santa Clara 1.679
Fairfield 1.142
Woodbridge 540
Jacksonville 525
Dublin 502
Chandler 500
Cambridge 490
Seattle 474
Ashburn 462
Houston 411
Wilmington 359
Warsaw 288
Florence 251
Singapore 199
Ann Arbor 187
Bern 182
Princeton 154
Boston 110
Lawrence 90
Altamura 86
Hong Kong 68
Boardman 64
Mumbai 62
San Diego 61
Medford 57
Buffalo 54
Milan 51
Beijing 41
Moscow 36
Izmir 32
Norwalk 32
Vienna 30
West Jordan 28
Shanghai 23
Abidjan 21
Frankfurt Am Main 19
Hillsboro 19
Barcelona 18
Los Angeles 16
New York 16
Rome 16
Verona 16
Falls Church 15
Kent 15
Auburn Hills 13
Saint Petersburg 13
Scandicci 13
Brussels 12
Helsinki 12
Arezzo 11
Naples 11
Toronto 11
Andover 10
Dearborn 10
Guangzhou 10
Zurich 10
London 9
Munich 8
Castel Rozzone 7
Turin 7
Paris 6
Philadelphia 6
Siena 6
Cedar Knolls 5
Giussano 5
Laurel 5
Padova 5
Salerno 5
Treviso 5
Bologna 4
Camerino 4
Castelfiorentino 4
Chiswick 4
Dong Ket 4
Genoa 4
Kilburn 4
Montopoli in Val d'Arno 4
Wroclaw 4
Yubileyny 4
Appignano 3
Cinisello Balsamo 3
Copertino 3
Cosenza 3
Edinburgh 3
Erzurum 3
Guidonia Montecelio 3
Kashan 3
Marnate 3
Montesilvano Marina 3
Montevarchi 3
Nuremberg 3
Pesaro 3
Pescara 3
Prescot 3
San Mateo 3
Seveso 3
Sondalo 3
Vigonza 3
Wuhan 3
Anaheim 2
Totale 9.758
Nome #
C : C++ = JAVAMM: JAVA 461
EUCALYPT: efficient tree reconciliation enumerator 241
On two collateral effects of using algorithm visualizations 235
MeDuSa: a multi-draft based scaffolder 196
GOCCE DI JAVA 191
TOWARDS A TAXONOMY OF NETWORK PROTOCOL VISUALIZATION TOOLS 179
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses 168
Greedily improving our own closeness centrality in a network 141
An Eclipse IDE for Teaching Java-- 137
Playful learning for kids with special educational needs 136
DEVELOPMENT OF AN ECB ON COMPUTER NETWORKS BASED ON WWW TECHNOLOGIES 129
Smooth movement and Manhattan path based random waypoint mobility 129
A UNIFORM APPROACH TO DEFINE COMPLEXITY CLASSES 127
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 124
Computing top-k Closeness Centrality Faster in Unweighted Graphs 124
Blind image clustering based on the Normalized Cuts criterion for camera identification 123
COMPLEXITY AND APPROXIMATION. COMBINATORIAL OPTIMIZATION PROBLEMS AND THEIR APPROXIMABILITY PROPERTIES 122
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 121
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 121
NETPRIDE: AN INTEGRATED ENVIRONMENT FOR DEVELOPING AND VISUALIZING COMPUTER NETWORK PROTOCOLS 121
ON COMPUTING AD-HOC SELECTIVE FAMILIES 117
An ant-colony based approach for real-time implicit collaborative information seeking 117
SEARCH DATA STRUCTURES FOR SKEWED STRINGS 115
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS 115
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 115
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 115
APPROXIMATE SOLUTION OF NP OPTIMIZATION PROBLEMS 114
On computing the diameter of real-world undirected graphs 114
Rumor spreading in random evolving graphs 114
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs 114
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 114
A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM 113
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 112
A TOOL TO DEVELOP ELECTRONIC COURSE BOOKS BASED ON WWW TECHNOLOGIES, RESOURCES AND USABILITY CRITERIA 112
A SHORT GUIDE TO APPROXIMATION PRESERVING REDUCTIONS 112
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach 112
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 112
ON THE COMPLEXITY OF COMPUTING MINIMUM ENERGY CONSUMPTION BROADCAST SUBGRAPHS 111
FULLY INTEGRATING ALGORITHM VISUALIZATION INTO A CS2 COURSE 110
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 110
SPERNER'S LEMMA AND ROBUST MACHINES 110
Performance Evaluation of a Chord-Based JXTA Implementation 109
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY 108
A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS 108
Cophylogeny reconstruction via an approximate bayesian computation 107
MINIMUM VERTEX COVER, DISTRIBUTED DECISION-MAKING, AND COMMUNICATION COMPLEXITY 107
A NOTE ON OPTIMAL AREA ALGORITHMS FOR UPWARD DRAWINGS OF BINARY TREES 106
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 106
RELATIVE COMPLEXITY OF EVALUATING THE OPTIMUM COST AND CONSTRUCTING THE OPTIMUM FOR MAXIMIZATION PROBLEMS 106
OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES 104
INTRODUCTION TO THE THEORY OF COMPLEXITY 104
COMPLETENESS IN APPROXIMATION CLASSES 102
TEXT SPARSIFICATION VIA LOCAL MAXIMA 101
ON WEIGHTED VS UNWEIGHTED VERSIONS OF COMBINATORIAL OPTIMIZATION PROBLEMS 101
LINEAR AREA UPWARD DRAWINGS OF AVL TREES 101
AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS 101
COMPLEXITY CLASSES AND SPARSE ORACLES 101
Greedily improving our own centrality in a network 101
OPTIMAL COVERING DESIGNS: COMPLEXITY RESULTS AND NEW BOUNDS 100
PARALLEL APPROXIMATION OF OPTIMIZATION PROBLEMS 100
Degrees of Separation and Diameter in Large Graphs 100
On the complexity of the shortest-path broadcast problem 100
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs 100
TEXT SPARSIFICATION VIA LOCAL MAXIMA 99
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 99
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 99
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 99
IP ADDRESS LOOKUP MADE FAST AND SIMPLE 98
STRUTTURE DI DATI E ALGORITMI. PROGETTAZIONE, ANALISI E VISUALIZZAZIONE 97
ADDING TEST GENERATION TO THE TEACHING MACHINE 97
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 97
ADAPTING MOODLE TO BETTER SUPPORT CS EDUCATION 97
Requirements and design strategies for open source interactive computer science ebooks 97
STRICTLY-UPWARD DRAWINGS OF ORDERED SEARCH TREES 96
THE MINIMUM LIKELY COLUMN COVER PROBLEM 96
Flooding in dynamic graphs with arbitrary degree sequence 96
EQUILIBRIA FOR BROADCAST RANGE ASSIGNMENT GAMES IN AD-HOC NETWORKS 95
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 95
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 95
REVERSIBLE EXECUTION AND VISUALIZATION OF PROGRAMS WITH LEONARDO 95
Assessing CS1 Java Skills: A Three-Year Experience 95
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING 94
MINIMUM-AREA H-V DRAWINGS OF COMPLETE BINARY TREES 94
ON THE HAMMING DISTANCE OF CONSTRAINT SATISFACTION PROBLEMS 94
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 94
Synchronous context-free grammars and optimal linear parsing strategies 94
PLATFORM INDEPENDENT VIRTUAL LABORATORY SYSTEM: SIMULATION OF GRADIENT ELUTION HPLC 94
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 93
MAKING TURING MACHINES ACCESSIBLE TO BLIND STUDENTS 93
On computing the hyperbolicity of real-world graphs 93
ON THE COMPLEXITY OF PROTEIN FOLDING 93
ON THE COMPLEXITY OF PROTEIN FOLDING 92
STRUCTURE IN APPROXIMATION CLASSES 92
MINIMUM-DELAY SCHEDULES IN LAYERED NETWORKS 92
MAKING ROLE ASSIGNMENT FEASIBLE: A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING ECOLOGICAL COLORINGS 92
Efficient Bubble Enumeration in Directed Graphs 91
APPROXIMATION ALGORITHMS 91
USING AVS TO EXPLAIN NP-COMPLETENESS 90
Integrating test generation functionality into the Teaching Machine environment 89
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 88
Totale 11.472
Categoria #
all - tutte 37.352
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 37.352


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.791 0 0 0 0 263 331 269 340 251 107 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/20253.623 187 547 268 676 1.945 0 0 0 0 0 0 0
Totale 14.147