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 YEAR=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Monotone separations for constant degree polynomials
Pavel Hrubes̑
,
Amir Yehudayoff
Information Processing Letters
110
(1), 2009, pp. 1-3
A counterexample to a conjecture concerning concatenation hierarchies
Jorge Almeida
,
Ondȓej Klíma
Information Processing Letters
110
(1), 2009, pp. 4-7
A note on width-parameterized SAT: An exact machine-model characterization
Periklis A. Papakonstantinou
Information Processing Letters
110
(1), 2009, pp. 8-12
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Jialin Zhang
,
Wei Chen
Information Processing Letters
110
(1), 2009, pp. 13-19
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Lei Chen
,
Changhong Lu
,
Zhenbing Zeng
Information Processing Letters
110
(1), 2009, pp. 20-23
A note on graph balancing problems with restrictions
Kangbok Lee
,
Joseph Y.-T. Leung
,
Michael L. Pinedo
Information Processing Letters
110
(1), 2009, pp. 24-29
Disjoint Hamilton cycles in the star graph
Roman C̑ada
,
Tomás̑ Kaiser
,
Moshe Rosenfeld
,
Zdenȇk Ryjác̑ek
Information Processing Letters
110
(1), 2009, pp. 30-35
A note on the descriptional complexity of semi-conditional grammars
Fumiya Okubo
Information Processing Letters
110
(1), 2009, pp. 36-40
A further result on fault-free cycles in faulty folded hypercubes
Sun-Yuan Hsieh
,
Che-Nan Kuo
,
Hsin-Hung Chou
Information Processing Letters
110
(2), 2009, pp. 41-43
A note on
t
-complementing permutations for graphs
Lech Adamus
,
Beata Orchel
,
Artur Szymański
,
A. Paweƚ Wojda
,
Maƚgorzata Zwonek
Information Processing Letters
110
(2), 2009, pp. 44-45
Enforcing non-hierarchical access policies by hierarchical key assignment schemes
Jyh-haw Yeh
Information Processing Letters
110
(2), 2009, pp. 46-49
Upper bounds on the queuenumber of
k
-ary
n
-cubes
Kung-Jui Pai
,
Jou-Ming Chang
,
Yue-Li Wang
Information Processing Letters
110
(2), 2009, pp. 50-56
On a new formal proof model for RFID location privacy
Ton van Deursen
,
Sas̑a Radomirović
Information Processing Letters
110
(2), 2009, pp. 57-61
An analytical study of central and in-network data processing for wireless sensor networks
Mohamed Medhat Gaber
,
Uwe Roehm
,
Karel Herink
Information Processing Letters
110
(2), 2009, pp. 62-70
Cycles embedding in exchanged hypercubes
Meijie Ma
,
Baodong Liu
Information Processing Letters
110
(2), 2009, pp. 71-76
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
Xie-Bin Chen
Information Processing Letters
110
(2), 2009, pp. 77-82
Optimal algorithms for the average-constrained maximum-sum segment problem
Chih-Huai Cheng
,
Hsiao-Fei Liu
,
Kun-Mao Chao
Information Processing Letters
109
(3), 2009, pp. 171-174
Approximating optimum branchings in linear time
Valentin Ziegler
Information Processing Letters
109
(3), 2009, pp. 175-178
The Mailman algorithm: A note on matrix-vector multiplication
Edo Liberty
,
Steven W. Zucker
Information Processing Letters
109
(3), 2009, pp. 179-182
A
\Theta(\log n)
-approximation for the set cover problem with set ownership
Mira Gonen
,
Yuval Shavitt
Information Processing Letters
109
(3), 2009, pp. 183-186
Deterministically testing sparse polynomial identities of unbounded degree
Markus Bläser
,
Moritz Hardt
,
Richard J. Lipton
,
Nisheeth K. Vishnoi
Information Processing Letters
109
(3), 2009, pp. 187-192
Minimal
k
-rankings and the rank number of
P^2_n
Sarah Novotny
,
Juan Ortiz
,
Darren A. Narayan
Information Processing Letters
109
(3), 2009, pp. 193-198
(2,1)-total labelling of trees with sparse vertices of maximum degree
Jing Huang
,
Haina Sun
,
Weifan Wang
,
Dong Chen
Information Processing Letters
109
(3), 2009, pp. 199-203
A note on on-line broadcast scheduling with deadlines
Xin Han
,
He Guo
,
Dawei Yin
,
Yong Zhang
Information Processing Letters
109
(3), 2009, pp. 204-207
On some open problems in reflective inductive inference
Sanjay Jain
Information Processing Letters
109
(3), 2009, pp. 208-211
Seiten 1
2
3
4
5
6
7
8
9
10
>