His primary scientific interests are in Parallel algorithm, Parallel computing, Algorithm, Theoretical computer science and Interconnection. The Parallel algorithm study combines topics in areas such as Disjoint sets, Graph theory, Combinatorics and Simple. The Parallel computing study combines topics in areas such as Discrete mathematics, Polygon mesh and Computational problem.
Selim G. Akl interconnects Key assignment, Analysis of parallel algorithms, Upper and lower bounds, Partially ordered set and Spanning tree in the investigation of issues within Theoretical computer science. His Interconnection study integrates concerns from other disciplines, such as Connection, Star and Host. His Star research is multidisciplinary, incorporating elements of Hypercube, Computation and Graph.
His primary areas of investigation include Algorithm, Parallel algorithm, Theoretical computer science, Combinatorics and Parallel computing. His Algorithm research includes themes of Scheduling, Spanning tree, Star and Constant. His Parallel algorithm study combines topics in areas such as Computational complexity theory, Speedup and Cost efficiency.
His Theoretical computer science study incorporates themes from Computation and Turing machine. His Combinatorics research incorporates themes from Discrete mathematics and Matching. His study ties his expertise on Interconnection together with the subject of Parallel computing.
His primary areas of study are Computation, Computer network, Wireless sensor network, Cellular automaton and Algorithm. The various areas that Selim G. Akl examines in his Computation study include Universality, Theoretical computer science and Speedup, Parallel computing. His studies deal with areas such as Graph and Encryption as well as Theoretical computer science.
His study looks at the intersection of Computer network and topics like Knapsack problem with Scheduling, Time complexity and Resource allocation. His Wireless sensor network research is multidisciplinary, incorporating perspectives in Key distribution in wireless sensor networks, Mobile wireless sensor network, Distributed computing and Mobile computing. His biological study spans a wide range of topics, including Atrial fibrillation and Catheter ablation.
Selim G. Akl focuses on Wireless sensor network, Algorithm, Distributed computing, Cellular automaton and Computer network. His Wireless sensor network research is multidisciplinary, relying on both Key distribution in wireless sensor networks, Mobile wireless sensor network, Heuristics, Mobile radio and Mobile computing. Selim G. Akl undertakes multidisciplinary studies into Algorithm and Fractionation in his work.
The study incorporates disciplines such as Time complexity, Local search, Resource allocation and Greedy algorithm in addition to Distributed computing. Selim G. Akl combines subjects such as Radio resource management, Matching, Blossom algorithm, Knapsack problem and Scheduling with his study of Time complexity. His Computer network study focuses on Telecommunications link in particular.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The design and analysis of parallel algorithms
Selim G. Akl.
(1985)
Cryptographic solution to a problem of access control in a hierarchy
Selim G. Akl;Peter D. Taylor.
ACM Transactions on Computer Systems (1983)
Parallel computation: models and methods
Selim G. Akl.
(1997)
Scheduling Algorithms for Grid Computing: State of the Art and Open Problems
Fangpeng Dong;Selim G. Akl.
(2006)
Parallel Sorting Algorithms
Selim G. Akl.
(1985)
Parallel Computational Geometry
Selim G. Akl;Kelly A. Lyons.
(1992)
Views for Multilevel Database Security
D.E. Denning;S.G. Akl;M. Heckman;T.F. Lunt.
IEEE Transactions on Software Engineering (1987)
A fast convex hull algorithm
Selim G. Akl;Godfried T. Toussaint.
Information Processing Letters (1978)
The principal continuation and the killer heuristic
Selim G. Akl;Monroe M. Newborn.
Proceedings of the 1977 annual conference (1977)
EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS.
Selim G. Akl;Godfried T. Toussaint.
Proc of the Int Jt Conf on Pattern Recognition, 4th (1979)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Queen's University
University of Ottawa
University of the West of England
New York University Abu Dhabi
Queen's University
Queen's University
Middlesex University
University of Sydney
University of Amsterdam
University of Auckland
University of Helsinki
Spanish National Research Council
Pacific Northwest Diabetes Research Institute
Vrije Universiteit Amsterdam
King's College London
University of Massachusetts Medical School
Kyoto University
University of Basel
University of California, Davis
University of Washington
Tulane University
University Medical Center Utrecht
Columbia University
University of Michigan–Ann Arbor
University of Melbourne