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=83
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compror: On-line lossless data compression with a factor oracle
Arnaud Lefebvre
,
Thierry Lecroq
Information Processing Letters
83
(1), 2002, pp. 1-6
Bundle event structures: A revised cpo approach
Harald Fecher
,
Mila Majster-Cederbaum
,
Jinzhao Wu
Information Processing Letters
83
(1), 2002, pp. 7-12
On a game in directed graphs
Alan J. Hoffman
,
Kate Jenkins
,
Tim Roughgarden
Information Processing Letters
83
(1), 2002, pp. 13-16
A simplified correctness proof for a well-known algorithm computing strongly connected components
Ingo Wegener
Information Processing Letters
83
(1), 2002, pp. 17-19
A time-optimal distributed sorting algorithm on a line network
Atsushi Sasaki
Information Processing Letters
83
(1), 2002, pp. 21-26
Lower bounds on precedence-constrained scheduling for parallel processors
Ivan D. Baev
,
Waleed M. Meleis
,
Alexandre Eichenberger
Information Processing Letters
83
(1), 2002, pp. 27-32
Approximate swapped matching
Amihood Amir
,
Moshe Lewenstein
,
Ely Porat
Information Processing Letters
83
(1), 2002, pp. 33-39
A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation
Maharaj Mukherjee
,
Kanad Chakraborty
Information Processing Letters
83
(1), 2002, pp. 41-48
Database recovery using incomplete page versions in a multisystem data sharing environment
Haengrae Cho
Information Processing Letters
83
(1), 2002, pp. 49-55
Approximation algorithms for time-dependent orienteering
Fedor V. Fomin
,
Andrzej Lingas
Information Processing Letters
83
(2), 2002, pp. 57-62
Sending compressed messages to a learned receiver on a bidirectional line
Bruno Carpentieri
Information Processing Letters
83
(2), 2002, pp. 63-70
Byzantine quorum systems with maximum availability
Tatsuhiro Tsuchiya
,
Tohru Kikuno
Information Processing Letters
83
(2), 2002, pp. 71-77
Managing the granularity of constraint-based analyses by rule transformation
Byeong-Mo Chang
Information Processing Letters
83
(2), 2002, pp. 79-88
On adaptive deterministic gossiping in ad hoc radio networks
Leszek Ga̧sieniec
,
Andrzej Lingas
Information Processing Letters
83
(2), 2002, pp. 89-93
Weaknesses in some multisignature schemes for specified group of verifiers
Wei-Hua He
Information Processing Letters
83
(2), 2002, pp. 95-99
Abstract interpretation of operational semantics for secure information flow
R. Barbuti
,
C. Bernardeschi
,
N. De Francesco
Information Processing Letters
83
(2), 2002, pp. 101-108
Security of most significant bits of
g^{x^2}
Igor E. Shparlinski
Information Processing Letters
83
(2), 2002, pp. 109-113
An efficient algorithm for hyperspherical range query processing in high-dimensional data space
Dong-Ho Lee
,
Shin Heu
,
Hyoung-Joo Kim
Information Processing Letters
83
(2), 2002, pp. 115-123
Coding distributive lattices with edge firing games
Matthieu Latapy
,
Clémence Magnien
Information Processing Letters
83
(3), 2002, pp. 125-128
A note on constructing binary heaps with periodic networks
Marek Piotrów
Information Processing Letters
83
(3), 2002, pp. 129-134
Walking around fat obstacles
L. Paul Chew
,
Haggai David
,
Matthew J. Katz
,
Klara Kedem
Information Processing Letters
83
(3), 2002, pp. 135-140
Efficient algorithm for transversal of disjoint convex polygons
Francis Y.L. Chin
,
Fu Lee Wang
Information Processing Letters
83
(3), 2002, pp. 141-144
An efficient algorithm for cyclic reference counting
Rafael Dueire Lins
Information Processing Letters
83
(3), 2002, pp. 145-150
Optimal bounded disorder
Ricardo A. Baeza-Yates
,
Héctor Soza-Pollman
Information Processing Letters
83
(3), 2002, pp. 151-157
A speed-up for the commute between subword trees and DAWGs
Alberto Apostolico
,
Stefano Lonardi
Information Processing Letters
83
(3), 2002, pp. 159-161
Seiten 1
2
3
>