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=81
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deciding
k
-colorability in expected polynomial time
Michael Krivelevich
Information Processing Letters
81
(1), 2002, pp. 1-6
On maximum induced matchings in bipartite graphs
V.V. Lozin
Information Processing Letters
81
(1), 2002, pp. 7-11
Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
Kuo-Liang Chung
,
Wen-Ming Yan
Information Processing Letters
81
(1), 2002, pp. 13-21
Entropy lower bounds for quantum decision tree complexity
Yaoyun Shi
Information Processing Letters
81
(1), 2002, pp. 23-27
A characterization of Büchi tree automata
Jerzy Skurczyński
Information Processing Letters
81
(1), 2002, pp. 29-33
A combinatorial property of the factor poset of a word
Arturo Carpi
,
Aldo de Luca
Information Processing Letters
81
(1), 2002, pp. 35-39
Improvements of generalization of threshold signature and authenticated encryption for group communications
Chien-Lung Hsu
,
Tzong-Sun Wu
,
Tzong-Chen Wu
Information Processing Letters
81
(1), 2002, pp. 41-45
A new bound for map labeling with uniform circle pairs
Michael J. Spriggs
,
J. Mark Keil
Information Processing Letters
81
(1), 2002, pp. 47-53
A polynomial algorithm for the strong Helly property
Alain Bretto
,
Stéphane Ubéda
,
Janez Z̑erovnik
Information Processing Letters
81
(1), 2002, pp. 55-57
Width-restricted layering of acyclic digraphs with consideraton of dummy nodes
Jürgen Branke
,
Stefan Leppert
,
Martin Middendorf
,
Peter Eades
Information Processing Letters
81
(2), 2002, pp. 59-63
Transfer theorems via sign conditions
Pascal Koiran
Information Processing Letters
81
(2), 2002, pp. 65-69
A faster off-line algorithm for the TCP acknowledgement problem
John Noga
,
Steve Seiden
,
Gerhard J. Woeginger
Information Processing Letters
81
(2), 2002, pp. 71-73
Bounds for the element distinctness problem on one-tape Turing machines
Holger Petersen
Information Processing Letters
81
(2), 2002, pp. 75-79
Minimizing the total weighted completion time of deteriorating jobs
Aleksander Bachman
,
Adam Janiak
,
Mikhail Y. Kovalyov
Information Processing Letters
81
(2), 2002, pp. 81-84
A new method for constructing pair-wise covering designs for software testing
Noritaka Kobayashi
,
Tatsuhiro Tsuchiya
,
Tohru Kikuno
Information Processing Letters
81
(2), 2002, pp. 85-91
On computing a longest path in a tree - Eindhoven Tuesday Afternoon Club
R.W. Bulterman
,
F.W. van der Sommen
,
G. Zwaan
,
T. Verhoeff
,
A.J.M. van Gasteren
,
W.H.J. Feijen
Information Processing Letters
81
(2), 2002, pp. 93-96
Extracting indexing information from XML DTDs
Tae-Sun Chung
,
Hyoung-Joo Kim
Information Processing Letters
81
(2), 2002, pp. 97-103
Removing edge-node intersections in drawings of graphs
Wei Lai
,
Peter Eades
Information Processing Letters
81
(2), 2002, pp. 105-110
An efficient method for computing dynamic program slices
D. Goswami
,
R. Mall
Information Processing Letters
81
(2), 2002, pp. 111-117
A heuristic to accelerate in-situ permutation algorithms
Jörg Keller
Information Processing Letters
81
(3), 2002, pp. 119-125
A fast correlation attack on LILI-128
Fredrik Jönsson
,
Thomas Johansson
Information Processing Letters
81
(3), 2002, pp. 127-132
Kolmogorov random graphs only have trivial stable colorings
Qi Cheng
,
Fang Fang
Information Processing Letters
81
(3), 2002, pp. 133-136
Lower bounds for approximate polygon decomposition and minimum gap
Joachim Gudmundsson
,
Thore Husfeldt
,
Christos Levcopoulos
Information Processing Letters
81
(3), 2002, pp. 137-141
Approximation algorithms for general parallel task scheduling
Oh-Heum Kwon
,
Kyung-Yong Chwa
Information Processing Letters
81
(3), 2002, pp. 143-150
An approximation algorithm for a bottleneck
k
-Steiner tree problem in the Euclidean plane
Lusheng Wang
,
Zimao Li
Information Processing Letters
81
(3), 2002, pp. 151-156
Seiten 1
2
3
>