Skip to content

Beatrice Palano

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

14

Venues

9

Active years

2001–2026

Best venue rank

C

Where they publish

Papers

14 indexed papers, newest first.

YearVenueTitleAuthors
2026DLTOn Some Decision Problems on Quantum Automata.Flavio D'Alessandro, Carlo Mereghetti, Beatrice Palano, Paolo Papi
2024DLTDeterministic Pushdown Automata with Translucent Input Letters.Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2023OPODIS𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots.Caterina Feletti, Carlo Mereghetti, Beatrice Palano
2021SOFSEMIterated Uniform Finite-State Transducers on Unary Languages.Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2020CiEDeterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power.Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2018SSSUniform Circle Formation for Swarms of Opaque Robots with Lights.Caterina Feletti, Carlo Mereghetti, Beatrice Palano
2016SOFSEMOnline Minimum Spanning Tree with Advice - (Extended Abstract).Maria Paola Bianchi, Hans-Joachim Bckenhauer, Tatjana Brlisauer, Dennis Komm, Beatrice Palano
2013CSRBoolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height.Viliam Geffert, Zuzana Bednrov, Carlo Mereghetti, Beatrice Palano
2013UCSize Lower Bounds for Quantum Automata.Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2010LATAOn the Expressive Power of FO[ + ].Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2008DLTMore Concise Representation of Regular Languages by Automata and Regular Expressions.Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2006DLTContext-Free Grammars and XML Languages.Alberto Bertoni, Christian Choffrut, Beatrice Palano
2003DLTQuantum Computing: 1-Way Quantum Automata.Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2001STACSOn the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.Massimiliano Goldwurm, Beatrice Palano, Massimo Santini