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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear complexity of the
x^2
mod
p
orbits
F. Montoya Vitini
,
J. Muñoz Masqué
,
A. Peinado Domínguez
Information Processing Letters
72
(1-2), 1999, pp. 3-7
Regularity of normed PA processes
Antonín Kuc̑era
Information Processing Letters
72
(1-2), 1999, pp. 9-17
A note on self-modifying finite automata
Y. Wang
,
K. Inoue
,
A. Ito
,
T. Okazaki
Information Processing Letters
72
(1-2), 1999, pp. 19-24
Assessment of data redundancy in fuzzy relational databases based on semantic inclusion degree
Z.M. Ma
,
W.J. Zhang
,
W.Y. Ma
Information Processing Letters
72
(1-2), 1999, pp. 25-29
Estimating the range of a function in an online setting
John A. Mount
Information Processing Letters
72
(1-2), 1999, pp. 31-35
A new one pass algorithm for estimating stochastic context-free grammars
Dong-Yul Ra
,
George C. Stockman
Information Processing Letters
72
(1-2), 1999, pp. 37-45
Memory-efficient enumeration of constrained spanning trees
Jurg Nievergelt
,
Narsingh Deo
,
Ambros Marzetta
Information Processing Letters
72
(1-2), 1999, pp. 47-53
Christmas tree: A versatile 1-fault-tolerant design for token rings
Chun-Nan Hung
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Information Processing Letters
72
(1-2), 1999, pp. 55-63
Very fast and simple approximate string matching
Gonzalo Navarro
,
Ricardo Baeza-Yates
Information Processing Letters
72
(1-2), 1999, pp. 65-70
Generating all the acyclic orientations of an undirected graph
Valmir C. Barbosa
,
Jayme L. Szwarcfiter
Information Processing Letters
72
(1-2), 1999, pp. 71-74
A fast modular multiplication algorithm for calculating the product
AB
modulo
N
Chien-Yuan Chen
,
Chin-Chen Chang
Information Processing Letters
72
(3-4), 1999, pp. 77-81
On the computational structure of the connected components of a hard problem
Martin Matamala
,
Klaus Meer
Information Processing Letters
72
(3-4), 1999, pp. 83-90
Restricted failure detectors: Definition and reduction protocols
Michel Raynal
,
Frédéric Tronel
Information Processing Letters
72
(3-4), 1999, pp. 91-97
Honeycomb tori are Hamiltonian
G.M. Megson
,
Xiaofan Yang
,
Xiaoping Liu
Information Processing Letters
72
(3-4), 1999, pp. 99-103
An
O(|V|^2
algorithm for single connectedness
Samir Khuller
Information Processing Letters
72
(3-4), 1999, pp. 105-107
The correct diameter of trivalent Cayley graphs
Chang-Hsiung Tsai
,
Chun-Nan Hung
,
Lih-Hsing Hsu
,
Chung-Haw Chang
Information Processing Letters
72
(3-4), 1999, pp. 109-111
Amplification of slight probabilistic advantage at absolutely no cost in space
Ioan I. Macarie
,
Joel I. Seiferas
Information Processing Letters
72
(3-4), 1999, pp. 113-118
Random 2-SAT and unsatisfiability
Yann Verhoeven
Information Processing Letters
72
(3-4), 1999, pp. 119-123
Worst-case analysis of Weber's GCD algorithm
Christian Lavault
,
S. Mohamed Sedjelmaci
Information Processing Letters
72
(3-4), 1999, pp. 125-130
A note on cyclic-cubes
Shien-Ching Hwang
,
Gen-Huey Chen
Information Processing Letters
72
(3-4), 1999, pp. 131-135
An optimal layout of multigrid networks
Tiziana Calamoneri
,
Annalisa Massini
Information Processing Letters
72
(3-4), 1999, pp. 137-141
Computing two penetration measures for curved 2D objects
K. Sridharan
Information Processing Letters
72
(3-4), 1999, pp. 143-148
Optimal vertex ordering of graphs
Xiaoyi Jiang
,
Horst Bunke
Information Processing Letters
72
(5-6), 1999, pp. 149-154
A note on well quasi-orderings for powersets
Petr Janc̑ar
Information Processing Letters
72
(5-6), 1999, pp. 155-160
A 3-approximation algorithm for the
k
-level uncapacitated facility location problem
Karen Aardal
,
Fabián A. Chudak
,
David B. Shmoys
Information Processing Letters
72
(5-6), 1999, pp. 161-167
Seiten 1
2
3
4
5
6
7
>