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=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On inferring linear single-tree languages
Erkki Mäkinen
Information Processing Letters
73
(1-2), 2000, pp. 1-3
On the Day-Tripathi orientation of the star graphs: Connectivity
Eddie Cheng
,
Marc J. Lipman
Information Processing Letters
73
(1-2), 2000, pp. 5-10
PACS, simple-BAC and query learning
Castro-Jorge
,
David Guijarro
Information Processing Letters
73
(1-2), 2000, pp. 11-16
Performance guarantees for the TSP with a parameterized triangle inequality
Michael A. Bender
,
Chandra Chekuri
Information Processing Letters
73
(1-2), 2000, pp. 17-21
An ergodic theorem for read-once non-uniform deterministic finite automata
Mikael Goldmann
,
Alexander Russell
,
Denis Thérien
Information Processing Letters
73
(1-2), 2000, pp. 23-28
Low discrepancy sets yield approximate min-wise independent permutation families
Michael Saks
,
Aravind Srinivasan
,
Shiyu Zhou
,
David Zuckerman
Information Processing Letters
73
(1-2), 2000, pp. 29-32
Placing two disks in a convex polygon
Sung Kwon Kim
,
Chan-Su Shin
,
Tae-Cheon Yang
Information Processing Letters
73
(1-2), 2000, pp. 33-39
Error-detecting codes and fault-containing self-stabilization
Ted Herman
,
Sriram Pemmaraju
Information Processing Letters
73
(1-2), 2000, pp. 41-46
On the geometry of similarity search: Dimensionality curse and concentration of measure
Vladimir Pestov
Information Processing Letters
73
(1-2), 2000, pp. 47-51
A uniform framework for term and graph rewriting applied to combined systems
Enno Ohlebusch
Information Processing Letters
73
(1-2), 2000, pp. 53-59
On-line scheduling with setup costs
Giorgio Gambosi
,
Gaia Nicosia
Information Processing Letters
73
(1-2), 2000, pp. 61-68
Finding
OR
in a noisy broadcast network
Uriel Feige
,
Joe Kilian
Information Processing Letters
73
(1-2), 2000, pp. 69-75
Patchworks and metablocks enumeration
Vlady Ravelomanana
,
Loÿs Thimonier
Information Processing Letters
73
(3-4), 2000, pp. 77-86
An efficient upper bound of the rotation distance of binary trees
Jean Pallo
Information Processing Letters
73
(3-4), 2000, pp. 87-92
On the security of a convertible group signature scheme
Shahrokh Saeednia
Information Processing Letters
73
(3-4), 2000, pp. 93-96
Cryptanalysis of YCN assignment scheme in a hierarchy
Min-Shiang Hwang
Information Processing Letters
73
(3-4), 2000, pp. 97-101
Task migration in 2D wormhole-routed mesh multicomputers
Tzung-Shi Chen
Information Processing Letters
73
(3-4), 2000, pp. 103-110
A PTAS for the multiple subset sum problem with different knapsack capacities
Alberto Caprara
,
Hans Kellerer
,
Ulrich Pferschy
Information Processing Letters
73
(3-4), 2000, pp. 111-118
An improved heuristic for the ``Ulam-Rényi game''
Ferdinando Cicalese
,
Ugo Vaccaro
Information Processing Letters
73
(3-4), 2000, pp. 119-124
A general method to speed up fixed-parameter-tractable algorithms
Rolf Niedermeier
,
Peter Rossmanith
Information Processing Letters
73
(3-4), 2000, pp. 125-129
Hierarchical broadcast and gossip networks
Guillaume Fertin
Information Processing Letters
73
(3-4), 2000, pp. 131-136
Estimating the number of vertices of a polyhedron
David Avis
,
Luc Devroye
Information Processing Letters
73
(3-4), 2000, pp. 137-143
Fault-containing self-stabilization using priority scheduling
Skukumar Ghosh
,
Xin He
Information Processing Letters
73
(3-4), 2000, pp. 145-151
Pancyclicity in switching classes
Andrzej Ehrenfeucht
,
Jurriaan Hage
,
Tero Harju
,
Grzegorz Rozenberg
Information Processing Letters
73
(5-6), 2000, pp. 153-156
Liu and Layland's schedulability test revisited
Raymond Devillers
,
Joël Gossens
Information Processing Letters
73
(5-6), 2000, pp. 157-161
Seiten 1
2
>