RE.PUBLIC@POLIMI pubblicazioni di ricerca del Politecnico di Milano

RODARO, EMANUELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.926
EU - Europa 1.417
AS - Asia 909
SA - Sud America 225
AF - Africa 50
OC - Oceania 9
Totale 5.536
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.880
RU - Federazione Russa 689
SG - Singapore 458
IT - Italia 308
CN - Cina 210
BR - Brasile 200
VN - Vietnam 110
GB - Regno Unito 79
DE - Germania 68
FI - Finlandia 43
FR - Francia 39
SE - Svezia 33
IE - Irlanda 32
UA - Ucraina 29
CA - Canada 28
MA - Marocco 28
IN - India 25
NL - Olanda 21
ID - Indonesia 18
ES - Italia 16
AR - Argentina 13
KR - Corea 13
BE - Belgio 12
BD - Bangladesh 9
HK - Hong Kong 9
MX - Messico 9
PL - Polonia 9
AT - Austria 8
AU - Australia 7
IQ - Iraq 7
JP - Giappone 7
ZA - Sudafrica 6
HR - Croazia 5
PH - Filippine 5
CZ - Repubblica Ceca 4
PK - Pakistan 4
PS - Palestinian Territory 4
SA - Arabia Saudita 4
TR - Turchia 4
EC - Ecuador 3
KE - Kenya 3
KZ - Kazakistan 3
TN - Tunisia 3
BB - Barbados 2
BG - Bulgaria 2
BJ - Benin 2
CI - Costa d'Avorio 2
CL - Cile 2
CR - Costa Rica 2
DK - Danimarca 2
LT - Lituania 2
LU - Lussemburgo 2
LV - Lettonia 2
NZ - Nuova Zelanda 2
PE - Perù 2
PT - Portogallo 2
PY - Paraguay 2
RO - Romania 2
SN - Senegal 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
AM - Armenia 1
BO - Bolivia 1
BT - Bhutan 1
BY - Bielorussia 1
CH - Svizzera 1
CO - Colombia 1
CU - Cuba 1
CY - Cipro 1
DM - Dominica 1
DO - Repubblica Dominicana 1
EG - Egitto 1
GE - Georgia 1
GL - Groenlandia 1
HU - Ungheria 1
IL - Israele 1
IR - Iran 1
IS - Islanda 1
KG - Kirghizistan 1
KH - Cambogia 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
MM - Myanmar 1
MN - Mongolia 1
MT - Malta 1
MU - Mauritius 1
MW - Malawi 1
NO - Norvegia 1
NP - Nepal 1
OM - Oman 1
PR - Porto Rico 1
QA - Qatar 1
RS - Serbia 1
TH - Thailandia 1
VE - Venezuela 1
ZW - Zimbabwe 1
Totale 5.536
Salva come PNG Salva come JPEG
Città #
Ashburn 391
Fairfield 321
Chandler 233
Singapore 201
Woodbridge 184
Santa Clara 180
Wilmington 145
Seattle 140
Houston 129
Cambridge 117
Moscow 109
Ann Arbor 98
Boardman 56
Dong Ket 55
Milan 53
Dearborn 51
Council Bluffs 50
Hefei 49
Dallas 46
Lawrence 39
Beijing 37
Los Angeles 35
London 33
Dublin 32
Medford 29
Casablanca 25
Miami 22
São Paulo 21
San Diego 20
New York 17
Columbus 16
Jakarta 16
Princeton 16
The Dalles 16
Frankfurt am Main 15
Buffalo 14
Jacksonville 14
Verona 14
Amsterdam 13
Helsinki 13
Norwalk 13
Ottawa 13
Seoul 13
Guwahati 12
Málaga 12
Brussels 11
Washington 11
Nuremberg 10
Campinas 9
Chicago 9
Düsseldorf 9
Ho Chi Minh City 9
Hong Kong 9
Montreal 8
Redwood City 8
Stockholm 8
Des Moines 7
Edinburgh 7
Lappeenranta 7
Rio de Janeiro 7
Springfield 7
Tokyo 7
Kent 6
Turku 6
Warsaw 6
Belo Horizonte 5
Berlin 5
Kiel 5
Roubaix 5
Zagreb 5
Altoona 4
Atlanta 4
Brasília 4
Curitiba 4
Guangzhou 4
Guglionesi 4
Johannesburg 4
Latina 4
Lauterbourg 4
Manaus 4
Mountain View 4
North Bergen 4
Phoenix 4
Porto Alegre 4
Tianjin 4
Vienna 4
Yekaterinburg 4
Amalfi 3
Charlotte 3
Conselheiro Lafaiete 3
Desio 3
Falls Church 3
Gessate 3
Groningen 3
Los Lunas 3
Melbourne 3
Nanjing 3
Prague 3
Prineville 3
Salvador 3
Totale 3.421
Salva come PNG Salva come JPEG
Nome #
Maximal subgroups of amalgams of finite inverse semigroups 198
Missing factors of ideals and synchronizing automata 167
Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups 164
Amalgams of finite inverse semigroups and deterministic context-free languages 161
A geometric approach to (semi)-groups defined by automata via dual transducers 158
Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness 150
Alphabetical satisfiability problem for trace equations 145
Freeness of automaton groups vs boundary dynamics 145
Amalgams vs Yamamura's HNN-extensions of inverse semigroups 144
Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups 143
Mortality Problem for 2x2 Integer Matrices 143
On the complexity of the word problem for automaton semigroups and automaton groups 142
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number 141
The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton 135
Ideal regular languages and strongly connected synchronizing automata 135
A stochastic continuous cellular automata traffic flow model with a multi-agent fuzzy system 134
Equalizers and kernels in categories of monoids 132
Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups 126
Multilinear equations in amalgams of finite inverse semigroups 122
SEMISIMPLE SYNCHRONIZING AUTOMATA AND THE WEDDERBURN-ARTIN THEORY 121
Boundary dynamics for bireversible and for contracting automaton groups 115
Eraser morphisms and membership problem in groups and monoids 114
Circular automata synchronize with high probability 113
Infinite automaton semigroups and groups have infinite orbits 107
Undecidability of the word problem for Yamamura’s HNN-extension under nice conditions 104
NP-completeness of the alphabetical satisfiability problem for trace equations 100
Amalgams of inverse semigroups and reversible two-counter machines 100
Catalan fragile words 99
Fragile words and Cayley type transducers 97
Bicyclic subsemigroups in amalgams of finite inverse semigroups 96
Orbit expandability of automaton semigroups and groups 93
Finitely generated synchronizing automata 90
Applications of automaton groups in cryptography 89
Strongly connected synchronizing automata and the language of minimal reset words 85
Groups and semigroups defined by colorings of synchronizing automata 84
On the structure theory of partial automaton semigroups 83
AUTOMATON SEMIGROUPS AND GROUPS: ON THE UNDECIDABILITY OF PROBLEMS RELATED TO FREENESS AND FINITENESS (vol 237, pg 15, 2020) 80
Trim strongly connected synchronizing automata and ideal languages 77
Representation of (Left) ideal regular languages by synchronizing automata 75
Synchronizing automata with finitely many minimal synchronizing words 73
Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete 72
Erratum to “Automaton semigroups and groups: On the undecidability of problems related to freeness and finiteness” 70
Fixed points of endomorphisms of graph groups 70
Fixed points of endomorphisms of trace monoids 68
Graph automaton groups 64
Generalizations of the Muller–Schupp theorem and tree‐like inverse graphs 62
Semisimple synchronizing automata and the wedderburn-artin theory 62
On the orbits of automaton semigroups and groups 60
On a class of poly-context-free groups generated by automata 59
On periodic points of free inverse monoid homomorphisms 58
Regular ideal languages and synchronizing automata 58
State complexity of code operators 57
On an uncountable family of graphs whose spectrum is a Cantor set 53
The Freeness Problem for Automaton Semigroups 50
Totale 5.643
Salva come PNG Salva come JPEG
Categoria #
all - tutte 19.272
article - articoli 16.053
book - libri 0
conference - conferenze 2.580
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 639
Totale 38.544
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021416 0 0 0 0 0 18 74 32 48 46 60 138
2021/2022384 7 51 38 41 15 22 26 28 17 26 54 59
2022/2023594 48 22 22 53 85 95 1 78 81 20 74 15
2023/2024288 23 40 13 58 33 58 5 6 8 5 4 35
2024/20251.133 1 27 31 29 200 80 40 102 176 78 167 202
2025/20261.570 489 511 155 216 173 26 0 0 0 0 0 0
Totale 5.643