IRIS
Pinotti, Maria Cristina
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.449
EU - Europa 380
AS - Asia 169
AF - Africa 2
Totale 3.000
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.444
UA - Ucraina 165
SG - Singapore 93
FI - Finlandia 67
CN - Cina 63
SE - Svezia 63
GB - Regno Unito 27
BG - Bulgaria 18
IT - Italia 12
DE - Germania 10
RU - Federazione Russa 7
ID - Indonesia 6
CA - Canada 5
TR - Turchia 5
NL - Olanda 4
FR - Francia 3
AT - Austria 1
CI - Costa d'Avorio 1
ES - Italia 1
GE - Georgia 1
IE - Irlanda 1
IR - Iran 1
PL - Polonia 1
SC - Seychelles 1
Totale 3.000
Salva come PNG Salva come JPEG
Città #
Jacksonville 379
Chandler 327
Fairfield 281
Woodbridge 160
Ashburn 151
Seattle 117
San Mateo 114
Cambridge 112
Wilmington 112
Houston 108
Princeton 97
Ann Arbor 90
Singapore 63
Dearborn 35
Boardman 31
Beijing 27
New York 25
Sofia 18
Helsinki 17
Santa Clara 11
San Diego 10
Falls Church 6
Jakarta 6
Los Angeles 6
Izmir 5
Norwalk 5
Andover 4
Council Bluffs 4
Hefei 4
Kunming 4
London 4
Toronto 4
Des Moines 3
Jinan 3
Milan 3
Shenyang 3
Turin 3
Verona 3
Hanover 2
Lawrence 2
Nanchang 2
Nanjing 2
Wuhan 2
Abidjan 1
Changsha 1
Chaoyang 1
Chengdu 1
Chongqing 1
Clearwater 1
Dublin 1
Düsseldorf 1
Fuzhou 1
Guangzhou 1
Gunzenhausen 1
Hangzhou 1
Hebei 1
Madrid 1
Mountain View 1
Portland 1
Redmond 1
Rovereto 1
Scarborough 1
Springfield 1
Tbilisi 1
Toenisvorst 1
Vienna 1
Wageningen 1
Xian 1
Zhengzhou 1
Totale 2.391
Salva come PNG Salva come JPEG
Nome #
Adding Flexibility to Hybrid Number Systems 93
Distributed Priority Queues on Hypercube Architectures 87
Comparator Networks for Binary Heap Construction 86
Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access 84
O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-MAx-PAir Heap Operations on the Hypercube 83
A Parallel Solution to the Extended Set-Union Problem With Unlimited Backtracking 82
A Systolic Architecture for Sorting an Arbitrary Number of Elements 81
Conflict-Free Template Access in k-ary and Binomial Trees 80
Conflict Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems 79
On the Problem of Tracking Mobile Users in Wireless Communications Networks 79
Parallel Priority Queues based on Binomial Heaps 77
A Scalable VLSI Architecture for Binary Prefix Sums 75
Comparator Networks for Binary Heap Construction 73
Parallel Priority Queues 73
Scalable Hardware-Algorithms for Binary Prefix Sums 73
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes 72
Efficient Error Correcting Technique for Digital Equipment 72
Parallel Priority Queues 71
Minimal Synthesis of Multivalued Functions with New Operators 70
Some Comments on Building Heaps in Parallel 69
Fast Base Extension and Precise Scaling in RNS for Look Up Table Implementations 68
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates 67
Fast VLSI Circuits for CSD-Coding and GNAF-Coding 66
Optimal Tree Access by Elementary and Composite templates in Parallel Memory Systems 65
Time Optimal Mixed Radix Conversion for Residue Number Applications 65
Scalable Hardware-Algorithms for Binary Prefix Sums 63
Parallel CSD-Coding and Its Generalization 60
o(log log n) Time Algorithms for Hamiltonian-Siffix and Min-Max Pair Heap Operations on the Hypercube 52
Conflict-Free Path Access of Trees in Parallel Memory Systems and its Generalization with Applications to Distributed Heap Implementations 51
Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations 49
An Optical Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product Files 49
Conflict-Free Data Access in Parallel Memory Systems: Algorithms and Experimental Study 49
Broadcast and Other Primitive Operations on Fat-Trees 46
A New Hybrid Broadcast scheduling Algorithm for Asymmetric Communication Systems: Push and Pull Data based on Optimal Cut-Off Point 45
An Optimal Hardware-Algorithm for Selection Using a Ficed-Size Parallel Classifier Device 44
A Strictly-Optimal Strategy to Access Mumti-Dimensional Data on Parallel Disk Systems 44
Parallel and Distributed Meldable Priority queues based on Binomial lHeaps 42
An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 42
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time_division Multiplexing Optical Buses 42
A Fully Parallel Residue-to-Binary Conversion 41
Toward a Universal Mapping for Accessing Trees in Parallel Memory Systems 41
Efficient Computation on a Processor Array with Pipelined TDM Optical Buses 40
Parallel Algorithms for Prioriry Queue Operations 39
An Optical Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device 38
Parallel Algorithms for Priority Queues Operations 37
A Fully Parallel Residue-to-Binary Conversion 35
How to sort N Items Using a Network of Fixed I/O 32
Generalized Coincident Pulse Technique and New Addressing Schemes for Pipelined Time-Division Multiplexing Optical Buses 29
Suboptimal Solutions for PLA Multiple Column Folding 27
Mappings for conflict-free accessing paths in elementary data structures 26
Load Balanced and Optimal Disk Allocation Strategy for Partial Match Queries on Multi-dimensional Files 14
Haplotyping Populations: Complexity and Approximations 14
Channel Assignment with Separation on Trees and Interval Graphs 9
Allocating Servers in Infostations for Bounded Simultaneous Requests 8
Push less and pull the current highest demanded data item to decrease the waiting time in asymmetric communication environments 6
Selection on Matrices Classifying Rows and Columns 5
Totale 3.009
Salva come PNG Salva come JPEG
Categoria #
all - tutte 11.704
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 11.704
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020638 0 0 0 74 98 66 127 60 98 27 22 66
2020/2021497 5 73 8 66 44 52 54 20 56 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/2025101 3 2 18 78 0 0 0 0 0 0 0 0
Totale 3.009