BILARDI, GIANFRANCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2733
EU - Europa 297
AS - Asia 175
OC - Oceania 3
Totale 3208
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2731
CN - Cina 133
IT - Italia 69
FI - Finlandia 59
DE - Germania 58
UA - Ucraina 54
VN - Vietnam 38
SE - Svezia 27
GB - Regno Unito 15
BE - Belgio 5
IE - Irlanda 4
NL - Olanda 3
AU - Australia 2
CA - Canada 2
IN - India 2
JP - Giappone 2
RO - Romania 2
FR - Francia 1
NZ - Nuova Zelanda 1
Totale 3208
Salva come PNG Salva come JPEG
Città #
Fairfield 438
Houston 321
Woodbridge 284
Jacksonville 261
Chandler 228
Ann Arbor 193
Seattle 173
Wilmington 169
Ashburn 159
Cambridge 152
Princeton 67
San Diego 39
Dong Ket 38
Medford 37
Nanjing 34
Beijing 33
Padova 32
Helsinki 18
Boardman 15
Des Moines 12
Shenyang 12
Nanchang 11
Roxbury 9
Guangzhou 7
Hebei 6
Jiaxing 6
Kempten 6
Brussels 5
Changsha 5
Indiana 5
Jinan 5
London 5
Silea 5
Tianjin 5
Bremen 4
Dublin 4
Falls Church 4
Riolo Terme 4
Limena 3
New York 3
Waldwick 3
Zhengzhou 3
Haikou 2
Islington 2
Jesolo 2
Karlsruhe 2
Melbourne 2
Mestre 2
Norwalk 2
Phoenix 2
Redwood City 2
Rome 2
San Donà Di Piave 2
Venezia 2
Borås 1
Hangzhou 1
Hanover 1
Horia 1
Kharkiv 1
Marietta 1
Ningbo 1
Nürnberg 1
Orange 1
Ottawa 1
Paris 1
Pinehaven 1
Pirmasens 1
San Francisco 1
Sannomaru 1
Santu Lussurgiu 1
Taizhou 1
Tokyo 1
Trieste 1
Turin 1
Verona 1
Welling 1
Yellow Springs 1
Totale 2870
Salva come PNG Salva come JPEG
Nome #
On bufferless routing of variable length messages in leveled networks. 162
Network-Oblivious Algorithms 149
An accurate and efficient frontal solver for fully-coupled hygro-thermo-mechanical problems 120
Network-Oblivious Algorithms 115
The role of terminal cost/reward in finite-horizon, discrete-time LQ optimal control 111
On bufferless routing of variable-length messages in leveled networks 101
A Lower Bound Technique for Communication in BSP 95
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies 92
On Approximating the Ideal Random Access Machine by Physical Machines 91
A frontal solver tuned for fully-coupled non-linear hygro-thermo-mechanical problems 85
The speculative prefetcher and evaluator processor for pipelined memory hierarchies 82
Algorithms for computing the single static assignment form 80
A Lower Bound Technique for Communication on BSP with Application to the FFT 80
Efficient Stack Distance Computation for a Class of Priority Replacement Policies 76
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer 75
Decomposable BSP: a bandwidth-latency model for parallel and hierarchical computation 73
Algorithms — ESA’ 986th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings 72
Universality in VLSI Computation 71
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation 71
Tight bounds on parallel list marking 69
Decomposable BSP: A Bandwidth-Latency Model for Parallel and Hierarchical Computation 68
Area-Time Tradeoffs for Universal VLSI Circuits. 66
Area-universal Circuits with Constant Slowdown 66
Tight bounds on parallel list marking 65
Spectral analysis of the powers of a PAM digital signal 64
A quantitative measure of portability with application to bandwidth-latency models for parallel computing 62
Optimal eviction policies for stochastic address traces 60
An accurate and efficient frontal solver for fully-coupled hygro-thermo-mechanical problems 58
Optimal organizations for pipelined memory hierarchies 57
On stalling in LogP 56
The I/O complexity of Toom-Cook integer multiplication 55
Bounds and Estimates on the Average Edit Distance 53
A Graphical Model for Context-Free Grammar ParsingCompiler Construction 53
BSP versus LogP 52
Derivative grammars: a symbolic approach to parsing with derivatives 52
An accurate and efficient frontal solver for fully coupled non-linear hygro-thermo-mechanical problems 51
The Potential of On-Chip Multiprocessing for QCD Machines 49
Efficient Stack Distance Computation for Priority Replacement Policies 47
Optimal on-line computation of stack distances for MIN and OPT 46
On stalling in LogP 44
An Approach toward an Analytical Characterization of Locality and its Portability 43
New Area-Time Lower Bounds for the Multidimensional DFT 38
BSP vs LogP 38
The I/O complexity of Strassen’s matrix multiplication with recomputation 38
Calcolatori: Hardware 28
AuroraScience Project. Report on the First Phase. 28
Models of Computation, TheoreticalEncyclopedia of Parallel Computing 23
The DAG Visit Approach for Pebbling and I/O Lower Bounds 1
Totale 3231
Salva come PNG Salva come JPEG
Categoria #
all - tutte 6415
article - articoli 2251
book - libri 74
conference - conferenze 0
curatela - curatele 131
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 1218
Totale 10089
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/20183 0000 00 00 0003
2018/2019362 23742 41 434 3449299
2019/2020702 96191345 6859 6989 75755638
2020/2021659 28493349 2282 1346 1071096556
2021/2022562 225710224 3424 3656 35156790
2022/2023458 11641650 7440 430 734200
Totale 3231