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.
A closer look at constraints as processes
N. Raja
,
R.K. Shyamasundar
Information Processing Letters
98
(5), 2006, pp. 206-210
Multiple serial episodes matching
Patrick Cégielski
,
Irene Guessarian
,
Yuri Matiyasevich
Information Processing Letters
98
(6), 2006, pp. 211-218
The reachability and related decision problems for monadic and semi-constructor TRSs
Ichiro Mitsuhashi
,
Michio Oyamaguchi
,
Toshiyuki Yamada
Information Processing Letters
98
(6), 2006, pp. 219-224
Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm
Enrique Alba
,
Bernabé Dorronsoro
Information Processing Letters
98
(6), 2006, pp. 225-230
The state complexity of
L^2
and
L^k
Narad Rampersad
Information Processing Letters
98
(6), 2006, pp. 231-234
A note on 2-facial coloring of plane graphs
Mickaël Montassier
,
André Raspaud
Information Processing Letters
98
(6), 2006, pp. 235-241
Periodic and Sturmian languages
Lucian Ilie
,
Solomon Marcus
,
Ion Petre
Information Processing Letters
98
(6), 2006, pp. 242-246
On the oriented chromatic number of Halin graphs
Mohammad Hosseini Dolama
,
Éric Sopena
Information Processing Letters
98
(6), 2006, pp. 247-252
A new tree inclusion algorithm
Yangjun Chen
,
Yibin Chen
Information Processing Letters
98
(6), 2006, pp. 253-262
A tight lower bound for job scheduling with cancellation
Feifeng Zheng
,
Francis Y.L. Chin
,
Stanley P.Y. Fung
,
Chung Keung Poon
,
Yinfeng Xu
Information Processing Letters
97
(1), 2006, pp. 1-3
On the complexity of market equilibria with maximum social welfare
Xiaotie Deng
,
Li-Sha Huang
Information Processing Letters
97
(1), 2006, pp. 4-11
Monotone circuits for monotone weighted threshold functions
Amos Beimel
,
Enav Weinreb
Information Processing Letters
97
(1), 2006, pp. 12-18
Transforming spanning trees and pseudo-triangulations
Oswin Aichholzer
,
Franz Aurenhammer
,
Clemens Huemer
,
Hannes Krasser
Information Processing Letters
97
(1), 2006, pp. 19-22
The greedy algorithm for edit distance with moves
Haim Kaplan
,
Nira Shafrir
Information Processing Letters
97
(1), 2006, pp. 23-27
An algorithm for exact satisfiability analysed with the number of clauses as parameter
Bolette Ammitzbll Madsen
Information Processing Letters
97
(1), 2006, pp. 28-30
On the hardness of approximating Max-Satisfy
Uriel Feige
,
Daniel Reichman
Information Processing Letters
97
(1), 2006, pp. 31-35
A decidable characterization of the classes between lintime and exptime
Salvatore Caporaso
Information Processing Letters
97
(1), 2006, pp. 36-40
Efficient polynomial time algorithms computing industrial-strength primitive roots
Jacques Dubrois
,
Jean-Guillaume Dumas
Information Processing Letters
97
(2), 2006, pp. 41-45
A constructive approach to sequential Nash equilibria
René Vestergaard
Information Processing Letters
97
(2), 2006, pp. 46-51
Strongly secure ramp secret sharing schemes for general access structures
Mitsugu Iwamoto
,
Hirosuke Yamamoto
Information Processing Letters
97
(2), 2006, pp. 52-57
A note on the attractor-property of infinite-state Markov chains
Christel Baier
,
Nathalie Bertrand
,
Philippe Schnoebelen
Information Processing Letters
97
(2), 2006, pp. 58-63
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
Wen-Hung Kuo
,
Dar-Li Yang
Information Processing Letters
97
(2), 2006, pp. 64-67
The reverse greedy algorithm for the metric
k-
median problem
Marek Chrobak
,
Claire Kenyon
,
Neal Young
Information Processing Letters
97
(2), 2006, pp. 68-72
Vertex covering by paths on trees with its applications in machine translation
Guohui Lin
,
Zhipeng Cai
,
Dekang Lin
Information Processing Letters
97
(2), 2006, pp. 73-81
Runtime feasibility check for non-preemptive real-time periodic tasks
Sangwon Kim
,
Joonwon Lee
,
Jinsoo Kim
Information Processing Letters
97
(3), 2006, pp. 83-87
Seiten
<
1
2
3
4
5
6
7
8
>