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=69
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding a minimal 1-DNF constistent with a positive sample is
LOGSNP
-complete
François Denis
Information Processing Letters
69
(1), 1999, pp. 1-5
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
Prosenjit Gupta
,
Ravi Janardan
,
Michiel Smid
Information Processing Letters
69
(1), 1999, pp. 7-13
Consecutive retrieval property - revisited
Jitender S. Deogun
,
K. Gopalakrishnan
Information Processing Letters
69
(1), 1999, pp. 15-20
Global avalanche characteristics and propagation criterion of balanced Boolean functions
Soo Hak Sung
,
Seongtaek Chee
,
Choonsik Park
Information Processing Letters
69
(1), 1999, pp. 21-24
Labeling a rectilinear map more efficiently
Tycho Strijk
,
Marc van Kreveld
Information Processing Letters
69
(1), 1999, pp. 25-30
Evaluations of domino-free communication-induced checkpointing protocols
Jichiang Tsai
,
Yi-Min Wang
,
Sy-Yen Kuo
Information Processing Letters
69
(1), 1999, pp. 31-37
Tight analysis of a self-approaching strategy for the online kernel-search problem
Jae-Ha Lee
,
Kyung-Yong Chwa
Information Processing Letters
69
(1), 1999, pp. 39-45
A note on the Horton-Strahler number for random binary search trees
Paul Kruszewski
Information Processing Letters
69
(1), 1999, pp. 47-51
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Guo-Hui Lin
,
Guoliang Xue
Information Processing Letters
69
(2), 1999, pp. 53-57
On a hierarchy of languages generated by cooperating distributed grammar systems
H. Bordihn
,
M. Holzer
Information Processing Letters
69
(2), 1999, pp. 59-62
An efficient algorithm for the length-constrained heaviest path problem on a tree
Bang Ye Wu
,
Kun-Mao Chao
,
Chuan Yi Tang
Information Processing Letters
69
(2), 1999, pp. 63-67
A model for
k
-nearest neighbor query processing cost in multidimensional data space
Ju-Hong Lee
,
Guang-Ho Cha
,
Chin-Wan Chung
Information Processing Letters
69
(2), 1999, pp. 69-76
On the power of built-in relations in certain classes of program schemes
S.R. Chauhan
,
I.A. Stewart
Information Processing Letters
69
(2), 1999, pp. 77-82
Relative to a random oracle,
P
/poly is not measurable in
EXP
Marius Zimand
Information Processing Letters
69
(2), 1999, pp. 83-86
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
Chin-Wen Ho
,
Jou-Ming Chang
Information Processing Letters
69
(2), 1999, pp. 87-93
Comments on two group signatures
Chih-Hung Wang
,
Tzonelih Hwang
,
Narn-Yih Lee
Information Processing Letters
69
(2), 1999, pp. 95-97
On the covering of vertices for fault diagnosis in hypercubes
Mark G. Karpovsky
,
Krishnendu Chakrabarty
,
Lev B. Levitin
,
Dimiter R. Avresky
Information Processing Letters
69
(2), 1999, pp. 99-103
Progress properties for empty Unity programs
P. Crégut
,
B. Heyd
Information Processing Letters
69
(3), 1999, pp. 107-109
On the complexity of quality of service routing
Zheng Wang
Information Processing Letters
69
(3), 1999, pp. 111-114
A separation of two randomness concepts
Yongge Wang
Information Processing Letters
69
(3), 1999, pp. 115-118
A memory-efficient and fast Huffman decoding algorithm
Hong-Chung Chen
,
Yue-Li Wang
,
Yu-Feng Lan
Information Processing Letters
69
(3), 1999, pp. 119-122
A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
Dominique Roelants van Baronaigien
Information Processing Letters
69
(3), 1999, pp. 123-126
Computing the optimal bridge between two convex polygons
Leizhen Cai
,
Yinfeng Xu
,
Binhai Zhu
Information Processing Letters
69
(3), 1999, pp. 127-130
An application of ramp schemes to broadcast encryption
D.R. Stinson
,
R. Wei
Information Processing Letters
69
(3), 1999, pp. 131-135
Undecidability of partial order logics
Rajeev Alur
,
Doron Peled
Information Processing Letters
69
(3), 1999, pp. 137-143
Seiten 1
2
3
>