Bertossi, Alan Albert
 Distribuzione geografica
Continente #
NA - Nord America 3.241
EU - Europa 538
AS - Asia 342
AF - Africa 3
Continente sconosciuto - Info sul continente non disponibili 1
Totale 4.125
Nazione #
US - Stati Uniti d'America 3.228
SG - Singapore 202
UA - Ucraina 188
CN - Cina 101
SE - Svezia 95
FI - Finlandia 65
DE - Germania 53
IT - Italia 40
RU - Federazione Russa 30
JO - Giordania 26
GB - Regno Unito 22
BG - Bulgaria 21
CA - Canada 12
FR - Francia 6
BE - Belgio 4
ID - Indonesia 4
LT - Lituania 4
IL - Israele 3
NL - Olanda 3
TR - Turchia 3
AT - Austria 2
CI - Costa d'Avorio 2
IE - Irlanda 2
IN - India 2
DK - Danimarca 1
EU - Europa 1
HK - Hong Kong 1
MA - Marocco 1
MX - Messico 1
RO - Romania 1
SK - Slovacchia (Repubblica Slovacca) 1
Totale 4.125
Città #
Fairfield 436
Jacksonville 404
Chandler 346
Ashburn 236
Woodbridge 215
Seattle 198
Cambridge 166
Singapore 160
Wilmington 155
Houston 138
Santa Clara 130
Columbus 105
Princeton 102
Ann Arbor 91
San Mateo 73
Beijing 48
Bremen 39
New York 31
Dearborn 24
Moscow 23
Sofia 21
San Diego 17
Boardman 14
Helsinki 11
Toronto 10
Milan 9
Norwalk 8
Verona 7
Falls Church 6
Frankfurt am Main 6
Hefei 6
Lawrence 6
Andover 5
Los Angeles 5
Bologna 4
Brussels 4
Jakarta 4
Trento 4
Fuzhou 3
Jinan 3
Kunming 3
Turin 3
Washington 3
Abidjan 2
Casalecchio di Reno 2
Clearwater 2
Dallas 2
Des Moines 2
Dublin 2
Düsseldorf 2
Izmir 2
London 2
North Bergen 2
Vienna 2
Ahnsbeck 1
Baotou 1
Binasco 1
Bratislava 1
Brescia 1
Busto Arsizio 1
Central District 1
Changsha 1
Chengdu 1
Chiswick 1
Darmstadt 1
Gunzenhausen 1
Imola 1
Jinhua 1
Lanzhou 1
Milton 1
Mountain View 1
Nanchang 1
New Bedfont 1
Phoenix 1
Redmond 1
Redwood City 1
Scarborough 1
Shanghai 1
Taranto 1
Wageningen 1
Wuhan 1
Xian 1
Yingkou 1
Zhoushan 1
Totale 3.334
Nome #
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors 113
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 103
Constant time dynamic programming on directed reconfigurable networks 102
On some matching problems arising in vehicle scheduling models 102
New number representation and conversion techniques on reconfigurable mesh 100
A randomized saturation degree heuristic for channel assignment in cellular radio networks 99
Optimal segmented scan and simulation of reconfigurable architectures on fixed-connection networks 97
A VLSI implementation of the simplex algorithm 97
Differential Greedy for the 0-1 Equicut Problem 96
A gracefully degradable VLSI system for linear programming 96
Allocating Servers in Infostations for Bounded Simultaneous Requests 92
A residue number system on reconfigurable mesh with applications to prefix sums and approximate string-matching 91
A randomized saturation-degree heuristic for channel assignment in cellular radio networks 91
Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks 89
Some parallel algorithms on interval graphs 88
Differential greedy for the $0$-$1$ equicut problem 88
Code assignment for hidden terminalinterference avoidance in multihop packet radio networks 87
Hamiltonian circuits in interval graph generalizations 86
A VLSI system for string matching 83
A parallel solution to the approximate string matching problem 82
Total domination in interval graphs 81
Reconfigurable treearchitectures for gracefully degradable VLSI systems 81
Preemptive scheduling of periodic jobs in uniform multiprocessor systems 80
Time slot assignment in SS/TDMA systems with intersatellite links 80
Greedy, Prohibition and Reactive Heuristics for Graph-Partitioning 80
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs 79
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 78
Fault-tolerant LPT task scheduling in multiprocessor systems 78
Randomized greedy algorithms for the hypergraph partitioning problem 78
Parallel circle-cover algorithms 77
Increasing processor utilization in hard-real-time systems with checkpoints 76
Dominating sets for split and bipartite graphs 76
Total domination and irredundance in weighted interval graphs 74
Finding Hamiltonian circuits in proper interval graphs 73
Parallel string matching with variable lengthdon't cares 72
The edge Hamiltonian path problem is NP-complete 72
Parallel algorithms on circular-arc graphs 70
Cellular channel assignment: a new localized and distributed algorithm 70
Rate-monotonic scheduling for hard-real-time systems 69
String matching with weighted errors 68
Algoritmi e strutture di dati 66
Algoritmi e Strutture di Dati 65
Cellular channel assignment: comparing and simplifying heuristics 63
Assigning codes in wireless networks: bounds and scaling properties 57
Algoritmi e Strutture di Dati 54
Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations 53
Distributed code assignment in multihop radio networks: object-oriented software simulations 52
P-bandwidth priority queues on reconfigurable treeof meshes 47
On the domatic number of interval graphs 46
Scheduling algorithms for fault-tolerance inhard-real-time systems 46
Special issue: Proceedings of the First Conference on Algorithms and Experiments (ALEX98) 44
On-line operation 41
Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems combining active and passive task replication 40
Mappings for conflict-free accessing paths in elementary data structures 37
Allocating Servers in Infostations for Bounded Simultaneous Requests 21
Channel Assignment with Separation for Interference Avoidance in Wireless Networks 20
Channel Assignment with Separation on Trees and Interval Graphs 15
Selection on Matrices Classifying Rows and Columns 14
Totale 4.175
Categoria #
all - tutte 14.626
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 792
Totale 15.418


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020613 0 0 0 0 0 74 146 92 141 50 36 74
2020/2021583 11 87 12 81 58 48 63 26 63 32 74 28
2021/2022415 7 45 1 25 29 31 12 84 33 41 20 87
2022/2023718 146 55 15 83 117 100 0 51 103 5 34 9
2023/2024214 15 24 19 8 25 54 8 10 3 8 9 31
2024/2025504 2 4 33 234 80 151 0 0 0 0 0 0
Totale 4.175