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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A semantic approach for modular synthesis of VLSI systems
M. Balakrishnan
,
S. Sutarwala
,
A.K. Majumdar
,
D.K. Banerji
,
J.G. Linders
,
J.C. Majithia
Information Processing Letters
27
(1), 1988, February, pp. 1-7
A separator theorem for one-dimensional graphs under linear mapping
M. Li
Information Processing Letters
27
(1), 1988, February, pp. 9-11
Sorting with efficient use of special-purpose sorters
M.J. Atallah
,
G.N. Frederickson
,
S. Rao Kosaraju
Information Processing Letters
27
(1), 1988, February, pp. 13-15
Total domination in interval graphs revisited
G. Ramalingam
,
C. Pandu Rangan
Information Processing Letters
27
(1), 1988, February, pp. 17-21
A tagless marking that is linear over subtrees
G. Lyon
Information Processing Letters
27
(1), 1988, February, pp. 23-28
The data refinement calculator for Z specifications
M.B. Josephs
Information Processing Letters
27
(1), 1988, February, pp. 29-33
Digital and Hilbert k-d trees
D. Lea
Information Processing Letters
27
(1), 1988, February, pp. 35-41
Parallel
O(\log n)
time edge-colouring of trees and Halin graphs
A.M. Gibbons
,
A. Israeli
,
W. Rytter
Information Processing Letters
27
(1), 1988, February, pp. 43-51
A parallel bucket sort
B.S. Chlebus
Information Processing Letters
27
(2), 1988, February, pp. 57-61
A practical method for finding the optimum postponement transformation for LR(
k
) parsers
J. Witaszek
Information Processing Letters
27
(2), 1988, February, pp. 63-67
A polynomial algorithm for computation of the probability of conflicts in a database under arbitrary data access distribution
M. Singhal
,
Y. Yesha
Information Processing Letters
27
(2), 1988, February, pp. 69-74
A parallelizable lexicographically first maximal edge-induced subgraph problem
S. Miyano
Information Processing Letters
27
(2), 1988, February, pp. 75-78
An ordered minimal perfect hashing scheme with single parameter
C.C. Chang
,
C.H. Chang
Information Processing Letters
27
(2), 1988, February, pp. 79-83
On decomposing polygons into uniformly monotone parts
R. Liu
,
S. Ntafos
Information Processing Letters
27
(2), 1988, February, pp. 85-89
A note on unification type zero
F. Baader
Information Processing Letters
27
(2), 1988, February, pp. 91-93
Cryptographic implementation of a tree hierarchy for access control
R.S. Sandhu
Information Processing Letters
27
(2), 1988, February, pp. 95-98
Finding the vertices nearest to a point in a hypercube
N.J. Patterson
,
K.J. Supowitt
Information Processing Letters
27
(2), 1988, February, pp. 99-102
On the random construction of heaps
A.M. Frieze
Information Processing Letters
27
(2), 1988, February, pp. 103-109
Propositional description of finite cause-effect structures
L. Holenderski
,
A. Szalas
Information Processing Letters
27
(3), 1988, March, pp. 111-117
On generating all maximal independent sets
D.S. Johnson
,
M. Yannakakis
,
C.H. Papadimitriou
Information Processing Letters
27
(3), 1988, March, pp. 119-123
A faster approximation algorithm for the Steiner problem in graphs
K. Mehlhorn
Information Processing Letters
27
(3), 1988, March, pp. 125-128
Order statistics on a hypercube
S. Chandran
,
A. Rosenfeld
Information Processing Letters
27
(3), 1988, March, pp. 129-132
Parallel circle-cover algorithms
A.A. Bertossi
Information Processing Letters
27
(3), 1988, March, pp. 133-139
A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
S.A. Cook
,
M. Luby
Information Processing Letters
27
(3), 1988, March, pp. 141-145
Positive Boolean dependencies
J. Berman
,
W.J. Blok
Information Processing Letters
27
(3), 1988, March, pp. 147-150
Seiten 1
2
3
>