IRIS
Pinotti, Maria Cristina
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.300
AS - Asia 1.257
EU - Europa 723
SA - Sud America 199
AF - Africa 19
Totale 5.498
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.266
SG - Singapore 570
CN - Cina 295
VN - Vietnam 188
UA - Ucraina 165
BR - Brasile 159
RU - Federazione Russa 147
FI - Finlandia 92
SE - Svezia 65
FR - Francia 59
LV - Lettonia 56
HK - Hong Kong 53
KR - Corea 51
GB - Regno Unito 43
DE - Germania 29
IT - Italia 21
IN - India 20
BG - Bulgaria 18
CA - Canada 16
AR - Argentina 13
IQ - Iraq 12
MX - Messico 12
TR - Turchia 10
EC - Ecuador 9
JP - Giappone 9
BD - Bangladesh 8
ID - Indonesia 7
PL - Polonia 7
ES - Italia 6
PK - Pakistan 6
VE - Venezuela 6
NL - Olanda 5
ZA - Sudafrica 5
PY - Paraguay 4
SA - Arabia Saudita 4
TH - Thailandia 4
AE - Emirati Arabi Uniti 3
CO - Colombia 3
IE - Irlanda 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
DK - Danimarca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GE - Georgia 1
GT - Guatemala 1
HN - Honduras 1
IR - Iran 1
JM - Giamaica 1
KZ - Kazakistan 1
PE - Perù 1
QA - Qatar 1
SC - Seychelles 1
SI - Slovenia 1
SY - Repubblica araba siriana 1
TW - Taiwan 1
Totale 5.498
Salva come PNG Salva come JPEG
Città #
Jacksonville 379
Singapore 369
Chandler 327
Fairfield 281
Ashburn 225
Dallas 166
Woodbridge 160
San Jose 138
Santa Clara 126
Seattle 119
San Mateo 114
Cambridge 112
Wilmington 112
Houston 109
Columbus 103
Princeton 97
Ann Arbor 90
Moscow 78
Beijing 56
Riga 56
Ho Chi Minh City 54
Lauterbourg 52
Hong Kong 50
Seoul 49
The Dalles 49
Hanoi 44
Los Angeles 44
New York 38
Dearborn 35
Boardman 32
Helsinki 31
Hefei 24
Sofia 18
Buffalo 15
Da Nang 15
Redondo Beach 12
London 11
Munich 11
São Paulo 11
Turku 11
Council Bluffs 10
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
Curitiba 5
Izmir 5
Kunming 5
Milan 5
Norwalk 5
Shanghai 5
Shenyang 5
Tianjin 5
Tokyo 5
Andover 4
Brasília 4
Brooklyn 4
Chennai 4
Denver 4
Ha Long 4
Istanbul 4
Johannesburg 4
Ottawa 4
Wuhan 4
Atlanta 3
Baghdad 3
Belo Horizonte 3
Biên Hòa 3
Bến Tre 3
Des Moines 3
Dublin 3
Guarulhos 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
Bogotá 2
Boston 2
Bragança Paulista 2
Bảo Lộc 2
Caruaru 2
Chengdu 2
Totale 4.075
Salva come PNG Salva come JPEG
Nome #
Conflict Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems 159
Comparator Networks for Binary Heap Construction 146
Comparator Networks for Binary Heap Construction 146
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-MAx-PAir Heap Operations on the Hypercube 145
A Parallel Solution to the Extended Set-Union Problem With Unlimited Backtracking 140
Adding Flexibility to Hybrid Number Systems 138
A Scalable VLSI Architecture for Binary Prefix Sums 134
A Systolic Architecture for Sorting an Arbitrary Number of Elements 134
Scalable Hardware-Algorithms for Binary Prefix Sums 130
Distributed Priority Queues on Hypercube Architectures 128
Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access 119
Conflict-Free Path Access of Trees in Parallel Memory Systems and its Generalization with Applications to Distributed Heap Implementations 115
Parallel Priority Queues 115
Conflict-Free Template Access in k-ary and Binomial Trees 113
Parallel Priority Queues based on Binomial Heaps 113
A New Hybrid Broadcast scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data based on Optimal Cut-Off Point 113
Scalable Hardware-Algorithms for Binary Prefix Sums 112
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates 109
Minimal Synthesis of Multivalued Functions with New Operators 108
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes 107
Conflict-Free Data Access in Parallel Memory Systems: Algorithms and Experimental Study 106
Optimal Tree Access by Elementary and Composite templates in Parallel Memory Systems 105
Efficient Error Correcting Technique for Digital Equipment 104
A Strictly-Optimal Strategy to Access Mumti-Dimensional Data on Parallel Disk Systems 102
Parallel CSD-Coding and Its Generalization 101
On the Problem of Tracking Mobile Users in Wireless Communications Networks 101
An Optimal Hardware-Algorithm for Selection Using a Ficed-Size Parallel Classifier Device 97
Broadcast and Other Primitive Operations on Fat-Trees 97
Parallel Priority Queues 97
Time Optimal Mixed Radix Conversion for Residue Number Applications 96
Fast Base Extension and Precise Scaling in RNS for Look Up Table Implementations 96
Fast VLSI Circuits for CSD-Coding and GNAF-Coding 96
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 94
An Optical Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product Files 92
Some Comments on Building Heaps in Parallel 91
Channel Assignment with Separation on Trees and Interval Graphs 88
Mappings for conflict-free accessing paths in elementary data structures 88
o(log log n) Time Algorithms for Hamiltonian-Siffix and Min-Max Pair Heap Operations on the Hypercube 87
An Optical Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 87
A Fully Parallel Residue-to-Binary Conversion 86
Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations 86
A Fully Parallel Residue-to-Binary Conversion 80
Parallel Algorithms for Prioriry Queue Operations 79
Parallel and Distributed Meldable Priority queues based on Binomial lHeaps 77
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time_division Multiplexing Optical Buses 74
Efficient Computation on a Processor Array with Pipelined TDM Optical Buses 72
Parallel Algorithms for Priority Queues Operations 71
Toward a Universal Mapping for Accessing Trees in Parallel Memory Systems 71
Allocating Servers in Infostations for Bounded Simultaneous Requests 69
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time-Division Multiplexing Optical Buses 61
Selection on Matrices Classifying Rows and Columns 60
How to sort N Items Using a Network of Fixed I/O 60
Suboptimal Solutions for PLA Multiple Column Folding 59
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multi-dimensional Files 57
Haplotyping Populations: Complexity and Approximations 54
Push less and pull the current highest demanded data item to decrease the waiting time in asymmetric communication environments 42
Totale 5.507
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.001
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 19.001
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021119 0 0 0 0 0 0 0 0 0 22 69 28
2021/2022377 3 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.706 88 35 288 276 160 140 378 33 149 159 0 0
Totale 5.507