Dana Pardubská

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o: Antibandwidth and cyclic antibandwidth of Hamming graphs. Discrete Applied Mathematics 161(10-11): 1402-1408 (2013)

Viliam Geffert, Dana Pardubská: Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory 2012: 166-177

Dana Pardubská, Frantisek Mráz, Martin Plátek: Translations by Regulated Parallel Communicating Grammar Systems. Journal of Automata, Languages and Combinatorics 16(2-4): 215-251 (2011)

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): 458-477 (2011)

Dana Pardubská (Ed.): Proceedings of the Conference on Theory and Practice of Information Technologies, ITAT 2010, Hotel Smrekovica, Veľká Fatra, Slovak Republic, September 21-25, 2010. CEUR Workshop Proceedings 683, CEUR-WS.org 2010

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto: Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electronic Notes in Discrete Mathematics 34: 295-300 (2009)

Stefan Dobrev, Rastislav Královic, Dana Pardubská: Measuring the problem-relevant information in input. ITA 43(3): 585-613 (2009)

Dana Pardubská, Martin Plátek, Friedrich Otto: Parallel Communicating Grammar Systems with Regular Control. CAI 2009: 342-360

Dana Pardubská, Martin Plátek, Friedrich Otto: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009: 660-671

Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská: Black Hole Search in Directed Graphs. SIROCCO 2009: 182-194

Viliam Geffert, Dana Pardubská: Factoring and Testing Primes in Small Space. SOFSEM 2009: 291-302

Jirí Wiedermann, Dana Pardubská: Wireless Mobile Computing and its Links to Descriptive Complexity. Int. J. Found. Comput. Sci. 19(4): 887-913 (2008)

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská: Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526

Stefan Dobrev, Rastislav Kralovic, Dana Pardubská: How Much Information about the Future Is Needed? SOFSEM 2008: 247-258

Jirí Wiedermann, Dana Pardubská: Wireless Parallel Computing and its Links to Descriptive Complexity. DCFS 2007: 41-56

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: 546-557

Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan: Online Bandwidth Allocation. CoRR abs/cs/0701153 (2007)

Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles. Parallel Processing Letters 8(2): 197-205 (1998)

Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. Fundam. Inform. 25(3): 271-284 (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: 273-282

Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská: The Complexity of Systolic Dissemination of Information in Interconnection Networks. ITA 28(3-4): 303-342 (1994)

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: 235-249

Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432

Dana Pardubská: On the Power of Communication Structure for Distributive Generation of Languages. Developments in Language Theory 1993: 419-429

Dana Pardubská, Ivana Stefáneková: Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 67(1): 111-113 (1989)