Maria Paola Bianchi

Publication Activity (10 Years)

Years Active: 2008-2018
Publications (10 Years): 6

Top Topics

Finite Automaton

Minimum Spanning Tree

Top Venues

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

RAIRO Theor. Informatics Appl.

Publications

Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
On the Size of Two-Way Reasonable Automata for the Liveness Problem. Int. J. Found. Comput. Sci. 29 (2) (2018)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. 29 (4) (2018)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Quantum finite automata: Advances on Bertoni's ideas. Theor. Comput. Sci. 664 (2017)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM (2016)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
On the Power of One-Way Automata with Quantum and Classical States. Int. J. Found. Comput. Sci. 26 (7) (2015)
Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác
On the Size of Two-Way Reasonable Automata for the Liveness Problem. DLT (2015)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70 (1) (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Complexity of Promise Problems on Classical and Quantum Automata. Computing with New Resources (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
On the Power of One-Way Automata with Quantum and Classical States. CIAA (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Size lower bounds for quantum automata. Theor. Comput. Sci. 551 (2014)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. Theor. Comput. Sci. 554 (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Size Lower Bounds for Quantum Automata. UCNC (2013)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen
(2, 1)-Coloring Problem on Paths and Cycles. COCOON (2013)
Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro
Regularity of languages defined by formal series with isolated cut point. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. 17 (2-4) (2012)
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini
On Inverse Operations and Their Descriptional Complexity. DCFS (2012)
Carlo Comin, Maria Paola Bianchi
Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata CoRR (2012)
Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller
Online Coloring of Bipartite Graphs with and without Advice. COCOON (2012)
Maria Paola Bianchi, Giovanni Pighizzini
Normal forms for unary probabilistic automata. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Maria Paola Bianchi, Giovanni Pighizzini
Normal Forms for Unary Probabilistic Automata. NCMA (2011)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae 112 (2-3) (2011)
Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro
Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA (2011)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
Probabilistic vs. Nondeterministic Unary Automata. NCMA (2010)
Maria Paola Bianchi, Beatrice Palano
Behaviours of Unary Quantum Automata. Fundam. Informaticae 104 (1-2) (2010)
Maria Paola Bianchi, Beatrice Palano
Events and Languages on Unary Quantum Automata. NCMA (2009)
Maria Paola Bianchi, Beatrice Palano
On leftmost #-Rewriting Systems. DCFS (2008)