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=110
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
Haihui Zhang
Information Processing Letters
110
(24), 2010, pp. A1-A1
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
A simple and communication-efficient Omega algorithm in the crash-recovery model
Cristian Martín
,
Mikel Larrea
Information Processing Letters
110
(3), 2010, pp. 83-87
Efficient incremental mining of contrast patterns in changing data
James Bailey
,
Elsa Loekito
Information Processing Letters
110
(3), 2010, pp. 88-92
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Yuichi Asahiro
,
Eiji Miyano
,
Shuichi Miyazaki
,
Takuro Yoshimuta
Information Processing Letters
110
(3), 2010, pp. 93-98
Partial model checking via abstract interpretation
N. De Francesco
,
G. Lettieri
,
L. Martini
,
G. Vaglini
Information Processing Letters
110
(3), 2010, pp. 99-103
A network flow based approach for network selection in dynamic spectrum access networks
S. Anand
,
R. Chandramouli
Information Processing Letters
110
(3), 2010, pp. 104-107
Detecting patterns in finite regular and context-free languages
Narad Rampersad
,
Jeffrey Shallit
Information Processing Letters
110
(3), 2010, pp. 108-112
Finding the maximum bounded intersection of
k
out of
n
halfplanes
Peter Brass
,
Hyeon-Suk Na
Information Processing Letters
110
(3), 2010, pp. 113-115
Compiling and securing cryptographic protocols
Yannick Chevalier
,
Michaël Rusinowitch
Information Processing Letters
110
(3), 2010, pp. 116-122
Seiten 1
2
3
4
5
6
7
8
9
>