Catalogo dei prodotti della ricerca

MONTI, Angelo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.249
EU - Europa 620
AS - Asia 320
SA - Sud America 29
AF - Africa 2
OC - Oceania 1
Totale 4.221
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.230
UA - Ucraina 162
IT - Italia 155
IN - India 137
SG - Singapore 111
SE - Svezia 100
FI - Finlandia 68
CN - Cina 64
DE - Germania 46
GB - Regno Unito 46
AR - Argentina 26
CA - Canada 17
BG - Bulgaria 15
BE - Belgio 11
RO - Romania 8
HK - Hong Kong 6
IE - Irlanda 5
BR - Brasile 3
FR - Francia 2
MX - Messico 2
AU - Australia 1
ES - Italia 1
JP - Giappone 1
MU - Mauritius 1
QA - Qatar 1
RU - Federazione Russa 1
ZA - Sudafrica 1
Totale 4.221
Salva come PNG Salva come JPEG
Città #
Fairfield 517
Chandler 349
Woodbridge 285
Ashburn 238
Seattle 225
Houston 212
Cambridge 178
Ann Arbor 174
Wilmington 166
Rome 86
Princeton 77
Plano 71
Singapore 71
Jacksonville 61
Boston 46
Lawrence 46
Beijing 43
San Paolo di Civitate 39
Boardman 28
San Diego 28
Federal 26
Norwalk 21
Des Moines 17
Millbury 17
Sofia 15
Dearborn 14
Falls Church 12
Andover 11
Brussels 11
Southend 11
Toronto 11
New York 10
Bühl 8
Cottbus 7
Karlsruhe 7
Nanjing 6
Ottawa 6
Dublin 5
Indiana 5
Mannheim 5
Milan 5
San Mateo 5
London 4
Auburn Hills 3
Kunming 3
Los Angeles 3
Phoenix 3
Rodgau 3
Washington 3
Chennai 2
Ciudad Nezahualcoyotl 2
Grafing 2
Hefei 2
Helsinki 2
Jinan 2
Leawood 2
Lecce 2
Philadelphia 2
Redwood City 2
San Francisco 2
Shenyang 2
Sterling 2
Tarquinia 2
Tortoreto 2
Treglio 2
Trumbull 2
Wenzhou 2
Basildon 1
Bologna 1
Buffalo 1
Changsha 1
Corbetta 1
Düsseldorf 1
Eden Prairie 1
Fiumicino 1
Hounslow 1
Jönköping 1
Kilburn 1
Lappeenranta 1
Mairena del Aljarafe 1
Melbourne 1
Monterotondo 1
Muizenberg 1
Nanchang 1
Nuremberg 1
Provo 1
Pune 1
Redmond 1
Rolla 1
San Jose 1
Santa Clara 1
Sarstedt 1
Springfield 1
Yellow Springs 1
Yinchuan 1
Totale 3.261
Salva come PNG Salva come JPEG
Nome #
Systolic tree with base automata. 109
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs 100
A gap theorem for the anonymous torus 95
A linear time algorithm for the feasibility of pebble motion on trees 94
On dynamic threshold graphs and related classes 91
Chomsky Hierarchy and systolic Y-Tree 83
On the complexity of some reachability problems 79
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. 78
A Better Bound for Locally Thin Set Families 77
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game 75
Systolic Y-tree automata: closure properties and decision problems. 73
Communication in dynamic radio networks 73
Fast flooding over Manhattan 72
Minimum energy broadcast and disk cover in grid wireless networks 72
On the bounded-hop MST problem on random Euclidean instances 72
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances 72
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. 71
Distributed broadcast in radio networks of unknown topology 71
Graphs that are not pairwise compatible: A new proof technique (extended abstract) 71
A logical characterization of systolic languages 71
DELTA-SYSTEMS AND QUALITATIVE (IN)DEPENDENCE 70
Flooding Time in edge-Markovian Dynamic Graphs 68
On reconfigurability of VLSI linear arrays 66
Compact representations of the intersection structure of families of finite sets 66
A linear time algorithm for the feasibility of pebble motion on trees 65
Minimum-Energy Broadcast and disk cover in grid wireless networks 65
Broadcasting in dynamic radio networks 63
Testing and reconfiguration of VLSI linear arrays 63
Some classes of graphs that are not PCGs 60
Succinctness of descriptions of SBTA-languages 59
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 59
Logical definability of Y-tree and trellis systolic omega languages 58
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. 58
Modelling mobility: A discrete revolution 58
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-hoc Wireless Networks 57
Reverse-free codes and permutations 57
On the computational complexity of graph closures 57
Spanning Trees with Many Leaves in Regular Bipartite Graphs. 57
Languages accepted by Systolic Y-tree automata: structural characterizations. 57
On reverse-free codes and permutations 55
Flooding time of edge-Markovian evolving graphs 55
Families of locally separated Hamilton paths 55
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks 54
Co-divergence and tree topology 54
The shuffled mesh: a flexible and efficient model for parallel computing 54
Self-similarity bounds for locally thin set families 53
String factorisations with maximum or minimum dimension 53
Completeness results concerning systolic tree automata and EOL languages 52
Information spreading in stationary Markovian evolving graphs 52
Optimal gossiping in geometric radio networks in the presence of dynamical faults 52
Distributed Multi-Broadcast in Unknown Radio Networks 52
A Kleene-like charachterization of languages accepted by Systolic Binary Tree Automata. 52
Minimum-energy broadcast in random-grid Ad-Hoc Networks: Approximation and distributed algorithms 50
Systolic tree omega-languages: the operational and the logical view 50
Systolic omega-Languages 49
Some classes of graphs that are not pairwise compatibility graphs (communication) 48
Round Robin is optimal for fault-tolerant broadcasting on wireless networks 46
null 45
Modelling Mobility: A Discrete Revolution 44
Fast Flooding over Manhattan 43
An Equivalent Version of the Caccetta-Haeggkvist Conjecture in an Online Load Balancing Problem 40
On variants of Vertex Geography on undirected graphs 38
Fully dynamically mantaining minimal integral separator for Threshold and Difference Graphs 34
Information spreading in stationary markovian evolving graphs 34
String quartets in binary 32
The Shuffled Mesh: A Flexible and Efficient Model for Parallel Computing 31
Comparison results for particular systolic tree automata 30
Rainbow graph splitting 30
Trade off between computational power and common knowledge in anonymous rings 29
null 27
Regular sets, context-free languages and Systolic Y-tree Automata 26
Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoe wireless networks 26
On the domination number of t-constrained de Bruijn graphs 22
State complexity of Systolic Binary Tree automata 22
On Star-Multi-interval Pairwise Compatibility Graphs 18
Selective Families, Superimposed Codes and Broadcasting in Unknown Radio Networks 16
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract) 15
On the Domination Number of t-Constrained de Bruijn Graphs (Short Paper) 13
A locally connected spanning tree can be found in polynomial time on simple clique 3-trees 8
On Graphs that are not Star-K-PCGs (short paper) 5
Totale 4.326
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.816
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 10.816
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.026 158 52 14 53 98 106 125 121 122 93 66 18
2020/2021388 49 49 27 27 10 22 11 50 50 60 27 6
2021/2022835 7 56 85 16 95 22 44 86 71 55 145 153
2022/2023838 136 134 91 95 124 84 23 46 65 16 17 7
2023/2024290 21 62 14 24 17 34 10 9 3 37 30 29
2024/202545 45 0 0 0 0 0 0 0 0 0 0 0
Totale 4.326