default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Paola Bianchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j12]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): 187-212 (2018)- [j11]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): 505-527 (2018) - 2017
- [j10]Maria Paola Bianchi, Carlo Mereghetti
, Beatrice Palano:
Quantum finite automata: Advances on Bertoni's ideas. Theor. Comput. Sci. 664: 39-53 (2017) - 2016
- [c13]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM 2016: 195-207 - 2015
- [j9]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): 895-912 (2015) - [c12]Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. DLT 2015: 120-131 - 2014
- [j8]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. Algorithmica 70(1): 92-111 (2014) - [j7]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
Size lower bounds for quantum automata. Theor. Comput. Sci. 551: 102-115 (2014) - [j6]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: 22-39 (2014) - [c11]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
Complexity of Promise Problems on Classical and Quantum Automata. Computing with New Resources 2014: 161-175 - [c10]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
On the Power of One-Way Automata with Quantum and Classical States. CIAA 2014: 84-97 - 2013
- [c9]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. COCOON 2013: 53-64 - [c8]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
Size Lower Bounds for Quantum Automata. UCNC 2013: 19-30 - 2012
- [j5]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): 479-493 (2012) - [j4]Maria Paola Bianchi, Giovanni Pighizzini:
Normal forms for unary probabilistic automata. RAIRO Theor. Informatics Appl. 46(4): 495-510 (2012) - [j3]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): 61-81 (2012) - [c7]Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. COCOON 2012: 519-530 - [c6]Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. DCFS 2012: 89-102 - [i1]Carlo Comin, Maria Paola Bianchi:
Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata. CoRR abs/1206.1702 (2012) - 2011
- [j2]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae 112(2-3): 119-135 (2011) - [c5]Alberto Bertoni, Maria Paola Bianchi, Flavio D'Alessandro:
Regularity of Languages Defined by Formal Series with Isolated Cut Point. NCMA 2011: 73-87 - [c4]Maria Paola Bianchi, Giovanni Pighizzini:
Normal Forms for Unary Probabilistic Automata. NCMA 2011: 89-102 - 2010
- [j1]Maria Paola Bianchi, Beatrice Palano:
Behaviours of Unary Quantum Automata. Fundam. Informaticae 104(1-2): 1-15 (2010) - [c3]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
Probabilistic vs. Nondeterministic Unary Automata. NCMA 2010: 33-44
2000 – 2009
- 2009
- [c2]Maria Paola Bianchi, Beatrice Palano:
Events and Languages on Unary Quantum Automata. NCMA 2009: 61-76 - 2008
- [c1]Maria Paola Bianchi, Beatrice Palano:
On leftmost #-Rewriting Systems. DCFS 2008: 61-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
