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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of the maximum satisfiability problem for Horn formulas
B. Jaumard
,
B. Simeone
Information Processing Letters
26
(1), 1987, September, pp. 1-4
Modeling B-tree insertion activity
J.R. Driscoll
,
Sheau-Dong Lang
,
L.A. Franklin
Information Processing Letters
26
(1), 1987, September, pp. 5-18
A notation for distributed operations
A.T. Berztiss
Information Processing Letters
26
(1), 1987, September, pp. 19-21
On the length of word chains
J. Berstel
,
S. Brlek
Information Processing Letters
26
(1), 1987, September, pp. 23-28
Rewriting systems and word problems in a free partially commutative monoid
R.V. Book
,
Hai-Ning Liu
Information Processing Letters
26
(1), 1987, September, pp. 29-32
The deap - a double-ended heap to implement double-ended priority queues
S. Carlsson
Information Processing Letters
26
(1), 1987, September, pp. 33-36
Practical variations of Shellsort
J. Incerpi
,
R. Sedgewick
Information Processing Letters
26
(1), 1987, September, pp. 37-43
Equivalence of multistage interconnection networks
J.C. Bermond
,
J.M. Fourneau
,
A. Jean-Marie
Information Processing Letters
26
(1), 1987, September, pp. 45-50
Random oracles separate PSPACE from the polynomial-time hierarchy
L. Babai
Information Processing Letters
26
(1), 1987, September, pp. 51-53
On lexicographic semi-commutations
Y. Métivier
,
E. Ochmanski
Information Processing Letters
26
(2), 1987, October, pp. 55-59
A tight lower bound on the size of visibility graphs
Xiaojun Shen
,
H. Edelsbrunner
Information Processing Letters
26
(2), 1987, October, pp. 61-64
On termination of the direct sum of term-rewriting systems
M. Rusinowitch
Information Processing Letters
26
(2), 1987, October, pp. 65-70
A halving technique for the longest stuttering subsequence problem
A. Mirzaian
Information Processing Letters
26
(2), 1987, October, pp. 71-75
Performance evaluation of concurrent systems using conflict-free and persistent Petri nets
J. Magott
Information Processing Letters
26
(2), 1987, October, pp. 77-80
Partitioned encryption and achieving simultaneity by partitioning
Z. Galil
,
M. Yung
Information Processing Letters
26
(2), 1987, October, pp. 81-88
Average efficiency of data structures for binary image processing
C. Mathieu
,
C. Puech
,
H. Yahia
Information Processing Letters
26
(2), 1987, October, pp. 89-93
A D0L-T0L public key cryptosystem
K.G. Subramanian
,
R. Siromoney
,
P.J. Abisha
Information Processing Letters
26
(2), 1987, October, pp. 95-97
Optimal three-dimensional layouts of complete binary trees
A.K. Gupta
,
S.E. Hambrusch
Information Processing Letters
26
(2), 1987, October, pp. 99-104
On the structural locality of reference in LISP list access streams
M.J. Thazhuthaveetil
,
A.R. Pleszkun
Information Processing Letters
26
(2), 1987, October, pp. 105-110
Arithmetical axiomatization of first-order temporal logic
A. Szalas
Information Processing Letters
26
(3), 1987, November, pp. 111-116
Tight chip area lower bounds for string matching
O. Sýkora
,
I. Vrt̑o
Information Processing Letters
26
(3), 1987, November, pp. 117-119
Towards the minimum set of primitive relations in temporal logic
M. Zhu
,
N.K. Loh
,
P. Siy
Information Processing Letters
26
(3), 1987, November, pp. 121-126
Trinity algebra and its application to machine decompositions
Y. Hou
Information Processing Letters
26
(3), 1987, November, pp. 127-134
Manipulation of data structures without pointers
A.S.M. Sajeev
,
J. Olszewski
Information Processing Letters
26
(3), 1987, November, pp. 135-143
Extended impossibility results for asynchronous complete networks
S. Moran
,
Y. Wolfstahl
Information Processing Letters
26
(3), 1987, November, pp. 145-151
Seiten 1
2
3
>