BIANCHI, MARIA PAOLA
BIANCHI, MARIA PAOLA
Dipartimento di Informatica Giovanni Degli Antoni
Online Minimum Spanning Tree with Advice
2018 M.P. Bianchi, H. Böckenhauer, T. Brülisauer, D. Komm, B. Palano
Italian real life experience with brentuximab vedotin : results of a large observational study on 234 relapsed/refractory Hodgkin's lymphoma
2017 C. Pellegrini, A. Broccoli, A. Pulsoni, L. Rigacci, C. Patti, G. Gini, D. Mannina, M. Tani, C. Rusconi, A. Romano, A. Vanazzi, B. Botto, A. Santoro, S. Hoaus, G.M. Rigolin, P. Musto, P. Mazza, S. Molica, P. Corradini, A. Fama, F. Gaudio, M. Merli, F. Ronconi, G. Gritti, D. Vallisa, P. Tosi, A.M. Liberati, A. Pinto, V. Pavone, F. Gherlinzoni, M.P. Bianchi, S. Volpetti, L. Trentin, M.C. Goldaniga, M. Bonfichi, A. De Renzo, C. Schiavotto, M. Spina, A.M. Carella, V. Stefoni, L. Argnani, P.L. Zinzani
Quantum finite automata : advances on Bertoni's ideas
2017 M.P. Bianchi, C. Mereghetti, B.S. Palano
Online minimum spanning tree with advice
2016 M.P. Bianchi, H. Böckenhauer, T. Brülisauer, D. Komm, B. Palano
On the Power of One-Way Automata with Quantum and Classical States
2015 M.P. Bianchi, C. Mereghetti, B. Palano
Complexity of Promise Problems on Classical and Quantum Automata
2014 M.P. Bianchi, C. Mereghetti, B. Palano
On the power of one-way automata with quantum and classical states
2014 M.P. Bianchi, C. Mereghetti, B. Palano
Size lower bounds for quantum automata
2014 M.P. Bianchi, C. Mereghetti, B. Palano
DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA
2013 M.P. Bianchi
On the advice complexity of the online L(2,1)-coloring problem on paths and cycles
2013 M.P. Bianchi, H.J. Böckenhauer, J. Hromkovič, S. Krug, B. Steffen
Size lower bounds for quantum automata
2013 M.P. Bianchi, C. Mereghetti, B. Palano
Regularity of languages defined by formal series with isolated cut point
2012 A. Bertoni, M.P. Bianchi, F. D'Alessandro
On inverse operations and their descriptional complexity
2012 M.P. Bianchi, C. Mereghetti, B. Palano, G. Pighizzini, M. Holzer, S. Jakobi
Normal forms for unary probabilistic automata
2012 M.P. Bianchi, G. Pighizzini
On Inverse Operations and Their Descriptional Complexity
2012 M. P. Bianchi, M. Holzer, S. Jakobi, G. Pighizzini
Online coloring of bipartite graphs with and without advice
2012 M.P. Bianchi, H. Böckenhauer, J. Hromkovič, L. Keller
Normal forms for unary probabilistic automata
2011 M.P. Bianchi, G. Pighizzini
Regularity of languages defined by formal series with isolated cut point
2011 A. Bertoni, M.P. Bianchi, F. D'Alessandro
On the size of unary probabilistic and nondeterministic automata
2011 M.P. Bianchi, C. Mereghetti, B.S. Palano, G. Pighizzini
Probabilistic vs. nondeterministic unary automata
2010 M.P. Bianchi, C. Mereghetti, B. Palano, G. Pighizzini