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: Journal=Theor.~Comput.~Sci. AND Volume=118
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Feasibility problems for recurring tasks on one processor
Sanjoy K. Baruah
,
Rodney R. Howell
,
Louis E. Rosier
Theoretical Computer Science
118
(1), 1993, pp. 3-20
Refinement of actions in event structures and causal trees
Philippe Darondeau
,
Pierpaolo Degano
Theoretical Computer Science
118
(1), 1993, pp. 21-48
A speed-up theorem without tape compression
Viliam Geffert
Theoretical Computer Science
118
(1), 1993, pp. 49-65
Gentzen-type axiomatization for PAL
Igor Walukiewicz
Theoretical Computer Science
118
(1), 1993, pp. 67-79
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT, beating, on an average, QUICKSORT (if
n
is not very small)
Ingo Wegener
Theoretical Computer Science
118
(1), 1993, pp. 81-98
Proof methods of declarative properties of definite programs
Pierre Deransart
Theoretical Computer Science
118
(2), 1993, pp. 99-166
Complete axiomatizations of some quotient term algebras
Hubert Comon
Theoretical Computer Science
118
(2), 1993, pp. 167-191
Methods for proving completeness via logical reductions
Iain A. Stewart
Theoretical Computer Science
118
(2), 1993, pp. 193-229
A uniform treatment of order of evaluation and aggregate update
M. Draghicescu
,
S. Purushothaman
Theoretical Computer Science
118
(2), 1993, pp. 231-262
Transition system specifications with negative premises
Jan Friso Groote
Theoretical Computer Science
118
(2), 1993, pp. 263-299
A characterisation of the least-fixed-point operator by dinaturality
Alex K. Simpson
Theoretical Computer Science
118
(2), 1993, pp. 301-314