PUPPIS, Gabriele
 Distribuzione geografica
Continente #
NA - Nord America 2.156
EU - Europa 430
AS - Asia 242
Continente sconosciuto - Info sul continente non disponibili 7
AF - Africa 1
Totale 2.836
Nazione #
US - Stati Uniti d'America 2.151
UA - Ucraina 112
IT - Italia 103
CN - Cina 100
DE - Germania 61
VN - Vietnam 60
SG - Singapore 55
IE - Irlanda 48
FI - Finlandia 33
SE - Svezia 20
CZ - Repubblica Ceca 14
FR - Francia 13
GB - Regno Unito 9
IN - India 9
TR - Turchia 8
BE - Belgio 7
EU - Europa 7
CA - Canada 5
JP - Giappone 4
IL - Israele 3
RO - Romania 3
RU - Federazione Russa 3
LT - Lituania 2
PH - Filippine 2
EE - Estonia 1
LK - Sri Lanka 1
NG - Nigeria 1
NL - Olanda 1
Totale 2.836
Città #
Fairfield 335
Woodbridge 276
Houston 212
Ann Arbor 186
Ashburn 173
Wilmington 138
Seattle 126
Cambridge 106
Jacksonville 80
Beijing 67
Chandler 67
Boardman 60
Dong Ket 60
Singapore 51
Princeton 49
Dublin 48
Dearborn 29
San Diego 29
Udine 29
Ogden 27
Trieste 25
Brno 14
Norwalk 14
Washington 12
Los Angeles 11
Vicenza 10
Serra Riccò 9
Izmir 8
Brussels 7
Helsinki 7
Munich 7
Preganziol 6
Phoenix 5
Varese 5
Guangzhou 4
Nanchang 4
Grafing 3
Nanjing 3
Santa Clara 3
Timisoara 3
Council Bluffs 2
Des Moines 2
Elmshorn 2
Frankfurt am Main 2
Fremont 2
Hanatennishi 2
Hefei 2
Indiana 2
Jinan 2
Karlsruhe 2
Kunming 2
Las Pinas 2
Montreal 2
New York 2
Ningbo 2
Ottawa 2
Saarbrücken 2
Scorzè 2
Shaoxing 2
South Burlington 2
Tokyo 2
Amsterdam 1
Asti 1
Azzano Decimo 1
Bellevue 1
Bonn 1
Como 1
Dallas 1
Darmstadt 1
Jiaxing 1
Lanzhou 1
Las Vegas 1
Mainz 1
Maradankadawalagama 1
Monmouth Junction 1
Nanning 1
Naples 1
Nice 1
Oakland 1
Pasian di Prato 1
Pessione 1
Porcia 1
Redwood City 1
Rodgau 1
Saint Petersburg 1
San Francisco 1
Shenyang 1
Simi Valley 1
Tallinn 1
Toronto 1
West Chester 1
Wiesbaden 1
Zaria 1
Zhangzhou 1
Šiauliai 1
Totale 2.384
Nome #
A Decidable Spatial Logic with Cone-shaped Cardinal Directions 189
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals 162
Decidability of MSO Theories of Tree Structures 140
Time Granularities and Ultimately Periodic Automata 136
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity 132
Compact and Tractable Automaton-based Representations for Time Granularities 124
A Contraction Method to Decide MSO Theory of Deterministic Trees 112
On the Equivalence of Automaton-based Representations of Time Granularities 104
On the relationships between theories of time granularity and the monadic second-order theory of one successor 104
Decidability of the interval temporal logic AA*BB* over the rationals 101
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2 100
Decidability of the interval temporal logic ABB* over the natural numbers 86
An Algebraic Approach to Mso-Definability on Countable Linear Orderings 73
Decidability of the Theory of the Totally Unbounded omega-Layered Structure 69
A decidable weakening of compass logic based on cone-shaped cardinal directions 69
Bounded repairability for regular tree languages 68
Bounded repairability for regular tree languages 68
Automata vs. logics on data words 67
Querying Visible and Invisible Information 62
Bounded repairability of word languages 59
Logics with rigidly guarded data tests 58
Regular languages of words over countable linear orderings 54
Untwisting two-way transducers in elementary time 54
The cost of traveling between languages 52
Regular repair of specifications 51
The complexity of higher-order queries 50
Automata for branching and layered temporal structures: An investigation into regularities of infinite transition systems 50
Positive higher-order queries 46
Which XML Schemas are Streaming Bounded Repairable? 46
The per-character cost of repairing word languages 45
Which DTDs are streaming bounded repairable? 43
Equivalence of finite-valued streaming string transducers is decidable 43
Towards Compact and Tractable Automaton-Based Representations of Time Granularities 36
Walking on Data Words 36
Ciaramella: A Synchronous Data Flow Programming Language For Audio DSP 33
On the use of guards for logics with data 32
Origin-equivalence of two-way word transducers is in PSPACE 30
One-way definability of two-way word transducers 29
On the decomposition of finite-valued streaming string transducers 29
Dynamic data structures for timed automata acceptance 29
Minimizing resources of sweeping and streaming string transducers 25
The many facets of string transducers 25
What you must remember when processing data words 25
Walking on data words 24
Resynchronizing classes of word relations 24
Proceedings of GANDALF 2013, Fourth International Symposium on Games, Automata, Logics and Formal Verification 23
On synthesis of resynchronizers for transducers 21
One-way definability of sweeping transducers 20
One-way resynchronizability of word transducers 18
Inference from Visible Information and Background Knowledge 14
The Logic of Prefixes and Suffixes is Elementary under Homogeneity* 13
Dynamic Data Structures for Timed Automata Acceptance 13
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024 12
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 9
Finite-valued Streaming String Transducers 5
Totale 3.142
Categoria #
all - tutte 12.983
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 12.983


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020867 0 0 19 76 21 52 185 182 167 86 25 54
2020/2021652 12 62 16 69 28 46 47 61 86 79 54 92
2021/2022401 37 50 7 9 2 21 34 16 6 74 94 51
2022/2023212 52 20 19 14 8 70 1 9 11 5 3 0
2023/2024205 8 3 19 2 34 43 1 8 32 19 6 30
2024/2025234 73 132 29 0 0 0 0 0 0 0 0 0
Totale 3.142