Dana Pardubská

Available identifiers

zbMath Open pardubska.danaMaRDI QIDQ620960

List of research outcomes

Publication	Date of Publication	Type
Effective systolic algorithms for gossiping in cycles and two-dimensional grids	2022-12-09	Paper
Improved Lower Bounds for Shoreline Search	2022-09-01	Paper
Exploration of Time-Varying Connected Graphs with Silent Agents	2022-09-01	Paper
Two lower bounds on distributive generation of languages	2022-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q5089196	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5061521	2022-03-11	Paper
Tight hierarchy of data-independent multi-head automata	2020-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q3300812	2020-07-30	Paper
Isometric gene tree reconciliation revisited	2018-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q2819408	2016-09-29	Paper
On Minimalism of Analysis by Reduction by Restarting Automata	2014-10-14	Paper
UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(log log n)	2014-08-04	Paper
Antibandwidth and cyclic antibandwidth of Hamming graphs	2014-04-16	Paper
Factoring and testing primes in small space	2014-02-24	Paper
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs	2013-10-10	Paper
Unary Coded NP-Complete Languages in ASPACE (log log n)	2012-11-02	Paper
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata	2011-02-02	Paper
Black Hole Search in Directed Graphs	2010-02-24	Paper
Parallel Communicating Grammar Systems with Regular Control	2009-11-05	Paper
Measuring the problem-relevant information in input	2009-07-15	Paper
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata	2009-04-02	Paper
Factoring and Testing Primes in Small Space	2009-02-03	Paper
WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY	2008-09-25	Paper
Online Bandwidth Allocation	2008-09-25	Paper
On the Power of Broadcasting in Mobile Computing	2008-04-29	Paper
How Much Information about the Future Is Needed?	2008-03-07	Paper
The complexity of systolic dissemination of information in interconnection networks	1997-12-17	Paper
https://portal.mardi4nfdi.de/entity/Q4874656	1996-04-28	Paper
Nondeterministic multicounter machines and complementation	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3792261	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3809264	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3809265	1988-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dana Pardubská