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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Real time scheduling with a budget: Parametric-search is better than binary search
Asaf Levin
Information Processing Letters
99
(5), 2006, pp. 187-191
Improved algorithm for finding next-to-shortest paths
Shisheng Li
,
Guangzhong Sun
,
Guoliang Chen
Information Processing Letters
99
(5), 2006, pp. 192-194
On the multi-radius cover problem
Julián Mestre
Information Processing Letters
99
(5), 2006, pp. 195-198
Minimum implicational basis for
\wedge
-semidistributive lattices
Philippe Janssen
,
Lhouari Nourine
Information Processing Letters
99
(5), 2006, pp. 199-202
A linear space algorithm for computing a longest common increasing subsequence
Yoshifumi Sakai
Information Processing Letters
99
(5), 2006, pp. 203-207
Boundedness undecidability for synchronized nets
Raymond Devillers
,
Laurent Van Begin
Information Processing Letters
99
(5), 2006, pp. 208-214
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in
P
André Große
,
Jörg Rothe
,
Gerd Wechsung
Information Processing Letters
99
(6), 2006, pp. 215-221
Folk theorems on the determinization and minimization of timed automata
Stavros Tripakis
Information Processing Letters
99
(6), 2006, pp. 222-226
Analysis of a heuristic for acyclic edge colouring
C.R. Subramanian
Information Processing Letters
99
(6), 2006, pp. 227-229
An approximation algorithm for maximum
P_3
-packing in subcubic graphs
Adrian Kosowski
,
Michaƚ Maƚafiejski
,
Paweƚ Żyliński
Information Processing Letters
99
(6), 2006, pp. 230-233
An improved algorithm for approximating the chromatic number of
G_{n,p}
Amin Coja-Oghlan
,
Lars Kuhtz
Information Processing Letters
99
(6), 2006, pp. 234-238
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
Felix Fischer
,
Markus Holzer
,
Stefan Katzenbeisser
Information Processing Letters
99
(6), 2006, pp. 239-245
Large alphabets and incompressibility
Travis Gagie
Information Processing Letters
99
(6), 2006, pp. 246-251
Improved generalized Atkin algorithm for computing square roots in finite fields
Fanyu Kong
,
Zhun Cai
,
Jia Yu
,
Daxing Li
Information Processing Letters
98
(1), 2006, pp. 1-5
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
Henrik Brosenne
,
Matthias Homeister
,
Stephan Waack
Information Processing Letters
98
(1), 2006, pp. 6-10
Using postdomination to reduce space requirements of data flow analysis
C. Bernardeschi
,
G. Lettieri
,
L. Martini
,
P. Masci
Information Processing Letters
98
(1), 2006, pp. 11-18
Fraction interpolation walking a Farey tree
Marc Mosko
,
J.J. Garcia-Luna-Aceves
Information Processing Letters
98
(1), 2006, pp. 19-23
Optimal 2-constraint satisfaction via sum-product algorithms
Mikko Koivisto
Information Processing Letters
98
(1), 2006, pp. 24-28
Approximating minimum coloring and maximum independent set in dotted interval graphs
Minghui Jiang
Information Processing Letters
98
(1), 2006, pp. 29-33
A simple algorithm for in-place merging
Jing-Chao Chen
Information Processing Letters
98
(1), 2006, pp. 34-40
Low-complex dynamic programming algorithm for hardware/software partitioning
Jigang Wu
,
Thambipillai Srikanthan
Information Processing Letters
98
(2), 2006, pp. 41-46
Test suite oscillations
Borislav Nikolik
Information Processing Letters
98
(2), 2006, pp. 47-55
Applying adaptive test cases to nondeterministic implementations
R.M. Hierons
Information Processing Letters
98
(2), 2006, pp. 56-60
On the complexity of extension checking in default logic
Paolo Liberatore
Information Processing Letters
98
(2), 2006, pp. 61-65
Construction of Aho Corasick automaton in linear time for integer alphabets
Shiri Dori
,
Gad M. Landau
Information Processing Letters
98
(2), 2006, pp. 66-72
Seiten
<
1
2
3
4
5
6
7
8
>