IRIS
PUPPIS, Gabriele
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.086
EU - Europa 397
AS - Asia 181
Continente sconosciuto - Info sul continente non disponibili 7
AF - Africa 1
Totale 2.672
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.083
UA - Ucraina 113
IT - Italia 103
CN - Cina 98
VN - Vietnam 60
DE - Germania 49
IE - Irlanda 49
FI - Finlandia 30
SE - Svezia 20
FR - Francia 9
GB - Regno Unito 9
IN - India 9
TR - Turchia 8
BE - Belgio 7
EU - Europa 7
CA - Canada 3
IL - Israele 3
RO - Romania 3
RU - Federazione Russa 3
JP - Giappone 2
EE - Estonia 1
LK - Sri Lanka 1
LT - Lituania 1
NG - Nigeria 1
Totale 2.672
Salva come PNG Salva come JPEG
Città #
Fairfield 336
Woodbridge 276
Houston 212
Ann Arbor 186
Ashburn 175
Wilmington 139
Seattle 126
Cambridge 106
Jacksonville 81
Beijing 67
Chandler 67
Dong Ket 60
Princeton 50
Dublin 49
Dearborn 29
San Diego 29
Udine 29
Ogden 28
Trieste 25
Norwalk 14
Washington 13
Vicenza 10
Serra Riccò 9
Izmir 8
Brussels 7
Preganziol 6
Varese 5
Fremont 4
Guangzhou 4
Helsinki 4
Nanchang 4
Boardman 3
Grafing 3
Nanjing 3
Phoenix 3
Timisoara 3
Des Moines 2
Elmshorn 2
Hanatennishi 2
Hefei 2
Indiana 2
Jinan 2
Karlsruhe 2
Kunming 2
Ningbo 2
Ottawa 2
Redwood City 2
Scorzè 2
Shaoxing 2
Asti 1
Azzano Decimo 1
Bellevue 1
Bonn 1
Como 1
Darmstadt 1
Frankfurt am Main 1
Jiaxing 1
Lanzhou 1
Mainz 1
Maradankadawalagama 1
Monmouth Junction 1
Montreal 1
Nanning 1
Naples 1
New York 1
Nice 1
Oakland 1
Pasian di Prato 1
Pessione 1
Porcia 1
Rodgau 1
Saint Petersburg 1
San Francisco 1
Shenyang 1
Simi Valley 1
Tallinn 1
West Chester 1
Wiesbaden 1
Zaria 1
Zhangzhou 1
Šiauliai 1
Totale 2.231
Salva come PNG Salva come JPEG
Nome #
A Decidable Spatial Logic with Cone-shaped Cardinal Directions 178
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals 159
Decidability of MSO Theories of Tree Structures 133
Time Granularities and Ultimately Periodic Automata 131
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity 123
Compact and Tractable Automaton-based Representations for Time Granularities 117
A Contraction Method to Decide MSO Theory of Deterministic Trees 102
On the Equivalence of Automaton-based Representations of Time Granularities 99
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2 99
On the relationships between theories of time granularity and the monadic second-order theory of one successor 98
Decidability of the interval temporal logic AA*BB* over the rationals 93
Decidability of the interval temporal logic ABB* over the natural numbers 80
An Algebraic Approach to Mso-Definability on Countable Linear Orderings 65
Bounded repairability for regular tree languages 62
A decidable weakening of compass logic based on cone-shaped cardinal directions 62
Decidability of the Theory of the Totally Unbounded omega-Layered Structure 60
Bounded repairability for regular tree languages 60
Querying Visible and Invisible Information 60
Automata vs. logics on data words 59
Logics with rigidly guarded data tests 57
Untwisting two-way transducers in elementary time 53
Bounded repairability of word languages 51
Regular languages of words over countable linear orderings 50
The cost of traveling between languages 47
The complexity of higher-order queries 46
Regular repair of specifications 46
Automata for branching and layered temporal structures: An investigation into regularities of infinite transition systems 43
Positive higher-order queries 42
Which XML Schemas are Streaming Bounded Repairable? 42
The per-character cost of repairing word languages 41
Which DTDs are streaming bounded repairable? 39
Equivalence of finite-valued streaming string transducers is decidable 38
Towards Compact and Tractable Automaton-Based Representations of Time Granularities 32
Walking on Data Words 32
Origin-equivalence of two-way word transducers is in PSPACE 29
One-way definability of two-way word transducers 28
On the decomposition of finite-valued streaming string transducers 28
On the use of guards for logics with data 28
Minimizing resources of sweeping and streaming string transducers 24
The many facets of string transducers 24
Resynchronizing classes of word relations 22
Decidability of the theory of the totally unbounded ω-layered structure 21
What you must remember when processing data words 21
Walking on data words 20
On synthesis of resynchronizers for transducers 20
Dynamic data structures for timed automata acceptance 20
Ciaramella: A Synchronous Data Flow Programming Language For Audio DSP 20
One-way definability of sweeping transducers 19
One-way resynchronizability of word transducers 17
Proceedings of GANDALF 2013, Fourth International Symposium on Games, Automata, Logics and Formal Verification 17
Inference from Visible Information and Background Knowledge 9
The Logic of Prefixes and Suffixes is Elementary under Homogeneity* 7
Dynamic Data Structures for Timed Automata Acceptance 7
Totale 2.880
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.470
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.470
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201991 0 0 0 0 0 0 0 0 0 18 43 30
2019/2020901 16 12 19 76 21 52 188 183 168 86 26 54
2020/2021656 12 62 16 69 28 49 47 62 86 79 54 92
2021/2022405 37 51 7 9 2 21 35 16 6 74 95 52
2022/2023214 53 20 19 14 8 71 1 9 11 5 3 0
2023/2024161 8 3 20 2 35 45 1 8 33 6 0 0
Totale 2.880