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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the decomposition of sequences into ascending subsequences
Anne Kaldewaij
Information Processing Letters
21
, 1985, pp. 69
Bidirectional coroutines
H. Samet
Information Processing Letters
21
(1), 1985, July, pp. 1-6
Alternating multicounter machines with constant number of reversals
J. Hromkovic̑
Information Processing Letters
21
(1), 1985, July, pp. 7-9
Join during merge: an improved sort based algorithm
M. Negri
,
G. Pelagatti
Information Processing Letters
21
(1), 1985, July, pp. 11-16
An algorithm for uniform random sampling of points in and on a hypersphere
G. Guralnik
,
C. Zemach
,
T. Warnock
Information Processing Letters
21
(1), 1985, July, pp. 17-21
Self-adjusting hash tables
L. Pagli
Information Processing Letters
21
(1), 1985, July, pp. 23-25
Worst-case choice for the stable marriage problem
D. Kapur
,
M.S. Krishnamoorthy
Information Processing Letters
21
(1), 1985, July, pp. 27-30
A note on removing loops from table-driven code generators
S.M. Oh
,
J.C.H. Park
Information Processing Letters
21
(1), 1985, July, pp. 31-34
A secure and useful ``keyless cryptosystem''
M.M. Yung
Information Processing Letters
21
(1), 1985, July, pp. 35-38
Finding extreme points in three dimensions and solving the post-office problem in the plane
H. Edelsbrunner
,
H.A. Maurer
Information Processing Letters
21
(1), 1985, July, pp. 39-47
Optimal search with positive switch cost is
NP
-hard
I. Wegener
Information Processing Letters
21
(1), 1985, July, pp. 49-52
On fast computation of distance between line segments
V.J. Lumelsky
Information Processing Letters
21
(2), 1985, August, pp. 55-61
Exposure to deadlock for communicating processes is hard to detect
T. Räuchle
,
S. Toueg
Information Processing Letters
21
(2), 1985, August, pp. 63-68
Linear lower bounds on unbounded fan-in Boolean circuits
J. Hromkovic̑
Information Processing Letters
21
(2), 1985, August, pp. 71-74
A note on finding minimum cuts in directed planar networks by parallel computations
L. Janiga
,
V. Koubek
Information Processing Letters
21
(2), 1985, August, pp. 75-78
Fast parallel polynominal division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
D. Bini
,
V.Ya. Pan
Information Processing Letters
21
(2), 1985, August, pp. 79-81
Feedback automata and their languages
D. Wätjen
Information Processing Letters
21
(2), 1985, August, pp. 83-86
Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit
P.M.B. Vitányi
Information Processing Letters
21
(2), 1985, August, pp. 87-91
The incompleteness of Misra and Chandy's proof systems
V. Nguyen
Information Processing Letters
21
(2), 1985, August, pp. 93-96
Fair mutual exclusion with unfair P and V operations
A.J. Martin
,
J.R. Burch
Information Processing Letters
21
(2), 1985, August, pp. 97-100
Lower time bounds for integer programming with two variables
C. Lautemann
,
F. Meyer auf der Heide
Information Processing Letters
21
(2), 1985, August, pp. 101-105
VLSI design with multiple active layers
C.D. Thompson
Information Processing Letters
21
(3), 1985, September, pp. 109-111
General algorithms for the address calculation of lexicographically ordered tuples
S.C. Kothari
,
K.V.S. Ramarao
Information Processing Letters
21
(3), 1985, September, pp. 113-116
The power of geometric duality revisited
D.T. Lee
,
Y.T. Ching
Information Processing Letters
21
(3), 1985, September, pp. 117-122
Improved lower bounds for some matrix multiplication problems
J. JáJá
,
J. Takche
Information Processing Letters
21
(3), 1985, September, pp. 123-127
Seiten 1
2
>