Maria Paola Bianchi

zbMath Openbianchi.maria-paolaMaRDI QIDQ403022

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Online Minimum Spanning Tree with Advice International Journal of Foundations of Computer Science	2018-07-24	Paper
On the size of two-way reasonable automata for the liveness problem International Journal of Foundations of Computer Science	2018-05-15	Paper
Quantum finite automata: advances on Bertoni's ideas Theoretical Computer Science	2017-03-16	Paper
Online minimum spanning tree with advice (extended abstract) Lecture Notes in Computer Science	2016-03-10	Paper
On the power of one-way automata with quantum and classical states International Journal of Foundations of Computer Science	2016-02-17	Paper
On the size of two-way reasonable automata for the liveness problem Developments in Language Theory	2015-11-10	Paper
Complexity of promise problems on classical and quantum automata Computing with New Resources	2015-09-08	Paper
scientific article; zbMATH DE number 6415494 (Why is no real title available?)	2015-03-16	Paper
Online coloring of bipartite graphs with and without advice Algorithmica	2015-01-19	Paper
On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles Theoretical Computer Science	2014-10-06	Paper
On the power of one-way automata with quantum and classical states Implementation and Application of Automata	2014-09-26	Paper
Size lower bounds for quantum automata Theoretical Computer Science	2014-08-29	Paper
Size lower bounds for quantum automata Unconventional Computation and Natural Computation	2013-06-28	Paper
On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles Lecture Notes in Computer Science	2013-06-11	Paper
Regularity of languages defined by formal series with isolated cut point RAIRO - Theoretical Informatics and Applications	2012-11-22	Paper
Normal forms for unary probabilistic automata RAIRO - Theoretical Informatics and Applications	2012-11-22	Paper
On inverse operations and their descriptional complexity Descriptional Complexity of Formal Systems	2012-11-02	Paper
Online coloring of bipartite graphs with and without advice Lecture Notes in Computer Science	2012-09-25	Paper
On the size of unary probabilistic and nondeterministic automata Fundamenta Informaticae	2012-05-04	Paper
Behaviours of unary quantum automata Fundamenta Informaticae	2011-05-18	Paper

Research outcomes over time

This page was built for person: Maria Paola Bianchi