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=169
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lambda terms definable as combinators
M.W. Bunder
Theoretical Computer Science
169
(1), 1996, pp. 3-21
The logic engine and the realization problem for nearest neighbor graphs
Peter Eades
,
Sue Whitesides
Theoretical Computer Science
169
(1), 1996, pp. 23-37
Formal specification of parallel SIMD execution
C.A. Farrell
,
D.H. Kieronska
Theoretical Computer Science
169
(1), 1996, pp. 39-65
Computing downwards accumulations on trees quickly
Jeremy Gibbons
Theoretical Computer Science
169
(1), 1996, pp. 67-80
The Qu-Prolog unification algorithm: Formalisation and correctness
Peter Nickolas
,
Peter J. Robinson
Theoretical Computer Science
169
(1), 1996, pp. 81-112
See more through lenses than bananas
La Monte H. Yarroll
Theoretical Computer Science
169
(1), 1996, pp. 113-121
On the complementation of asynchronous cellular Büchi automata
Anca Muscholl
Theoretical Computer Science
169
(2), 1996, pp. 123-145
A fast randomized LOGSPACE algorithm for graph connectivity
Uriel Feige
Theoretical Computer Science
169
(2), 1996, pp. 147-160
Complexity results for two-way and multi-pebble automata and their logics
Noa Globerman
,
David Harel
Theoretical Computer Science
169
(2), 1996, pp. 161-184
Polynomial closure of group languages and open sets of the Hall topology
Jean-Eric Pin
Theoretical Computer Science
169
(2), 1996, pp. 185-200
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Roberto Di Cosmo
,
Delia Kesner
Theoretical Computer Science
169
(2), 1996, pp. 201-220