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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of Dijkstra's algorithm
D.E. Knuth
Information Processing Letters
6
, 1977, February, pp. 1-5
Theil's estimator
G. Yuval
Information Processing Letters
6
(1), 1977, February, pp. 6-7
Parallel hashing algorithms
E. Goto
,
T. Ida
,
T. Gunji
Information Processing Letters
6
(1), 1977, February, pp. 8-13
Generalizations of line graphs and applications
N. Deo
,
M.S. Krishnamoorthy
,
A.B. Pai
Information Processing Letters
6
(1), 1977, February, pp. 14-17
A fast error evaluation algorithm for polynomial approximation
F. Chin
,
K. Steiglitz
Information Processing Letters
6
(1), 1977, February, pp. 18-21
Alternate solutions to the cigarette smokers' problem without conditionals
S.S. Reddi
Information Processing Letters
6
(1), 1977, February, pp. 22-24
A note on optimal preemptive scheduling for two-processor systems
A. Rowicki
Information Processing Letters
6
(1), 1977, February, pp. 25-28
Relations as programming language elements
T.H. Merrett
Information Processing Letters
6
(1), 1977, February, pp. 29-33
A universally hard set of formulae with respect to non-deterministic Turing acceptors
C.P. Schnorr
,
H. Klupp
Information Processing Letters
6
(2), 1977, April, pp. 35-37
On the partial computation principle
A.P. Ershov
Information Processing Letters
6
(2), 1977, April, pp. 38-41
The universal space for parallel computation
R. Zuczek
Information Processing Letters
6
(2), 1977, April, pp. 42-45
FIFO-optimal placement on pages of independently referenced sectors
A. Endres
,
H.-G. Stork
Information Processing Letters
6
(2), 1977, April, pp. 46-49
'v-tape', a virtual memory oriented data type and its resource requirements
M. Sassa
,
E. Goto
Information Processing Letters
6
(2), 1977, April, pp. 50-55
Producing optimised code for coercions
J.P. Banatre
Information Processing Letters
6
(2), 1977, April, pp. 56-59
Complete operator precedence conditions
M.H. Williams
Information Processing Letters
6
(2), 1977, April, pp. 60-62
A first-in-first-out buffered cyclic memory
V. Rajaraman
,
O. Vikas
Information Processing Letters
6
(2), 1977, April, pp. 63-68
An
O(n)
algorithm for finding periodicity of a sequence using hash coding
T. Hikita
,
E. Goto
Information Processing Letters
6
(2), 1977, April, pp. 69-71
Nonisomorphic trees with the same t-polynomial
E.A. Dinic
,
A.K. Kelmans
,
M.A. Zaitsev
Information Processing Letters
6
(3), 1977, April, pp. 73-76
A method for determining class subspaces
J. Kittler
Information Processing Letters
6
(3), 1977, April, pp. 77-79
Preserving order in a forest in less than logarithmic time and linear space
P. van Emde Boas
Information Processing Letters
6
(3), 1977, April, pp. 80-82
An adaptive time advancement algorithm for discrete simulation
A. Javor
Information Processing Letters
6
(3), 1977, April, pp. 83-86
Comments on ``Error resynchronisation in producer consumer systems''
H. Wurges
Information Processing Letters
6
(3), 1977, April, pp. 87-90
One more polynomial complete consecutive retrieval problem
W., Jr. Lipski
Information Processing Letters
6
(3), 1977, April, pp. 91-93
Sorting tree, nestling tree and inverse permutation
S. Kundu
Information Processing Letters
6
(3), 1977, April, pp. 94-96
An optimization of the alternating semantic evaluator
K.J. Räihä
,
M. Saarinen
Information Processing Letters
6
(3), 1977, April, pp. 97-100
Seiten 1
2
3
>