Bertossi, Alan Albert
 Distribuzione geografica
Continente #
NA - Nord America 2.975
EU - Europa 496
AS - Asia 157
AF - Africa 3
Continente sconosciuto - Info sul continente non disponibili 1
Totale 3.632
Nazione #
US - Stati Uniti d'America 2.963
UA - Ucraina 188
SE - Svezia 95
CN - Cina 75
FI - Finlandia 63
DE - Germania 48
SG - Singapore 47
IT - Italia 37
JO - Giordania 26
BG - Bulgaria 21
GB - Regno Unito 21
CA - Canada 11
RU - Federazione Russa 7
FR - Francia 6
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 3.632
Città #
Fairfield 436
Jacksonville 404
Chandler 346
Ashburn 236
Woodbridge 215
Seattle 198
Cambridge 166
Wilmington 155
Houston 138
Princeton 102
Ann Arbor 91
San Mateo 73
Beijing 48
Bremen 39
New York 31
Dearborn 24
Singapore 21
Sofia 21
San Diego 17
Boardman 14
Helsinki 9
Milan 9
Toronto 9
Norwalk 8
Verona 7
Falls Church 6
Hefei 6
Lawrence 6
Andover 5
Los Angeles 5
Bologna 4
Trento 4
Fuzhou 3
Jinan 3
Kunming 3
Turin 3
Washington 3
Abidjan 2
Clearwater 2
Dallas 2
Des Moines 2
Dublin 2
Düsseldorf 2
Frankfurt am Main 2
Izmir 2
London 2
Vienna 2
Ahnsbeck 1
Baotou 1
Binasco 1
Bratislava 1
Busto Arsizio 1
Central District 1
Changsha 1
Chengdu 1
Chiswick 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
Santa Clara 1
Scarborough 1
Taranto 1
Wageningen 1
Xian 1
Zhoushan 1
Totale 2.914
Nome #
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors 104
New number representation and conversion techniques on reconfigurable mesh 94
Constant time dynamic programming on directed reconfigurable networks 94
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 92
On some matching problems arising in vehicle scheduling models 91
Optimal segmented scan and simulation of reconfigurable architectures on fixed-connection networks 91
Differential Greedy for the 0-1 Equicut Problem 88
A VLSI implementation of the simplex algorithm 88
A randomized saturation degree heuristic for channel assignment in cellular radio networks 88
A gracefully degradable VLSI system for linear programming 87
A residue number system on reconfigurable mesh with applications to prefix sums and approximate string-matching 83
Some parallel algorithms on interval graphs 82
Differential greedy for the $0$-$1$ equicut problem 82
Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks 81
Allocating Servers in Infostations for Bounded Simultaneous Requests 81
Hamiltonian circuits in interval graph generalizations 80
A randomized saturation-degree heuristic for channel assignment in cellular radio networks 80
Total domination in interval graphs 75
Reconfigurable treearchitectures for gracefully degradable VLSI systems 74
Greedy, Prohibition and Reactive Heuristics for Graph-Partitioning 74
Time slot assignment in SS/TDMA systems with intersatellite links 73
A VLSI system for string matching 73
Code assignment for hidden terminalinterference avoidance in multihop packet radio networks 73
Preemptive scheduling of periodic jobs in uniform multiprocessor systems 72
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs 72
Randomized greedy algorithms for the hypergraph partitioning problem 72
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 71
Fault-tolerant LPT task scheduling in multiprocessor systems 71
A parallel solution to the approximate string matching problem 71
Parallel circle-cover algorithms 69
Increasing processor utilization in hard-real-time systems with checkpoints 69
Dominating sets for split and bipartite graphs 69
Finding Hamiltonian circuits in proper interval graphs 67
Total domination and irredundance in weighted interval graphs 66
Parallel string matching with variable lengthdon't cares 65
The edge Hamiltonian path problem is NP-complete 65
Parallel algorithms on circular-arc graphs 62
Rate-monotonic scheduling for hard-real-time systems 61
String matching with weighted errors 61
Cellular channel assignment: a new localized and distributed algorithm 60
Algoritmi e Strutture di Dati 54
Cellular channel assignment: comparing and simplifying heuristics 53
Algoritmi e strutture di dati 51
Assigning codes in wireless networks: bounds and scaling properties 48
Efficient Use of Radio Spectrum in Wireless NBetworks with Channel Separation between Close Stations 48
Algoritmi e Strutture di Dati 45
Distributed code assignment in multihop radio networks: object-oriented software simulations 44
On the domatic number of interval graphs 40
Scheduling algorithms for fault-tolerance inhard-real-time systems 40
P-bandwidth priority queues on reconfigurable treeof meshes 38
Special issue: Proceedings of the First Conference on Algorithms and Experiments (ALEX98) 37
On-line operation 33
Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems combining active and passive task replication 32
Mappings for conflict-free accessing paths in elementary data structures 25
Channel Assignment with Separation for Interference Avoidance in Wireless Networks 9
Channel Assignment with Separation on Trees and Interval Graphs 6
Allocating Servers in Infostations for Bounded Simultaneous Requests 5
Selection on Matrices Classifying Rows and Columns 3
Totale 3.682
Categoria #
all - tutte 12.948
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 727
Totale 13.675


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020926 0 0 83 101 129 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/202511 2 4 5 0 0 0 0 0 0 0 0 0
Totale 3.682