Dana Pardubská

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 16

Top Topics

Communicating Agents

Finite Automata

Top Venues

J. Comput. Syst. Sci.

Publications

Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT (2023)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT (2022)
Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa, Jirí Síma
On Separations of LR(0)-Grammars by Two Types of Pumping Patterns. ITAT (2021)
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
Lexicalized Syntactic Analysis by Two-Way Restarting Automata. J. Autom. Lang. Comb. 26 (1-2) (2021)
Pavol Duris, Rastislav Královic, Dana Pardubská
Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. 114 (2020)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Improved Lower Bounds for Shoreline Search. SIROCCO (2020)
Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith
Randomization in Non-Uniform Finite Automata. MFCS (2020)
Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT (2020)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO (2020)
Martin Plátek, Frantisek Mráz, Dana Pardubská
Lexically Syntactic Characterization by Restarting Automata. ITAT (2019)
Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek
Lexicalized Syntactic Analysis by Restarting Automata. Stringology (2019)
Martin Plátek, Dana Pardubská, Frantisek Mráz
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT (2018)
Martin Plátek, Karel Oliva, Dana Pardubská
Analysis by reduction of analytical PDT-trees. NCMA (2017)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Treasure Hunt with Barely Communicating Agents. OPODIS (2017)
Brona Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomás Vinar
Isometric gene tree reconciliation revisited. Algorithms Mol. Biol. 12 (1) (2017)
Brona Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomás Vinar
Isometric Gene Tree Reconciliation Revisited. WABI (2016)
Martin Plátek, Dana Pardubská, Karel Oliva
Analysis by Reduction, the Prague Dependency Treebank): Redukční Analýza a Pražský Závislostní Korpus. ITAT (2015)
Martin Plátek, Dana Pardubská, Markéta Lopatková
On Minimalism of Analysis by Reduction by Restarting Automata. FG (2014)
Martin Plátek, Markéta Lopatková, Dana Pardubská
On the complexity of reductions by restarting automata. NCMA (2014)
Viliam Geffert, Dana Pardubská
Unary Coded NP-Complete Languages in Aspace(log log n). Int. J. Found. Comput. Sci. 24 (7) (2013)
Viliam Geffert, Dana Pardubská
Factoring and testing primes in small space. RAIRO Theor. Informatics Appl. 47 (3) (2013)
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o
Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161 (10-11) (2013)
Viliam Geffert, Dana Pardubská
Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory (2012)
Dana Pardubská, Martin Plátek, Friedrich Otto
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412 (4-5) (2011)
Dana Pardubská, Frantisek Mráz, Martin Plátek
Translations by Regulated Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 16 (2-4) (2011)
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. 34 (2009)
Dana Pardubská, Martin Plátek, Friedrich Otto
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA (2009)
Viliam Geffert, Dana Pardubská
Factoring and Testing Primes in Small Space. SOFSEM (2009)
Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská
Black Hole Search in Directed Graphs. SIROCCO (2009)
Stefan Dobrev, Rastislav Královic, Dana Pardubská
Measuring the problem-relevant information in input. RAIRO Theor. Informatics Appl. 43 (3) (2009)
Dana Pardubská, Martin Plátek, Friedrich Otto
Parallel Communicating Grammar Systems with Regular Control. CAI (2009)
Stefan Dobrev, Rastislav Kralovic, Dana Pardubská
Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS (2008)
Dana Pardubská, Martin Plátek, Friedrich Otto
On PCGS and FRR-automata. ITAT (2008)
Jirí Wiedermann, Dana Pardubská
Wireless Mobile Computing and its Links to Descriptive Complexity. Int. J. Found. Comput. Sci. 19 (4) (2008)
Stefan Dobrev, Rastislav Kralovic, Dana Pardubská
How Much Information about the Future Is Needed? SOFSEM (2008)
Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation. ESA (2007)
Jirí Wiedermann, Dana Pardubská
Wireless Parallel Computing and its Links to Descriptive Complexity. DCFS (2007)
Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan
Online Bandwidth Allocation CoRR (2007)
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener
Effective Systolic Algorithms for Gossiping in Cycles. Parallel Process. Lett. 8 (2) (1998)
Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
Two Lower Bounds on Distributive Generation of Languages. Fundam. Informaticae 25 (3) (1996)
Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). FCT (1995)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing (1994)
Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská
Two Lower Bounds on Distributive Generation of Languages. MFCS (1994)
Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
The Complexity of Systolic Dissemination of Information in Interconnection Networks. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Dana Pardubská
On the Power of Communication Structure for Distributive Generation of Languages. Developments in Language Theory (1993)
Dana Pardubská, Ivana Stefáneková
Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 67 (1) (1989)