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=106
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reduction of stochastic parity to stochastic mean-payoff games
Krishnendu Chatterjee
,
Thomas A. Henzinger
Information Processing Letters
106
(1), 2008, pp. 1-7
Reducing inference control to access control for normalized database schemas
Joachim Biskup
,
David W. Embley
,
Jan-Hendrik Lochner
Information Processing Letters
106
(1), 2008, pp. 8-12
New efficient algorithms for the LCS and constrained LCS problems
Costas S. Iliopoulos
,
M. Sohel Rahman
Information Processing Letters
106
(1), 2008, pp. 13-18
Strong diagnosability of regular networks under the comparison model
Jyh-Jian Sheu
,
Wen-Tzeng Huang
,
Chin-Hsing Chen
Information Processing Letters
106
(1), 2008, pp. 19-25
Proxy-based hybrid cache management in Mobile IP systems
Weiping He
,
Ing-Ray Chen
Information Processing Letters
106
(1), 2008, pp. 26-32
On the fixed-parameter tractability of parameterized model-checking problems
Iain A. Stewart
Information Processing Letters
106
(1), 2008, pp. 33-36
Chain-splay trees, or, how to achieve and prove loglog
N
-competitiveness by splaying
George F. Georgakopoulos
Information Processing Letters
106
(1), 2008, pp. 37-43
Slicing for modern program structures: A theory for eliminating irrelevant loops
Torben Amtoft
Information Processing Letters
106
(2), 2008, pp. 45-51
A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
Banghe Li
,
Yuefeng Shen
,
Bo Li
Information Processing Letters
106
(2), 2008, pp. 52-58
The super connectivity of augmented cubes
Meijie Ma
,
Guizhen Liu
,
Jun-Ming Xu
Information Processing Letters
106
(2), 2008, pp. 59-63
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
Lun-Min Shih
,
Chieh-Feng Chiang
,
Lih-Hsing Hsu
,
Jimmy J.M. Tan
Information Processing Letters
106
(2), 2008, pp. 64-69
How much can lookahead help in online single machine scheduling
Feifeng Zheng
,
Yinfeng Xu
,
E. Zhang
Information Processing Letters
106
(2), 2008, pp. 70-74
Computing Longest Previous Factor in linear time and applications
Maxime Crochemore
,
Lucian Ilie
Information Processing Letters
106
(2), 2008, pp. 75-80
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Jiong Guo
,
Rolf Niedermeier
,
Johannes Uhlmann
Information Processing Letters
106
(2), 2008, pp. 81-86
A note on the
k
-Canadian Traveller Problem
Stephan Westphal
Information Processing Letters
106
(3), 2008, pp. 87-89
A more efficient algorithm for perfect sorting by reversals
Sèverine Bérard
,
Cedric Chauve
,
Christophe Paul
Information Processing Letters
106
(3), 2008, pp. 90-95
More restrictive Gray codes for necklaces and Lyndon words
Vincent Vajnovszki
Information Processing Letters
106
(3), 2008, pp. 96-99
On the equivalence between small-step and big-step abstract machines: A simple application of lightweight fusion
Olivier Danvy
,
Kevin Millikin
Information Processing Letters
106
(3), 2008, pp. 100-109
Streaming algorithm for graph spanners - Single pass and constant processing time per edge
Surender Baswana
Information Processing Letters
106
(3), 2008, pp. 110-114
More decidable instances of Post's correspondence problem: Beyond counting
Mirko Rahn
Information Processing Letters
106
(3), 2008, pp. 115-119
On the complexity of partial order trace model checking
Thierry Massart
,
Cédric Meuter
,
Laurent Van Begin
Information Processing Letters
106
(3), 2008, pp. 120-126
Linear election in pancake graphs
Adnan Mohamed
,
R.S. Ramakrishna
Information Processing Letters
106
(3), 2008, pp. 127-131
A note on mixed tree coloring
Hanna Furmańczyk
,
Adrian Kosowski
,
Paweƚ Żyliński
Information Processing Letters
106
(4), 2008, pp. 133-135
Weighted broadcast in linear radio networks
Gautam K. Das
,
Subhas C. Nandy
Information Processing Letters
106
(4), 2008, pp. 136-143
The distant-2 chromatic number of random proximity and random geometric graphs
Josep Díaz
,
Zvi Lotker
,
Maria Serna
Information Processing Letters
106
(4), 2008, pp. 144-148
Seiten 1
2
>