default search action
Dana Pardubská
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c31]Martin Plátek, Frantisek Mráz, Dana Pardubská, Martin Procházka:
Non-Regularity of Complete CF(¢, $)-Grammars. ITAT 2024: 75-80 - [e6]Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Martin Macaj, Frantisek Mráz, Richard Ostertág, Dana Pardubská, Martin Plátek, Martin Stanek:
Proceedings of the 24th Conference Information Technologies - Applications and Theory (ITAT 2024), Drienica, Slovakia, September 20-24, 2024. CEUR Workshop Proceedings 3792, CEUR-WS.org 2024 [contents] - 2023
- [c30]Frantisek Mráz, Martin Plátek, Dana Pardubská, Daniel Prusa:
One-side Pumping and Two-side Pumping by Complete CF(¢, $)-grammars. ITAT 2023: 110-120 - [e5]Brona Brejová, Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Matej Lexa, Frantisek Mráz, Dana Pardubská, Martin Plátek:
Proceedings of the 23rd Conference Information Technologies - Applications and Theory (ITAT 2023), Tatranské Matliare, Slovakia, September 22-26, 2023. CEUR Workshop Proceedings 3498, CEUR-WS.org 2023 [contents] - 2022
- [c29]Martin Plátek, Frantisek Mráz, Dana Pardubská, Daniel Prusa:
On Pumping RP-automata Controlled by Complete LRG(\cent, $)-grammars. ITAT 2022: 111-121 - [e4]Lucie Ciencialová, Martin Holena, Robert Jajcay, Tatiana Jajcayová, Frantisek Mráz, Dana Pardubská, Martin Plátek:
Proceedings of the 22nd Conference Information Technologies - Applications and Theory (ITAT 2022), Zuberec, Slovakia, September 23-27, 2022. CEUR Workshop Proceedings 3226, CEUR-WS.org 2022 [contents] - 2021
- [j15]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): 145-171 (2021) - [c28]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: 140-146 - [e3]Brona Brejová, Lucie Ciencialová, Martin Holena, Frantisek Mráz, Dana Pardubská, Martin Plátek, Tomás Vinar:
Proceedings of the 21st Conference Information Technologies - Applications and Theory (ITAT 2021), Hotel Heľpa, Nízke Tatry and Muránska planina, Slovakia, September 24-28, 2021. CEUR Workshop Proceedings 2962, CEUR-WS.org 2021 [contents] - 2020
- [j14]Pavol Duris, Rastislav Královic
Tight hierarchy of data-independent multi-head automata. J. Comput. Syst. Sci. 114: 126-136 (2020) - [c27]Frantisek Mráz, Dana Pardubská, Martin Plátek, Jirí Síma:
Pumping Deterministic Monotone Restarting Automata and DCFL. ITAT 2020: 51-58 - [c26]Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen
Randomization in Non-Uniform Finite Automata. MFCS 2020: 30:1-30:13 - [c25]Stefan Dobrev, Rastislav Královic
Improved Lower Bounds for Shoreline Search. SIROCCO 2020: 80-90 - [c24]Stefan Dobrev, Rastislav Královic
Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO 2020: 146-162 - [e2]Martin Holena, Tomás Horváth, Alica Kelemenová, Frantisek Mráz, Dana Pardubská, Martin Plátek, Petr Sosík:
Proceedings of the 20th Conference Information Technologies - Applications and Theory (ITAT 2020), Hotel Tyrapol, Oravská Lesná, Slovakia, September 18-22, 2020. CEUR Workshop Proceedings 2718, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [c23]Martin Plátek, Frantisek Mráz, Dana Pardubská:
Lexically Syntactic Characterization by Restarting Automata. ITAT 2019: 104-111 - [c22]Frantisek Mráz, Friedrich Otto, Dana Pardubská, Martin Plátek:
Lexicalized Syntactic Analysis by Restarting Automata. Stringology 2019: 69-83 - 2018
- [c21]Martin Plátek, Dana Pardubská, Frantisek Mráz:
Robustness versus Sensibility by Two-Way Restarting Automata. ITAT 2018: 10-17 - 2017
- [j13]Brona Brejová
Isometric gene tree reconciliation revisited. Algorithms Mol. Biol. 12(1): 17:1-17:16 (2017) - [c20]Martin Plátek, Karel Oliva, Dana Pardubská:
Analysis by reduction of analytical PDT-trees. NCMA 2017: 211-226 - [c19]Stefan Dobrev, Rastislav Královic
Treasure Hunt with Barely Communicating Agents. OPODIS 2017: 14:1-14:16 - 2016
- [c18]Brona Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomás Vinar
Isometric Gene Tree Reconciliation Revisited. WABI 2016: 40-51 - 2015
- [c17]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: 43-50 - 2014
- [c16]Martin Plátek
On Minimalism of Analysis by Reduction by Restarting Automata. FG 2014: 155-170 - [c15]Martin Plátek, Markéta Lopatková, Dana Pardubská:
On the complexity of reductions by restarting automata. NCMA 2014: 207-222 - 2013
- [j12]Stefan Dobrev, Rastislav Královic
Antibandwidth and cyclic antibandwidth of Hamming graphs. Discret. Appl. Math. 161(10-11): 1402-1408 (2013) - [j11]Viliam Geffert, Dana Pardubská:
Unary Coded NP-Complete Languages in Aspace(log log n). Int. J. Found. Comput. Sci. 24(7): 1167- (2013) - [j10]Viliam Geffert, Dana Pardubská:
Factoring and testing primes in small space. RAIRO Theor. Informatics Appl. 47(3): 241-259 (2013) - 2012
- [c14]Viliam Geffert, Dana Pardubská:
Unary Coded NP-Complete Languages in ASPACE (log log n). Developments in Language Theory 2012: 166-177 - 2011
- [j9]Dana Pardubská, Frantisek Mráz, Martin Plátek:
Translations by Regulated Parallel Communicating Grammar Systems. J. Autom. Lang. Comb. 16(2-4): 215-251 (2011) - [j8]Dana Pardubská, Martin Plátek
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata. Theor. Comput. Sci. 412(4-5): 458-477 (2011) - 2010
- [e1]Dana Pardubská:
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 [contents]
2000 – 2009
- 2009
- [j7]Stefan Dobrev, Rastislav Královic
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. 34: 295-300 (2009) - [j6]Stefan Dobrev, Rastislav Královic
Measuring the problem-relevant information in input. RAIRO Theor. Informatics Appl. 43(3): 585-613 (2009) - [c13]Dana Pardubská, Martin Plátek
Parallel Communicating Grammar Systems with Regular Control. CAI 2009: 342-360 - [c12]Dana Pardubská, Martin Plátek
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata. LATA 2009: 660-671 - [c11]Jurek Czyzowicz, Stefan Dobrev, Rastislav Královic
Black Hole Search in Directed Graphs. SIROCCO 2009: 182-194 - [c10]Viliam Geffert, Dana Pardubská:
Factoring and Testing Primes in Small Space. SOFSEM 2009: 291-302 - 2008
- [j5]Jirí Wiedermann
Wireless Mobile Computing and its Links to Descriptive Complexity. Int. J. Found. Comput. Sci. 19(4): 887-913 (2008) - [c9]Dana Pardubská, Martin Plátek, Friedrich Otto:
On PCGS and FRR-automata. ITAT 2008 - [c8]Stefan Dobrev, Rastislav Kralovic
Leader Election in Extremely Unreliable Rings and Complete Networks. OPODIS 2008: 512-526 - [c7]Stefan Dobrev, Rastislav Kralovic
How Much Information about the Future Is Needed? SOFSEM 2008: 247-258 - 2007
- [c6]Jirí Wiedermann, Dana Pardubská:
Wireless Parallel Computing and its Links to Descriptive Complexity. DCFS 2007: 41-56 - [c5]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic
Online Bandwidth Allocation. ESA 2007: 546-557 - [i1]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)
1990 – 1999
- 1998
- [j4]Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Juraj Waczulík, Hubert Wagener:
Effective Systolic Algorithms for Gossiping in Cycles. Parallel Process. Lett. 8(2): 197-205 (1998) - 1996
- [j3]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages. Fundam. Informaticae 25(3): 271-284 (1996) - 1995
- [c4]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 - 1994
- [j2]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): 303-342 (1994) - [c3]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 - [c2]Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432 - 1993
- [c1]Dana Pardubská:
On the Power of Communication Structure for Distributive Generation of Languages. Developments in Language Theory 1993: 419-429
1980 – 1989
- 1989
- [j1]Dana Pardubská, Ivana Stefáneková:
Nondeterministic Multicounter Machines and Complementation. Theor. Comput. Sci. 67(1): 111-113 (1989)
Coauthor Index
aka: Rastislav Královic
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: