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
[3]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimizing interference in ad hoc networks with bounded communication radius
Matias Korman
Information Processing Letters
112
(19), 2012, pp. 748-752
An ID-based cryptographic mechanisms based on GDLP and IFP
Chandrashekhar Meshram
,
Suchitra A. Meshram
,
Mingwu Zhang
Information Processing Letters
112
(19), 2012, pp. 753-758
Pancyclic out-arcs of a vertex in oriented graphs
Qiaoping Guo
,
Shengjia Li
,
Ruijuan Li
,
Gaokui Xu
Information Processing Letters
112
(20), 2012, pp. 759-761
Batch scheduling of identical jobs on parallel identical machines
Baruch Mor
,
Gur Mosheiov
Information Processing Letters
112
(20), 2012, pp. 762-766
The linear arboricity of planar graphs with maximum degree at least 5
Hong-Yu Chen
,
Jian-Ming Qi
Information Processing Letters
112
(20), 2012, pp. 767-771
Clique problem, cutting plane proofs and communication complexity
Stasys Jukna
Information Processing Letters
112
(20), 2012, pp. 772-777
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
Justin Iwerks
,
Joseph S.B. Mitchell
Information Processing Letters
112
(20), 2012, pp. 778-782
HORSIC: An efficient one-time signature scheme for wireless sensor networks
Jaeheung Lee
,
Seokhyun Kim
,
Yookun Cho
,
Yoojin Chung
,
Yongsu Park
Information Processing Letters
112
(20), 2012, pp. 783-787
A multi-cycle checkpointing protocol that ensures strict 1-rollback
Yi-Wei Ci
,
Zhan Zhang
,
De-Cheng Zuo
,
Zhi-Bo Wu
,
Xiao-Zong Yang
Information Processing Letters
112
(20), 2012, pp. 788-793
Lossy trapdoor functions from homomorphic reproducible encryption
Seung Geol Choi
,
Hoeteck Wee
Information Processing Letters
112
(20), 2012, pp. 794-798
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Mehrnoush Malekesmaeili
,
Cedric Chauve
,
Tamon Stephen
Information Processing Letters
112
(20), 2012, pp. 799-803
Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function
Miodrag J. Mihaljević
,
Sugata Gangopadhyay
,
Goutam Paul
,
Hideki Imai
Information Processing Letters
112
(21), 2012, pp. 805-810
On multiple output bent functions
E. Pasalic
,
W.G. Zhang
Information Processing Letters
112
(21), 2012, pp. 811-815
Algorithmic aspects of
k
-tuple total domination in graphs
D. Pradhan
Information Processing Letters
112
(21), 2012, pp. 816-822
Topological ordering algorithm for LDAG
GuiPing Wang
,
ShuYu Chen
,
XiaoQin Zhang
,
Zhen Zhou
Information Processing Letters
112
(21), 2012, pp. 823-828
Partitioning extended
P_4
-laden graphs into cliques and stable sets
Raquel S.F. Bravo
,
Sulamita Klein
,
Loana T. Nogueira
,
Fábio Protti
,
Rudini M. Sampaio
Information Processing Letters
112
(21), 2012, pp. 829-834
Single-machine scheduling with past-sequence-dependent delivery times and release times
Ming Liu
,
Feifeng Zheng
,
Chengbin Chu
,
Yinfeng Xu
Information Processing Letters
112
(21), 2012, pp. 835-838
On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
Hsun Su
,
Yuan-Kang Shih
,
Shin-Shin Kao
Information Processing Letters
112
(21), 2012, pp. 839-843
Antimagic labeling graphs with a regular dominating subgraph
Radek Slíva
Information Processing Letters
112
(21), 2012, pp. 844-847
Membership(s) and compliance(s) with class-based graphs
Willy Picard
Information Processing Letters
112
(22), 2012, pp. 849-855
Verifiable secret sharing in a total of three rounds
Shashank Agrawal
Information Processing Letters
112
(22), 2012, pp. 856-859
Enhancing customer relationships by semantic consumer support systems
Jyhjong Lin
Information Processing Letters
112
(22), 2012, pp. 860-868
A note on the algebraic immunity of the Maiorana-McFarland class of bent functions
Qichun Wang
,
Chik How Tan
Information Processing Letters
112
(22), 2012, pp. 869-871
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Qunxiong Zheng
,
Wenfeng Qi
,
Tian Tian
Information Processing Letters
112
(22), 2012, pp. 872-875
A note on asynchronous multi-exponentiation algorithm using binary representation
Da-Zhi Sun
,
Jin-Peng Huai
,
Jian-Xin Li
Information Processing Letters
112
(22), 2012, pp. 876-879
Seiten
<
1
2
3
4
5
6
7
8
>