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.
Approximate maximum weight branchings
Amitabha Bagchi
,
Ankur Bhargava
,
Torsten Suel
Information Processing Letters
99
(2), 2006, pp. 54-58
On the structure of certain intersection graphs
Kathie Cameron
,
Chính T. Hoàng
Information Processing Letters
99
(2), 2006, pp. 59-63
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Chung-Ming Lin
,
Yin Te Tsai
,
Chuan Yi Tang
Information Processing Letters
99
(2), 2006, pp. 64-67
A note on the not 3-choosability of some families of planar graphs
Mickaël Montassier
Information Processing Letters
99
(2), 2006, pp. 68-71
Simulation of simultaneous safe recursion over an arbitrary structure
Olga Xirotiri
Information Processing Letters
99
(2), 2006, pp. 72-81
Optimal priority assignment in the presence of blocking
Konstantinos Bletsas
,
Neil Audsley
Information Processing Letters
99
(3), 2006, pp. 83-86
A note on unique games
Adi Avidor
,
Ricky Rosen
Information Processing Letters
99
(3), 2006, pp. 87-91
An improvement of the tree code construction
Marcin Peczarski
Information Processing Letters
99
(3), 2006, pp. 92-95
Fair service for mice in the presence of elephants
Seth Voorhies
,
Hyunyoung Lee
,
Andreas Klappenecker
Information Processing Letters
99
(3), 2006, pp. 96-101
A new algorithm for online uniform-machine scheduling to minimize the makespan
T.C.E. Cheng
,
C.T. Ng
,
Vladimir Kotov
Information Processing Letters
99
(3), 2006, pp. 102-105
Retrieving reusable components with variation points from software product lines
Shih-Chien Chou
,
Yuan-Chien Chen
Information Processing Letters
99
(3), 2006, pp. 106-110
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Sándor Vágvölgyi
Information Processing Letters
99
(3), 2006, pp. 111-118
Approximating weighted matchings in parallel
Stefan Hougardy
,
Doratha E. Vinkemeier
Information Processing Letters
99
(3), 2006, pp. 119-123
A new approximation algorithm for labeling points with circle pairs
Minghui Jiang
Information Processing Letters
99
(4), 2006, pp. 125-129
Finding and counting cliques and independent sets in
r
-uniform hypergraphs
Raphael Yuster
Information Processing Letters
99
(4), 2006, pp. 130-134
Analysis of improved signcryption scheme with key privacy
Chik How Tan
Information Processing Letters
99
(4), 2006, pp. 135-138
Acyclic domination on bipartite permutation graphs
Guangjun Xu
,
Liying Kang
,
Erfang Shan
Information Processing Letters
99
(4), 2006, pp. 139-144
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
Boaz Tsaban
Information Processing Letters
99
(4), 2006, pp. 145-148
The communication complexity of the Hamming distance problem
Wei Huang
,
Yaoyun Shi
,
Shengyu Zhang
,
Yufan Zhu
Information Processing Letters
99
(4), 2006, pp. 149-153
Improved constructions of secret sharing schemes by applying
(\lambda,\omega)
-decompositions
Marten van Dijk
,
Tom Kevenaar
,
Geert-Jan Schrijen
,
Pim Tuyls
Information Processing Letters
99
(4), 2006, pp. 154-157
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Olivier Danvy
,
Henning Korsholm Rohde
Information Processing Letters
99
(4), 2006, pp. 158-162
Strong normalization proofs by CPS-translations
Satoshi Ikeda
,
Koji Nakazawa
Information Processing Letters
99
(4), 2006, pp. 163-170
TETRAVEX is
NP
-complete
Yasuhiko Takenaga
,
Toby Walsh
Information Processing Letters
99
(5), 2006, pp. 171-174
Binary codes for locally homogeneous sequences
Alistair Moffat
,
Vo Ngoc Anh
Information Processing Letters
99
(5), 2006, pp. 175-180
On Quickselect, partial sorting and Multiple Quickselect
Markus Kuba
Information Processing Letters
99
(5), 2006, pp. 181-186
Seiten
<
1
2
3
4
5
6
7
8
>