List of publications
journals
- Stefan Dobrev, Rastislav Královic, Dana Pardubská, Lubomír Török, Imrich Vrto: 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). Int. J. Found. Comput. Sci. 24(7): 1167- (2013)
- Viliam Geffert, Dana Pardubská: Factoring and testing primes in small space. RAIRO - Theor. Inf. and Applic. 47(3): 241-259 (2013)
- Dana Pardubská, Martin Plátek, Friedrich Otto: Parallel communicating grammar systems with
regular control and skeleton preserving FRR automata. Theoretical Computer Science 412(4-5):
458-477 (2011)
- Stefan Dobrev, Rastislav Královic, Dana Pardubská: Measuring the problem-relevant information
in input. ITA 43(3): 585-613 (2009)
- J.Wiedermann, D. Pardubská: Wireless Mobile Computing and Its Links to Descriptive Complexity. International Journal of Foundations of Computer Science, Vol.19 No. 4, 2008, pp. 887-913
- J.Hromkovič, R. Klasing, D. Pardubská, J. Waczulik, H. Wagener: Effective
Systolic Algorithms for Gossiping in Cycles. Parallel Processing Letters Vol. 8
No.2 (1998) 197 - 205
- J.Hromkovič,
J.Kari, L.Kari, D.Pardubská: Two lower bounds on distributive generation of
languages. Fundamenta Informaticae 25 (1996) 271 -282
- J.Hromkovič,R.Klasing, W.Unger, H.Wagener, D.Pardubská: The complexity of systolic
dissemination of information in interconnection networks. R.A.I.R.O.
Theoretical Informatics and Applications, Vol.28 Nos.3-4, 1994, pp. 303-342
- D.Pardubská: A note on lower bound for one-dimensional systolic array. Computers and
Artificial Intelligence, Vol.10.1991, No.3, pp.215-220
- D.Pardubská, I.Štefáneková: Nondeterministic multicounter machines and complementation
(note). Theoretical Computer Science 67 (1989) pp.111-113
- J.Hromkovič, D.Pardubská: Some complexity aspects of VLSI computations Part 4. VLSI circuits
with programs. Computers and Artificial Intelligence, Vol.7, 1988, No.6, pp.
481-495
- J.Hromkovič, D.Pardubská: Some complexity aspects of VLSI computations Part 3. On the power of
input bit permutation in tree and trellis automata. Computers and Artificial
Intelligence, Vol.7, 1988, No.5, pp. 397-412
- D.Pardubská: Closure properties of the family of languages defined by systolic tree
automata. CAI, Vol.7,1988, No.1, pp. 59-64
conferences
- Martin Plátek, Dana Pardubská, Markéta Lopatková: On Minimalism of Analysis by Reduction by Restarting Automata. FG 2014: 155-170
- Martin Plátek, Markéta Lopatková, Dana Pardubská: On the complexity of reductions by restarting automata. NCMA 2014: 207-222
- Viliam Geffert, Dana Pardubská: Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory 2012: 166-177
- Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic, Stanislav Miklík, Dana Pardubská: Black Hole Search in Directed Graphs. SIROCCO 2009. Pages 182-194
- Stefan Dobrev, Rastislav Královič, Dana Pardubská, Ľubomír Török and Imrich Vrťo: Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. EUROCOMB 2009. Electronic Notes in Discrete Mathematics Volume 34, 1 August 2009, Pages 295-300
- Dana Pardubská, Martin Plátek, and Friedrich Otto: On Parallel Communicating Grammar Systems with Regular Control. CAI 2009. Springer, LNCS 5725, pp 342-360
- Dana Pardubská, Martin Plátek, and Friedrich Otto: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009. Springer, LNCS 5457, pp 660-671
- V.Geffert and D.Pardubská: Factoring and Testing Primes in Small Space. SOFSEM 2009. Springer, LNCS 5404, pp 291-302
- S.Dobrev, R.Královič, D.Pardubská: Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008. Springer, LNCS 5401, pp 512-526
- S.Dobrev, R.Královič, D.Pardubská: How Much Information About the Future is
Needed? SOFSEM 2008. Springer, LNCS 4910, pp 247-258
- Michal Forišek, Branislav Katreniak, Jana Katreniaková, Rastislav Královič, Richard
Královič, Vladimír Koutný, Dana Pardubská, Tomáš Plachetka, Branislav Rovan : Online
Bandwidth Aloocation. Algorithms–ESA 2007, Berlin : Springer, 2007 S.
546-557
- J.Hromkovič, R.Klasing, D.Pardubská, W.Unger, J.Waczulík, H.Wagener: Effective Systolic Algorithms for Gossiping in Cycles and
Two-Dimensional Grids. In: Proc. 10th Int. Conference of
Fundamentals of Computation Theory (FCT´95)
- J.Hromkovič, J.Kari, L.Kari, D.Pardubská: Two lower bounds on distributive generation of
languages. Proc. of MFCS'94, LNCS 841, pp.423-432
- J.Hromkovič, R.Klasing, W.Unger, H.Wagener, D.Pardubská: The complexity of systolic
dissemination of information in interconnection networks.
- Proc. of the 1st Canada-France Conference on Parallel Computing (CFCP'94), Springer LNCS 805, pp.235-249.
- D.Pardubská: On the power of communication structure for distributive generation of
languages. In: Developments in Language Theory. Preproceedings, University
of Turku, Turku 1993, pp.30 - 32
- D.Pardubská: The communication complexity hierarchy of parallel communicating systems.
In : Proc. of the 7th International Meeting of Young Computer Scientists
(IMYCS'92)
workshops
- D.Pardubská, M. Plátek, and F. Otto. On PCGS and
FRR-automata. In: P. Vojtáš (ed.), Information Technologies -- Applications
and Theory, ITAT 2008, Proc., Department of Computer Science, Faculty of
Science, Pavol Jozef Šafárik University, Košice, 2008, pp. 41--47.
- D.Pardubská, M.Plátek: Parallel
communicating grammar systems and analysis by reduction by restarting automata.
In: G.~Bel-Enguix and M.D.~Jimenez-Lopez (eds.), International Workshop on Non-Classical
Formal Languages in Linguistics, ForLing 2008, Proc., Tarragona, 2008, pp. 81--98.
- J.Wiedermann, D.Pardubská: Wireless Parallel Computing and its Links to
descriptive Complexity. Proc. of DCFS 2007, ISBN
978-80-7097-688-3, pp. 41-56
- D.Pardubská, J.Wiedermann: Alternatívna charakterizácia synchronizovaného alternovania.
In: Proc. of ITAT 2005, ISBN 80-7097-609-8, pp.133-144
chapter in book
technical reports
- D.Pardubská, M.Plátek and F.Otto: On the Correspondence between Parallel Communicating
Grammar Systems and Restarting Automata. TR -2008-015, Comenius
University Bratislava
- S.Dobrev, R. Královič, D. Pardubská: How Much Information About the Future is Needed?TR -2007-007, Comenius University Bratislava
- Michal Forišek, Branislav Katreniak, Jana Katreniaková, Rastislav Královič, Richard
Královič, Vladimír Koutný, Dana Pardubská, Tomáš Plachetka, Branislav Rovan : Online Bandwidth
Aloocation
, TR -2007-004, Comenius University Bratislava
J.Wiedermann, D.Pardubská: Computing by Broadcasting: Alternation in Disguise (Extended version) Tech. Rep. V-975, ICS AS CR, Prague 2006
J.Wiedermann, D.Pardubská: On the Power of Broadcasting in Mobile Computations Tech. Rep. V-944, ICS AS CR, Prague 2005
J.Hromkovič, J.Kari, L.Kari, D.Pardubská:
Two lower bounds on distributive generation of languages., TR University Paderborn, 94 – 137
J.Hromkovič, R.Klasing, W.Unger, H.Wagener, D.Pardubská: The
complexity of systolic dissemination of information in interconnection networks TR University Paderborn, 93 – 136
D.Pardubská: Communication
complexity hierarchies for distributive generation of languages. TR
University Paderborn, 93 – 133
D.Pardubská:On
the power of communication structure for distributive generation of languages TR University Paderborn, 93 – 131
textbook