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=102
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Node-pancyclicity and edge-pancyclicity of hypercube variants
Ken S. Hu
,
Shyun-Shyun Yeoh
,
Chiuyuan Chen
,
Lih-Hsing Hsu
Information Processing Letters
102
(1), 2007, pp. 1-7
Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
M. Jiang
,
Y.P. Luo
,
S.Y. Yang
Information Processing Letters
102
(1), 2007, pp. 8-16
On approximation by
\bigoplus
-OBDDs
Henrik Brosenne
,
Carsten Damm
,
Matthias Homeister
,
Stephan Waack
Information Processing Letters
102
(1), 2007, pp. 17-21
Single machine scheduling with past-sequence-dependent setup times and learning effects
Wen-Hung Kuo
,
Dar-Li Yang
Information Processing Letters
102
(1), 2007, pp. 22-26
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity
Yung H. Tsin
Information Processing Letters
102
(1), 2007, pp. 27-34
Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
Cho-Chin Lin
,
Hao-Yun Yin
Information Processing Letters
102
(1), 2007, pp. 35-40
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
Min Ji
,
T.C.E. Cheng
Information Processing Letters
102
(2-3), 2007, pp. 41-47
A note on the characterization of TL[EF]
Zhilin Wu
Information Processing Letters
102
(2-3), 2007, pp. 48-54
Greedy online frequency allocation in cellular networks
Joseph Wun-Tat Chan
,
Francis Y.L. Chin
,
Deshi Ye
,
Yong Zhang
,
Hong Zhu
Information Processing Letters
102
(2-3), 2007, pp. 55-61
Feedback arc set in bipartite tournaments is
NP
-complete
Jiong Guo
,
Falk Hüffner
,
Hannes Moser
Information Processing Letters
102
(2-3), 2007, pp. 62-65
Sweeping simple polygons with the minimum number of chain guards
Xuehou Tan
Information Processing Letters
102
(2-3), 2007, pp. 66-71
A short proof of optimality for the MIN cache replacement algorithm
Benjamin Van Roy
Information Processing Letters
102
(2-3), 2007, pp. 72-73
On the context-freeness of the set of words containing overlaps
Narad Rampersad
Information Processing Letters
102
(2-3), 2007, pp. 74-78
Minimum cost subpartitions in graphs
Hiroshi Nagamochi
,
Yoko Kamidoi
Information Processing Letters
102
(2-3), 2007, pp. 79-84
The 4-choosability of toroidal graphs without intersecting triangles
Luo Xiaofang
Information Processing Letters
102
(2-3), 2007, pp. 85-91
On a new class of identifying codes in graphs
Iiro Honkala
,
Tero Laihonen
Information Processing Letters
102
(2-3), 2007, pp. 92-98
Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang
,
Chang-Biau Yang
,
Kuo-Tsung Tseng
,
Yung-Hsing Peng
,
Hsing-Yen Ann
Information Processing Letters
102
(2-3), 2007, pp. 99-103
Powering requires threshold depth 3
Alexander A. Sherstov
Information Processing Letters
102
(2-3), 2007, pp. 104-107
An improved degree based condition for Hamiltonian cycles
Lenin Mehedy
,
M. Kamrul Hasan
,
Mohammad Kaykobad
Information Processing Letters
102
(2-3), 2007, pp. 108-112
Dynamic Shannon coding
Travis Gagie
Information Processing Letters
102
(2-3), 2007, pp. 113-117
An empirical study on classification methods for alarms from a bug-finding static C analyzer
Kwangkeun Yi
,
Hosik Choi
,
Jaehwang Kim
,
Yongdai Kim
Information Processing Letters
102
(2-3), 2007, pp. 118-123
A note on the size of minimal covers
Vaston Costa
,
Edward Haeusler
,
Eduardo S. Laber
,
Loana Nogueira
Information Processing Letters
102
(2-3), 2007, pp. 124-126
Multi-designated verifiers signatures: Anonymity without encryption
Fabien Laguillaumie
,
Damien Vergnaud
Information Processing Letters
102
(2-3), 2007, pp. 127-132
A note on secret sharing schemes with three homogeneous access structure
Jaume Martí-Farré
Information Processing Letters
102
(4), 2007, pp. 133-137
How to safely close a discussion
Gildas Avoine
,
Serge Vaudenay
Information Processing Letters
102
(4), 2007, pp. 138-142
Seiten 1
2
>