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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Indexed extendible hashing
Soon M. Chung
Information Processing Letters
44
, 1992, pp. 1-6
Deciding whether graph
G
has page number one is in NC
Shigeru Masuyama
,
Shozo Naito
Information Processing Letters
44
, 1992, pp. 7-10
A
(\Delta/2)
-approximation algorithm for the maximum independent set problem
V.Th. Paschos
Information Processing Letters
44
, 1992, pp. 11-13
An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
Ming-Shing Yu
,
Cheng-Hsing Yang
Information Processing Letters
44
, 1992, pp. 15-22
Horn functions and their DNFs
Peter L. Hammer
,
Alexander Kogan
Information Processing Letters
44
, 1992, pp. 23-29
Efficient ID-based key distribution with tamperfree device
Tzonelih Hwang
Information Processing Letters
44
, 1992, pp. 31-34
On uniform learnability of language families
Shyam Kapur
,
Gianfranco Bilardi
Information Processing Letters
44
, 1992, pp. 35-38
Some optimal algorithms for decomposed partially ordered sets
Vijay K. Garg
Information Processing Letters
44
, 1992, pp. 39-43
A linear-time algorithm for isomorphism of a subclass of chordal graphs
N.Ch. Veeraraghavulu
,
P. Sreenivasa Kumar
,
C.E. Veni Madhavan
Information Processing Letters
44
, 1992, pp. 45-49
On a setup optimization problem for interval orders
Ahmad Sharary
,
Nejib Zaguia
Information Processing Letters
44
, 1992, pp. 51-55
The number of minimal words chains computing the Thue-Morse word
Mireille Bousquet-Mélou
Information Processing Letters
44
, 1992, pp. 57-64
Decidability of the star problem in
A^* \times b^*
Paul Gastin
,
Edward Ochmanski
,
Antoine Petit
,
Brigitte Rozoy
Information Processing Letters
44
, 1992, pp. 65-71
Finding all the palindromes in a binary tree in linear time and space
Bettina de Iaco
,
Fabrizio Luccio
Information Processing Letters
44
, 1992, pp. 73-77
Not all planar digraphs have small cycle separators
Ming-Yang Kao
,
Fang Wan
Information Processing Letters
44
, 1992, pp. 79-83
Perfect staircase profile of linear complexity for finite sequences
Masakatu Morii
,
Masao Kasahara
Information Processing Letters
44
, 1992, pp. 85-89
Non-associative parallel prefix computation
Rong-Jaye Chen
,
Yu-Song Hou
Information Processing Letters
44
, 1992, pp. 91-94
Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
Krishnendu Mukhopadhyaya
,
Bhabani P. Sinha
Information Processing Letters
44
, 1992, pp. 95-99
An efficient one-side height minimization algorithm for routing around a rectangle
Kim-Heng Teo
,
Tai-Ching Tuan
Information Processing Letters
44
, 1992, pp. 101-105
The worst case analysis of algorithm on multiple stacks manipulation
Been-Chian Chien
,
Wei-Pang Yang
Information Processing Letters
44
, 1992, pp. 107-111
The complexity of model checking for circumscriptive formulae
Marco Cadoli
Information Processing Letters
44
, 1992, pp. 113-118
On the regularity of languages on a binary alphabet generated by copying systems
Daniel P. Bovet
,
Stefano Varricchio
Information Processing Letters
44
, 1992, pp. 119-123
Remarks on the structural grammatical inference problem for context-free grammars
Erkki Mäkinen
Information Processing Letters
44
, 1992, pp. 125-127
Relating minimal models and pre-requisite-free normal defaults
Jorge Lobo
,
V.S. Subrahmanian
Information Processing Letters
44
, 1992, pp. 129-133
The completeness of gp-resolution for annotated logics
James J. Lu
,
Lawrence J. Henschen
Information Processing Letters
44
, 1992, pp. 135-140
Mapping a chain task to chained processors
Y. Han
,
B. Narahari
,
H.-A. Choi
Information Processing Letters
44
, 1992, pp. 141-148
Seiten 1
2
3
>