EDBT 2026 Demo / reviewers in the wild / expert
Zdenek Sawa
dblp:74/5191
· DBLP profile ↗
13ranked-venue papers
4as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 11 · 3 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Logic in computer science · 50% Computational complexity · 41% Automata and formal languages · 6% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
bisimulation |
0.1 | 1 | 2010 | Complexity of deciding bisimilarity between normed BPA and normed BPP · Inf. Comput. 2010 |
Computational complexity
decidability |
0.1 | 1 | 2010 | Complexity of deciding bisimilarity between normed BPA and normed BPP · Inf. Comput. 2010 |
Logic in computer science › process algebra
process semantics |
0.1 | 1 | 2010 | Non-interleaving bisimulation equivalences on Basic Parallel Processes · Inf. Comput. 2010 |
Computational complexity
circuit complexity |
0.0 | 1 | 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata · Inf. Comput. 2004 |
Computational complexity › circuit complexity › circuit depth
circuit depth lower bounds |
0.0 | 1 | 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata · Inf. Comput. 2004 |
Logic in computer science
process algebra |
0.0 | 1 | 2010 | Complexity of deciding bisimilarity between normed BPA and normed BPP · Inf. Comput. 2010 |
Automata and formal languages
equivalence problem |
0.0 | 1 | 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata · Inf. Comput. 2004 |
Automated reasoning and model checking
model checking |
0.0 | 1 | 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata · Inf. Comput. 2004 |
Automata and formal languages › counter machines
one-counter automata |
0.0 | 1 | 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata · Inf. Comput. 2004 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Countdown games, and simulation on (succinct) one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa |
Log. Methods Comput. Sci. | 3 |
| 2013 | Complexity of Checking Bisimilarity between Sequential and Parallel Processes
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa |
MFCS | 4 |
| 2013 | Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite AutomataabstractIn languages over a unary alphabet, i.e., an alphabet with only one letter, words can be identified with their lengths. It is well known that each regular language over a unary alphabet can be represented as the union of a finite number of arithmetic Zdenek Sawa |
Fundam. Informaticae | 1 |
| 2010 | Non-interleaving bisimulation equivalences on Basic Parallel Processes
Sibylle Fröschle, Petr Jancar, Slawomir Lasota 0001, Zdenek Sawa |
Inf. Comput. | 4 |
| 2010 | Complexity of deciding bisimilarity between normed BPA and normed BPP
Petr Jancar, Martin Kot, Zdenek Sawa |
Inf. Comput. | 3 |
| 2009 | Hardness of equivalence checking for composed finite-state systems
Zdenek Sawa, Petr Jancar |
Acta Informatica | 1 |
| 2008 | Normed BPA vs. Normed BPP Revisited
Petr Jancar, Martin Kot, Zdenek Sawa |
CONCUR | 3 |
| 2007 | A note on emptiness for alternating finite automata with a one-letter alphabet
Petr Jancar, Zdenek Sawa |
Inf. Process. Lett. | 2 |
| 2004 | DP lower bounds for equivalence-checking and model-checking of one-counter automata
Petr Jancar, Antonín Kucera 0001, Faron Moller, Zdenek Sawa |
Inf. Comput. | 4 |
| 2003 | Equivalence Checking of Non-Flat Systems Is EXPTIME-hard
Zdenek Sawa |
CONCUR | 1 |
| 2002 | Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
Petr Jancar, Antonín Kucera 0001, Faron Moller, Zdenek Sawa |
FoSSaCS | 4 |
| 2001 | P-Hardness of Equivalence Testing on Finite-State Processes
Zdenek Sawa, Petr Jancar |
SOFSEM | 1 |
| 1999 | Simulation Problems for One-Counter Machines
Petr Jancar, Faron Moller, Zdenek Sawa |
SOFSEM | 3 |