Maria Paola Bianchi

According to our database, Maria Paola Bianchi authored at least 20 papers between 2008 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2018

On the Size of Two-Way Reasonable Automata for the Liveness Problem.

Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác

Int. J. Found. Comput. Sci., 2018

Online Minimum Spanning Tree with Advice.

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano

Int. J. Found. Comput. Sci., 2018

2017

Quantum finite automata: Advances on Bertoni's ideas.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Theor. Comput. Sci., 2017

2016

Online Minimum Spanning Tree with Advice - (Extended Abstract).

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

On the Power of One-Way Automata with Quantum and Classical States.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Int. J. Found. Comput. Sci., 2015

2014

Size lower bounds for quantum automata.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Theor. Comput. Sci., 2014

On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles.

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen

Theor. Comput. Sci., 2014

Online Coloring of Bipartite Graphs with and without Advice.

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller

Algorithmica, 2014

Complexity of Promise Problems on Classical and Quantum Automata.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano

Proceedings of the Computing with New Resources, 2014

2013

On the Advice Complexity of the Online <i>L</i>(2, 1)-Coloring Problem on Paths and Cycles.

Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

On Inverse Operations and Their Descriptional Complexity.

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini

J. Autom. Lang. Comb., 2012

Normal forms for unary probabilistic automata.

Maria Paola Bianchi, Giovanni Pighizzini

RAIRO Theor. Informatics Appl., 2012

Regularity of languages defined by formal series with isolated cut point.

Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro

RAIRO Theor. Informatics Appl., 2012

Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata

Carlo Comin, Maria Paola Bianchi

CoRR, 2012

On Inverse Operations and Their Descriptional Complexity.

Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini

Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011

On the Size of Unary Probabilistic and Nondeterministic Automata.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini

Fundam. Informaticae, 2011

2010

Behaviours of Unary Quantum Automata.

Maria Paola Bianchi, Beatrice Palano

Fundam. Informaticae, 2010

Probabilistic vs. Nondeterministic Unary Automata.

Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini

Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

2009

Events and Languages on Unary Quantum Automata.

Maria Paola Bianchi, Beatrice Palano

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

2008

On leftmost #-Rewriting Systems.

Maria Paola Bianchi, Beatrice Palano

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008