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=80
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The RS-tree: An efficient data structure for distance browsing queries
Dong-Joo Park
,
Shin Heu
,
Hyoung-Joo Kim
Information Processing Letters
80
(4), 2001, pp. 195-203
A generalized grid quorum strategy for
k
-mutual exclusion in distributed systems
Ye-In Chang
,
Bor-Hsu Chen
Information Processing Letters
80
(4), 2001, pp. 205-212
On approximating planar metrics by tree metrics
Goran Konjevod
,
R. Ravi
,
F. Sibel Salman
Information Processing Letters
80
(4), 2001, pp. 213-219
Maximal matching stabilizes in time
\O(m)
Stephen T. Hedetniemi
,
David P. Jacobs
,
Pradip K. Srimani
Information Processing Letters
80
(5), 2001, pp. 221-223
Phased RGSS: An improved disk array scheduling for continuous media retrieval
Han Wook Lee
,
Dae Woong Kim anch Chan-Ik Park
Information Processing Letters
80
(5), 2001, pp. 225-231
On the semantics of nested datatypes
Clare Martin
,
Jeremy Gibbons
Information Processing Letters
80
(5), 2001, pp. 233-238
Clouds over a public key cryptosystem based on Lyndon words
María Isabel González Vasco
,
Rainer Steinwandt
Information Processing Letters
80
(5), 2001, pp. 239-242
A tradeoff between search and update in dictionaries
Jaikumar Radhakrishnan
,
Venkatesh Raman
Information Processing Letters
80
(5), 2001, pp. 243-247
Routing and path multicoloring
Christos Nomikos
,
Aris Pagourtzis
,
Stathis Zachos
Information Processing Letters
80
(5), 2001, pp. 249-256
Relativized separation of
EQP
from
P^{NP}
Frederic Green
,
Randall Pruim
Information Processing Letters
80
(5), 2001, pp. 257-260
A note on the x-coordinate of points on an elliptic curve in characteristic two
N.P. Smart
Information Processing Letters
80
(5), 2001, pp. 261-263
Typing evolving ambients
Xudong Guan
,
Yiling Yang
,
Jinyuan You
Information Processing Letters
80
(5), 2001, pp. 265-270
In-memory hash tables for accumulating text vocabularies
Justin Zobel
,
Steffen Heinz
,
Hugh E. Wiliams
Information Processing Letters
80
(6), 2001, pp. 271-277
A fast and practical bit-vector algorithm for the longest common subsequence problem
Maxime Crochemore
,
Costas S. Iliopoulos
,
Yoan J. Pinzon
,
James F. Reid
Information Processing Letters
80
(6), 2001, pp. 279-285
Minimum cost source location problem with vertex-connectivity requirements in digraphs
Hiroshi Nagamochi
,
Toshimasa Ishii
,
Hiro Ito
Information Processing Letters
80
(6), 2001, pp. 287-293
Security of Wang et al.'s group-oriented
(t,n)
threshold signature schemes with traceable signers
Z.C. Li
,
L.C.K. Hui
,
K.P. Chow
,
C.F. Chong
,
W.W. Tsang
,
H.W. Chan
Information Processing Letters
80
(6), 2001, pp. 295-298
A decoding algorithm for triple-error-correcting binary BCH codes
Erl-Huei Lu
,
Shao-Wei Wu
,
Yi-Chang Cheng
Information Processing Letters
80
(6), 2001, pp. 299-303
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Guoqing Wang
,
T.C. Edwin Cheng
Information Processing Letters
80
(6), 2001, pp. 305-309
A parallel algorithm for approximate regularity
Laurence Boxer
,
Russ Miller
Information Processing Letters
80
(6), 2001, pp. 311-316
Seiten
<
1
2