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=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The role of virtual memory in the handling of application files
G.M. Stacey
Information Processing Letters
1
, 1971, pp. 1-3
Programmed simulation of sequential circuits
F.G. Duncan
,
D. Zissos
Information Processing Letters
1
, 1971, pp. 4-6
The solution of a problem by Ginsburg
Herman A. Maurer
Information Processing Letters
1
, 1971, pp. 7-10
Programmed simulation of race hazards in sequential circuits
D. Zissos
,
F.G. Duncan
Information Processing Letters
1
, 1971, pp. 11-13
A run-time mechanism for referencing variables
W. Henhapl
,
C.B. Jones
Information Processing Letters
1
, 1971, pp. 14-16
General programs for management systems
T.H. Merrett
Information Processing Letters
1
, 1971, pp. 17-20
Stacking without really stacking when reducing categorical expressions
Hans Karlgren
Information Processing Letters
1
, 1971, pp. 21-22
Notes on avoiding ``go to'' statements
D.E. Knuth
,
R.W. Floyd
Information Processing Letters
1
, 1971, pp. 23-31
A
V^2
algorithm for determining isomorphism of planar graphs
John Hopcroft
,
Robert Tarjan
Information Processing Letters
1
, 1971, pp. 32-34
The performance of interactive information retrieval
G. Salton
Information Processing Letters
1
, 1971, pp. 35-41
A note on comparison of subrecursive hierarchies
D. Tsichritzis
Information Processing Letters
1
, 1971, pp. 42-44
An existence lemma for canonical forms in symbolic mathematics
B.F. Caviness
,
P.L. Pollack
,
C.M. Rubald
Information Processing Letters
1
, 1971, pp. 45-46
A note on scattered context grammars
David L. Milgram
,
Azriel Rosenfeld
Information Processing Letters
1
, 1971, pp. 47-50
An
n^2
algorithm for determining the bridges of a graph
D.G. Corneil
Information Processing Letters
1
, 1971, pp. 51-55
Efficient determination of the transitive closure of a directed graph
Ian Munro
Information Processing Letters
1
, 1971, pp. 56-58
The two-thirds rule for dynamic storage allocation under equilibrium
Erol Gelenbe
Information Processing Letters
1
, 1971, pp. 59-60
Representation and equality of modes
H. Scheidig
Information Processing Letters
1
, 1971, pp. 61-65
Evaluating polynomials at many points
A. Borodin
,
I. Munro
Information Processing Letters
1
, 1971, pp. 66-68
Input-output modeling and identification of linear automata
S.G. Tzafestas
Information Processing Letters
1
, 1971, pp. 69-75
On the use of complete subgraphs in cluster analysis
J.C. Ogilvie
,
C.L. Olson
Information Processing Letters
1
, 1971, pp. 76-79
Software data paging and segmentation for complex systems
Andries van Dam
,
Frank W. Tompa
Information Processing Letters
1
, 1971, pp. 80-86
The critical value of the basic parameter of a nonlinear differential equation
J.F. Whale
Information Processing Letters
1
, 1971, pp. 87-90
A classification of extensible programming languages
N. Solntseff
Information Processing Letters
1
, 1971, pp. 91-96
ECT - an extensible-contractable translator system
N. Solntseff
,
A. Yezerski
Information Processing Letters
1
, 1971, pp. 97-99
Programming by induction
David Gries
Information Processing Letters
1
, 1971, pp. 100-107
Seiten 1
2
3
>