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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Soft precedence
Rainer Zimmer
Information Processing Letters
1
, 1971, pp. 108-110
Expression evaluation with minimum average working storage
G. Chroust
Information Processing Letters
1
, 1971, pp. 111-114
Recursion and stacks
B.H. Mayoh
Information Processing Letters
1
, 1971, pp. 115-116
Outline of a machine without branch instructions
C. Bron
Information Processing Letters
1
, 1971, pp. 117-119
Determining whether a groupoid is a group
Robert E. Tarjan
Information Processing Letters
1
, 1971, pp. 120-124
Protection in operating systems
D. Tsichritzis
Information Processing Letters
1
, 1971, pp. 127-131
An efficient algorithm for determining the convex hull of a finite planar set
R.L. Graham
Information Processing Letters
1
, 1971, pp. 132-133
Automatic content analysis in an on-line environment
John M. Carroll
,
William Fraser
,
Gregory Gill
Information Processing Letters
1
, 1971, pp. 134-140
A context-free syntax of ALGOL 68
P. Branquart
,
J.P. Cardinael
,
J.P. Delescaille
,
J. Lewi
Information Processing Letters
1
, 1971, pp. 141-148
Fast and read-only algorithms for traversing trees without an auxiliary stack
Laurent Siklóssy
Information Processing Letters
1
, 1971, pp. 149-152
Feature evaluation with quadratic mutual information
Godfried T. Toussaint
Information Processing Letters
1
, 1971, pp. 153-156
A fast method for interpolation using preconditioning
Ellis Horowitz
Information Processing Letters
1
, 1971, pp. 157-163
A new additive pseudorandom number generator for extremely short word-lengths
Jaroslav Král
Information Processing Letters
1
, 1971, pp. 164-167
On an approach to integrating boundary problems with a non-unique solution
I.N. Molchanov
,
L.D. Nikolenko
Information Processing Letters
1
, 1971, pp. 168-172
An experiment in optimal sorting
Donald E. Knuth
,
E.B. Kaehler
Information Processing Letters
1
, 1971, pp. 173-176
Information streams sharing a finite buffer
Edsger W. Dijkstra
Information Processing Letters
1
, 1971, pp. 179-180
On an extension of Dijkstra's semaphore primitives
H. Vantilborgh
,
A. van Lamsweerde
Information Processing Letters
1
, 1971, pp. 181-186
Priority processes used for scheduling within a tree structured operating system
R.C. Varney
Information Processing Letters
1
, 1971, pp. 187-190
Short note on a heuristic search strategy in long-term memory networks
Nicholas V. Findler
Information Processing Letters
1
, 1971, pp. 191-196
A refinement procedure for pure random search
R.S. Anderssen
Information Processing Letters
1
(5), 1972, pp. 197-200
The equivalence problem for deterministic TOL-systems is undecidable
Grzegorg Rozenberg
Information Processing Letters
1
, 1971, pp. 201-204
Iterative methods for solving difference equations of the theory of elasticity not depending on the spacing of the difference net
I.N. Molchanov
,
N.I. Stepanets
Information Processing Letters
1
, 1971, pp. 205-210
Synthesis of a discrete-time optimal filter algorithm with reduced sensitivity to deviations of a priori statistics
G.B. Krepyshev
,
Ya.A. Pollack
Information Processing Letters
1
, 1971, pp. 211-215
Storage requirements in stochastic data acquisition systems
A. Brandstetter
Information Processing Letters
1
, 1971, pp. 217-219
Bounds on the weighted path length of binary trees
J. Nievergelt
,
J. Pradels
,
C.K. Wong
,
P.C. Yue
Information Processing Letters
1
, 1971, pp. 220-225
Seiten
<
1
2
3
>