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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20202.537 251 180 64 251 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/202548 48 0 0 0 0 0 0 0 0 0 0 0
Totale 10.572