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=64
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards optimal two-dimensional indexing for constraint databases
E. Bertino
,
B. Catania
,
B. Shidlovsky
Information Processing Letters
64
(1), 1997, pp. 1-8
Billiard quorums on the grid
Divyakant Agrawal
,
Ömer Eğecioğlu
,
Amr El Abbadi
Information Processing Letters
64
(1), 1997, pp. 9-16
Calculating the Hausdorff distance between curves
E. Belogay
,
C. Cabrelli
,
U. Molter
,
R. Shonkwiler
Information Processing Letters
64
(1), 1997, pp. 17-22
Embedding cycles in IEH graphs
Hung-Yi Chang
,
Rong-Jaye Chen
Information Processing Letters
64
(1), 1997, pp. 23-27
Multitolerant barrier synchronization
Sandeep S. Kulkarni
,
Anish Arora
Information Processing Letters
64
(1), 1997, pp. 29-36
Fast correlation attacks on nonlinear filter generators
J.Dj. Golić
,
M. Salmasizadeh
,
L. Simpson
,
E. Dawson
Information Processing Letters
64
(1), 1997, pp. 37-42
Fair on-line scheduling of a dynamic set of tasks on a single resource
Sanjoy K. Baruah
,
Johannes E. Gehrk
,
C. Greg Plaxton
,
Ion Stoica
,
Hussein Abdel-Wahab
,
Kevin Jeffay
Information Processing Letters
64
(1), 1997, pp. 43-51
Recognizable subsets of the two letter plactic monoid
A. Arnold
,
M. Kanta
,
D. Krob
Information Processing Letters
64
(2), 1997, pp. 53-59
An approximate model of processor communication rings under heavy load
E.G., Jr. Coffman
,
L. Flatto
,
E.N. Gilbert
,
A.G. Greenberg
Information Processing Letters
64
(2), 1997, pp. 61-67
Batch scheduling with deadlines on parallel machines: An
NP
-hard case
Mikhail Y. Kovalyov
,
Yakov M. Shafransky
Information Processing Letters
64
(2), 1997, pp. 69-74
Characterization of extended
LR(k)
grammars
Gyung-Ok Lee
,
Do-Hyung Kim
Information Processing Letters
64
(2), 1997, pp. 75-82
A simple linear algorithm for the edge-disjoint
(s,t)
-paths problem in undirected planar graphs
Laurent Coupry
Information Processing Letters
64
(2), 1997, pp. 83-86
Time bounds on synchronization in a periodic distributed system
Injong Rhee
,
Jennifer L. Welch
Information Processing Letters
64
(2), 1997, pp. 87-93
Efficient access methods for image databases
Ye-In Chang
,
Bi-Yen Yang
Information Processing Letters
64
(2), 1997, pp. 95-105
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
Frank Dehne
,
Katia Guimarães
Information Processing Letters
64
(3), 1997, pp. 107-114
Formal justification of underspecification for S5
Eric Aaron
,
David Gries
Information Processing Letters
64
(3), 1997, pp. 115-121
Noncommutative minimization algorithms
M. Flouret
,
E. Laugerotte
Information Processing Letters
64
(3), 1997, pp. 123-126
A characterization of finitary bisimulation
Luca Aceto
,
Anna Ingólfsdóttir
Information Processing Letters
64
(3), 1997, pp. 127-134
On improving dependency implication algorithms
Wai Yin Mok
,
David W. Embley
Information Processing Letters
64
(3), 1997, pp. 135-141
The computational complexity of the reliability problem on distributed systems
Min-Sheng Lin
,
Deng-Jyi Chen
Information Processing Letters
64
(3), 1997, pp. 143-147
Computing a poset from its realizer
Enrico Nardelli
,
Vincenzo Mastrobuoni
,
Alesiano Santomo
Information Processing Letters
64
(3), 1997, pp. 149-154
Revisiting the COUNTER algorithms for list update
Susanne Albers
,
Michael Mitzenmacher
Information Processing Letters
64
(3), 1997, pp. 155-160
Optimal on-line decremental connectivity in trees
Stephen Alstrup
,
Jens Peter Secher
,
Maz Spork
Information Processing Letters
64
(4), 1997, pp. 161-164
On the efficiency of polynomial time approximation schemes
Marco Cesati
,
Luca Trevisan
Information Processing Letters
64
(4), 1997, pp. 165-171
An efficient, strongly polynomial,
\varepsilon
-approximation parametric optimization scheme
S.N. Kabadi
,
Y.P. Aneja
Information Processing Letters
64
(4), 1997, pp. 173-177
Seiten 1
2
>