Dana Pardubská

According to our database, Dana Pardubská authored at least 40 papers between 1989 and 2024.

Collaborative distances:

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

2024

Non-Regularity of Complete CF(¢, $)-Grammars.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka

Proceedings of the 24th Conference Information Technologies, 2024

2023

One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars.

Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa

Proceedings of the 23rd Conference Information Technologies, 2023

2022

On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa

Proceedings of the 22nd Conference Information Technologies, 2022

2021

Lexicalized Syntactic Analysis by Two-Way Restarting Automata.

Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek

J. Autom. Lang. Comb., 2021

On Separations of LR(0)-Grammars by Two Types of Pumping Patterns.

Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma

Proceedings of the 21st Conference Information Technologies, 2021

2020

Tight hierarchy of data-independent multi-head automata.

Pavol Duris, Rastislav Královic, Dana Pardubská

J. Comput. Syst. Sci., 2020

Exploration of Time-Varying Connected Graphs with Silent Agents.

Stefan Dobrev, Rastislav Královic, Dana Pardubská

Proceedings of the Structural Information and Communication Complexity, 2020

Improved Lower Bounds for Shoreline Search.

Stefan Dobrev, Rastislav Královic, Dana Pardubská

Proceedings of the Structural Information and Communication Complexity, 2020

Randomization in Non-Uniform Finite Automata.

Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Pumping Deterministic Monotone Restarting Automata and DCFL.

Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma

Proceedings of the 20th Conference Information Technologies, 2020

2019

Lexicalized Syntactic Analysis by Restarting Automata.

Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek

Proceedings of the Prague Stringology Conference 2019, 2019

Lexically Syntactic Characterization by Restarting Automata.

Martin Plátek, Frantisek Mráz, Dana Pardubská

Proceedings of the 19th Conference Information Technologies, 2019

2018

Robustness versus Sensibility by Two-Way Restarting Automata.

Martin Plátek, Dana Pardubská, Frantisek Mráz

Proceedings of the 18th Conference Information Technologies, 2018

2017

Isometric gene tree reconciliation revisited.

Brona Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomás Vinar

Algorithms Mol. Biol., 2017

Treasure Hunt with Barely Communicating Agents.

Stefan Dobrev, Rastislav Královic, Dana Pardubská

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Analysis by reduction of analytical PDT-trees.

Martin Plátek, Karel Oliva, Dana Pardubská

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

2015

Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus.

Martin Plátek, Dana Pardubská, Karel Oliva

Proceedings of the Proceedings ITAT 2015: Information Technologies, 2015

2014

On the complexity of reductions by restarting automata.

Martin Plátek, Markéta Lopatková, Dana Pardubská

Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

On Minimalism of Analysis by Reduction by Restarting Automata.

Martin Plátek, Dana Pardubská, Markéta Lopatková

Proceedings of the Formal Grammar - 19th International Conference, 2014

2013

Factoring and testing primes in small space.

Viliam Geffert, Dana Pardubská

RAIRO Theor. Informatics Appl., 2013

Unary Coded NP-Complete Languages in Aspace(log log n).

Viliam Geffert, Dana Pardubská

Int. J. Found. Comput. Sci., 2013

Antibandwidth and cyclic antibandwidth of Hamming graphs.

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o

Discret. Appl. Math., 2013

2011

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata.

Dana Pardubská, Martin Plátek, Friedrich Otto

Theor. Comput. Sci., 2011

Translations by Regulated Parallel Communicating Grammar Systems.

Dana Pardubská, Frantisek Mráz, Martin Plátek

J. Autom. Lang. Comb., 2011

2009

Measuring the problem-relevant information in input.

Stefan Dobrev, Rastislav Královic, Dana Pardubská

RAIRO Theor. Informatics Appl., 2009

Black Hole Search in Directed Graphs.

Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská

Proceedings of the Structural Information and Communication Complexity, 2009

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata.

Dana Pardubská, Martin Plátek, Friedrich Otto

Proceedings of the Language and Automata Theory and Applications, 2009

Parallel Communicating Grammar Systems with Regular Control.

Dana Pardubská, Martin Plátek, Friedrich Otto

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

Wireless Mobile Computing and its Links to Descriptive Complexity.

Jirí Wiedermann, Dana Pardubská

Int. J. Found. Comput. Sci., 2008

How Much Information about the Future Is Needed?

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská

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

Leader Election in Extremely Unreliable Rings and Complete Networks.

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

On PCGS and FRR-automata.

Dana Pardubská, Martin Plátek, Friedrich Otto

Proceedings of the Conference on Theory and Practice of Information Technologies, 2008

2007

Online Bandwidth Allocation.

Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan

Proceedings of the Algorithms, 2007

Wireless Parallel Computing and its Links to Descriptive Complexity.

Jirí Wiedermann, Dana Pardubská

Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

1998

Effective Systolic Algorithms for Gossiping in Cycles.

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener

Parallel Process. Lett., 1998

1996

Two Lower Bounds on Distributive Generation of Languages.

Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská

Fundam. Informaticae, 1996

1995

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

The Complexity of Systolic Dissemination of Information in Interconnection Networks.

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská

RAIRO Theor. Informatics Appl., 1994

1993

On the Power of Communication Structure for Distributive Generation of Languages.

Dana Pardubská

Proceedings of the Developments in Language Theory, 1993

1989

Nondeterministic Multicounter Machines and Complementation.

Dana Pardubská, Ivana Stefáneková

Theor. Comput. Sci., 1989