Dora Giammarresi

According to our database1, Dora Giammarresi authored at least 63 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Characterization of Isometric Words based on Swap and Mismatch Distance.
CoRR, 2024

Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

Isometric Sets of Words and Generalizations of the Fibonacci Cubes.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Hypercubes and Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

Isometric Words and Edit Distance: Main Notions and New Variations.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2023

2021
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming.
Proc. VLDB Endow., 2021

Two-dimensional models.
Proceedings of the Handbook of Automata Theory., 2021

2020
Characterization and measure of infinite two-dimensional strong prefix codes.
Inf. Comput., 2020

A Common Framework to Recognize Two-dimensional Languages.
Fundam. Informaticae, 2020

Bad Pictures: Some Structural Properties Related to Overlaps.
Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019
Full sets of pictures to encode pictures.
Theor. Comput. Sci., 2019

Sets of Pictures Avoiding Overlaps.
Int. J. Found. Comput. Sci., 2019

2018
Encoding Pictures with Maximal Codes of Pictures.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Preface.
Theor. Comput. Sci., 2017

Non-expandable non-overlapping sets of pictures.
Theor. Comput. Sci., 2017

Structure and properties of strong prefix codes of pictures.
Math. Struct. Comput. Sci., 2017

Picture codes and deciphering delay.
Inf. Comput., 2017

Avoiding Overlaps in Pictures.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016
Construction of Non-expandable Non-overlapping Sets of Pictures.
CoRR, 2016

2015
Structure and Measure of a Decidable Class of Two-dimensional Codes.
Proceedings of the Language and Automata Theory and Applications, 2015

Unbordered Pictures: Properties and Construction.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Prefix Picture codes: a Decidable class of Two-Dimensional codes.
Int. J. Found. Comput. Sci., 2014

Picture Codes with Finite Deciphering Delay.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Two Dimensional Prefix Codes of Pictures.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Strong Prefix Codes of Pictures.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2011
Exploring inside Tiling Recognizable Picture Languages to Find Deterministic subclasses.
Int. J. Found. Comput. Sci., 2011

Classification of String Languages via Tiling Recognizable Picture Languages.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages.
Fundam. Informaticae, 2010

Tiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity.
Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
A computational model for tiling recognizable two-dimensional languages.
Theor. Comput. Sci., 2009

2008
Ambiguity and Complementation in Recognizable Two-dimensional Languages.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Matrix-based complexity functions and recognizable picture languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.
Proceedings of the Implementation and Application of Automata, 2007

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Tiling Recognizable Two-Dimensional Languages.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Unambiguous recognizable two-dimensional languages.
RAIRO Theor. Informatics Appl., 2006

2005
New operations and regular expressions for two-dimensional languages over one-letter alphabet.
Theor. Comput. Sci., 2005

2004
A characterization of Thompson digraphs.
Discret. Appl. Math., 2004

Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet.
Proceedings of the Developments in Language Theory, 2004

2003
Computing Languages by (Bounded) Local Sets.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Finite Automata and Non-self-Embedding Grammars.
Proceedings of the Implementation and Application of Automata, 2002

2001
Normal form algorithms for extended context-free grammars.
Theor. Comput. Sci., 2001

Block-Deterministic Regular Languages.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

1999
Deterministic Generalized Automata.
Theor. Comput. Sci., 1999

Extending Formal Language Hierarchies to Higher Dimensions.
ACM Comput. Surv., 1999

Thompson Digraphs: A Characterization.
Proceedings of the Automata Implementation, 1999

Thompson Languages.
Proceedings of the Jewels are Forever, 1999

1998
Periodicities on Trees.
Theor. Comput. Sci., 1998

Extended Context-Free Grammars and Normal Form Algorithms.
Proceedings of the Automata Implementation, 1998

1997
Two-Dimensional Languages.
Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

1996
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.
Inf. Comput., 1996

Two-Dimensional Finite State Recognizability.
Fundam. Informaticae, 1996

Decremental 2- and 3-Connectivity on Planar Graphs.
Algorithmica, 1996

1995
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey.
Proceedings of the Developments in Language Theory II, 1995

1994
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.
Proceedings of the STACS 94, 1994

A Periodicity Theorem for Trees.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Two-Dimensional Languages and Recognizable Functions.
Proceedings of the Developments in Language Theory, 1993

1992
Recognizable Picture Languages.
Int. J. Pattern Recognit. Artif. Intell., 1992

Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version).
Proceedings of the Algorithm Theory, 1992


  Loading...