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
[1]
Hilfe
Suche: Author="Akl, S.G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sharing memory with semi-Byzantine clients and faulty storage servers
Hagit Attiya
,
Amir Bar-Or
Parallel Processing Letters
16
(4), 2006, pp. 419-428
Optimal clustering size of small file access in network attached storage device
Yuhui Deng
,
Frank Wang
,
Na Helian
,
Dan Feng
,
Ke Zhou
Parallel Processing Letters
16
(4), 2006, pp. 501-512
Parallelizing an application with time-increasing workload using adaptive processor allocation
Kuo-Chan Huang
,
Feng-Jian Wang
Parallel Processing Letters
16
(4), 2006, pp. 455-466
Minimizing waiting ratio for dynamic workload on parallel computers
Kuo-Chan Huang
Parallel Processing Letters
16
(4), 2006, pp. 441-453
An improved parallel prefix algorithm on OTIS-Mesh
Prasanta K. Jana
,
Bhabani P. Sinha
Parallel Processing Letters
16
(4), 2006, pp. 429-440
Constructing dimension-adaptive sparse grid interpolants using parallel function evaluations
Andreas Klimke
,
Barbara Wohlmuth
Parallel Processing Letters
16
(4), 2006, pp. 407-418
The operations dashboard: A collaborative environment for monitoring virtual organization-specific compute element operational status
Catherine L. Ruby
,
Mark L. Green
,
Russ Miller
Parallel Processing Letters
16
(4), 2006, pp. 485-500
A highly concurrent group mutual
l
-exclusion algorithm
K. Vidyasankar
Parallel Processing Letters
16
(4), 2006, pp. 467-483
A parallel algorithm for Lagrange Interpolation on the star graphs
H. Sarbazi-Azad
,
M. Ould-Khaoua
,
L.M. Mackenzie
,
S.G. Akl
Journal Parallel Distributed Computing
62
(4), 2002, pp. 605-621
Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
S.D. Bruda
,
S.G. Akl
Theory of Computing Systems
34
(6), 2001, pp. 565-576
The characterization of data-accumulating algorithms
S.D. Bruda
,
S.G. Akl
Theory of Computing Systems
33
(1), 2000, pp. 85-96
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
S.G. Akl
,
K. Qiu
,
I. Stojmenović
Networks
23
(4), 1993, pp. 215-225
Data communication and computational geometry on the star and pancake interconnection networks
S.G. Akl
,
K. Qiu
,
I. Stojmenovic
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 415-422
The maximum weight perfect matching problem for complete weighted graphs is in
PC^*
C.N.K. Osiakwan
,
S.G. Akl
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 880-887
Optimal parallel merging and sorting without memory conflicts
S.G. Akl
,
N. Santoro
IEEE Transactions on Computers
C-36
(11), 1987, November, pp. 1367-1369
Efficient selection on a binary tree
J. Cooper
,
S.G. Akl
Information Processing Letters
23
(3), 1986, October, pp. 123-126
An optimal algorithm for parallel selection
S.G. Akl
Information Processing Letters
19
, 1984, July, pp. 47-50
Optimal parallel algorithms for computing convex hulls and for sorting
S.G. Akl
Computing
33
, 1984, pp. 1-11
The design and analysis of a new hybrid sorting algorithm
H. Meijer
,
S.G. Akl
Information Processing Letters
10
(4-5), 1980, July, pp. 213-218
Two remarks on a convex hull algorithm
S.G. Akl
Information Processing Letters
8
(2), 1979, February, pp. 108-109
An improved algorithm to check for polygon similarity
S.G. Akl
,
G.T. Toussaint
Information Processing Letters
7
(3), 1978, April, pp. 127-128
A fast convex hull algorithm
S.G. Akl
,
G.T. Toussaint
Information Processing Letters
7
(5), 1978, August, pp. 219-222
Comments on: G. Manacher, An application of pattern matching to a problem in geometrical complexity
S.G. Akl
Information Processing Letters
7
(2), 1978, February, pp. 86