| Publication | Date of Publication | Type |
|---|
| Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas | 2023-08-15 | Paper |
| Improved algorithms in directional wireless sensor networks | 2023-05-11 | Paper |
| The complexity of symmetric connectivity in directional wireless sensor networks | 2020-03-24 | Paper |
| Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas | 2017-11-09 | Paper |
| Dual power assignment optimization and fault tolerance in WSNs | 2015-07-01 | Paper |
| A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model | 2015-01-28 | Paper |
| Broadcast scheduling problem in SINR model | 2014-11-14 | Paper |
| Bounded-degree minimum-radius spanning trees in wireless sensor networks | 2014-01-10 | Paper |
| Minimum Total Node Interference in Wireless Sensor Networks | 2011-02-25 | Paper |
| On deciding some equivalences for concurrent processes | 1997-10-28 | Paper |
| Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) | 1995-07-10 | Paper |
| On deciding readiness and failure equivalences for processes | 1995-07-06 | Paper |
| A note on the complexity of deciding bisimilarity of normed unary processes | 1994-08-29 | Paper |
| On deciding trace equivalences for processes | 1994-03-13 | Paper |
| Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) | 1994-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4032309 | 1993-04-01 | Paper |
| The parallel complexity of coarsest set partition problems | 1993-01-16 | Paper |
| EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES | 1992-09-27 | Paper |
| The parallel complexity of finite-state automata problems | 1992-06-28 | Paper |
| Nonuniform complexity and the randomness of certain complete languages | 1992-06-28 | Paper |
| THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3363320 | 1992-01-01 | Paper |
| Finite-automaton aperiodicity is PSPACE-complete | 1991-01-01 | Paper |
| A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes | 1991-01-01 | Paper |
| The effective entropies of some extensions of context-free languages | 1991-01-01 | Paper |
| Effective entropies and data compression | 1991-01-01 | Paper |
| The complexity of ranking simple languages | 1990-01-01 | Paper |
| The complexity of membership for deterministic growing context-sensitive grammars∗ | 1990-01-01 | Paper |
| On a complexity hierarchy between L and NL | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760533 | 1987-01-01 | Paper |
| On solving hard problems by polynomial-size circuits | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3774963 | 1987-01-01 | Paper |
| Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states | 1986-01-01 | Paper |
| Some Observations about the Randomness of Hard Problems | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751001 | 1986-01-01 | Paper |
| A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems | 1986-01-01 | Paper |
| The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727433 | 1986-01-01 | Paper |
| Complexity of the word problem for commutative semigroups of fixed dimension | 1985-01-01 | Paper |
| The complexity of equivalence problems for commutative grammars | 1985-01-01 | Paper |
| Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete | 1984-01-01 | Paper |
| Properties of congruences on commutative monoids | 1984-01-01 | Paper |
| Commutative grammars: The complexity of uniform word problems | 1983-01-01 | Paper |
