| Publication | Date of Publication | Type |
|---|
Busy agents on a line
Discrete Applied Mathematics | 2026-02-11 | Paper |
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Improved Lower Bounds for Shoreline Search
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Exploration of Time-Varying Connected Graphs with Silent Agents
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Two lower bounds on distributive generation of languages
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| scientific article; zbMATH DE number 7559401 (Why is no real title available?) | 2022-07-18 | Paper |
| Lexicalized syntactic analysis by two-way restarting automata | 2022-03-11 | Paper |
Tight hierarchy of data-independent multi-head automata
Journal of Computer and System Sciences | 2020-09-07 | Paper |
| Treasure hunt with barely communicating agents | 2020-07-30 | Paper |
| Isometric gene tree reconciliation revisited | 2018-03-23 | Paper |
Translations by regulated parallel communicating grammar systems
Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
On minimalism of analysis by reduction by restarting automata
Formal Grammar | 2014-10-14 | Paper |
Unary coded NP-complete languages in \(\mathrm{ASpace}(\log \log n)\)
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
Factoring and testing primes in small space
RAIRO - Theoretical Informatics and Applications | 2014-02-24 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Unary coded NP-complete languages in \(\mathrm{ASpace}(\log\log n)\)
Developments in Language Theory | 2012-11-02 | Paper |
Parallel communicating grammar systems with regular control and skeleton preserving FRR automata
Theoretical Computer Science | 2011-02-02 | Paper |
Black hole search in directed graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Parallel Communicating Grammar Systems with Regular Control
Algebraic Informatics | 2009-11-05 | Paper |
Measuring the problem-relevant information in input
RAIRO - Theoretical Informatics and Applications | 2009-07-15 | Paper |
Measuring the problem-relevant information in input
RAIRO - Theoretical Informatics and Applications | 2009-07-15 | Paper |
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Factoring and Testing Primes in Small Space
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Online Bandwidth Allocation
Algorithms – ESA 2007 | 2008-09-25 | Paper |
WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
On the Power of Broadcasting in Mobile Computing
New Computational Paradigms | 2008-04-29 | Paper |
How Much Information about the Future Is Needed?
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
The complexity of systolic dissemination of information in interconnection networks
RAIRO - Theoretical Informatics and Applications | 1997-12-17 | Paper |
| scientific article; zbMATH DE number 871242 (Why is no real title available?) | 1996-04-28 | Paper |
Nondeterministic multicounter machines and complementation
Theoretical Computer Science | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4057034 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4078801 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4078802 (Why is no real title available?) | 1988-01-01 | Paper |
