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
Hilfe
Suche: Author="Chrz{\c{a}}stowski-Wachtel, Piotr"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker
Piotr Chrza̧stowski-Wachtel
,
Jerzy Tyszkiewicz
,
Achim Hoffmann
,
Arthur Ramer
Information Processing Letters
79
(4), 2001, pp. 155-160
Testing undecidability of the reachability in Petri nets with the help of 10th Hilbert problem
Piotr Chrza̧stowski-Wachtel
Lecture Notes in Computer Science
1639
, 1999, pp. 268-281
The 10th Hilbert problem and the undecidability of the reachability problem in Petri nets
Piotr Chrza̧stowski-Wachtel
Workshop on Concurrency, Specification and Programming, CS&P (Berlin, Germany, September 28-30, 1998 (110), 1998, pp. 9-28
Liveness of weighted circuits and the diophantine problem of Frobenius
Piotr Chrza̧stowski-Wachtel
,
Marek Raczunas
Proceedings of the 9th International Conference on Fundamentals of Computation Theory. FCT '93 (Szeged, Hungary, August 1993)
LNCS 710
, 1993, pp. 171-180