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="Chytil, Michael P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the Ehrenfeucht conjecture on test sets and its dual version
J. Albert
Lecture Notes in Computer Science
176
, 1984, pp. 176-184
Sparse oracles, lowness, and highness
José L. Balcázar
,
Ronald V. Book
,
Uwe Schöning
Lecture Notes in Computer Science
176
, 1984, pp. 185-193
Separating, strongly separating, and collapsing relativized complexity classes
José Luis Balcázar
Lecture Notes in Computer Science
176
, 1984, pp. 1-16
Computability of probabilistic parameters for some classes of formal languages
Joffroy Beauquier
,
Loÿs Thimonier
Lecture Notes in Computer Science
176
, 1984, pp. 194-204
A truely morphic characterization of recursively enumerable sets
Franz Josef Brandenburg
Lecture Notes in Computer Science
176
, 1984, pp. 205-213
On the Herbrand Kleene universe for nondeterministic computations
Manfred Broy
Lecture Notes in Computer Science
176
, 1984, pp. 214-222
An investigation of controls for concurrent systems by abstract control languages
H.D. Burkhard
Lecture Notes in Computer Science
176
, 1984, pp. 223-231
On generalized words of Thue-Morse
A. C̑erný
Lecture Notes in Computer Science
176
, 1984, pp. 232-239
Complexity of quantifier elimination in the theory of algebraically closed fields
A.L. Chistov
,
D.Yu. Grigor'ev
Lecture Notes in Computer Science
176
, 1984, pp. 17-31
Nondeterminism is essential for two-way counter machines
Marek Chrobak
Lecture Notes in Computer Science
176
, 1984, pp. 240-244
Weak and strong fairness in CCS
Gerardo Costa
,
Colin Stirling
Lecture Notes in Computer Science
176
, 1984, pp. 245-254
On the complexity of inductive inference
Robert P. Daley
,
Carl H. Smith
Lecture Notes in Computer Science
176
, 1984, pp. 255-264
Propositional dynamic logic with strong loop predicate
Ryszard Danecki
Lecture Notes in Computer Science
176
, 1984, pp. 573-581
Models and operators for nondeterministic processes
Rocco De Nicola
Lecture Notes in Computer Science
176
, 1984, pp. 433-442
Monotone edge sequences in line arrangements and applications
Herbert Edelsbrunner
,
Emmerich Welzl
Lecture Notes in Computer Science
176
, 1984, pp. 265-272
Many-sorted temporal logic for multi-processes systems
P. Enjalbert
,
M. Michel
Lecture Notes in Computer Science
176
, 1984, pp. 273-281
Systolic automata - Power, characterizations, nonhomogeneity
Jozef Gruska
Lecture Notes in Computer Science
176
, 1984, pp. 32-49
Process logics: Two decidability results
Z. Habasiński
Lecture Notes in Computer Science
176
, 1984, pp. 282-290
On searching of special classes of mazes and finite embedded graphs
A. Hemmerling
,
K. Kriegel
Lecture Notes in Computer Science
176
, 1984, pp. 291-300
The power of the future perfect in program logics
M. Hennessy
,
C. Stirling
Lecture Notes in Computer Science
176
, 1984, pp. 301-311
A note on unique decipherability
Christoph M. Hoffmann
Lecture Notes in Computer Science
176
, 1984, pp. 50-63
Outline of an algebraic language theory
Günter Hotz
Lecture Notes in Computer Science
176
, 1984, pp. 64-79
Hierarchy of reversal and zerotesting bounded multicounter machines
J. Hromkovic̑
Lecture Notes in Computer Science
176
, 1984, pp. 312-321
On the power of alternation in finite automata
Juraj Hromkovic̑
Lecture Notes in Computer Science
176
, 1984, pp. 322-329
The equivalence problem and correctness formulas for a simple class of programs
Oscar H. Ibarra
,
Louis E. Rosier
Lecture Notes in Computer Science
176
, 1984, pp. 330-338
Seiten 1
2
3
>