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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBLOCK
Marine Minier
,
María Naya-Plasencia
Information Processing Letters
112
(16), 2012, pp. 624-629
Vertex angle and crossing angle resolution of leveled tree drawings
Walter Didimo
,
Michael Kaufmann
,
Giuseppe Liotta
,
Yoshio Okamoto
,
Andreas Spillner
Information Processing Letters
112
(16), 2012, pp. 630-635
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
Ryo Yoshinaka
,
Jun Kawahara
,
Shuhei Denzumi
,
Hiroki Arimura
,
Shin-ichi Minato
Information Processing Letters
112
(16), 2012, pp. 636-640
Online scheduling with one rearrangement at the end: Revisited
Yuxin Wang
,
Attila Benko
,
Xin Chen
,
György Dósa
,
He Guo
,
Xin Han
,
Cecilia Sik Lanyi
Information Processing Letters
112
(16), 2012, pp. 641-645
New classes of quaternary cyclotomic sequence of length
2p^m
with high linear complexity
Pinhui Ke
,
Shengyuan Zhang
Information Processing Letters
112
(16), 2012, pp. 646-650
Bounding the maximum size of a minimal definitive set of quartets
Max Dietrich
,
Catherine McCartin
,
Charles Semple
Information Processing Letters
112
(16), 2012, pp. 651-655
Annotating problem diagrams with architectural tactics for reasoning on quality requirements
José M. Cañete-Valdeón
Information Processing Letters
112
(16), 2012, pp. 656-661
Lower bounds for randomized algorithms for online chain partitioning
Claire Mathieu
,
Olga Ohrimenko
Information Processing Letters
112
(17-18), 2012, pp. 663-666
Linear threshold multisecret sharing schemes
Oriol Farràs
,
Ignacio Gracia
,
Sebastià Martín
,
Carles Padró
Information Processing Letters
112
(17-18), 2012, pp. 667-673
On deriving conditional diagnosability of interconnection networks
E. Cheng
,
L. Lipták
,
K. Qiu
,
Z. Shen
Information Processing Letters
112
(17-18), 2012, pp. 674-677
A proof of a conjecture on multiset coloring the powers of cycles
Yun Feng
,
Wensong Lin
Information Processing Letters
112
(17-18), 2012, pp. 678-682
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
Hong Lai
,
Jinghua Xiao
,
Lixiang Li
,
Yixian Yang
Information Processing Letters
112
(17-18), 2012, pp. 683-687
The minimum spanning tree problem with non-terminal set
Tongquan Zhang
,
Ying Yin
Information Processing Letters
112
(17-18), 2012, pp. 688-690
Complexity of minimum corridor guarding problems
Ning Xu
Information Processing Letters
112
(17-18), 2012, pp. 691-696
On minimal arbitrarily partitionable graphs
Olivier Baudon
,
Jakub Przybyƚo
,
Mariusz Woźniak
Information Processing Letters
112
(17-18), 2012, pp. 697-700
\lambda^{\prime}
-optimality of bipartite digraphs
Xing Chen
,
Juan Liu
,
Jixiang Meng
Information Processing Letters
112
(17-18), 2012, pp. 701-705
A characterization of partial blocks in weighted graphs
Sunil Mathew
,
M.S. Sunitha
Information Processing Letters
112
(17-18), 2012, pp. 706-710
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Hideo Bannai
,
Travis Gagie
,
Tomohiro I
,
Shunsuke Inenaga
,
Gad M. Landau
,
Moshe Lewenstein
Information Processing Letters
112
(19), 2012, pp. 711-714
On behavioural pseudometrics and closure ordinals
Franck van Breugel
Information Processing Letters
112
(19), 2012, pp. 715-718
On-line algorithms for 2-space bounded 2-dimensional bin packing
Janusz Januszewski
Information Processing Letters
112
(19), 2012, pp. 719-722
On the inapproximability of maximum intersection problems
Min-Zheng Shieh
,
Shi-Chun Tsai
,
Ming-Chuan Yang
Information Processing Letters
112
(19), 2012, pp. 723-727
A two stage scheduling with transportation and batching
Hongli Zhu
Information Processing Letters
112
(19), 2012, pp. 728-731
An efficient algorithm for parameterizing HsMM with Gaussian and Gamma distributions
Y. Xie
,
S. Tang
,
C. Tang
,
X. Huang
Information Processing Letters
112
(19), 2012, pp. 732-737
A note on minimizing the sum of quadratic completion times on two identical parallel machines
F. Della Croce
,
C. Koulamas
Information Processing Letters
112
(19), 2012, pp. 738-742
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
Enrique Gerstl
,
Gur Mosheiov
Information Processing Letters
112
(19), 2012, pp. 743-747
Seiten
<
1
2
3
4
5
6
7
8
>