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="Jantzen, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Labeled step sequences in Petri nets
Matthias Jantzen
,
Georg Zetzsche
Lecture Notes in Computer Science
5062
, 2008, pp. 270-287
Refining the hierarchy of blind multicounter languages and twist-closed trios
Matthias Jantzen
,
Alexy Kurganskyy
Information and Computation
185
(2), 2003, pp. 159-181
Refining the hierarchy of blind multicounter languages
Matthias Jantzen
,
Alexy Kurganskyy
Lecture Notes in Computer Science
2010
, 2001, pp. 376-387
Hierarchies of prinicipal twist-closed trios
Matthias Jantzen
Lecture Notes in Computer Science
1373
, 1998, pp. 344-355
The composition heuristic
Kurt Ammon
Lecture Notes in Computer Science
1337
, 1997, pp. 437-444
The might of formulas and their limits
F.L. Bauer
Lecture Notes in Computer Science
1337
, 1997, pp. 1-8
A relational-functional integration for declarative programming
Harold Boley
Lecture Notes in Computer Science
1337
, 1997, pp. 351-358
Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositonality and all that
Manfred Broy
Lecture Notes in Computer Science
1337
, 1997, pp. 279-286
Defining discipline
Wolfgang Coy
Lecture Notes in Computer Science
1337
, 1997, pp. 21-35
On aperiodic sets of Wang tiles
Karel Culik
,
Jarkko Kari
Lecture Notes in Computer Science
1337
, 1997, pp. 153-162
Discrete time analysis of a state dependent tandem with different customer types
Hans Daduna
Lecture Notes in Computer Science
1337
, 1997, pp. 287-296
How distributed algorithms play the token game
Jörg Desel
Lecture Notes in Computer Science
1337
, 1997, pp. 297-306
A remark on trace equations
Volker Diekert
Lecture Notes in Computer Science
1337
, 1997, pp. 251-260
A uniform approach to Petri nets
H. Ehrig
,
J. Padberg
Lecture Notes in Computer Science
1337
, 1997, pp. 219-231
Path planning using a subgoal graph
Martin Eldracher
,
Thomas Pic
Lecture Notes in Computer Science
1337
, 1997, pp. 473-480
An automata approach to some problems on context-free grammars
J. Esparza
,
P. Rossmanith
Lecture Notes in Computer Science
1337
, 1997, pp. 143-152
Spatial and temporal structures in cognitive processes
Christian Freksa
Lecture Notes in Computer Science
1337
, 1997, pp. 379-387
Towards adjusting informatics education to information era
Jozef Gruska
,
Roland Vollmar
Lecture Notes in Computer Science
1337
, 1997, pp. 49-67
Abstract structures in spatial cognition
Christopher Habel
,
Carola Eschenbach
Lecture Notes in Computer Science
1337
, 1997, pp. 369-378
Self-improving behavior arbitration
Mohamed Salah Hamdi
,
Karl Kaiser
Lecture Notes in Computer Science
1337
, 1997, pp. 455-464
Qualitative vs. fuzzy representations of spatial distance
Daniel Hernández
Lecture Notes in Computer Science
1337
, 1997, pp. 389-398
On the arrangement complexity of uniform trees
Günter Hotz
,
Hongzhong Wu
Lecture Notes in Computer Science
1337
, 1997, pp. 337-350
On twist-closed trios: A new morphic characterization of r.e. sets
Matthias Jantzen
Lecture Notes in Computer Science
1337
, 1997, pp. 135-142
Closure under complementation of logspace complexity classes - A survey
Birgit Jenner
Lecture Notes in Computer Science
1337
, 1997, pp. 163-175
Inside and outside the Chinese room
Siegfried Kanngiess̈er
Lecture Notes in Computer Science
1337
, 1997, pp. 359-368
Seiten 1
2
3
>