| Measuring the problem-relevant information in input S Dobrev, R Královič, D Pardubská RAIRO-Theoretical Informatics and Applications 43 (3), 585-613, 2009 | 97 | 2009 |
| How much information about the future is needed? S Dobrev, R Královič, D Pardubská International Conference on Current Trends in Theory and Practice of …, 2008 | 76 | 2008 |
| Black hole search in directed graphs J Czyzowicz, S Dobrev, R Královič, S Miklík, D Pardubská Structural Information and Communication Complexity: 16th International …, 2010 | 43 | 2010 |
| Two lower bounds on distributive generation of languages J Hromkovič, J Kari, L Kari, D Pardubská Mathematical Foundations of Computer Science 1994: 19th International …, 1994 | 20 | 1994 |
| Antibandwidth and cyclic antibandwidth of hamming graphs S Dobrev, R Královič, D Pardubská, L Török, I Vrt'o Electronic Notes in Discrete Mathematics 34, 295-300, 2009 | 19 | 2009 |
| The complexity of systolic dissemination of information in interconnection networks J Hromkovič, R Klasing, W Unger, H Wagener, D Pardubska RAIRO-Theoretical Informatics and Applications 28 (3-4), 303-342, 1994 | 19 | 1994 |
| Online bandwidth allocation M Forišek, B Katreniak, J Katreniaková, R Královič, R Královič, V Koutný, ... Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 12 | 2007 |
| Informatika pre stredné školy: učebnica I Kalaš, R Baranovič, A Blaho, Z Kubincová, D Pardubská, Ľ Salanci, ... Slovenské pedagogické nakladateľstvo, 2001 | 12 | 2001 |
| Parallel communicating grammar systems and analysis by reduction by restarting automata D Pardubská, M Plátek International Workshop on Non-Classical Formal Languages in Linguistics …, 2008 | 11 | 2008 |
| Communication complexity hierarchy of parallel communicating grammar system D Pardubská Developments in Theoretical Computer Science, 115-122, 1994 | 10 | 1994 |
| Unary Coded NP-Complete Languages in ASPACE (log log n) V Geffert, D Pardubská International Journal of Foundations of Computer Science 24 (07), 1167-1182, 2013 | 8 | 2013 |
| Antibandwidth and cyclic antibandwidth of hamming graphs S Dobrev, R Královič, D Pardubská, L Török, I Vrt’o Discrete Applied Mathematics 161 (10-11), 1402-1408, 2013 | 7 | 2013 |
| Effective systolic algorithms for gossiping in cycles and two-dimensional grids J Hromkovič, R Klasing, D Pardubská, W Unger, J Waczulik, H Wagener Fundamentals of Computation Theory: 10th International Conference, FCT'95 …, 1995 | 7 | 1995 |
| On PCGS and FRR-automata. D Pardubská, M Plátek, F Otto ITAT, 41-47, 2008 | 6 | 2008 |
| Closure properties of the family of languages defined by systolic tree automata D Pardubská Computers and artificial intelligence 7 (1), 59-64, 1988 | 6 | 1988 |
| Pumping Deterministic Monotone Restarting Automata and DCFL. F Mráz, D Pardubská, M Plátek, J Síma ITAT, 51-58, 2020 | 5 | 2020 |
| On parallel communicating grammar systems and correctness preserving restarting automata D Pardubská, M Plátek, F Otto International Conference on Language and Automata Theory and Applications …, 2009 | 5 | 2009 |
| The communication complexity hierarchy of parallel communicating systems D Pardubská Proceedings of IMYC'92, 1992 | 5 | 1992 |
| Improved lower bounds for shoreline search S Dobrev, R Královič, D Pardubská International Colloquium on Structural Information and Communication …, 2020 | 4 | 2020 |
| On minimalism of analysis by reduction by restarting automata M Plátek, D Pardubská, M Lopatková International Conference on Formal Grammar, 155-170, 2014 | 4 | 2014 |
