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=Inf.~Process.~Lett. AND Volume=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Top-down tree transducers with deterministic top-down look-ahead
Z. Fülöp
,
S. Vágvölgyi
Information Processing Letters
33
, 1989/90, pp. 3-5
An adaptive algorithm for finding a covering hypersphere
S.J. Wan
,
S.K.M. Wong
Information Processing Letters
33
, 1989/90, pp. 7-10
On access and alignments of data in a parallel processor
De-Lei Lee
Information Processing Letters
33
, 1989/90, pp. 11-14
The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Mila E. Majster-Cederbaum
Information Processing Letters
33
, 1989/90, pp. 15-19
A simple proof of a simple consensus algorithm
Jayadev Misra
Information Processing Letters
33
, 1989/90, pp. 21-24
Leader election in the presence of
n - 1
initial failures
Gadi Taubenfeld
Information Processing Letters
33
, 1989/90, pp. 25-28
Linear algorithm for domatic number problem on interval graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Information Processing Letters
33
, 1989/90, pp. 29-33
An approximate algorithm for the minimal vertex nested polygon problem
Bhaskar Dasgupta
,
C.E. Veni Madhavan
Information Processing Letters
33
, 1989/90, pp. 35-44
Comments on ``A comparison of concatenated and superimposed code word surrogate files for very large data/knowledge bases''
Kam-Fai Wong
Information Processing Letters
33
, 1989/90, pp. 45-52
Prime numbers as a tool to design distributed algorithms
Michel Raynal
Information Processing Letters
33
, 1989/90, pp. 53-58
Lower bounds for line stabbing
D. Avis
,
J.M. Robert
,
R. Wenger
Information Processing Letters
33
, 1989/90, pp. 59-62
On the average number of maxima in a set of vectors
Christian Buchta
Information Processing Letters
33
, 1989/90, pp. 63-65
Fast computation of periodic continued fractions
Kuo-Liang Chung
,
Wen-Chin Chen
,
Ferng-Ching Lin
Information Processing Letters
33
, 1989/90, pp. 67-72
Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space
Andrzej Szepietowski
Information Processing Letters
33
, 1989/90, pp. 73-78
Simulating circular attribute grammars through attribute reevaluation
Winfried Thome
,
Reinhard Wilhelm
Information Processing Letters
33
, 1989/90, pp. 79-81
The speed of copying on one-tape off-line Turing machines
Martin Dietzfelbinger
Information Processing Letters
33
, 1989/90, pp. 83-89
Optimal node ranking of trees in linear time
Alejandro A. Schäffer
Information Processing Letters
33
, 1989/90, pp. 91-96
Magic semi-joins
Stefano Ceri
,
Georg Gottlob
,
Letizia Tanca
,
Gio Wiederhold
Information Processing Letters
33
, 1989/90, pp. 97-107
Some notes on strong and weak
\log\log n
space complexity
Andrzej Szepietowski
Information Processing Letters
33
, 1989/90, pp. 109-112
Simple and efficient string matching with
k
mismatches
R. Grossi
,
F. Luccio
Information Processing Letters
33
, 1989/90, pp. 113-120
The lexicographically first topological order problem is NLOG-complete
Takayoshi Shoudai
Information Processing Letters
33
, 1989/90, pp. 121-124
Software-controlled cache coherence protocol for multicache systems
Lanfranco Lopriore
Information Processing Letters
33
, 1989/90, pp. 125-130
Auxiliary variables in partial correctness programming logics
E. Robert McCurley
Information Processing Letters
33
, 1989/90, pp. 131-133
An optimal parallel algorithm for generating combinations
Selim G. Akl
,
David Gries
,
Ivan Stojmenovic
Information Processing Letters
33
, 1989/90, pp. 135-139
A note on sparse sets and the polynomial-time hierarchy
Ronald V. Book
,
Shouwen Tang
Information Processing Letters
33
, 1989/90, pp. 141-143
Seiten 1
2
3
>