BILARDI, GIANFRANCO
 Distribuzione geografica
Continente #
NA - Nord America 3.117
EU - Europa 359
AS - Asia 347
OC - Oceania 4
SA - Sud America 3
Totale 3.830
Nazione #
US - Stati Uniti d'America 3.113
CN - Cina 175
SG - Singapore 116
IT - Italia 89
FI - Finlandia 69
DE - Germania 61
UA - Ucraina 54
VN - Vietnam 38
FR - Francia 27
SE - Svezia 27
GB - Regno Unito 20
IN - India 11
CA - Canada 4
IE - Irlanda 4
AU - Australia 3
BR - Brasile 3
JP - Giappone 3
NL - Olanda 3
RO - Romania 2
RU - Federazione Russa 2
AE - Emirati Arabi Uniti 1
AM - Armenia 1
KR - Corea 1
NZ - Nuova Zelanda 1
PL - Polonia 1
TH - Thailandia 1
Totale 3.830
Città #
Fairfield 438
Houston 321
Woodbridge 284
Jacksonville 261
Chandler 228
Ashburn 220
Ann Arbor 193
Seattle 193
Wilmington 169
Cambridge 152
Santa Clara 129
Singapore 95
Princeton 67
Boardman 63
San Diego 39
Dong Ket 38
Medford 37
Beijing 36
Padova 35
Nanjing 34
Helsinki 24
Des Moines 12
Shenyang 12
Nanchang 11
Roxbury 9
Pune 8
Guangzhou 7
Jinan 7
New York 7
Changsha 6
Hebei 6
Jiaxing 6
Kempten 6
North Bergen 6
Indiana 5
Milan 5
Silea 5
Tianjin 5
Bremen 4
Dublin 4
Falls Church 4
Lappeenranta 4
London 4
Riolo Terme 4
Zhengzhou 4
Kilburn 3
Limena 3
Los Angeles 3
Rome 3
Waldwick 3
Dallas 2
Haikou 2
Hounslow 2
Jesolo 2
Karlsruhe 2
Melbourne 2
Mestre 2
Norwalk 2
Ogden 2
Paris 2
Phoenix 2
Ponzano Veneto 2
Redwood City 2
San Donà Di Piave 2
San Francisco 2
Tokyo 2
Venezia 2
Venice 2
Yonkers 2
Bangkok 1
Borås 1
Campinas 1
Chiswick 1
Cinisello Balsamo 1
Dubai 1
Florianópolis 1
Forest City 1
Frankfurt am Main 1
Fuyang 1
Hangzhou 1
Hanover 1
Horia 1
Incheon 1
Islington 1
Jiangmen 1
Kharkiv 1
L'Assomption 1
Landshut 1
Marietta 1
Miami Beach 1
Montreal 1
Monza 1
Ningbo 1
Nürnberg 1
Orange 1
Ottawa 1
Patna 1
Pinehaven 1
Pirmasens 1
Prescot 1
Totale 3.291
Nome #
On bufferless routing of variable length messages in leveled networks. 167
Network-Oblivious Algorithms 162
An accurate and efficient frontal solver for fully-coupled hygro-thermo-mechanical problems 135
Network-Oblivious Algorithms 127
The role of terminal cost/reward in finite-horizon, discrete-time LQ optimal control 119
A Lower Bound Technique for Communication in BSP 118
On bufferless routing of variable-length messages in leveled networks 112
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies 112
A frontal solver tuned for fully-coupled non-linear hygro-thermo-mechanical problems 102
On Approximating the Ideal Random Access Machine by Physical Machines 100
A Lower Bound Technique for Communication on BSP with Application to the FFT 100
The speculative prefetcher and evaluator processor for pipelined memory hierarchies 92
Algorithms for computing the single static assignment form 91
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer 90
Algorithms — ESA’ 986th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings 87
Universality in VLSI Computation 86
Decomposable BSP: a bandwidth-latency model for parallel and hierarchical computation 85
Efficient Stack Distance Computation for a Class of Priority Replacement Policies 85
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation 81
Tight bounds on parallel list marking 81
Area-Time Tradeoffs for Universal VLSI Circuits. 80
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation 79
An accurate and efficient frontal solver for fully-coupled hygro-thermo-mechanical problems 77
A quantitative measure of portability with application to bandwidth-latency models for parallel computing 77
Tight bounds on parallel list marking 77
Spectral analysis of the powers of a PAM digital signal 76
Area-universal Circuits with Constant Slowdown 76
A Graphical Model for Context-Free Grammar ParsingCompiler Construction 73
On stalling in LogP 72
Optimal eviction policies for stochastic address traces 71
An accurate and efficient frontal solver for fully coupled non-linear hygro-thermo-mechanical problems 68
Bounds and Estimates on the Average Edit Distance 68
The I/O complexity of Toom-Cook integer multiplication 65
Optimal organizations for pipelined memory hierarchies 64
BSP versus LogP 62
The Potential of On-Chip Multiprocessing for QCD Machines 61
An Approach toward an Analytical Characterization of Locality and its Portability 59
Derivative grammars: a symbolic approach to parsing with derivatives 59
The I/O complexity of Strassen’s matrix multiplication with recomputation 58
Efficient Stack Distance Computation for Priority Replacement Policies 56
On stalling in LogP 55
Optimal on-line computation of stack distances for MIN and OPT 54
BSP vs LogP 52
New Area-Time Lower Bounds for the Multidimensional DFT 48
AuroraScience Project. Report on the First Phase. 46
Calcolatori: Hardware 41
Models of Computation, TheoreticalEncyclopedia of Parallel Computing 34
The DAG Visit Approach for Pebbling and I/O Lower Bounds 13
FlexSEE: a Flexible Secure Execution Environment for protecting data-in-use 2
Totale 3.855
Categoria #
all - tutte 15.009
article - articoli 4.815
book - libri 265
conference - conferenze 0
curatela - curatele 308
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 2.896
Totale 23.293


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020402 0 0 0 0 0 0 69 89 75 75 56 38
2020/2021659 28 49 33 49 22 82 13 46 107 109 65 56
2021/2022562 22 57 102 24 34 24 36 56 35 15 67 90
2022/2023453 116 41 6 50 74 40 4 29 71 2 18 2
2023/2024235 6 27 20 12 21 47 5 24 8 6 32 27
2024/2025394 10 68 33 54 208 19 2 0 0 0 0 0
Totale 3.855