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=165
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Behavioural theories and the proof of behavioural properties
Michel Bidoit
,
Rolf Hennicker
Theoretical Computer Science
165
(1), 1996, pp. 3-55
Proving implications by algebraic approximation
Michael Codish
,
Grigory Mashevitzky
Theoretical Computer Science
165
(1), 1996, pp. 57-74
A seqyential reduction strategy
Sergio Antoy
,
Aart Middeldorp
Theoretical Computer Science
165
(1), 1996, pp. 75-95
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Bernhard Gramlich
Theoretical Computer Science
165
(1), 1996, pp. 97-131
A compositional semantic basis for the analysis of equational Horn programs
María Alpuente
,
Moreno Falaschi
,
Germán Vidal
Theoretical Computer Science
165
(1), 1996, pp. 133-169
Three-valued completion for abductive logic programs
Frank Teusink
Theoretical Computer Science
165
(1), 1996, pp. 171-200
Forum: A multiple-conclusion specification logic
Dale Miller
Theoretical Computer Science
165
(1), 1996, pp. 201-232
Consistent subsequences and supersequences
Campbell Fraser
Theoretical Computer Science
165
(2), 1996, pp. 233-246
Exact complexity bounds for ordinal addition
Françoise Maurin
Theoretical Computer Science
165
(2), 1996, pp. 247-273
Automorphism groups of context-free graphs
Laurent Pélecq
Theoretical Computer Science
165
(2), 1996, pp. 275-293
Fréquences des facteurs des suites sturmiennes
Valérie Berthé
Theoretical Computer Science
165
(2), 1996, pp. 295-309
Selection from read-only memory and sorting with minimum data movement
J. Ian Munro
,
Venkatesh Raman
Theoretical Computer Science
165
(2), 1996, pp. 311-323
Sur l'équivalence de descriptions de figures itérées
Michelle Morcrette
Theoretical Computer Science
165
(2), 1996, pp. 325-354
Linear time parsers for classes of non context free languages
Sulekha R. Kulkarni
,
Priti Shankar
Theoretical Computer Science
165
(2), 1996, pp. 355-390
Tree structure for distributive lattices and its applications
Michel Habib
,
Lhouari Nourine
Theoretical Computer Science
165
(2), 1996, pp. 391-405
Fully dynamic secret sharing schemes
Carlo Blundo
,
Antonella Cresti
,
Alfredo De Santis
,
Ugo Vaccaro
Theoretical Computer Science
165
(2), 1996, pp. 407-440
Dynamic and static algorithms for optimal placement of resources in a tree
Vincenzo Auletta
,
Domenico Parente
,
Giuseppe Persiano
Theoretical Computer Science
165
(2), 1996, pp. 441-461
Nonreturning PC grammar systems can be simulated by returning systems
Sorina Dumitrescu
Theoretical Computer Science
165
(2), 1996, pp. 463-474
Firing squad synchronization problem in reversible cellular automata
Katsunobu Imai
,
Kenichi Morita
Theoretical Computer Science
165
(2), 1996, pp. 475-482
Strong
NP
-completeness of a matrix similarity problem
V. Brimkov
,
B. Codenotti
,
M. Leoncini
,
G. Resta
Theoretical Computer Science
165
(2), 1996, pp. 483-490