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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A communication concept for distributed systems
W. Korczyński
,
J. Winkowski
Information Processing Letters
15
(3), 1982, October, pp. 111-114
A statistical model for estimating the number of records in a relational database
To-Yat Cheung
Information Processing Letters
15
(3), 1982, October, pp. 115-118
Sorting numbers in linear expected time and optimal extra space
T.F. Gonzalez
,
D.B. Johnson
Information Processing Letters
15
(3), 1982, October, pp. 119-124
Finding connected components of an intersection graph of squares in the Euclidean plane
H. Imai
Information Processing Letters
15
(3), 1982, October, pp. 125-128
An introduction to three algorithms for sorting in situ
E.W. Dijkstra
,
A.J.M. van Gasteren
Information Processing Letters
15
(3), 1982, October, pp. 129-134
A probabilistic algorithm for vertex connectivity of graphs
M. Becker
,
W. Degenhardt
,
J. Doenhardt
,
S. Hertel
,
G. Kaninke
,
W. Keber
,
K. Mehlhorn
,
S. Naher
,
H. Rohnert
,
T. Winter
Information Processing Letters
15
(3), 1982, October, pp. 135-136
Another compacting garbage collector
F.L. Morris
Information Processing Letters
15
(4), 1982, October, pp. 139-142
Two theorems about the completeness of Hoare's logic
J.A. Bergstra
,
J.V. Tucker
Information Processing Letters
15
(4), 1982, October, pp. 143-149
Grammatical unification
J. Maluszyński
,
J.F. Nilsson
Information Processing Letters
15
(4), 1982, October, pp. 150-158
Determinancy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
A.W. Mostowski
Information Processing Letters
15
(4), 1982, October, pp. 159-163
A note on alternating on-line Turing machines
K. Inoue
,
I. Takanami
,
H. Taniguchi
Information Processing Letters
15
(4), 1982, October, pp. 164-168
A counter example to a monotonicity property of k-d trees
M. Hoshi
,
T. Yuba
Information Processing Letters
15
(4), 1982, October, pp. 169-173
A solution method for the non-additive resource allocation problem in distributed system design
S. Ceri
,
G. Pelagatti
Information Processing Letters
15
(4), 1982, October, pp. 174-178
Recognition of perfect elimination bipartite graphs
L. Goh
,
D. Rotem
Information Processing Letters
15
(4), 1982, October, pp. 179-182
Fast composition of sparse maps
M. Sharir
Information Processing Letters
15
(4), 1982, October, pp. 183-185
A linear algorithm for the number of degree constrained subforests of a tree
P.J. Slater
Information Processing Letters
15
(4), 1982, October, pp. 186-188
On optimal multilevel indexed sequential files
T. Leipälä
Information Processing Letters
15
(5), 1982, December, pp. 191-195
The ears of a polygon (computational geometry)
P.T. Highnam
Information Processing Letters
15
(5), 1982, December, pp. 196-198
A finite 5-pebble-automaton can search every maze
A. Szepietowski
Information Processing Letters
15
(5), 1982, December, pp. 199-204
Sorting a linked list with equal keys
L.M. Wegner
Information Processing Letters
15
(5), 1982, December, pp. 205-208
A data structure for dynamic range queries
G.S. Lueker
,
D.E. Willard
Information Processing Letters
15
(5), 1982, December, pp. 209-213
A note on upper bounds for the selection problem
T. Motoki
Information Processing Letters
15
(5), 1982, December, pp. 214-219
Unifiability is complete for co-NLOGSPACE
H.R. Lewis
,
R. Statman
Information Processing Letters
15
(5), 1982, December, pp. 220-222
A new hierarchy of two-dimensional array languages
Patrick Shen-pei Wang
Information Processing Letters
15
(5), 1982, December, pp. 223-226
Extendible hashing with overflow
M. Tamminen
Information Processing Letters
15
(5), 1982, December, pp. 227-232
Seiten
<
1
2
3
>