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
[3]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Global lock escalation in database management systems
Ji-Woong Chang
,
Young-Koo Lee
,
Kyu-Young Whang
Information Processing Letters
82
, 2002, pp. 179-186
Strong
NP
-hardness of the single machine multi-operation jobs total completion time scheduling problem
C.T. Ng
,
T.C.E. Cheng
,
J.J. Yuan
Information Processing Letters
82
, 2002, pp. 187-191
A note concerning the closest point pair algorithm
Martin Richards
Information Processing Letters
82
, 2002, pp. 193-195
Tree pattern matching with a more general notion of occurrence of the pattern
Cedric Chauve
Information Processing Letters
82
, 2002, pp. 197-201
On local modularity and interpolation in entailment systems
Paulo A.S. Veloso
,
José L. Fiadeiro
,
Sheila R.M. Veloso
Information Processing Letters
82
, 2002, pp. 203-211
Signature files and signature trees
Yangjun Chen
Information Processing Letters
82
, 2002, pp. 213-221
A note on the verification of automata specifications of probabilistic real-time systems
Arnaldo V. Moura
,
Guilherme A. Pinto
Information Processing Letters
82
, 2002, pp. 223-228
Differential approximation results for the Traveling Salesman and related problems
Jérôme Monnot
Information Processing Letters
82
, 2002, pp. 229-235
On the approximability of two tree drawing conventions
Paolo Penna
Information Processing Letters
82
, 2002, pp. 237-242
Provable securtiy for 13 round Skipjack-like structure
Seokhie Hong
,
Jaechul Sung
,
Sangjin Lee
,
Jongin Lim
,
Jongsu Kim
Information Processing Letters
82
, 2002, pp. 243-246
Digital signature algorithm for securing digital identities
Taekyoung Kwon
Information Processing Letters
82
, 2002, pp. 247-252
Online timestamped text indexing
Amihood Amir
,
Gad M. Landau
,
Esko Ukkonen
Information Processing Letters
82
, 2002, pp. 253-259
Updating
\le
,
<
-chains
James P. Delgrande
,
Arvind Gupta
Information Processing Letters
82
, 2002, pp. 261-268
Processing a multimedia join through the method of nearest neighbor search
Harald Kosch
,
Solomon Atnafu
Information Processing Letters
82
, 2002, pp. 269-276
Scaling multiple addition and prefix sums on the reconfigurable mesh
Jerry L. Trahan
,
Ramachandran Vaidyanathan
Information Processing Letters
82
, 2002, pp. 277-282
Recognition and dualization of disguised bidual Horn functions
Thomas Eiter
,
Toshihide Ibaraki
,
Kazuhisa Makino
Information Processing Letters
82
, 2002, pp. 283-291
New bounds on the barycenter heuristic for bipartite graph drawing
Xiao Yu Li
,
Matthias F. Stallmann
Information Processing Letters
82
, 2002, pp. 293-298
A self-stabilizing enumeration algorithms
Emmanuel Godard
Information Processing Letters
82
, 2002, pp. 299-305
Time-space trade-offs for compressed suffix arrays
S. Srinivasa Rao
Information Processing Letters
82
, 2002, pp. 307-311
Randomized local elections
Yves Métivier
,
Nasser Saheb
,
Akka Zemmari
Information Processing Letters
82
, 2002, pp. 313-320
For completeness, sublogarithmic space is no space
Manindra Agrawal
Information Processing Letters
82
, 2002, pp. 321-325
s
-partitions
William M.Y. Goh
,
Paweƚ Hitczenko
,
Ali Shokoufandeh
Information Processing Letters
82
, 2002, pp. 327-329
Seiten
<
1
2