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=95
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conceptual level concurrency control of relational update transactions
Victor Vianu
,
Gottfried Vossen
Theoretical Computer Science
95
, 1992, pp. 1-42
Extending Horn clause logic with implication goals
Laura Giordano
,
Alberto Martelli
,
Gianfranco Rossi
Theoretical Computer Science
95
, 1992, pp. 43-74
Temporal logics need their clocks
Ildikó Sain
Theoretical Computer Science
95
, 1992, pp. 75-95
Learning elementary formal systems
Setsuo Arikawa
,
Takeshi Shinohara
,
Akihiro Yamamoto
Theoretical Computer Science
95
, 1992, pp. 97-113
A decision procedure revisited: Notes on direct logic, linear logic and its implementation
Gianluigi Bellin
,
Jussi Ketonen
Theoretical Computer Science
95
, 1992, pp. 115-142
Filter models with polymorphic types
Bart Jacobs
,
Ines Margaria
,
Maddalena Zacchi
Theoretical Computer Science
95
, 1992, pp. 143-158
Fine covers of a VAS language
Sylviane R. Schwer
Theoretical Computer Science
95
, 1992, pp. 159-168
Two distributed problems involving Byzantine processes
Joffroy Beauquier
Theoretical Computer Science
95
, 1992, pp. 169-185
Proof of Dejean's conjecture for alphabets with 5,6,7,8,9,10 and 11 letters
Jean Moulin Ollagnier
Theoretical Computer Science
95
, 1992, pp. 187-205
Systolic convolution of arithmetic functions
Patrice Quinton
,
Yves Robert
Theoretical Computer Science
95
, 1992, pp. 207-229
On the space complexity of some algorithms for sequence comparison
Yuval Rabani
,
Zvi Galil
Theoretical Computer Science
95
, 1992, pp. 231-244
On-line computation of minimal and maximal length paths
Giorgio Ausiello
,
Giuseppe F. Italiano
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
95
, 1992, pp. 245-261
Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of
R
-strongly connected automata
Shuhua Zhang
Theoretical Computer Science
95
, 1992, pp. 263-277
Rational indexes of generators of the cone of context-free languages
Laurent Pierre
Theoretical Computer Science
95
, 1992, pp. 279-305
Ulam's searching game with a fixed number of lies
Joel Spencer
Theoretical Computer Science
95
, 1992, pp. 307-321
Data-movement-intensive problems: Two folk theorems in parallel computation revisited
Selim G. Akl
,
Michel Cosnard
,
Afonso G. Ferreira
Theoretical Computer Science
95
, 1992, pp. 323-337