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=120
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equality and abductive residua for Horn clauses
E. Knill
,
P.T. Cox
,
T. Pietrzykowski
Theoretical Computer Science
120
(1), 1993, pp. 1-44
Legality concepts for three-valued logic programs
G. Nota
,
S. Orefice
,
G. Pacini
,
F. Ruggiero
,
G. Tortora
Theoretical Computer Science
120
(1), 1993, pp. 45-68
On the status of proving program properties in effective interpretations
Michaƚ Grabowski
Theoretical Computer Science
120
(1), 1993, pp. 69-81
A class of programs for which SLDNF resolution and NAF rule are complete
Stefano Baratella
Theoretical Computer Science
120
(1), 1993, pp. 83-99
The poset of infinitary traces
Paul Gastin
,
Brigitte Rozoy
Theoretical Computer Science
120
(1), 1993, pp. 101-121
``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs
P. Cousot
,
R. Cousot
Theoretical Computer Science
120
(1), 1993, pp. 123-155
Cut formulas in propositional logic
Wenhui Zhang
Theoretical Computer Science
120
(1), 1993, pp. 157-168
Composition is almost (but not quite) as good as s-1-1
Yves Marcoux
Theoretical Computer Science
120
(2), 1993, pp. 169-195
Regular expressions into finite automata
Anne Brüggemann-Klein
Theoretical Computer Science
120
(2), 1993, pp. 197-213
Deriving algorithms on reconfigurable networks based on function decomposition
Gen-Huey Chen
,
Biing-Feng Wang
,
Hungwen Li
Theoretical Computer Science
120
(2), 1993, pp. 215-227
On D0L systems with immigration
Juha Honkala
Theoretical Computer Science
120
(2), 1993, pp. 229-245
Separating
k
-separated eNCE graph languages
Changwook Kim
,
Dong Hoon Lee
Theoretical Computer Science
120
(2), 1993, pp. 247-259
An optimal distributed algorithm for recognizing mesh-connected networks
Rajanarayanan Subbiah
,
Sitharama S. Iyengar
,
Sridhar Radhakrishnan
,
R.L. Kashyap
Theoretical Computer Science
120
(2), 1993, pp. 261-278
On symmetric differences of NP-hard sets with weakly P-selective sets
Bin Fu
,
Hong-zhou Li
Theoretical Computer Science
120
(2), 1993, pp. 279-291
Closure properties of slender languages
Gheorghe Păun
,
Arto Salomaa
Theoretical Computer Science
120
(2), 1993, pp. 293-301
Parallel on-line parsing in constant time per word
Klaas Sikkel
Theoretical Computer Science
120
(2), 1993, pp. 303-310
On space-efficient algorithms for certain NP-complete problems
A. Ferreira
Theoretical Computer Science
120
(2), 1993, pp. 311-315