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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the real-number representation with variable-length exponent field
Nakagawa Akinari
,
Hiroshi Hagiwara
Information Processing Letters
52
, 1994, pp. 1-6
Maximum finding on a multiple access broadcast network
Charles U. Martel
Information Processing Letters
52
, 1994, pp. 7-13
WORM-2DPDAs: An extension to 2DPDAs that can be simulated in linear time
Torben {\Ae}. Mogensen
Information Processing Letters
52
, 1994, pp. 15-22
An algorithm for hazard-free minimization of incompletely specified switching function
Md. Mozammel Huq Azad Khan
Information Processing Letters
52
, 1994, pp. 23-29
An optimal sublinear time parallel algorithm for some dynamic programming problems
Lawrence L. Larmore
,
Wojciech Rytter
Information Processing Letters
52
, 1994, pp. 31-34
An efficient permutation-based parallel range-join algorithm on
N
-dimensional torus computers
Shao Dong Chen
,
Hong Shen
,
Rodney Topor
Information Processing Letters
52
, 1994, pp. 35-38
A lower bound for two-server balancing algorithms
Jon M. Kleinberg
Information Processing Letters
52
, 1994, pp. 39-43
A short note on the approximability of the maximum leaves spanning tree problem
G. Galbiati
,
F. Maffioli
,
A. Morzenti
Information Processing Letters
52
, 1994, pp. 45-49
An efficient strategy for robot navigation in unknown environment
Aohan Mei
,
Yoshihide Igarashi
Information Processing Letters
52
, 1994, pp. 51-56
Haskell overloading is DEXPTIME-complete
Helmut Seidl
Information Processing Letters
52
, 1994, pp. 57-60
Semi-unification of two terms in Abelian groups
Mikael Rittri
Information Processing Letters
52
, 1994, pp. 61-68
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
Bern-Cherng Liaw
,
R.C.T. Lee
Information Processing Letters
52
, 1994, pp. 69-75
Recognizing shortest-path trees in linear time
C.H. Peng
,
J.S. Wang
,
R.C.T. Lee
Information Processing Letters
52
, 1994, pp. 77-85
Maximizing the number of unused colors in the vertex coloring problem
Refael Hassin
,
Shlomo Lahav (Haddad)
Information Processing Letters
52
, 1994, pp. 87-90
An attribute evaluation of context-free languages
Takehiro Tokuda
,
Yoshimichi Watanabe
Information Processing Letters
52
, 1994, pp. 91-98
Stabilizing observers
Mohamed G. Gouda
Information Processing Letters
52
, 1994, pp. 99-103
Distributed termination detection with roughly synchronized clocks
Jean Mayo
,
Phil Kearns
Information Processing Letters
52
, 1994, pp. 105-108
k
-violation linear programming
Thomas Roos
,
Peter Widmayer
Information Processing Letters
52
, 1994, pp. 109-114
Analysis of a list-update strategy
A. Pedrotti
Information Processing Letters
52
, 1994, pp. 115-121
On the feedback vertex set problem in permutation graphs
Y. Daniel Liang
Information Processing Letters
52
, 1994, pp. 123-129
Average-case scalable on-line algorithms for fault replacement
Kirk R. Pruhs
Information Processing Letters
52
, 1994, pp. 131-136
Constructor equivalent term rewriting systems are strongly sequential: A direct proof
Irène Durand
,
Bruno Salinier
Information Processing Letters
52
, 1994, pp. 137-145
A constant update time finger search tree
Paul F. Dietz
,
Rajeev Raman
Information Processing Letters
52
, 1994, pp. 147-154
A note on the Horton-Strahler number for random trees
Luc Devroye
,
Paul Kruszewski
Information Processing Letters
52
, 1994, pp. 155-159
Approximate map labeling is in
\Omega(n \log n)
Frank Wagner
Information Processing Letters
52
, 1994, pp. 161-165
Seiten 1
2
3
4
5
6
7
8
9
>