PIETRACAPRINA, ANDREA ALBERTO
 Distribuzione geografica
Continente #
NA - Nord America 5.768
EU - Europa 555
AS - Asia 315
AF - Africa 4
OC - Oceania 3
Totale 6.645
Nazione #
US - Stati Uniti d'America 5.765
CN - Cina 222
IT - Italia 148
FI - Finlandia 118
UA - Ucraina 80
DE - Germania 76
VN - Vietnam 71
SE - Svezia 68
GB - Regno Unito 31
IN - India 17
FR - Francia 12
IE - Irlanda 12
GR - Grecia 6
EG - Egitto 4
NL - Olanda 4
CA - Canada 2
HK - Hong Kong 2
NZ - Nuova Zelanda 2
TR - Turchia 2
AU - Australia 1
HN - Honduras 1
SG - Singapore 1
Totale 6.645
Città #
Fairfield 993
Woodbridge 739
Ann Arbor 532
Houston 512
Ashburn 484
Seattle 394
Jacksonville 366
Cambridge 350
Wilmington 340
Chandler 282
Princeton 109
Padova 86
San Diego 74
Dong Ket 71
Beijing 70
Medford 69
Nanjing 50
Helsinki 39
Boardman 33
Roxbury 29
Des Moines 25
Norwalk 17
Guangzhou 16
Nanchang 16
Shenyang 14
Changsha 12
Dublin 12
Hebei 12
Tianjin 12
Jiaxing 10
London 10
Washington 9
Conegliano 8
Milan 6
Indiana 5
Jinan 5
Redwood City 5
Bremen 4
Cairo 4
Falls Church 4
New York 4
San Francisco 4
Islington 3
Kharkiv 3
Tappahannock 3
Venice 3
Vicenza 3
Yellow Springs 3
Borås 2
Cadoneghe 2
College Station 2
Fiera di Primiero 2
Groningen 2
Hangzhou 2
Hounslow 2
Inveruno 2
Kilburn 2
Limena 2
Mestre 2
Ogden 2
Phoenix 2
Pinehaven 2
Pune 2
Southwark 2
Trieste 2
Wandsworth 2
Zhengzhou 2
Arezzo 1
Azzano Decimo 1
Bari 1
Bresso 1
Catanzaro 1
Cinisello Balsamo 1
Karabük 1
Montebelluna 1
North York 1
Orland Park 1
Portland 1
Porto Torres 1
Prescot 1
Providence 1
Rockville 1
Rossano Veneto 1
Rosà 1
San Mateo 1
San Pedro Sula 1
Sassari 1
Spinetoli 1
Tacoma 1
Tilburg 1
Verona 1
Witzhave 1
Yellowknife 1
Yenibosna 1
Totale 5.919
Nome #
Network-Oblivious Algorithms 152
An optimized data structure for high-throughput 3D proteomics data: mzRTree 150
Constructive, deterministic implementation of shared memory on meshes 140
Heterogeneous machine learning system for improving the diagnosis of primary aldosteronism 136
A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs 131
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation 127
Translating submachine locality into locality of reference 126
Network-Oblivious Algorithms 121
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets 106
Solving k-center clustering (with outliers) in MapReduce and streaming, almost as accurately as sequentially 106
A new scheme for the deterministic simulation of PRAMs in VLSI 103
Space-efficient parallel algorithms for combinatorial search problems 103
On the complexity of the shortest-path broadcast problem 103
Analysis and implementation of parallel uniform hashing 101
Mining top-K frequent itemsets through progressive sampling 100
On the Connectivity of Bluetooth-Based Ad Hoc Networks 99
Optimal deterministic protocols for mobile robots on a grid 99
Tight Bounds on Information Dissemination in Sparse Mobile Networks 94
Seamless Integration of Parallelism and Memory Hierarchy 94
Space-Efficient Parallel Algorithms for Combinatorial Search Problems 94
An O(√n)-worst-case-time solution to the granularity problem 94
MapReduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension 94
Optimal deterministic protocols for mobile robots on a grid 93
Implementing shared memory on mesh-connected computers and on the fat-tree 91
Sharper analysis of packet routing on a butterfly 91
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets 91
MADMX: A Strategy for Maximal Dense Motif Extraction 90
Implementing Shared Memory on Clustered Machines (Extended Abstract) 89
Fast deterministic parallel branch-and-bound 88
A probabilistic simulation of prams on a bounded degree network 88
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer 86
Efficient Incremental Mining of Top-K Frequent Closed Itemsets 86
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree 86
Improved deterministic PRAM simulation on the mesh 84
A General PRAM Simulation for Clustered Machines 82
A practical constructive scheme for deterministic shared-memory access 82
Analysis of parallel uniform hashing 82
The complexity of deterministic PRAM simulation on distributed memory machines 81
On the Expansion and Diameter of Bluetooth-like Topologies 80
Predicting performance on SMP's. A case study: the SGI Power Challenge 77
Deterministic branch-and-bound on distributed memory machines. 77
The deterministic complexity of parallel multisearch 77
Clustering Uncertain Graphs 77
Decomposable BSP: a bandwidth-latency model for parallel and hierarchical computation 76
Fast Coreset-based Diversity Maximization under Matroid Constraints 76
Algorithms — ESA’ 986th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings 75
MADMX: A Novel Strategy for Maximal Dense Motif Extraction 75
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation 74
Analysis and Implementation of Parallel Uniform Hashing 73
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation 70
Deterministic parallel backtrack search 70
On the Expansion and Diameter of Bluetooth-Like Topologies 70
A quantitative measure of portability with application to bandwidth-latency models for parallel computing 67
Constructive deterministic PRAM simulation on a mesh-connected computer 67
Optimal many-to-one routing on the mesh 66
Theoretical Computer Science 65
Deterministic Routing of h-relations on the Multibutterfly 65
Tight bounds on deterministic PRAM emulations with constant redundancy 64
On stalling in LogP 63
Implementing shared memory on multi-dimensional meshes and on the fat-tree 63
Packet routing in optimal time on a butterflyIEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings 63
Deterministic branch-and-bound on distributed memory machines 63
An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree 62
Store-and-Forward Multicast Routing on the Mesh 62
Space-round tradeoffs for MapReduce computations 62
Fast deterministic backtrack search 56
Cache-oblivous simulation of parallel programs 53
BSP versus LogP 53
Distributed graph diameter approximation 53
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer 53
On the Connectivity of Bluetooth-Based Ad Hoc Networks 52
The Potential of On-Chip Multiprocessing for QCD Machines 52
Translating Submachine Locality into Locality of Reference 51
Optimal Many-to-One Routing on the Mesh with Constant Queues 50
Introduction to Topic 12: Theory and Algorithms for Parallel Computation 45
On stalling in LogP 45
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints 43
BSP vs LogP 42
Dimensionality-adaptive k-center in sliding windows 41
Heterogeneous Machine Learning System for Diagnosing Primary Aldosteronism 40
Accurate MapReduce algorithms for k-median and k-means in general metric spaces 36
Preface 32
AuroraScience Project. Report on the First Phase. 31
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation 31
Bioinformatics tools for high-throughput 3D proteomics data 28
Models of Computation, TheoreticalEncyclopedia of Parallel Computing 26
Big Data. Contesto Tecnologico 16
One-to-many routing on the mesh 15
Adaptive k-center and diameter estimation in sliding windows 10
Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics 5
Distributed k-Means with Outliers in General Metrics 5
k-Center Clustering with Outliers in Sliding Windows 5
Scalable and Space-Efficient Robust Matroid Center Algorithms 4
Totale 6.715
Categoria #
all - tutte 22.048
article - articoli 10.144
book - libri 135
conference - conferenze 0
curatela - curatele 372
other - altro 199
patent - brevetti 0
selected - selezionate 0
volume - volumi 4.201
Totale 37.099


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019637 0 0 0 0 0 0 0 0 0 128 285 224
2019/20201.469 219 42 20 115 160 141 133 175 151 136 111 66
2020/20211.355 48 93 110 106 48 102 66 116 210 200 128 128
2021/20221.004 33 103 134 34 74 79 46 111 75 31 116 168
2022/2023645 158 47 7 62 115 80 4 43 76 7 37 9
2023/2024341 8 63 50 37 37 73 12 39 17 5 0 0
Totale 6.715