Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Selim G. Akl
2010 – today
- 2013
[j133]Andrew Adamatzky, Selim G. Akl, Ramón Alonso-Sanz, Wesley van Dessel, Zuwairie Ibrahim, Andrew Ilachinski, Jeff Jones, Anne V. D. M. Kayem, Genaro Juárez Martínez, Pedro P. B. de Oliveira, Mikhail Prokopenko, Theresa Schubert, Peter M. A. Sloot, Emanuele Strano, Xin-She Yang: Are motorways rational from slime mould's point of view? IJPEDS 28(3): 230-248 (2013)
[j132]
[j131]
[c103]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl: Comparisons between Measures of Nondeterminism on Finite Automata. DCFS 2013: 217-228
[c102]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl: Finite Nondeterminism vs. DFAs with Multiple Initial States. DCFS 2013: 229-240- 2012
[j130]Salimur Choudhury, Kai Salomaa, Selim G. Akl: A Cellular Automaton Model for Wireless Sensor Networks. J. Cellular Automata 7(3): 223-241 (2012)
[j129]
[j128]
[j127]
[j126]
[j125]
[j124]Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl: A study of multi-hop cellular networks. Wireless Communications and Mobile Computing 12(12): 1115-1129 (2012)
[c101]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl: State Complexity and Limited Nondeterminism. DCFS 2012: 252-265
[c100]Salimur Choudhury, Kai Salomaa, Selim G. Akl: A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. ICC 2012: 6545-6549
[c99]Salimur Choudhury, Kai Salomaa, Selim G. Akl: Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. TPNC 2012: 108-120
[c98]Sami Torbey, Selim G. Akl: Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata. UCNC 2012: 210-221
[c97]Salimur Choudhury, Selim G. Akl, Kai Salomaa: Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. WCNC 2012: 2341-2346
[i2]Andrew Adamatzky, Selim G. Akl, Ramón Alonso-Sanz, Wesley van Dessel, Zuwairie Ibrahim, Andrew Ilachinski, Jeff Jones, Anne V. D. M. Kayem, Genaro Juárez Martínez, Pedro P. B. de Oliveira, Mikhail Prokopenko, Theresa Schubert, Peter M. A. Sloot, Emanuele Strano, Xin-She Yang: Are motorways rational from slime mould's point of view? CoRR abs/1203.2851 (2012)- 2011
[j123]Andrew Adamatzky, Selim G. Akl: Trans-Canada Slimeways: Slime Mould Imitates the Canadian Transport Network. IJNCR 2(4): 31-46 (2011)
[j122]Kamrul Islam, Selim G. Akl: A local algorithm to compute multiple connected dominating sets in wireless sensor networks. IJPEDS 26(5): 369-380 (2011)
[j121]
[j120]
[j119]Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl: Enhancing identity trust in cryptographic key management systems for dynamic environments. Security and Communication Networks 4(1): 79-94 (2011)
[c96]Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl: Efficient Enforcement of Dynamic Access Control Policies for Outsourced Data. ISSA 2011
[c95]
[r1]
[i1]Andrew Adamatzky, Selim G. Akl: Trans-Canada Slimeways: Slime mould imitates the Canadian transport network. CoRR abs/1105.5084 (2011)- 2010
[b3]Anne V. D. M. Kayem, Selim G. Akl, Patrick Martin: Adaptive Cryptographic Access Control. Advances in Information Security 48, Springer 2010, ISBN 978-0-387-77265-3, pp. 1-135
[j118]Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl: Placement of multiple mobile data collectors in wireless sensor networks. Ad Hoc Networks 8(4): 378-390 (2010)
[j117]Kamrul Islam, Selim G. Akl: Target Monitoring in Wireless Sensor Networks: A Localized Approach. Ad Hoc & Sensor Wireless Networks 9(3-4): 223-237 (2010)
[j116]
[j115]Naya Nagy, Marius Nagy, Selim G. Akl: Hypercomputation in a Cryptographic Setting: Solving the Identity Theft Problem Using Quantum Memories? IJUC 6(5): 375-398 (2010)
[j114]Naya Nagy, Marius Nagy, Selim G. Akl: Quantum security in wireless sensor networks. Natural Computing 9(4): 819-830 (2010)
[j113]Marius Nagy, Selim G. Akl: Coping with Decoherence: Parallelizing the Quantum Fourier Transform. Parallel Processing Letters 20(3): 213-226 (2010)
[j112]Marius Nagy, Selim G. Akl: Entanglement Verification with an Application to Quantum Key Distribution Protocols. Parallel Processing Letters 20(3): 227-237 (2010)
[j111]Naya Nagy, Marius Nagy, Selim G. Akl: Key Distribution versus Key Enhancement in Quantum Cryptography. Parallel Processing Letters 20(3): 239-250 (2010)
[j110]Naya Nagy, Selim G. Akl: A Quantum Cryptographic Solution to the Problem of Access Control in a Hierarchy. Parallel Processing Letters 20(3): 251-261 (2010)
[j109]Naya Nagy, Selim G. Akl: One-Time Pads without Prior Encounter. Parallel Processing Letters 20(3): 263-273 (2010)
[j108]
[j107]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: Channel Assignment for Multihop Cellular Networks: Minimum Delay. IEEE Trans. Mob. Comput. 9(7): 1022-1034 (2010)
[c94]Salimur Choudhury, Kamrul Islam, Selim G. Akl: A primal-dual approximation algorithm for the Minimum Cost Stashing problem in wireless sensor networks. IPCCC 2010: 146-152
[c93]Ian Stewart, Wenying Feng, Selim G. Akl: Tuning Neural Networks by Both Connectivity and Size. ITNG 2010: 126-131
2000 – 2009
- 2009
[j106]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl, Paria Moinzadeh: Chromatic sets of power graphs and their application to resource placement in multicomputer networks. Computers & Mathematics with Applications 58(3): 403-413 (2009)
[j105]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl: Some topological properties of star graphs: The surface area and volume. Discrete Mathematics 309(3): 560-569 (2009)
[j104]Sami Torbey, Selim G. Akl: An Exact and Optimal Local Solution to the Two-Dimensional Convex Hull of Arbitrary Points Problem. J. Cellular Automata 4(2): 137-146 (2009)
[j103]Sami Torbey, Selim G. Akl: An Exact Solution to the Two-Dimensional Arbitrary-Threshold Density Classification Problem. J. Cellular Automata 4(3): 225-235 (2009)
[c92]Kamrul Islam, Selim G. Akl: A Localized Algorithm for Target Monitoring in Wireless Sensor Networks. ADHOC-NOW 2009: 391-396
[c91]Kamrul Islam, Selim G. Akl, Henk Meijer: Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. DCOSS 2009: 343-355
[c90]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: Effective Cell Size Scheme in Multi-Hop Cellular Networks. GLOBECOM 2009: 1-6
[c89]Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl: Routing to a Mobile Data Collector on a Predefined Trajectory. ICC 2009: 1-5
[c88]Ian Stewart, Wenying Feng, Selim G. Akl: A Further Improvement on a Genetic Algorithm. ITNG 2009: 154-159
[c87]Kamrul Islam, Selim G. Akl, Henk Meijer: Maximizing the lifetime of wireless sensor networks through domatic partition. LCN 2009: 436-442- 2008
[j102]Selim G. Akl: Unconventional Computational Problems with Consequences to Universality. IJUC 4(1): 89-98 (2008)
[j101]Selim G. Akl, Kamrul Islam, Henk Meijer: Planar tree transformation: Results and counterexample. Inf. Process. Lett. 109(1): 61-67 (2008)
[j100]Anne V. D. M. Kayem, Selim G. Akl, Patrick Martin: On replacing cryptographic keys in hierarchical key management systems. Journal of Computer Security 16(3): 289-309 (2008)
[j99]Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein: Cooperative ad hoc computing: towards enabling cooperative processing in wireless environments. IJPEDS 23(1): 59-79 (2008)
[j98]
[j97]Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl: Placement of multiple mobile data collectors in underwater acoustic sensor networks. Wireless Communications and Mobile Computing 8(8): 1011-1022 (2008)
[c86]Selim G. Akl, Kamrul Islam, Henk Meijer: Direct Planar Tree Transformation and Counterexample. CCCG 2008
[c85]Fangpeng Dong, Selim G. Akl: A QoS Guided Workflow Scheduling Algorithm for the Grid. GCA 2008: 22-27
[c84]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: Optimal Cell Size in Multi-Hop Cellular Networks. GLOBECOM 2008: 574-578
[c83]Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein: Placement of Multiple Mobile Data Collectors in Underwater Acoustic Sensor Networks. ICC 2008: 2113-2118
[c82]Kamrul Islam, Selim G. Akl, Henk Meijer: A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. ICPADS 2008: 559-566
[c81]Marius Nagy, Selim G. Akl: Entanglement verification with application to key distribution protocols. ITSL 2008: 99-105
[c80]Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl: Delay constrained placement of mobile data collectors in underwater acoustic sensor networks. LCN 2008: 91-97
[c79]Arezou Mohammadi, Selim G. Akl, Firouz Behnamfar: QoS-based optimal logarithmic-time uplink scheduling algorithm for packets with hard or soft deadlines in WiMAX. PIMRC 2008: 1-5
[c78]Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl, Wendy Powley: A Framework for Self-Protecting Cryptographic Key Management. SASO 2008: 191-200
[c77]Marius Nagy, Selim G. Akl, Sean Kershaw: Key Distribution based on Quantum Fourier Transform. SECRYPT 2008: 263-269
[c76]
[c75]Arezou Mohammadi, Selim G. Akl, Firouz Behnamfar: Optimal Linear-Time Algorithm for Uplink Scheduling of Packets with Hard or Soft Deadlines in WiMAX. VTC Fall 2008: 1-5- 2007
[j96]Selim G. Akl, Kamrul Islam, Henk Meijer: On planar path transformation. Inf. Process. Lett. 104(2): 59-64 (2007)
[j95]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: QoS and data relaying for wireless sensor networks. J. Parallel Distrib. Comput. 67(6): 715-726 (2007)
[j94]Marius Nagy, Selim G. Akl: Quantum computing: beyond the limits of conventional computation. IJPEDS 22(2): 123-135 (2007)
[j93]
[j92]Naya Nagy, Selim G. Akl: Aspects of Biomolecular Computing. Parallel Processing Letters 17(2): 185-211 (2007)
[j91]Marius Nagy, Selim G. Akl: Parallelism in Quantum Information Processing Defeats the Universal Computer. Parallel Processing Letters 17(3): 233-262 (2007)
[j90]Naya Nagy, Selim G. Akl: Authenticated Quantum Key Distribution without Classical Communication. Parallel Processing Letters 17(3): 323-335 (2007)
[j89]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl: Perfect load balancing on the star interconnection network. The Journal of Supercomputing 41(3): 269-286 (2007)
[c74]Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl: Heuristics for Improving Cryptographic Key Assignment in a Hierarchy. AINA Workshops (1) 2007: 531-536
[c73]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl: Resource Placement in Networks Using Chromatic Sets of Power Graphs. CSR 2007: 158-167
[c72]Arezou Mohammadi, Selim G. Akl: Comparing Priority Functions of Heuristic Scheduling Algorithms for Soft Real-Time Tasks. ESA 2007: 107-113
[c71]Fangpeng Dong, Selim G. Akl: A Joint Data and Computation Scheduling Algorithm for the Grid. Euro-Par 2007: 587-597
[c70]Yik Hung Tam, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: Optimal Channel Assignment in Multi-Hop Cellular Networks. GLOBECOM 2007: 731-735
[c69]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: On the Average Capacity of Vehicle to Vehicle Networks. GLOBECOM 2007: 1092-1096
[c68]Fangpeng Dong, Selim G. Akl: An Adaptive Double-layer Workflow Scheduling Approach for Grid Computing. HPCS 2007: 7
[c67]Fangpeng Dong, Selim G. Akl: Two-Phase Computation and Data Scheduling Algorithms for Workflows in the Grid. ICPP 2007: 66
[c66]Fangpeng Dong, Selim G. Akl: PFAS: A Resource-Performance-Fluctuation-Aware Workflow Scheduling Algorithm for Grid Computing. IPDPS 2007: 1-9
[c65]Arezou Mohammadi, Selim G. Akl: Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison. ISPA 2007: 20-31
[c64]Arezou Mohammadi, Selim G. Akl: Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks. SCSC 2007: 481-488
[c63]
[e4]Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham (Eds.): Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings. Lecture Notes in Computer Science 4618, Springer 2007, ISBN 978-3-540-73553-3- 2006
[j88]Selim G. Akl: Coping with uncertainty and stress: a parallel computation approach. IJHPCN 4(1/2): 85-90 (2006)
[j87]Marius Nagy, Selim G. Akl: Real-time minimum vertex cover for two-terminal series-parallel graphs. IJHPCN 4(5/6): 347-356 (2006)
[j86]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai: Data relaying with constraints in hierarchical sensor networks. J. Comb. Optim. 11(1): 113-123 (2006)
[j85]Marius Nagy, Selim G. Akl: Computing nearest neighbors in real time. J. Parallel Distrib. Comput. 66(3): 359-366 (2006)
[j84]
[j83]Selim G. Akl: Inherently Parallel Geometric Computations. Parallel Processing Letters 16(1): 19-38 (2006)
[j82]Selim G. Akl: Errata: "inherently Parallel Geometric Computations". Parallel Processing Letters 16(2): 185-188 (2006)
[j81]Selim G. Akl: Three Counterexamples to Dispel the Myth of the Universal Computer. Parallel Processing Letters 16(3): 381-403 (2006)
[j80]Selim G. Akl, Weiguang Yao: A Parallel Approach Eliminates Measurement Perturbations in RLC Circuits. The Journal of Supercomputing 35(2): 155-164 (2006)
[c62]Marius Nagy, Selim G. Akl: Coping with Decoherence: Parallelizing the Quantum Fourier Transform. ISCA PDCS 2006: 108-113
[c61]
[c60]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic. GLOBECOM 2006
[c59]Sylvia Tai, Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl: A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks. ICC 2006: 3432-3437
[c58]Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl: Effective channel assignment in multi-hop W-CDMA cellular networks. IWCMC 2006: 569-574
[c57]Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl, Robert Benkoczi: Optimal Multi-hop Cellular Architecture for Wireless Communications. LCN 2006: 738-745- 2005
[j79]Selim G. Akl, Weiguang Yao: Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems. J. Math. Model. Algorithms 4(1): 5-15 (2005)
[j78]Selim G. Akl, Brendan J. Cordy, Weiguang Yao: An analysis of the effect of parallelism in the control of dynamical systems. Parallel Algorithms Appl. 20(2): 147-168 (2005)
[c56]Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein: Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs. IPDPS 2005
[c55]Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl: On Some Combinatorial Properties of the Star Graph. ISPAN 2005: 58-65
[c54]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai: Data relaying with optimal resource management in wireless sensor networks (Extended Abstract). LCN 2005: 617-618
[c53]Robert Benkoczi, Hossam S. Hassanein, Selim G. Akl, Sylvia Tai: QoS for data relaying in hierarchical wireless sensor networks. Q2SWinet 2005: 47-54
[c52]
[c51]Anne V. D. M. Kayem, Selim G. Akl, Patrick Martin: An Independent Set Approach to Solving the Collaborative Attack Problem. IASTED PDCS 2005: 594-599
[c50]Ke Qiu, Selim G. Akl: On Node-to-Node Disjoint Paths in the Star Interconnection Network. IASTED PDCS 2005: 731-735
[c49]Marius Nagy, Selim G. Akl: On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer. UC 2005: 176-190
[c48]Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein: Energy-aware task allocation over MANETs. WiMob (3) 2005: 315-322- 2004
[j77]Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl: On The Combinatorial Properties Of k-Ary n-Cubes. Journal of Interconnection Networks 5(1): 79-91 (2004)
[j76]Selim G. Akl: Superlinear Performance in Real-Time Parallel Computation. The Journal of Supercomputing 29(1): 89-111 (2004)
[c47]Selim G. Akl, Weiguang Yao: Parallel Computation Applied to Dynamical Systems. ISCA PDCS 2004: 13-20- 2003
[j75]Stefan D. Bruda, Selim G. Akl: On limits on the computational power of data-accumulating algorithms. Inf. Process. Lett. 86(4): 221-227 (2003)
[j74]Naya Nagy, Selim G. Akl: The maximum flow problem: a real-time approach. Parallel Computing 29(6): 767-794 (2003)
[j73]Selim G. Akl: Parallel Real-Time Computation of Nonlinear Feedback Functions. Parallel Processing Letters 13(1): 65-75 (2003)
[c46]
[c45]- 2002
[j72]Selim G. Akl: Parallel Real-Time Computation: Sometimes Quantity Means Quality. Computers and Artificial Intelligence 21(5) (2002)
[j71]Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl: A Parallel Algorithm for Lagrange Interpolation on the Star Graph. J. Parallel Distrib. Comput. 62(4): 605-621 (2002)
[j70]Selim G. Akl: Secure File Transfer: A Computational Analog To The Furniture Moving Paradigm. Scalable Computing: Practice and Experience 5(2) (2002)
[c44]Stefan D. Bruda, Selim G. Akl: The Characterization of Parallel Real-Time Optimization Problems. HPCS 2002: 77-83
[c43]Stefan D. Bruda, Selim G. Akl: On the Relation between Parallel Real-time Computations and Logarithmic Space. IASTED PDCS 2002: 102-107
[c42]
[e3]Selim G. Akl, Teofilo F. Gonzalez (Eds.): International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA. IASTED/ACTA Press 2002, ISBN 0-88986-366-0- 2001
[j69]Stefan D. Bruda, Selim G. Akl: A Case Study in Real-Time Parallel Computation: Correcting Algorithms. J. Parallel Distrib. Comput. 61(5): 688-708 (2001)
[j68]Stefan D. Bruda, Selim G. Akl: On the Necessity of Formal Models for Real-Time Parallel Computations. Parallel Processing Letters 11(2/3): 353-361 (2001)
[j67]Selim G. Akl: Discrete Steepest Descent in Real Time. Scalable Computing: Practice and Experience 4(3) (2001)
[j66]Selim G. Akl, Stefan D. Bruda: Improving A Solution's Quality Through Parallel Processing. The Journal of Supercomputing 19(2): 221-233 (2001)
[c41]Hamid Sarbazi-Azad, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Selim G. Akl: On Some Properties of k-Ary n-Cubes. ICPADS 2001: 517-524
[c40]Stefan D. Bruda, Selim G. Akl: Real-Time Computation: A Formal Definition and its Applications. IPDPS 2001: 137
[c39]Stefan D. Bruda, Selim G. Akl: Parallel Real-Time Complexity A Strong Infinite Hierarchy. SIROCCO 2001: 45-60
[c38]Stefan D. Bruda, Selim G. Akl: Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems. SPAA 2001: 312-313- 2000
[j65]Selim G. Akl, Stephan Olariu, Ivan Stojmenovic: A New BFS Parent Array Encoding of t-ary Trees. Computers and Artificial Intelligence 19(5) (2000)
[j64]Limin Xiang, Kazuo Ushijima, Selim G. Akl: Generating Regular k-ary Trees Efficiently. Comput. J. 43(4): 290-300 (2000)
[j63]Stefan D. Bruda, Selim G. Akl: The Characterization of Data-Accumulating Algorithms. Theory Comput. Syst. 33(1): 85-96 (2000)
[c37]Stefan D. Bruda, Selim G. Akl: Towards a meaningful formal definition of real-time computations. Computers and Their Applications 2000: 274-279
[c36]Hamid Sarbazi-Azad, Lewis M. Mackenzie, Mohamed Ould-Khaoua, Selim G. Akl: Parallel Lagrange Interpolation on the Star Graph. IPDPS 2000: 777-782
[c35]
[c34]Selim G. Akl, Stefan D. Bruda: Parallel Real-Time Numerical Computation: Beyond Speedup III. ITCC 2000: 428-435
[c33]
[c32]Stefan D. Bruda, Selim G. Akl: On the Necessity of Formal Models for Real-Time Parallel Computations. PDPTA 2000
1990 – 1999
- 1999
[j62]Selim G. Akl, Lin Chen: On the Power of some Pram Models. Parallel Algorithms Appl. 13(4): 307-319 (1999)
[j61]Selim G. Akl, Stefan D. Bruda: Parallel Real-Time Optimization: Beyond Speedup. Parallel Processing Letters 9(4): 499-509 (1999)
[j60]Limin Xiang, Kazuo Ushijima, Selim G. Akl, Ivan Stojmenovic: An Efficient Implementation for the BROADCAST Instruction of BSR+. IEEE Trans. Parallel Distrib. Syst. 10(8): 852-863 (1999)
[c31]Stefan D. Bruda, Selim G. Akl: The Characterization of Data-Accumulating Algorithms. IPPS/SPDP 1999: 2-6- 1998
[j59]Paraskevi Fragopoulou, Selim G. Akl: Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks. Discrete Applied Mathematics 83(1-3): 79-96 (1998)
[j58]Sandy Pavel, Selim G. Akl: Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses. Int. J. Found. Comput. Sci. 9(1): 99-120 (1998)
[j57]Selim G. Akl, Tanya Wolff: Efficient sorting on the star graph interconnection network. Telecommunication Systems 10(1): 3-20 (1998)- 1997
[j56]Selim G. Akl, Lorrie Fava Lindon: Paradigms Admitting Superunitary Behaviour in Parallel Computation. Parallel Algorithms Appl. 11(1-2): 129-153 (1997)
[j55]Selim G. Akl, Binay K. Bhattacharya: Computing Maximum Cliques of Circular Arcs in Parallel. Parallel Algorithms Appl. 12(4): 305-320 (1997)- 1996
[j54]Paraskevi Fragopoulou, Selim G. Akl, Henk Meijer: Optimal Communication Primitives on the Generalized Hypercube Network. J. Parallel Distrib. Comput. 32(2): 173-187 (1996)
[j53]Selim G. Akl, Ivan Stojmenovic: Generating t-ary Trees in Parallel. Nord. J. Comput. 3(1): 63-71 (1996)
[j52]Sandy Pavel, Selim G. Akl: Matrix Operations Using Arrays with Reconfigurable Optical Buses*. Parallel Algorithms Appl. 8(3-4): 223-242 (1996)
[j51]Paraskevi Fragopoulou, Selim G. Akl: Spanning Subgraphs with Applications to Communication on the Multidimensional Torus Network. Parallel Computing 22(7): 991-1015 (1996)
[j50]Paraskevi Fragopoulou, Selim G. Akl: Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance. IEEE Trans. Computers 45(2): 174-185 (1996)
[c30]Sandy Pavel, Selim G. Akl: Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses. ICPP, Vol. 2 1996: 90-94
[c29]Sandy Pavel, Selim G. Akl: Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses. IPPS 1996: 697-701
[c28]Sandy Pavel, Selim G. Akl: on the Power of Arrays with Optical Pipeline Buses. PDPTA 1996: 1443-1454- 1995
[j49]Paraskevi Fragopoulou, Selim G. Akl: Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions. J. Parallel Distrib. Comput. 24(1): 55-71 (1995)
[j48]Constantine N. K. Osiakwan, Selim G. Akl: The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*. Parallel Algorithms Appl. 6(2-3): 143-166 (1995)
[j47]Sandy Pavel, Selim G. Akl: Efficient Algorithms for the Euclidean Distance Transform. Parallel Processing Letters 5: 205-212 (1995)
[c27]Paraskevi Fragopoulou, Selim G. Akl: Fault tolerant communication algorithms on the star network using disjoint paths. HICSS (2) 1995: 4-13
[c26]Paraskevi Fragopoulou, Selim G. Akl: Efficient algorithms for global data communication on the multidimensional torus network. IPPS 1995: 324-330
[c25]Maher M. Atwah, Johnnie W. Baker, Selim G. Akl: An Associative Implementation of Graham's Convex Hull Algorithm. Parallel and Distributed Computing and Systems 1995: 273-276
[c24]Selim G. Akl, Lin Chen: Efficient Parallel Algorithms on Proper Circular Arc Graphs. PDPTA 1995: 71-80
[e2]Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (Eds.): Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8- 1994
[j46]Constantine N. K. Osiakwan, Selim G. Akl: An EP Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane. INFORMS Journal on Computing 6(4): 436-444 (1994)
[j45]Selim G. Akl, Henk Meijer, Ivan Stojmenovic: An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order. J. Parallel Distrib. Comput. 20(1): 84-91 (1994)
[j44]Ke Qiu, Selim G. Akl, Henk Meijer: On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. J. Parallel Distrib. Comput. 22(1): 16-25 (1994)
[j43]Ke Qiu, Selim G. Akl: Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks. Parallel Algorithms Appl. 2(1-2): 27-42 (1994)
[j42]Constantine N. K. Osiakwan, Selim G. Akl: An Efficient Parallel Algorithm for the Assignment Problem on the Plane. Parallel Algorithms Appl. 4(3-4): 193-210 (1994)
[j41]Paraskevi Fragopoulou, Selim G. Akl: A Parallel Algorithm for Computing Fourier Transforms on the Star Graph. IEEE Trans. Parallel Distrib. Syst. 5(5): 525-531 (1994)
[c23]Selim G. Akl, Lorrie Fava Lindon: Paradigms Admitting Superunitary Behaviour in Parallel Computation. CONPAR 1994: 301-312
[c22]Selim G. Akl, Ivan Stojmenovic: Multiple Criteria BSR: An Implementation and Applications to Computational Geometry Problems. HICSS (2) 1994: 159-168- 1993
[b2]Selim G. Akl, Kelly A. Lyons: Parallel computational geometry. Prentice Hall 1993, ISBN 978-0-13-652017-7, pp. I-VIII, 1-215
[j40]Selim G. Akl, Ke Qiu, Ivan Stojmenovic: Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks 23(4): 215-225 (1993)
[j39]
[j38]Selim G. Akl, Ke Qiu: A Novel Routing Scheme on the Star and Pancake Networks and its Applications. Parallel Computing 19(1): 95-101 (1993)
[j37]Lorrie Fava Lindon, Selim G. Akl: An Optimal Implementation of Broadcasting with Selective Reduction. IEEE Trans. Parallel Distrib. Syst. 4(3): 256-269 (1993)
[c21]Paraskevi Fragopoulou, Selim G. Akl: Optimal Communication Algorithms on the Star Interconnection Network. SPDP 1993: 702-711- 1992
[j36]Selim G. Akl, Ivan Stojmenovic: A Simple Optimal Systolic Algorithm for Generating Permutations. Parallel Processing Letters 2: 231-239 (1992)
[j35]Selim G. Akl, Michel Cosnard, Afonso Ferreira: Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. Theor. Comput. Sci. 95(2): 323-337 (1992)
[c20]Selim G. Akl, Ke Qiu: Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks. CONPAR 1992: 565-570
[c19]Constantine N. K. Osiakwan, Selim G. Akl: An Efficient Parallel Algorithm for the Assignment Problem on the Plane. ICCI 1992: 110-113
[c18]Selim G. Akl, Michel Cosnard, Afonso Ferreira: Revisiting Parallel Speedup Complexity. ICCI 1992: 179-182- 1991
[j34]Selim G. Akl, G. Labonté, M. Leeder, Ke Qiu: On doing Todd-Coxeter coset enumeration in parallel. Discrete Applied Mathematics 34(1-3): 27-35 (1991)
[j33]Selim G. Akl, G. R. Guenther: Application of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem. International Journal of High Speed Computing 3(2): 107-119 (1991)
[j32]Calvin Ching-Yuen Chen, Sajal K. Das, Selim G. Akl: A Unified Approach to Parallel Depth-First Traversals of General Trees. Inf. Process. Lett. 38(1): 49-55 (1991)
[j31]Ke Qiu, Henk Meijer, Selim G. Akl: Decomposing a Star Graph Into Disjoint Cycles. Inf. Process. Lett. 39(3): 125-129 (1991)
[j30]Constantine N. K. Osiakwan, Selim G. Akl: Parallel computation of matchings in trees. Parallel Computing 17(6-7): 643-656 (1991)
[j29]Selim G. Akl, Thibault Duboux, Ivan Stojmenovic: Constant Delay Parallel Counters. Parallel Processing Letters 1: 143-148 (1991)
[c17]Selim G. Akl, John M. Calvert, Ivan Stojmenovic: Systolic generation of derangements. Algorithms and Parallel VLSI Architectures 1991: 59-70
[c16]Ke Qiu, Henk Meijer, Selim G. Akl: Parallel Routing and Sorting of the Pancake Network. ICCI 1991: 360-371
[c15]Paraskevi Fragopoulou, Selim G. Akl: A Parallel Algorithm For Computing Fourier Transforms On the Star Graph. ICPP (3) 1991: 100-106
[c14]Selim G. Akl, Ke Qiu, Ivan Stojmenovic: Data communication and computational geometry on the star and pancake interconnection networks. SPDP 1991: 415-422
[c13]Selim G. Akl: Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond. WADS 1991: 92-104- 1990
[j28]Henk Meijer, Selim G. Akl: Parallel Binary Search with Delayed Read Conflicts. International Journal of High Speed Computing 2(1): 17-21 (1990)
[j27]Selim G. Akl, Henk Meijer: Parallel Binary Search. IEEE Trans. Parallel Distrib. Syst. 1(2): 247-250 (1990)
[c12]Constantine N. K. Osiakwan, Selim G. Akl: A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs. PARBASE / Architectures 1990: 161-180
[c11]Constantine N. K. Osiakwan, Selim G. Akl: The maximum weight perfect matching problem for complete weighted graphs is in PC. SPDP 1990: 880-887
[e1]Selim G. Akl, Frantisek Fiala, Waldemar W. Koczkodaj (Eds.): Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings. Lecture Notes in Computer Science 468, Springer 1990, ISBN 3-540-53504-7
1980 – 1989
- 1989
[b1]Selim G. Akl: Design and analysis of parallel algorithms. Prentice Hall 1989, ISBN 978-0-13-200073-4, pp. I-XIII, 1-401
[j26]Selim G. Akl, Frank Dehne: Pipelined search on coarse grained networks. International Journal of Parallel Programming 18(5): 359-364 (1989)
[j25]Selim G. Akl, David Gries, Ivan Stojmenovic: An Optimal Parallel Algorithm for Generating Combinations. Inf. Process. Lett. 33(3): 135-139 (1989)
[c10]
[c9]Constantine N. K. Osiakwan, Selim G. Akl: Optimal Parallel Algorithms for b-Matchings in Trees. Optimal Algorithms 1989: 274-308- 1988
[j24]Selim G. Akl, Henk Meijer: On the bit complexity of parallel computations. Integration 6(2): 201-212 (1988)- 1987
[j23]Selim G. Akl: Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations. Comput. J. 30(5): 433-436 (1987)
[j22]Henk Meijer, Selim G. Akl: Optimal computation of prefix sums on a binary tree of processors. International Journal of Parallel Programming 16(2): 127-136 (1987)
[j21]Selim G. Akl, Nicola Santoro: Optimal Parallel Merging and Sorting Without Memory Conflicts. IEEE Trans. Computers 36(11): 1367-1369 (1987)
[j20]Dorothy E. Denning, Selim G. Akl, Mark Heckman, Teresa F. Lunt, Matthew Morgenstern, Peter G. Neumann, Roger R. Schell: Views for Multilevel Database Security. IEEE Trans. Software Eng. 13(2): 129-140 (1987)
[c8]Selim G. Akl, Dorothy E. Denning: Checking Classification Constraints for Consistency and Completeness. IEEE Symposium on Security and Privacy 1987: 196-201- 1986
[j19]
[j18]J. Cooper, Selim G. Akl: Efficient Selection on a Binary Tree. Inf. Process. Lett. 23(3): 123-126 (1986)
[j17]Selim G. Akl, Hartmut Schmeck: Systolic sorting in a sequential input/output environment. Parallel Computing 3(1): 11-17 (1986)
[c7]Dorothy E. Denning, Selim G. Akl, Matthew Morgenstern, Peter G. Neumann, Roger R. Schell, Mark Heckman: Views for Multilevel Database Security. IEEE Symposium on Security and Privacy 1986: 156-172- 1985
[j16]Stephen J. MacKinnon, Peter D. Taylor, Henk Meijer, Selim G. Akl: An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy. IEEE Trans. Computers 34(9): 797-802 (1985)
[c6]- 1984
[j15]
[c5]Selim G. Akl, Henk Meijer: A Fast Pseudo Random Permutation Generator With Applications to Cryptology. CRYPTO 1984: 269-275- 1983
[j14]Selim G. Akl, Peter D. Taylor: Cryptographic Solution to a Problem of Access Control in a Hierarchy. ACM Trans. Comput. Syst. 1(3): 239-248 (1983)
[c4]
[c3]Stephen J. MacKinnon, Selim G. Akl: New Key Generation Algorithms for Multilevel Security. IEEE Symposium on Security and Privacy 1983: 72-78- 1982
[j13]Selim G. Akl: A Constant-Time Parallel Algorithm for Computing Convex Hulls. BIT 22(2): 130-134 (1982)
[j12]Selim G. Akl, Henk Meijer: On the Average-Case Complexity of "Bucketing" Algorithms. J. Algorithms 3(1): 9-13 (1982)
[j11]Selim G. Akl, David T. Barnard, Ralph J. Doran: Design, Analysis, and Implementation of a Parallel Tree Search Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 4(2): 192-203 (1982)
[c2]Selim G. Akl, Peter D. Taylor: Cryptographic Solution to a Multilevel Security Problem. CRYPTO 1982: 237-249- 1981
[j10]Stephen K. Wismath, H. P. Soong, Selim G. Akl: Feature selection by interactive clustering. Pattern Recognition 14(1-6): 75-80 (1981)
[j9]Selim G. Akl: A Comparison of Combination Generation Methods. ACM Trans. Math. Softw. 7(1): 42-45 (1981)
[c1]Henk Meijer, Selim G. Akl: Digital Signature Scheme for Computer Communication Networks. CRYPTO 1981: 65-70- 1980
[j8]Selim G. Akl: The Minimal Directed spanning Graph for Combinatorial Optimization. Australian Computer Journal 12(4): 132-136 (1980)
[j7]
[j6]
[j5]Henk Meijer, Selim G. Akl: The Design and Analysis of a New Hybrid Sorting Algorithm. Inf. Process. Lett. 10(4/5): 213-218 (1980)
1970 – 1979
- 1979
[j4]- 1978
[j3]Selim G. Akl: Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity. Inf. Process. Lett. 7(2): 86 (1978)
[j2]Selim G. Akl, Godfried T. Toussaint: An Improved Algorithm to Check for Polygon Similarity. Inf. Process. Lett. 7(3): 127-128 (1978)
[j1]Selim G. Akl, Godfried T. Toussaint: A Fast Convex Hull Algorithm. Inf. Process. Lett. 7(5): 219-222 (1978)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:05 CEST by the dblp team



