Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Sos{\'{i}}k, Petr"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
P systems with proteins on membranes characterize PSPACE
Petr Sosík
,
Andrei Pȃun
,
Alfonso Rodríguez-Patón
Theoretical Computer Science
488
, 2013, pp. 78-95
On the scalability of biocomputing algorithms: The case of the maximum clique problem
Daniel Manrique
,
Alfonso Rodríguez-Patón
,
Petr Sosík
Theoretical Computer Science
412
(51), 2011, pp. 7075-7086
On the power of families of recognizer spiking neural P systems
Petr Sosík
,
Alfonso Rodríguez-Patón
,
Ludȇk Cienciala
International Journal of Foundations of Computer Science
22
(1), 2011, pp. 75-88
On the weight of universal insertion grammars
Lila Kari
,
Petr Sosík
Theoretical Computer Science
396
(1-3), 2008, pp. 264-270
On the power of deterministic and sequential communicating P systems
Ludȇk Cienciala
,
Lucie Ciencialová
,
Pierluigi Frisco
,
Petr Sosík
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 415-431
Normal forms for spiking neural
P
systems
Oscar H. Ibarra
,
Andrei Păun
,
Gheorghe Păun
,
Alfonso Rodríguez-Patón
,
Petr Sosík
,
Sara Woodworth
Theoretical Computer Science
372
(2-3), 2007, pp. 196-217
Membrane computing and complexity theory: A characterization of
P
SPACE
Petr Sosík
,
Alfonso Rodríguez-Patón
Journal of Computer and System Sciences
73
(1), 2007, pp. 137-152
Algebraic properties of substitution on trajectories
Michael Domaratzki
,
Petr Sosík
,
Alfonso Rodríguez-Patón
Theoretical Computer Science
369
(1-3), 2006, pp. 183-196
Computationally universal
P
systems without priorities: Two catalysts are sufficient
Rudolf Freund
,
Lila Kari
,
Marion Oswald
,
Petr Sosík
Theoretical Computer Science
330
(2), 2005, pp. 251-266
Operations on trajectories with applications to coding and bioinformatics
Lila Kari
,
Stavros Konstantinidis
,
Petr Sosík
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 531-546
Bond-free languages: Formalizations, maximality and construction methods
Lila Kari
,
Stavros Konstantinidis
,
Petr Sosík
International Journal of Foundations of Computer Science
16
(5), 2005, pp. 1039-1070
On properties of bond-free DNA languages
Lila Kari
,
Stavros Konstantinidis
,
Petr Sosík
Theoretical Computer Science
334
(1-3), 2005, pp. 131-159
Aspects of shuffle and deletion on trajectories
Lila Kari
,
Petr Sosík
Theoretical Computer Science
332
(1-3), 2005, pp. 47-61
Watson-Crick D0L systems: Generative power and undecidable problems
Petr Sosík
Theoretical Computer Science
306
(1-3), 2003, pp. 101-112
Universal computation with Watson-Crick D0L systems
Petr Sosík
Theoretical Computer Science
289
(1), 2002, pp. 485-501
Grammatical inference of colonies
Petr Sosík
,
Leos̑ S̑týbnar
Lecture Notes in Computer Science
1218
, 1997, pp. 236-246