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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial division with a remainder by means of evaluation and interpolation
Victor Pan
,
Akimou Sadikou
,
Elliott Landowne
Information Processing Letters
44
, 1992, pp. 149-153
An optimal parallel algorithm for computing furthest neighbors in a tree
Subir Kumar Ghosh
,
Anil Maheshwari
Information Processing Letters
44
, 1992, pp. 155-160
The complexity of finding arborescences in hypergraphs
Gerhard J. Woeginger
Information Processing Letters
44
, 1992, pp. 161-164
A heuristic method for generating large random expressions
John Bainbridge
Information Processing Letters
44
, 1992, pp. 165-170
A hierarchy of tractable satisfiability problems
Mukesh Dalal
,
David W. Etherington
Information Processing Letters
44
(4), 1992, pp. 173-180
The pre-NTS property is undecidable for context-free grammars
Louxin Zhang
Information Processing Letters
44
(4), 1992, pp. 181-184
Preservation of integrity constraints in definite DATALOG programs
Ke Wang
,
Li Yan Yuan
Information Processing Letters
44
(4), 1992, pp. 185-193
A note on shortest superstrings with flipping
Tao Jiang
,
Ming Li
,
Ding-zhu Du
Information Processing Letters
44
(4), 1992, pp. 195-199
Fault-tolerant routing in unique-path multistage Omega network
Hsun-Wen Chang
,
Kuo-Liang Chung
Information Processing Letters
44
(4), 1992, pp. 201-204
On the closure of certain function classes under integer division by polynomially-bounded functions
Sanjay Gupta
Information Processing Letters
44
(4), 1992, pp. 205-210
Degree constrained tree embedding into points in the plane
Akihisa Tamura
,
Yoshiko Tamura
Information Processing Letters
44
(4), 1992, pp. 211-214
Cyclic reference counting with lazy mark-scan
Rafael D. Lins
Information Processing Letters
44
(4), 1992, pp. 215-220
A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
Silvano Martello
,
Paolo Toth
Information Processing Letters
44
(4), 1992, pp. 221-222
An efficient Write-All algorithm for fail-stop PRAM without initialized memory
Alex A. Shvartsman
Information Processing Letters
44
(4), 1992, pp. 223-231
Two-dimensional dictionary matching
Amihood Amir
,
Martin Farach
Information Processing Letters
44
(5), 1992, pp. 233-239
The towers of Hanoi problem with parallel moves
Jer-Shyan Wu
,
Rong-Jaye Chen
Information Processing Letters
44
(5), 1992, pp. 241-243
Approximation algorithms for geometric median problems
Jyh-Han Lin
,
Jeffrey Scott Vitter
Information Processing Letters
44
(5), 1992, pp. 245-249
The greedy algorithm is optimal for on-line edge coloring
Amotz Bar-Noy
,
Rajeev Motwani
,
Joseph Naor
Information Processing Letters
44
(5), 1992, pp. 251-253
On the optimal binary plane partition for sets of isothetic rectangles
Fabrizio d'Amore
,
Paolo Giulio Franciosa
Information Processing Letters
44
(5), 1992, pp. 255-259
Point location in fat subdivisions
Mark H. Overmars
Information Processing Letters
44
(5), 1992, pp. 261-265
Oberservations on
\log(n)
time parallel recognition of unambigous cfl's
Peter Rossmanith
,
Wojciech Rytter
Information Processing Letters
44
(5), 1992, pp. 267-272
Dynamic parallel evaluation of the cross-product set using time-stamps
Gopal Gupta
Information Processing Letters
44
(5), 1992, pp. 273-280
On the difficulty of Manhattan channel routing
Ronald Greenberg
,
J. Jájá
,
Sridhar Krishnamurthy
Information Processing Letters
44
(5), 1992, pp. 281-284
An optimal algorithm for finding compact sets
Eliezer Dekel
,
Jie Hu
,
Wen Ouyang
Information Processing Letters
44
(5), 1992, pp. 285-289
An elementary proof of Double Greibach Normal Form
Joost Engelfriet
Information Processing Letters
44
(6), 1992, pp. 291-293
Seiten
<
1
2
3
>