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=76
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Feedback vertex set in hypercubes
Riccardo Focardi
,
Flaminia L. Luccio
,
David Peleg
Information Processing Letters
76
(1-2), 2000, pp. 1-5
Enumerating longest increasing subsequences and patience sorting
Sergei Bespamyatnikh
,
Michael Segal
Information Processing Letters
76
(1-2), 2000, pp. 7-11
Parallel approximation algorithms for maximum weighted matching in general graphs
Ryuhei Uehara
,
Zhi-Zhong Chen
Information Processing Letters
76
(1-2), 2000, pp. 13-17
Generalized interpolation in Casl
Tomasz Borzyszkowski
Information Processing Letters
76
(1-2), 2000, pp. 19-24
Protection in a single-address-space environment
Lanfranco Lopriore
Information Processing Letters
76
(1-2), 2000, pp. 25-32
Detecting masquerades in intrusion detection based on unpopular commands
Matthias Schonlau
,
Martin Theus
Information Processing Letters
76
(1-2), 2000, pp. 33-38
Enumeration of lattice points in
l_1
norm
Joan Serra-Sagristà
Information Processing Letters
76
(1-2), 2000, pp. 39-44
A network-flow-based lower bound for the minimum weighted integer coloring problem
Jue Xue
,
Ju Liu
Information Processing Letters
76
(1-2), 2000, pp. 45-50
Random dublicate storage strategies for load balancing in multimedia servers
Joep Aerts
,
Jan Korst
,
Sebastian Egner
Information Processing Letters
76
(1-2), 2000, pp. 51-59
A note on the non-
NP
-hardness of approximate lattice problems under general Cook reductions
Jin-Yi Cai
,
Ajay Nerurkar
Information Processing Letters
76
(1-2), 2000, pp. 61-66
On the linear complexity of the sequences generated by nonlinear filterings
L.J. García-Villalba
,
A. Fúster-Sabater
Information Processing Letters
76
(1-2), 2000, pp. 67-73
Equivalency reasoning to solve a class of hard SAT problems
Chu Min Li
Information Processing Letters
76
(1-2), 2000, pp. 75-81
Deterministic small-world communication networks
Francesc Comellas
,
Javier Ozón
,
Joseph G. Peters
Information Processing Letters
76
(1-2), 2000, pp. 83-90
Evolutionary graph colouring
Stefan Dobrev
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt'o
Information Processing Letters
76
(1-2), 2000, pp. 91-94
Linear complexity of the Naor-Reingold pseudo-random function
Igor E. Shparlinski
Information Processing Letters
76
(3), 2000, pp. 95-99
A fast addition algorithm for elliptic curve arithmetic in
GF(2^n)
using projective coordinates
Akira Higuchi
,
Naofumi Takagi
Information Processing Letters
76
(3), 2000, pp. 101-103
Linear systolic multiplier/squarer for fast exponentiation
Keon-Jik Lee
,
Kee-Young Yoo
Information Processing Letters
76
(3), 2000, pp. 105-111
On the number of spanning trees of a multi-complete/star related graph
Kuo-Liang Chung
,
Wen-Ming Yan
Information Processing Letters
76
(3), 2000, pp. 113-119
Complexity of estimating multi-way join result sizes for area skewed spatial data
Ho-Hyun Park
,
Chin-Wan Chung
Information Processing Letters
76
(3), 2000, pp. 121-129
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Leslie Lamport
,
Sharon Perl
,
William Weihl
Information Processing Letters
76
(3), 2000, pp. 131-134
Partitioned systolic architecture for modular multiplication in
GF(2^m)
Hyun-Sung Kim
,
Sung-Woo Lee
,
Kee-Young Yoo
Information Processing Letters
76
(3), 2000, pp. 135-139
Recognizing
i
-triangulated graphs in
O(mn)
time
F. Roussel
,
I. Rusu
Information Processing Letters
76
(3), 2000, pp. 141-147
A note on on-line scheduling with precedence constraints on identical machines
Leah Epstein
Information Processing Letters
76
(4-6), 2000, pp. 149-153
Limited bookmark randomized online algorithms for the paging problem
Wolfgang W. Bein
,
Rudolf Fleischer
,
Lawrence L. Larmore
Information Processing Letters
76
(4-6), 2000, pp. 155-162
On optimal bridges between two convex regions
Xuehou Tan
Information Processing Letters
76
(4-6), 2000, pp. 163-168
Seiten 1
2
>