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 YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Hamiltonian circuit problem for circle graphs is
NP
-complete
Peter Damaschke
Information Processing Letters
32
, 1989, pp. 1-2
An optimal parallel circle-cover algorithm
Dilip Sarkar
,
Ivan Stojmenović
Information Processing Letters
32
, 1989, pp. 3-6
Path integral methods for computer performance analysis
Neil Gunther
Information Processing Letters
32
, 1989, pp. 7-13
On-line computation of convolutions
Jiȓi Matous̑ek
Information Processing Letters
32
, 1989, pp. 15-16
On verifying that a concurrent program satisfies a nondeterministic specification
A.P. Sistla
Information Processing Letters
32
, 1989, pp. 17-23
An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
Kazuo Iwano
Information Processing Letters
32
, 1989, pp. 25-27
Boyce-Codd normal form and object normal forms
Joachim Biskup
Information Processing Letters
32
, 1989, pp. 29-33
Hybridsort revisited and parallelized
Torben Hagerup
Information Processing Letters
32
, 1989, pp. 35-39
On Matijasevich's nontraditional approach to search problems
Andreas Blass
,
Yuri Gurevich
Information Processing Letters
32
, 1989, pp. 41-45
A fast algorithm for finding interlocking sets
Errol L. Lloyd
Information Processing Letters
32
, 1989, pp. 47-50
Hybrid join: An improved sort-based join algorithm
Hwang Kyu Choi
,
Myunghwan Kim
Information Processing Letters
32
, 1989, pp. 51-56
A parallel circle-cover minimization algorithm
Laurence Boxer
,
Russ Miller
Information Processing Letters
32
, 1989, pp. 57-60
An LC branch-and-bound algorithm for the module assignment problem
Maw-Sheng Chern
,
G.H. Chen
,
P. Liu
Information Processing Letters
32
, 1989, pp. 61-71
Coordinator: A modification to the monitor concept
Young Joo Kim
,
Gil Chang Kim
Information Processing Letters
32
, 1989, pp. 73-80
Implementation of a wait-free synchronization primitive that solves
n
-process consensus
Dror G. Feitelson
,
Larry Rudolph
Information Processing Letters
32
, 1989, pp. 81-83
Forward checking and intelligent backtracking
D.A. Wolfram
Information Processing Letters
32
, 1989, pp. 85-87
Using fewer processors to reduce time complexities of semigroup computations
Y.C. Chen
,
Z.C. Yeh
,
G.H. Chen
Information Processing Letters
32
, 1989, pp. 89-93
A new threshold scheme and its application in designing the conference key distribution cryptosystem
Chi Sung Laih
,
Jau Yien Lee
,
Lein Harn
Information Processing Letters
32
, 1989, pp. 95-99
Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem
Adam Janiak
Information Processing Letters
32
, 1989, pp. 101-112
Termination detection by using distributed snapshots
Shing-Tsaan Huang
Information Processing Letters
32
, 1989, pp. 113-119
Efficient monotone circuits for threshold functions
Martin Kochol
Information Processing Letters
32
, 1989, pp. 121-122
Reconstructing graphs from cut-set sizes
Steven S. Skiena
Information Processing Letters
32
, 1989, pp. 123-127
A synchronization algorithm for processes with dynamic priorities in computer networks with node failures
A. Goscinski
Information Processing Letters
32
, 1989, pp. 129-136
Interprocedural analysis vs. procedure integration
Stephen Richardson
,
Mahadevan Ganapathi
Information Processing Letters
32
, 1989, pp. 137-142
Computing Fibonacci numbers quickly
Paul Cull
,
James L. Holloway
Information Processing Letters
32
, 1989, pp. 143-149
Seiten 1
2
3
4
5
6
7
>