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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of incremental convex hull algorithms in
R^d
M. Kallay
Information Processing Letters
19
(4), 1984, November, pp. 197
On the 'correct prefix property' in precedence parsers
P. Wyrostek
Information Processing Letters
19
(2), 1984, August, pp. 111
Extension of the Banker's algorithm for resource allocation in a distributed operating system
H. Madduri
,
R. Finkel
Information Processing Letters
19
(1), 1984, July, pp. 1-8
Some remarks on subclass containment problems for several classes of DPDA's
M. Oyamaguchi
Information Processing Letters
19
(1), 1984, July, pp. 9-12
A proof of the determinacy property of the data flow schema
Nam Sung Woo
,
C.H. Smith
,
A. Agrawala
Information Processing Letters
19
(1), 1984, July, pp. 13-16
On converting character strings to integers
J.R. Parker
Information Processing Letters
19
(1), 1984, July, pp. 17-19
On the use of extendible hashing without hashing
U. Bechtold
,
K. Kuspert
Information Processing Letters
19
(1), 1984, July, pp. 21-26
Minimizing completion time for a class of scheduling problems
U. Faigle
,
R. Schrader
Information Processing Letters
19
(1), 1984, July, pp. 27-29
On the power of real-time two-way multihead finite automata with jumps
W.J. Savitch
,
P.M.B. Vitanyi
Information Processing Letters
19
(1), 1984, July, pp. 31-35
Dominating sets for split and bipartite graphs
A.A. Bertossi
Information Processing Letters
19
(1), 1984, July, pp. 37-40
On embedding functions in logic
P.A. Subrahmanyam
,
J.-H. You
Information Processing Letters
19
(1), 1984, July, pp. 41-46
An optimal algorithm for parallel selection
S.G. Akl
Information Processing Letters
19
, 1984, July, pp. 47-50
A probabilistic lower bound for checking disjointness of sets
U. Manber
Information Processing Letters
19
(1), 1984, July, pp. 51-53
Strong
NP
-hardness of moving many discs
P. Spirakis
,
C.K. Yap
Information Processing Letters
19
(1), 1984, July, pp. 55-59
Partial match retrieval in implicit data structures
H. Alt
,
K. Mehlhorn
,
J.I. Munro
Information Processing Letters
19
(2), 1984, August, pp. 61-65
A presentation of the Fibonacci algorithm
A.J. Martin
,
M. Rem
Information Processing Letters
19
(2), 1984, August, pp. 67-68
Communication problems on MIMD parallel computers
G.P. McKeown
,
V.J. Rayward-Smith
Information Processing Letters
19
(2), 1984, August, pp. 69-73
Approximating block accesses in database organizations
P. Palvia
,
S.T. March
Information Processing Letters
19
(2), 1984, August, pp. 75-79
Integer linear programming for microprograms register allocation
E. Luque
,
A. Ripoll
Information Processing Letters
19
(2), 1984, August, pp. 81-85
A linear algorithm of a deadlock avoidance for nonpreemptible resources
E. Klupsz
Information Processing Letters
19
(2), 1984, August, pp. 87-94
Area-time tradeoff for rectangular matrix multiplication in VLSI models
G. Lotti
Information Processing Letters
19
(2), 1984, August, pp. 95-98
An
O(n\log n)
Manhattan path algorithm
W., Jr. Lipski
Information Processing Letters
19
(2), 1984, August, pp. 99-102
The complexity of data flow criteria for test data selection
E.J. Weyuker
Information Processing Letters
19
(2), 1984, August, pp. 103-109
Cryptanalysis of certain variants of Rabin's signature scheme
A. Shamir
,
C.P. Schnorr
Information Processing Letters
19
(3), 1984, October, pp. 113-115
Extensions to grid selector composition and compilation in APL
J.M. Treat
,
T.A. Budd
Information Processing Letters
19
(3), 1984, October, pp. 117-123
Seiten 1
2
>