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=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the multiplication of reduced biquaternions and applications
V.S. Dimitrov
,
T.V. Cooklev
,
B.D. Donevsky
Information Processing Letters
43
, 1992, pp. 161-164
Highly resilient correctors for polynomials
Peter Gemmell
,
Madhu Sudan
Information Processing Letters
43
, 1992, pp. 169-174
Safety analysis versus type inference for partial types
Jens Palsberg
,
Michael I. Schwartzbach
Information Processing Letters
43
, 1992, pp. 175-180
Fast computation of the Euclidian distance maps for binary images
Mihail N. Kolountzakis
,
Kiriakos N. Kutulakos
Information Processing Letters
43
, 1992, pp. 181-184
Intersection and union of regular languages and state complexity
Jean-Camille Birget
Information Processing Letters
43
, 1992, pp. 185-190
A fast and efficient parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula
Zhi-Zhong Chen
Information Processing Letters
43
, 1992, pp. 191-193
A new upper bound on the complexity of the all pairs shortest path problem
Tadao Takaoka
Information Processing Letters
43
, 1992, pp. 195-199
Minimum separation for single-layer channel routing
Ronald I. Greenberg
,
F. Miller Maley
Information Processing Letters
43
, 1992, pp. 201-205
Lazy dynamic-programming can be eager
L. Allison
Information Processing Letters
43
, 1992, pp. 207-212
On sorting in the presence of erroneous information
A. Bagchi
Information Processing Letters
43
, 1992, pp. 213-215
Voronoi diagrams of rigidly moving sets of points
Daniel P. Huttenlocher
,
Klara Kedem
,
Jon M. Kleinberg
Information Processing Letters
43
, 1992, pp. 217-223
A relationship between nondeterministic Turing machines and 1-inkdot Turing machines with small space
Katsushi Inoue
,
Akira Ito
,
Itsuo Takanami
Information Processing Letters
43
, 1992, pp. 225-227
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
Ju Yuan Hsiao
,
Chuan Yi Tang
,
Ruay Shiung Chang
Information Processing Letters
43
, 1992, pp. 229-235
Embedding meshes of trees into deBruijn graphs
Eric J. Schwabe
Information Processing Letters
43
, 1992, pp. 237-240
Some pursuit-evasion problems on grids
Robin W. Dawes
Information Processing Letters
43
, 1992, pp. 241-247
A note on Raymond's tree based algorithm for distributed mutual exclusion
R. Satyanarayanan
,
D.R. Muthukrishnan
Information Processing Letters
43
, 1992, pp. 249-255
An optimal algorithm for generating minimal perfect hash functions
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
Information Processing Letters
43
, 1992, pp. 257-264
Analysis of hierarchical bus-based multicomputer architectures
A.S. Pombortsis
Information Processing Letters
43
, 1992, pp. 265-270
Random list permutations in place
Eugene K. Ressler
Information Processing Letters
43
, 1992, pp. 271-275
An improved lower bound for on-line bin packing algorithms
André van Vliet
Information Processing Letters
43
, 1992, pp. 277-284
Optimal routing in toroidal networks
Izidor Jerebic
,
Roman Trobec
Information Processing Letters
43
, 1992, pp. 285-291
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Maw-Shang Chang
,
Fu-Hsing Wang
Information Processing Letters
43
, 1992, pp. 293-295
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Shen-Lung Peng
,
Maw-Shang Chang
Information Processing Letters
43
, 1992, pp. 297-300
Weakest precondition semantics for time and concurrency
D. Scholefield
,
H.S.M. Zedan
Information Processing Letters
43
, 1992, pp. 301-308
A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
Eliezer A. Albacea
Information Processing Letters
43
, 1992, pp. 309-314
Seiten
<
1
2
3
>