Pinotti, Maria Cristina
 Distribuzione geografica
Continente #
NA - Nord America 4.070
AS - Asia 1.274
EU - Europa 765
SA - Sud America 215
AF - Africa 20
Continente sconosciuto - Info sul continente non disponibili 11
Totale 6.355
Nazione #
US - Stati Uniti d'America 4.006
SG - Singapore 575
CN - Cina 297
VN - Vietnam 189
UA - Ucraina 166
BR - Brasile 165
RU - Federazione Russa 147
FI - Finlandia 92
SE - Svezia 65
FR - Francia 59
LV - Lettonia 56
HK - Hong Kong 55
GB - Regno Unito 54
KR - Corea 51
CA - Canada 32
DE - Germania 32
IT - Italia 29
IN - India 20
BG - Bulgaria 18
MX - Messico 14
AR - Argentina 13
LT - Lituania 13
IQ - Iraq 12
EC - Ecuador 11
TR - Turchia 11
BD - Bangladesh 9
CO - Colombia 9
JP - Giappone 9
ID - Indonesia 8
VE - Venezuela 8
PL - Polonia 7
EE - Estonia 6
ES - Italia 6
NL - Olanda 6
PK - Pakistan 6
JM - Giamaica 5
ZA - Sudafrica 5
KE - Kenya 4
PY - Paraguay 4
SA - Arabia Saudita 4
TH - Thailandia 4
AE - Emirati Arabi Uniti 3
CR - Costa Rica 3
HN - Honduras 3
IE - Irlanda 3
JO - Giordania 3
TT - Trinidad e Tobago 3
AZ - Azerbaigian 2
BO - Bolivia 2
CL - Cile 2
DZ - Algeria 2
MA - Marocco 2
MY - Malesia 2
NP - Nepal 2
OM - Oman 2
SN - Senegal 2
TN - Tunisia 2
UZ - Uzbekistan 2
AT - Austria 1
BE - Belgio 1
BY - Bielorussia 1
CI - Costa d'Avorio 1
CU - Cuba 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GE - Georgia 1
GT - Guatemala 1
HU - Ungheria 1
IL - Israele 1
IR - Iran 1
KZ - Kazakistan 1
PE - Perù 1
PH - Filippine 1
QA - Qatar 1
SC - Seychelles 1
SI - Slovenia 1
SV - El Salvador 1
SY - Repubblica araba siriana 1
TW - Taiwan 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 6.346
Città #
Jacksonville 381
Singapore 374
Chandler 327
Ashburn 319
Fairfield 282
San Jose 218
Dallas 175
Woodbridge 160
Columbus 139
Santa Clara 134
Council Bluffs 127
Seattle 120
San Mateo 114
Wilmington 113
Cambridge 112
Houston 111
Princeton 98
Ann Arbor 90
Moscow 78
Beijing 58
Riga 56
Ho Chi Minh City 54
Hong Kong 52
Lauterbourg 52
Seoul 49
The Dalles 49
Hanoi 45
Los Angeles 45
New York 43
Boardman 35
Dearborn 35
Helsinki 31
Hefei 24
Sofia 18
Buffalo 16
Da Nang 15
São Paulo 15
Phoenix 14
Redondo Beach 13
London 11
Munich 11
San Diego 11
Toronto 11
Turku 11
Vilnius 11
Chicago 10
Guangzhou 9
Haiphong 9
Brooklyn 7
Denver 7
Guayaquil 7
Warsaw 7
Bogotá 6
Changsha 6
Falls Church 6
Frankfurt am Main 6
Jakarta 6
Jinan 6
North Bergen 6
Orem 6
San Francisco 6
Curitiba 5
Izmir 5
Kunming 5
Milan 5
Montreal 5
Norwalk 5
Shanghai 5
Shenyang 5
Tianjin 5
Tokyo 5
Andover 4
Atlanta 4
Brasília 4
Chennai 4
Ha Long 4
Istanbul 4
Johannesburg 4
Kingston 4
Ottawa 4
Secaucus 4
Wuhan 4
Abbeville 3
Baghdad 3
Belo Horizonte 3
Biên Hòa 3
Boston 3
Bến Tre 3
Charlotte 3
Des Moines 3
Dublin 3
Guarulhos 3
Memphis 3
Mexico City 3
Nairobi 3
Newark 3
Praia Grande 3
Pune 3
Querétaro 3
Rio de Janeiro 3
Totale 4.515
Nome #
Conflict Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems 174
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-MAx-PAir Heap Operations on the Hypercube 161
A Parallel Solution to the Extended Set-Union Problem With Unlimited Backtracking 157
Comparator Networks for Binary Heap Construction 157
Comparator Networks for Binary Heap Construction 152
Adding Flexibility to Hybrid Number Systems 151
A Scalable VLSI Architecture for Binary Prefix Sums 148
A Systolic Architecture for Sorting an Arbitrary Number of Elements 148
Distributed Priority Queues on Hypercube Architectures 143
Scalable Hardware-Algorithms for Binary Prefix Sums 142
Conflict-Free Path Access of Trees in Parallel Memory Systems and its Generalization with Applications to Distributed Heap Implementations 132
A New Hybrid Broadcast scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data based on Optimal Cut-Off Point 130
Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access 129
Minimal Synthesis of Multivalued Functions with New Operators 128
Conflict-Free Template Access in k-ary and Binomial Trees 127
Parallel Priority Queues 127
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates 127
Parallel Priority Queues based on Binomial Heaps 126
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes 125
Scalable Hardware-Algorithms for Binary Prefix Sums 124
Conflict-Free Data Access in Parallel Memory Systems: Algorithms and Experimental Study 123
A Strictly-Optimal Strategy to Access Mumti-Dimensional Data on Parallel Disk Systems 120
Parallel CSD-Coding and Its Generalization 119
An Optimal Hardware-Algorithm for Selection Using a Ficed-Size Parallel Classifier Device 118
Efficient Error Correcting Technique for Digital Equipment 118
Optimal Tree Access by Elementary and Composite templates in Parallel Memory Systems 116
Broadcast and Other Primitive Operations on Fat-Trees 113
Fast VLSI Circuits for CSD-Coding and GNAF-Coding 113
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 113
On the Problem of Tracking Mobile Users in Wireless Communications Networks 110
An Optical Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product Files 109
Parallel Priority Queues 108
Some Comments on Building Heaps in Parallel 107
Fast Base Extension and Precise Scaling in RNS for Look Up Table Implementations 107
Channel Assignment with Separation on Trees and Interval Graphs 106
o(log log n) Time Algorithms for Hamiltonian-Siffix and Min-Max Pair Heap Operations on the Hypercube 105
Time Optimal Mixed Radix Conversion for Residue Number Applications 105
A Fully Parallel Residue-to-Binary Conversion 103
Mappings for conflict-free accessing paths in elementary data structures 103
An Optical Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 102
Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations 99
Parallel Algorithms for Prioriry Queue Operations 96
Allocating Servers in Infostations for Bounded Simultaneous Requests 94
A Fully Parallel Residue-to-Binary Conversion 94
Efficient Computation on a Processor Array with Pipelined TDM Optical Buses 88
Toward a Universal Mapping for Accessing Trees in Parallel Memory Systems 86
Parallel and Distributed Meldable Priority queues based on Binomial lHeaps 86
Parallel Algorithms for Priority Queues Operations 85
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time_division Multiplexing Optical Buses 85
Suboptimal Solutions for PLA Multiple Column Folding 80
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multi-dimensional Files 76
How to sort N Items Using a Network of Fixed I/O 76
Selection on Matrices Classifying Rows and Columns 73
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time-Division Multiplexing Optical Buses 72
Haplotyping Populations: Complexity and Approximations 70
Push less and pull the current highest demanded data item to decrease the waiting time in asymmetric communication environments 69
Totale 6.355
Categoria #
all - tutte 22.647
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 22.647


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022317 0 0 0 11 8 19 15 117 23 19 20 85
2022/2023585 79 56 8 98 88 93 0 48 78 6 24 7
2023/2024167 18 26 21 6 15 29 5 6 3 9 1 28
2024/2025893 3 2 18 223 78 150 3 39 58 138 70 111
2025/20261.815 88 35 288 276 160 140 378 33 149 189 56 23
2026/2027739 29 108 314 288 0 0 0 0 0 0 0 0
Totale 6.355