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=97
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Minimum neighborhood in a generalized cube
Xiaofan Yang
,
Jianqiu Cao
,
Graham M. Megson
,
Jun Luo
Information Processing Letters
97
(3), 2006, pp. 88-93
Paths in Möbius cubes and crossed cubes
Jun-Ming Xu
,
Meijie Ma
,
Min Lü
Information Processing Letters
97
(3), 2006, pp. 94-97
Weighted coloring: Further complexity and approximability results
Bruno Escoffier
,
Jérôme Monnot
,
Vangelis Th. Paschos
Information Processing Letters
97
(3), 2006, pp. 98-103
A flaw in the electronic commerce protocol SET
S. Brlek
,
S. Hamadou
,
J. Mullins
Information Processing Letters
97
(3), 2006, pp. 104-108
A fixed-parameter tractability result for multicommodity demand flow in trees
Jiong Guo
,
Rolf Niedermeier
Information Processing Letters
97
(3), 2006, pp. 109-114
Cayley graphs as models of deterministic small-world networks
Wenjun Xiao
,
Behrooz Parhami
Information Processing Letters
97
(3), 2006, pp. 115-117
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
Jung Hee Cheon
,
Woo-Hwan Kim
,
Hyun Soo Nam
Information Processing Letters
97
(3), 2006, pp. 118-123
Linear structures of symmetric functions over finite fields
Yuan Li
,
T.W. Cusick
Information Processing Letters
97
(3), 2006, pp. 124-127
Variations of the maximum leaf spanning tree problem for bipartite graphs
(Ben) P.C. Li
,
M. Toulouse
Information Processing Letters
97
(4), 2006, pp. 129-132
Seiten 1
2
>