PUPPIS, Gabriele
 Distribuzione geografica
Continente #
NA - Nord America 517
EU - Europa 142
AS - Asia 62
AF - Africa 4
Totale 725
Nazione #
US - Stati Uniti d'America 513
IT - Italia 91
VN - Vietnam 36
SE - Svezia 20
CN - Cina 12
DE - Germania 11
IN - India 8
GB - Regno Unito 5
CA - Canada 4
FR - Francia 4
IE - Irlanda 4
SG - Singapore 4
ZA - Sudafrica 3
JP - Giappone 2
AT - Austria 1
FI - Finlandia 1
IS - Islanda 1
LT - Lituania 1
NL - Olanda 1
RU - Federazione Russa 1
UA - Ucraina 1
ZW - Zimbabwe 1
Totale 725
Città #
Udine 59
Fairfield 53
Santa Cruz 40
Ashburn 38
Dong Ket 36
Buffalo 28
Houston 28
Seattle 28
Woodbridge 28
Cambridge 21
Stockholm 20
Wilmington 18
Fleming Island 12
Ann Arbor 10
Des Moines 9
Chicago 8
Brooklyn 7
Shanghai 7
Las Vegas 5
Clearwater 4
Dallas 4
Dublin 4
Kolkata 4
Milan 4
San Diego 4
Boardman 3
Cedar Knolls 3
Fremont 3
Gentilly 3
Lake Forest 3
Los Angeles 3
Riva 3
Beijing 2
Easton 2
Henderson 2
Jacksonville 2
Mountain View 2
Muizenberg 2
New York 2
North Bergen 2
Ottawa 2
Pasadena 2
Phoenix 2
Preganziol 2
Rostock 2
Trieste 2
Akureyri 1
Austin 1
Bengaluru 1
Berlin 1
Boulder 1
Brescia 1
Caserta 1
Chennai 1
Cloppenburg 1
Council Bluffs 1
Crugers 1
Essen 1
Guwahati 1
Hamilton 1
Hangzhou 1
Harare 1
Helsinki 1
Herndon 1
Hyderabad 1
Indianapolis 1
Kyonancho 1
Marina Julia 1
Miami 1
Morcone 1
Orlando 1
Redmond 1
Rochester 1
Rotterdam 1
Salem 1
San Francisco 1
Santa Clara 1
Scranton 1
Silverton 1
Sunnyvale 1
Toronto 1
Wuhan 1
Yellow Springs 1
Totale 565
Nome #
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals, file e27ce0c1-d817-055e-e053-6605fe0a7873 140
On the relationships between theories of time granularity and the monadic second-order theory of one successor, file e27ce0c1-cc9e-055e-e053-6605fe0a7873 136
Games, Automata, Logic, and Formal Verification (GandALF 2013) - Special Issue of the journal Information and Computation, Editorial pp. 1-2, file e27ce0c2-64e7-055e-e053-6605fe0a7873 82
Ciaramella: A Synchronous Data Flow Programming Language For Audio DSP, file 1988e1a9-f076-4691-b9ad-89f690c6b819 49
An Algebraic Approach to Mso-Definability on Countable Linear Orderings, file e27ce0c9-70dd-055e-e053-6605fe0a7873 48
Bounded repairability for regular tree languages, file e27ce0c9-5b35-055e-e053-6605fe0a7873 41
Logics with rigidly guarded data tests, file e27ce0c9-6f2f-055e-e053-6605fe0a7873 30
Decidability of the interval temporal logic ABB* over the natural numbers, file e27ce0c1-ee7b-055e-e053-6605fe0a7873 17
Querying Visible and Invisible Information, file e27ce0c9-7071-055e-e053-6605fe0a7873 17
One-way definability of sweeping transducers, file e27ce0c7-994d-055e-e053-6605fe0a7873 15
One-way resynchronizability of word transducers, file e27ce0c9-6dc5-055e-e053-6605fe0a7873 15
The many facets of string transducers, file e27ce0c7-9a36-055e-e053-6605fe0a7873 14
On the decomposition of finite-valued streaming string transducers, file e27ce0c7-6130-055e-e053-6605fe0a7873 13
On synthesis of resynchronizers for transducers, file e27ce0c7-9cb9-055e-e053-6605fe0a7873 13
Origin-equivalence of two-way word transducers is in PSPACE, file e27ce0c7-73af-055e-e053-6605fe0a7873 12
Untwisting two-way transducers in elementary time, file e27ce0c9-5b3b-055e-e053-6605fe0a7873 12
One-way definability of two-way word transducers, file e27ce0c9-7305-055e-e053-6605fe0a7873 11
Resynchronizing classes of word relations, file e27ce0c9-6eb3-055e-e053-6605fe0a7873 10
Dynamic Data Structures for Timed Automata Acceptance, file d3cf44e1-a0fd-40c7-8f94-e27a44d390ac 6
A decidable weakening of compass logic based on cone-shaped cardinal directions, file e27ce0c8-a32c-055e-e053-6605fe0a7873 6
Resynchronizing classes of word relations, file e27ce0c9-6eb4-055e-e053-6605fe0a7873 6
One-way definability of two-way word transducers, file e27ce0c9-7306-055e-e053-6605fe0a7873 6
An Algebraic Approach to Mso-Definability on Countable Linear Orderings, file e27ce0c9-829e-055e-e053-6605fe0a7873 6
Walking on data words, file e27ce0c7-5f8f-055e-e053-6605fe0a7873 4
Towards Compact and Tractable Automaton-Based Representations of Time Granularities, file e27ce0c7-5f7d-055e-e053-6605fe0a7873 3
Logics with rigidly guarded data tests, file e27ce0c9-9941-055e-e053-6605fe0a7873 3
Automata for branching and layered temporal structures: An investigation into regularities of infinite transition systems, file e27ce0c7-97a4-055e-e053-6605fe0a7873 2
The cost of traveling between languages, file e27ce0c7-9887-055e-e053-6605fe0a7873 2
Bounded repairability for regular tree languages, file e27ce0c7-9942-055e-e053-6605fe0a7873 2
The per-character cost of repairing word languages, file e27ce0c7-994b-055e-e053-6605fe0a7873 2
Walking on Data Words, file e27ce0c7-9a32-055e-e053-6605fe0a7873 2
Equivalence of finite-valued streaming string transducers is decidable, file e27ce0c9-adbb-055e-e053-6605fe0a7873 2
Inference from Visible Information and Background Knowledge, file e27ce0ca-1987-055e-e053-6605fe0a7873 2
A Theory of Ultimately Periodic Languages and Automata with an Application to Time Granularity, file e27ce0c1-cddc-055e-e053-6605fe0a7873 1
A Contraction Method to Decide MSO Theory of Deterministic Trees, file e27ce0c1-d7df-055e-e053-6605fe0a7873 1
Decidability of the interval temporal logic AA*BB* over the rationals, file e27ce0c1-f79c-055e-e053-6605fe0a7873 1
Positive higher-order queries, file e27ce0c7-6128-055e-e053-6605fe0a7873 1
Regular repair of specifications, file e27ce0c7-612b-055e-e053-6605fe0a7873 1
Time Granularities and Ultimately Periodic Automata, file e27ce0c7-6c6c-055e-e053-6605fe0a7873 1
Decidability of the theory of the totally unbounded ω-layered structure, file e27ce0c7-72cc-055e-e053-6605fe0a7873 1
A decidable weakening of compass logic based on cone-shaped cardinal directions, file e27ce0c7-73ad-055e-e053-6605fe0a7873 1
Decidability of MSO Theories of Tree Structures, file e27ce0c7-73ba-055e-e053-6605fe0a7873 1
Regular languages of words over countable linear orderings, file e27ce0c7-97a0-055e-e053-6605fe0a7873 1
On the use of guards for logics with data, file e27ce0c7-97a2-055e-e053-6605fe0a7873 1
Automata vs. logics on data words, file e27ce0c7-97a8-055e-e053-6605fe0a7873 1
Which DTDs are streaming bounded repairable?, file e27ce0c7-988e-055e-e053-6605fe0a7873 1
Bounded repairability of word languages, file e27ce0c7-9890-055e-e053-6605fe0a7873 1
What you must remember when processing data words, file e27ce0c7-993f-055e-e053-6605fe0a7873 1
The complexity of higher-order queries, file e27ce0c7-994f-055e-e053-6605fe0a7873 1
Which XML Schemas are Streaming Bounded Repairable?, file e27ce0c7-acbb-055e-e053-6605fe0a7873 1
Equivalence of finite-valued streaming string transducers is decidable, file e27ce0c9-9943-055e-e053-6605fe0a7873 1
Bounded repairability for regular tree languages, file e27ce0c9-9e23-055e-e053-6605fe0a7873 1
Totale 748
Categoria #
all - tutte 1.404
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 1.404


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201936 0 0 0 1 0 3 1 1 5 6 8 11
2019/2020145 10 10 17 11 6 7 38 17 13 7 3 6
2020/2021103 4 7 3 6 13 5 7 3 7 5 11 32
2021/2022177 10 18 3 26 15 7 8 6 2 22 44 16
2022/2023226 4 12 39 26 15 29 22 29 14 16 14 6
2023/202454 21 14 19 0 0 0 0 0 0 0 0 0
Totale 748