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=114
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the inapproximability of minimizing cascading failures under the deterministic threshold model
Lei Nie
,
Jingjie Liu
,
Haicang Zhang
,
Zhiwei Xu
Information Processing Letters
114
(1-2), 2014, pp. 1-4
Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
Yong Yu
,
Yi Mu
,
Willy Susilo
,
Man Ho Au
Information Processing Letters
114
(1-2), 2014, pp. 5-8
A note on BDD problems with
\lambda_2
-gap
Mingjie Liu
,
Xiaoyun Wang
,
Guangwu Xu
,
Xuexin Zheng
Information Processing Letters
114
(1-2), 2014, pp. 9-12
Fishing for minimum evolution trees with Neighbor-Nets
Sarah Bastkowski
,
Andreas Spillner
,
Vincent Moulton
Information Processing Letters
114
(1-2), 2014, pp. 13-18
Monochromatic geometric
k
-factors for bicolored point sets with auxiliary points
D. Garijo
,
M.A. Garrido
,
C.I. Grima
,
A. Márquez
,
A. Moreno-González
,
J.R. Portillo
,
P. Reyes
,
R. Robles
,
J. Valenzuela
Information Processing Letters
114
(1-2), 2014, pp. 19-24
A Novel Hybrid Slot Allocation Mechanism for 802.11e EDCA Protocol
Xin-Wei Yao
,
Wan-Liang Wang
,
Teng-cao Wu
,
Xiao-min Yao
,
Shuang-Hua Yang
Information Processing Letters
114
(1-2), 2014, pp. 25-30
Motzkin subposets and Motzkin geodesics in Tamari lattices
J.-L. Baril
,
J.-M. Pallo
Information Processing Letters
114
(1-2), 2014, pp. 31-37
Fitness levels with tail bounds for the analysis of randomized search heuristics
Carsten Witt
Information Processing Letters
114
(1-2), 2014, pp. 38-41
Clique-width and edge contraction
Bruno Courcelle
Information Processing Letters
114
(1-2), 2014, pp. 42-44
The oriented chromatic number of Halin graphs
Janusz Dybizbański
,
Andrzej Szepietowski
Information Processing Letters
114
(1-2), 2014, pp. 45-49
A simple 3-edge connected component algorithm revisited
Nima Norouzi
,
Yung H. Tsin
Information Processing Letters
114
(1-2), 2014, pp. 50-55
Approximation algorithms for the ring loading problem with penalty cost
Weidong Li
,
Jianping Li
,
Li Guan
Information Processing Letters
114
(1-2), 2014, pp. 56-59
The firing squad synchronization problem with sub-generals
Kazuya Yamashita
,
Yasuaki Nishitani
,
Sadaki Hirose
,
Satoshi Okawa
,
Nobuyasu Osato
Information Processing Letters
114
(1-2), 2014, pp. 60-65
Efficient recognition of equimatchable graphs
Marc Demange
,
Tınaz Ekim
Information Processing Letters
114
(1-2), 2014, pp. 66-71
A note on subject reduction in
(\rightarrow,\exists)
-Curry with respect to complete developments
Aleksy Schubert
,
Ken-etsu Fujita
Information Processing Letters
114
(1-2), 2014, pp. 72-75
Order-
k\ \alpha
-hulls and
\alpha
-shapes
Dmitry Krasnoshchekov
,
Valentin Polishchuk
Information Processing Letters
114
(1-2), 2014, pp. 76-83
Corrigendum to ``A counterexample for the proof of implication conjecture on independent spanning trees''
Abishek Gopalan
,
Srinivasan Ramasubramanian
Information Processing Letters
114
(1-2), 2014, pp. 84-84
Excessively duplicating patterns represent non-regular languages
Carles Creus
,
Guillem Godoy
,
Lander Ramos
Information Processing Letters
114
(3), 2014, pp. 85-93
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
Wojciech Wawrzyniak
Information Processing Letters
114
(3), 2014, pp. 94-98
Maximum common induced subgraph parameterized by vertex cover
Faisal N. Abu-Khzam
Information Processing Letters
114
(3), 2014, pp. 99-103
On the complexity of the Monte Carlo method for incremental PageRank
Peter Lofgren
Information Processing Letters
114
(3), 2014, pp. 104-106
Security weaknesses of a signature scheme and authenticated key agreement protocols
Peter Nose
Information Processing Letters
114
(3), 2014, pp. 107-115
Differential attack on nine rounds of the SEED block cipher
Jiqiang Lu
,
Wun-She Yap
,
Matt Henricksen
,
Swee-Huay Heng
Information Processing Letters
114
(3), 2014, pp. 116-123
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
Beate Bollig
Information Processing Letters
114
(3), 2014, pp. 124-129
Optimum sweeps of simple polygons with two guards
Xuehou Tan
,
Bo Jiang
Information Processing Letters
114
(3), 2014, pp. 130-136
Seiten 1
2
3
4
5
6
>