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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020564 0 0 0 0 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/2025316 3 2 18 223 70 0 0 0 0 0 0 0
Totale 3.224