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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022374 0 57 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/2027131 29 102 0 0 0 0 0 0 0 0 0 0
Totale 5.747