| Publication | Date of Publication | Type |
|---|
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Improved algorithms in directional wireless sensor networks
Journal of Combinatorial Optimization | 2023-05-11 | Paper |
The complexity of symmetric connectivity in directional wireless sensor networks
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
Establishing symmetric connectivity in directional wireless sensor networks equipped with 2/3 antennas
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
Dual power assignment optimization and fault tolerance in WSNs
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
Theoretical Computer Science | 2015-01-28 | Paper |
Broadcast scheduling problem in SINR model
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Theoretical Computer Science | 2014-01-10 | Paper |
Minimum total node interference in wireless sensor networks
Ad Hoc Networks | 2011-02-25 | Paper |
On deciding some equivalences for concurrent processes
RAIRO - Theoretical Informatics and Applications | 1997-10-28 | Paper |
Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\)
Information and Computation | 1995-07-10 | Paper |
On deciding readiness and failure equivalences for processes
Information and Computation | 1995-07-06 | Paper |
A note on the complexity of deciding bisimilarity of normed unary processes
Theoretical Computer Science | 1994-08-29 | Paper |
On deciding trace equivalences for processes
Information Sciences | 1994-03-13 | Paper |
Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
Theoretical Computer Science | 1994-02-22 | Paper |
| scientific article; zbMATH DE number 149518 (Why is no real title available?) | 1993-04-01 | Paper |
The parallel complexity of coarsest set partition problems
Information Processing Letters | 1993-01-16 | Paper |
EFFICIENT DETECTORS AND CONSTRUCTORS FOR SIMPLE LANGUAGES
International Journal of Foundations of Computer Science | 1992-09-27 | Paper |
The parallel complexity of finite-state automata problems
Information and Computation | 1992-06-28 | Paper |
Nonuniform complexity and the randomness of certain complete languages
Theoretical Computer Science | 1992-06-28 | Paper |
THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS
International Journal of Algebra and Computation | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4216027 (Why is no real title available?) | 1992-01-01 | Paper |
Finite-automaton aperiodicity is PSPACE-complete
Theoretical Computer Science | 1991-01-01 | Paper |
A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
Information and Computation | 1991-01-01 | Paper |
The effective entropies of some extensions of context-free languages
Information Processing Letters | 1991-01-01 | Paper |
Effective entropies and data compression
Information and Computation | 1991-01-01 | Paper |
The complexity of ranking simple languages
Mathematical Systems Theory | 1990-01-01 | Paper |
The complexity of membership for deterministic growing context-sensitive grammars<sup>∗</sup>
International Journal of Computer Mathematics | 1990-01-01 | Paper |
On a complexity hierarchy between L and NL
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4010508 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035164 (Why is no real title available?) | 1987-01-01 | Paper |
On solving hard problems by polynomial-size circuits
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3988704 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001487 (Why is no real title available?) | 1986-01-01 | Paper |
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
Theoretical Computer Science | 1986-01-01 | Paper |
Some Observations about the Randomness of Hard Problems
SIAM Journal on Computing | 1986-01-01 | Paper |
A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
Information and Control | 1986-01-01 | Paper |
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals
SIAM Journal on Computing | 1986-01-01 | Paper |
Complexity of the word problem for commutative semigroups of fixed dimension
Acta Informatica | 1985-01-01 | Paper |
The complexity of equivalence problems for commutative grammars
Information and Control | 1985-01-01 | Paper |
Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete
Theoretical Computer Science | 1984-01-01 | Paper |
Properties of congruences on commutative monoids
Semigroup Forum | 1984-01-01 | Paper |
Commutative grammars: The complexity of uniform word problems
Information and Control | 1983-01-01 | Paper |
