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=99
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
Seiten
<
1
2