Selim G. Akl

According to our database1, Selim G. Akl authored at least 276 papers between 1977 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
A computational journey in the true north.
Int. J. Parallel Emergent Distributed Syst., 2020

A Map of England, the Simulator Simulated, and Nonuniversality in Computation.
Int. J. Unconv. Comput., 2020

2019
Improved Recruitment Algorithms for Vehicular Crowdsensing Networks.
IEEE Trans. Veh. Technol., 2019

The Graph Is the Message: Design and Analysis of an Unconventional Cryptographic Function.
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

Unconventional Wisdom: Superlinear Speedup and Inherently Parallel Computations.
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

2018
Computing Shortest Paths with Cellular Automata.
J. Cell. Autom., 2018

Unconventional Wisdom: Superlinear Speedup and Inherently Parallel Computations.
Int. J. Unconv. Comput., 2018

A minimum knapsack-based resource allocation for underlaying device-to-device communication.
IJAACS, 2018

2017
Time: The Final Frontier.
Int. J. Unconv. Comput., 2017

Information and Computation: The Essence of It All.
Int. J. Unconv. Comput., 2017

Worst Case Branching and Other Measures of Nondeterminism.
Int. J. Found. Comput. Sci., 2017

Improved electromagnetic tracking for catheter path reconstruction with application in high-dose-rate brachytherapy.
Int. J. Comput. Assist. Radiol. Surg., 2017

2016
Operational state complexity of unary NFAs with finite nondeterminism.
Theor. Comput. Sci., 2016

Nonuniversality explained.
Int. J. Parallel Emergent Distributed Syst., 2016

The Quantum Chess Story.
Int. J. Unconv. Comput., 2016

A two-phase auction-based fair resource allocation for underlaying D2D communications.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

A stable matching algorithm for resource allocation for underlaying device-to-device communications.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

A Novel Method for Automated Fractionation Detection in Ventricular Tachycardia.
Proceedings of the Computing in Cardiology, CinC 2016, Vancouver, 2016

2015
On a class of covering problems with variable capacities in wireless networks.
Theor. Comput. Sci., 2015

Editorial Note.
Parallel Process. Lett., 2015

Carving Secret Messages out of Public Information.
J. Comput. Sci., 2015

Time-Scale Analysis of Signals Without Basis Functions: Application to Sudden Cardiac Arrest Prediction.
Int. J. Unconv. Comput., 2015

Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form.
Int. J. Unconv. Comput., 2015

Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks.
Int. J. Unconv. Comput., 2015

On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism.
Int. J. Unconv. Comput., 2015

Electromagnetic tracking in surgical and interventional environments: usability study.
Int. J. Comput. Assist. Radiol. Surg., 2015

Cellular automata and object monitoring in mobile wireless sensor networks.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

Nonholonomic catheter path reconstruction using electromagnetic tracking.
Proceedings of the Medical Imaging 2015: Image-Guided Procedures, 2015

Reducing the complexity of Resource Allocation for underlaying Device-to-Device communications.
Proceedings of the International Wireless Communications and Mobile Computing Conference, 2015

A Local Search Algorithm for Resource Allocation for Underlaying Device-to-Device Communications.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014
December Issue 2014 Editorial Note.
Parallel Process. Lett., 2014

Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks.
Int. J. Parallel Emergent Distributed Syst., 2014

What is computation?
Int. J. Parallel Emergent Distributed Syst., 2014

Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.
J. Autom. Lang. Comb., 2014

A survey of access management techniques in machine type communications.
IEEE Communications Magazine, 2014

Unary NFAs with Limited Nondeterminism.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

Cellular automata and Mobile Wireless Sensor Networks.
Proceedings of the IEEE 27th Canadian Conference on Electrical and Computer Engineering, 2014

2013
Are motorways rational from slime mould's point of view?
Int. J. Parallel Emergent Distributed Syst., 2013

Finite Nondeterminism vs. DFAs with Multiple Initial States.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

Comparisons between Measures of Nondeterminism on Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
A study of multi-hop cellular networks.
Wireless Communications and Mobile Computing, 2012

Computing with uncertainty and its implications to universality.
Int. J. Parallel Emergent Distributed Syst., 2012

A Cellular Automaton Model for Wireless Sensor Networks.
J. Cell. Autom., 2012

State Complexity of Finite Tree Width NFAs.
J. Autom. Lang. Comb., 2012

Energy efficient cellular automaton based algorithms for mobile wireless sensor networks.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2012

Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks.
Proceedings of the Theory and Practice of Natural Computing, 2012

Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks.
Proceedings of the 9th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, 2012

A cellular automaton model for connectivity preserving deployment of mobile wireless sensors.
Proceedings of IEEE International Conference on Communications, 2012

Multi-lead QRS detection using window pairs.
Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

State Complexity and Limited Nondeterminism.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011
Bitonic Sort.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Enhancing identity trust in cryptographic key management systems for dynamic environments.
Security and Communication Networks, 2011

Twentieth Anniversary Issue: Editorial Note.
Parallel Process. Lett., 2011

A local algorithm to compute multiple connected dominating sets in wireless sensor networks.
Int. J. Parallel Emergent Distributed Syst., 2011

Trans-Canada Slimeways: Slime Mould Imitates the Canadian Transport Network.
Int. J. Nat. Comput. Res., 2011

Computations with Uncertain Time Constraints: Effects on Parallelism and Universality.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

Efficient Enforcement of Dynamic Access Control Policies for Outsourced Data.
Proceedings of the Information Security South Africa Conference 2011, 2011

2010
Adaptive Cryptographic Access Control
Advances in Information Security 48, Springer, ISBN: 978-0-387-77265-3, 2010

Channel Assignment for Multihop Cellular Networks: Minimum Delay.
IEEE Trans. Mob. Comput., 2010

Key Distribution versus Key Enhancement in Quantum Cryptography.
Parallel Process. Lett., 2010

One-Time Pads without Prior Encounter.
Parallel Process. Lett., 2010

A Quantum Cryptographic Solution to the Problem of Access Control in a Hierarchy.
Parallel Process. Lett., 2010

Entanglement Verification with an Application to Quantum Key Distribution Protocols.
Parallel Process. Lett., 2010

Coping with Decoherence: Parallelizing the Quantum Fourier Transform.
Parallel Process. Lett., 2010

On the Importance of Being Quantum.
Parallel Process. Lett., 2010

Quantum security in wireless sensor networks.
Nat. Comput., 2010

Hypercomputation in a Cryptographic Setting: Solving the Identity Theft Problem Using Quantum Memories?
Int. J. Unconv. Comput., 2010

Time Travel: A New Hypercomputational Paradigm.
Int. J. Unconv. Comput., 2010

Target Monitoring in Wireless Sensor Networks: A Localized Approach.
Ad Hoc Sens. Wirel. Networks, 2010

Placement of multiple mobile data collectors in wireless sensor networks.
Ad Hoc Networks, 2010

Tuning Neural Networks by Both Connectivity and Size.
Proceedings of the Seventh International Conference on Information Technology: New Generations, 2010

A primal-dual approximation algorithm for the Minimum Cost Stashing problem in wireless sensor networks.
Proceedings of the 29th International Performance Computing and Communications Conference, 2010

2009
An Exact Solution to the Two-Dimensional Arbitrary-Threshold Density Classification Problem.
J. Cell. Autom., 2009

An Exact and Optimal Local Solution to the Two-Dimensional Convex Hull of Arbitrary Points Problem.
J. Cell. Autom., 2009

Some topological properties of star graphs: The surface area and volume.
Discret. Math., 2009

Chromatic sets of power graphs and their application to resource placement in multicomputer networks.
Comput. Math. Appl., 2009

Maximizing the lifetime of wireless sensor networks through domatic partition.
Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

A Further Improvement on a Genetic Algorithm.
Proceedings of the Sixth International Conference on Information Technology: New Generations, 2009

Routing to a Mobile Data Collector on a Predefined Trajectory.
Proceedings of IEEE International Conference on Communications, 2009

Effective Cell Size Scheme in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2009

A Localized Algorithm for Target Monitoring in Wireless Sensor Networks.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Placement of multiple mobile data collectors in underwater acoustic sensor networks.
Wireless Communications and Mobile Computing, 2008

Accelerating machines: a review.
Int. J. Parallel Emergent Distributed Syst., 2008

Cooperative <i>ad hoc</i> computing: towards enabling cooperative processing in wireless environments.
Int. J. Parallel Emergent Distributed Syst., 2008

On replacing cryptographic keys in hierarchical key management systems.
J. Comput. Secur., 2008

Planar tree transformation: Results and counterexample.
Inf. Process. Lett., 2008

Unconventional Computational Problems with Consequences to Universality.
Int. J. Unconv. Comput., 2008

Optimal Linear-Time Algorithm for Uplink Scheduling of Packets with Hard or Soft Deadlines in WiMAX.
Proceedings of the 68th IEEE Vehicular Technology Conference, 2008

Quantum Wireless Sensor Networks.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

Key Distribution based on Quantum Fourier Transform.
Proceedings of the SECRYPT 2008, 2008

A Framework for Self-Protecting Cryptographic Key Management.
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

QoS-based optimal logarithmic-time uplink scheduling algorithm for packets with hard or soft deadlines in WiMAX.
Proceedings of the IEEE 19th International Symposium on Personal, 2008

Delay constrained placement of mobile data collectors in underwater acoustic sensor networks.
Proceedings of the LCN 2008, 2008

Entanglement verification with application to key distribution protocols.
Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, 2008

A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks.
Proceedings of the 14th International Conference on Parallel and Distributed Systems, 2008

Optimal Cell Size in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

A QoS Guided Workflow Scheduling Algorithm for the Grid.
Proceedings of the 2008 International Conference on Grid Computing & Applications, 2008

Direct Planar Tree Transformation and Counterexample.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Evolving Computational Systems.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Perfect load balancing on the star interconnection network.
J. Supercomput., 2007

Authenticated Quantum Key Distribution without Classical Communication.
Parallel Process. Lett., 2007

Parallelism in Quantum Information Processing Defeats the Universal Computer.
Parallel Process. Lett., 2007

Aspects of Biomolecular Computing.
Parallel Process. Lett., 2007

Finding the maximum subsequence sum on interconnection networks.
Int. J. Parallel Emergent Distributed Syst., 2007

Quantum computing: beyond the limits of conventional computation.
Int. J. Parallel Emergent Distributed Syst., 2007

QoS and data relaying for wireless sensor networks.
J. Parallel Distributed Comput., 2007

On planar path transformation.
Inf. Process. Lett., 2007

Even Accelerating Machines are Not Universal.
Int. J. Unconv. Comput., 2007

Quantum Authenticated Key Distribution.
Proceedings of the Unconventional Computation, 6th International Conference, 2007

Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks.
Proceedings of the 2007 Summer Computer Simulation Conference, 2007

Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

PFAS: A Resource-Performance-Fluctuation-Aware Workflow Scheduling Algorithm for Grid Computing.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Two-Phase Computation and Data Scheduling Algorithms for Workflows in the Grid.
Proceedings of the 2007 International Conference on Parallel Processing (ICPP 2007), 2007

An Adaptive Double-layer Workflow Scheduling Approach for Grid Computing.
Proceedings of the 21st Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2007), 2007

Optimal Channel Assignment in Multi-Hop Cellular Networks.
Proceedings of the Global Communications Conference, 2007

On the Average Capacity of Vehicle to Vehicle Networks.
Proceedings of the Global Communications Conference, 2007

A Joint Data and Computation Scheduling Algorithm for the Grid.
Proceedings of the Euro-Par 2007, 2007

Comparing Priority Functions of Heuristic Scheduling Algorithms for Soft Real-Time Tasks.
Proceedings of the 2007 International Conference on Embedded Systems & Applications, 2007

Resource Placement in Networks Using Chromatic Sets of Power Graphs.
Proceedings of the Computer Science, 2007

Heuristics for Improving Cryptographic Key Assignment in a Hierarchy.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006
A Parallel Approach Eliminates Measurement Perturbations in RLC Circuits.
J. Supercomput., 2006

Three Counterexamples to Dispel the Myth of the Universal Computer.
Parallel Process. Lett., 2006

Errata: "inherently Parallel Geometric Computations".
Parallel Process. Lett., 2006

Inherently Parallel Geometric Computations.
Parallel Process. Lett., 2006

Quantum computation and quantum information.
Int. J. Parallel Emergent Distributed Syst., 2006

Computing nearest neighbors in real time.
J. Parallel Distributed Comput., 2006

Data relaying with constraints in hierarchical sensor networks.
J. Comb. Optim., 2006

Quantum Measurements and Universal Computation.
Int. J. Unconv. Comput., 2006

Real-time minimum vertex cover for two-terminal series-parallel graphs.
Int. J. High Perform. Comput. Netw., 2006

Coping with uncertainty and stress: a parallel computation approach.
Int. J. High Perform. Comput. Netw., 2006

Optimal Multi-hop Cellular Architecture for Wireless Communications.
Proceedings of the LCN 2006, 2006

Effective channel assignment in multi-hop W-CDMA cellular networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006

A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2006

An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
An analysis of the effect of parallelism in the control of dynamical systems.
Parallel Algorithms Appl., 2005

Parallel Computation and Measurement Uncertainty in Nonlinear Dynamical Systems.
J. Math. Model. Algorithms, 2005

Energy-aware task allocation over MANETs.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer.
Proceedings of the Unconventional Computation, 4th International Conference, 2005

On Node-to-Node Disjoint Paths in the Star Interconnection Network.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

An Independent Set Approach to Solving the Collaborative Attack Problem.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

Two Inherently Parallel Problems in Computational Geometry.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

QoS for data relaying in hierarchical wireless sensor networks.
Proceedings of the Q2SWinet'05, 2005

Data relaying with optimal resource management in wireless sensor networks (Extended Abstract).
Proceedings of the 30th Annual IEEE Conference on Local Computer Networks (LCN 2005), 2005

On Some Combinatorial Properties of the Star Graph.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Superlinear Performance in Real-Time Parallel Computation.
J. Supercomput., 2004

On The Combinatorial Properties Of k-Ary n-Cubes.
J. Interconnect. Networks, 2004

Parallel Computation Applied to Dynamical Systems.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Parallel Real-Time Computation of Nonlinear Feedback Functions.
Parallel Process. Lett., 2003

The maximum flow problem: a real-time approach.
Parallel Comput., 2003

On limits on the computational power of data-accumulating algorithms.
Inf. Process. Lett., 2003

An Algorithmic Model for Real-Time Computation.
Proceedings of the 23rd International Conference of the Chilean Computer Science Society (SCCC 2003), 2003

Computing in the Presence of Uncertainty: Disturbing the Peace.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

2002
Secure File Transfer: A Computational Analog To The Furniture Moving Paradigm.
Scalable Comput. Pract. Exp., 2002

A Parallel Algorithm for Lagrange Interpolation on the Star Graph.
J. Parallel Distributed Comput., 2002

Parallel Real-Time Computation: Sometimes Quantity Means Quality.
Comput. Artif. Intell., 2002

Locating the Median of a Tree in Real Time.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

On the Relation between Parallel Real-time Computations and Logarithmic Space.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

The Characterization of Parallel Real-Time Optimization Problems.
Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications, 2002

2001
Improving A Solution's Quality Through Parallel Processing.
J. Supercomput., 2001

Discrete Steepest Descent in Real Time.
Scalable Comput. Pract. Exp., 2001

On the Necessity of Formal Models for Real-Time Parallel Computations.
Parallel Process. Lett., 2001

A Case Study in Real-Time Parallel Computation: Correcting Algorithms.
J. Parallel Distributed Comput., 2001

Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Parallel Real-Time Complexity A Strong Infinite Hierarchy.
Proceedings of the SIROCCO 8, 2001

Real-Time Computation: A Formal Definition and its Applications.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

On Some Properties of <i>k</i>-Ary <i>n</i>-Cubes.
Proceedings of the Eigth International Conference on Parallel and Distributed Systems, 2001

2000
The Characterization of Data-Accumulating Algorithms.
Theory Comput. Syst., 2000

Generating Regular k-ary Trees Efficiently.
Comput. J., 2000

A New BFS Parent Array Encoding of t-ary Trees.
Comput. Artif. Intell., 2000

Parallel Real-Time Cryptography: Beyond Speedup II.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Parallel Real-Time Numerical Computation: Beyond Speedup III.
Proceedings of the 2000 International Symposium on Information Technology (ITCC 2000), 2000

Parallel Lagrange Interpolation on the Star Graph.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Towards a meaningful formal definition of real-time computations.
Proceedings of the ISCA 15th International Conference Computers and Their Applications, 2000

1999
An Efficient Implementation for the BROADCAST Instruction of BSR+.
IEEE Trans. Parallel Distrib. Syst., 1999

Parallel Real-Time Optimization: Beyond Speedup.
Parallel Process. Lett., 1999

On the Power of some Pram Models.
Parallel Algorithms Appl., 1999

1998
Efficient sorting on the star graph interconnection network.
Telecommunication Systems, 1998

Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses.
Int. J. Found. Comput. Sci., 1998

Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks.
Discret. Appl. Math., 1998

1997
Paradigms Admitting Superunitary Behaviour in Parallel Computation.
Parallel Algorithms Appl., 1997

Computing Maximum Cliques of Circular Arcs in Parallel.
Parallel Algorithms Appl., 1997

1996
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance.
IEEE Trans. Computers, 1996

Spanning Subgraphs with Applications to Communication on the Multidimensional Torus Network.
Parallel Comput., 1996

Matrix Operations Using Arrays with Reconfigurable Optical Buses*.
Parallel Algorithms Appl., 1996

Generating t-ary Trees in Parallel.
Nord. J. Comput., 1996

Optimal Communication Primitives on the Generalized Hypercube Network.
J. Parallel Distributed Comput., 1996

on the Power of Arrays with Optical Pipeline Buses.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses.
Proceedings of IPPS '96, 1996

1995
Efficient Algorithms for the Euclidean Distance Transform.
Parallel Process. Lett., 1995

The Maximum Weight Perfect Matching Problem for Complete Weighted Graphs Is in Pc*.
Parallel Algorithms Appl., 1995

Optimal Communication algorithms on Star Graphs Using Spanning Tree Constructions.
J. Parallel Distributed Comput., 1995

Efficient Parallel Algorithms on Proper Circular Arc Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1995

An Associative Implementation of Graham's Convex Hull Algorithm.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

Efficient algorithms for global data communication on the multidimensional torus network.
Proceedings of IPPS '95, 1995

Fault tolerant communication algorithms on the star network using disjoint paths.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
A Parallel Algorithm for Computing Fourier Transforms on the Star Graph.
IEEE Trans. Parallel Distrib. Syst., 1994

Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks.
Parallel Algorithms Appl., 1994

An Efficient Parallel Algorithm for the Assignment Problem on the Plane.
Parallel Algorithms Appl., 1994

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks.
J. Parallel Distributed Comput., 1994

An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order.
J. Parallel Distributed Comput., 1994

An <i>EP</i> Algorithm for Computing a Minimum Weight Perfect Matching for a Set of Points on the Plane.
INFORMS J. Comput., 1994

Multiple Criteria BSR: An Implementation and Applications to Computational Geometry Problems.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
An Optimal Implementation of Broadcasting with Selective Reduction.
IEEE Trans. Parallel Distrib. Syst., 1993

A Novel Routing Scheme on the Star and Pancake Networks and its Applications.
Parallel Comput., 1993

Parallel Synergy.
Parallel Algorithms Appl., 1993

Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry.
Networks, 1993

Optimal Communication Algorithms on the Star Interconnection Network.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Parallel computational geometry.
Prentice Hall, ISBN: 978-0-13-652017-7, 1993

1992
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited.
Theor. Comput. Sci., 1992

A Simple Optimal Systolic Algorithm for Generating Permutations.
Parallel Process. Lett., 1992

Revisiting Parallel Speedup Complexity.
Proceedings of the Computing and Information, 1992

Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks.
Proceedings of the Parallel Processing: CONPAR 92, 1992

Optimal Parallel Algorithms for Computing a Vertex of the linear Transportation polytope.
Proceedings of the Computer Science and Operations Research, 1992

1991
Constant Delay Parallel Counters.
Parallel Process. Lett., 1991

Parallel computation of matchings in trees.
Parallel Comput., 1991

Decomposing a Star Graph Into Disjoint Cycles.
Inf. Process. Lett., 1991

A Unified Approach to Parallel Depth-First Traversals of General Trees.
Inf. Process. Lett., 1991

Application of Broadcasting with Selective Reduction to the Maximal Sum Subsegment Problem.
International Journal of High Speed Computing, 1991

On doing Todd-Coxeter coset enumeration in parallel.
Discret. Appl. Math., 1991

Simulating Multiple Memory Accesses in Logarithmic Time and Linear Space.
Comput. J., 1991

Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond.
Proceedings of the Algorithms and Data Structures, 1991

Data communication and computational geometry on the star and pancake interconnection networks.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Parallel Routing and Sorting of the Pancake Network.
Proceedings of the Advances in Computing and Information, 1991

Systolic generation of derangements.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

1990
Parallel Binary Search.
IEEE Trans. Parallel Distrib. Syst., 1990

Parallel Binary Search with Delayed Read Conflicts.
International Journal of High Speed Computing, 1990

A Perfect Speedup Parallel Algorithm for the Assignment Problem on Complete Weighted Bipartite Graphs.
Proceedings of the Parallel Architectures (Postconference PARBASE-90)., 1990

1989
An Optimal Parallel Algorithm for Generating Combinations.
Inf. Process. Lett., 1989

Pipelined search on coarse grained networks.
Int. J. Parallel Program., 1989

Optimal Parallel Algorithms for b-Matchings in Trees.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Broadcasting with Selective Reduction.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Design and analysis of parallel algorithms.
Prentice Hall, ISBN: 978-0-13-200073-4, 1989

1988
On the bit complexity of parallel computations.
Integr., 1988

Bit serial addition trees and their applications.
Comput., 1988

1987
Views for Multilevel Database Security.
IEEE Trans. Software Eng., 1987

Optimal Parallel Merging and Sorting Without Memory Conflicts.
IEEE Trans. Computers, 1987

Optimal computation of prefix sums on a binary tree of processors.
Int. J. Parallel Program., 1987

Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations.
Comput. J., 1987

Checking Classification Constraints for Consistency and Completeness.
Proceedings of the 1987 IEEE Symposium on Security and Privacy, 1987

1986
Systolic sorting in a sequential input/output environment.
Parallel Comput., 1986

Efficient Selection on a Binary Tree.
Inf. Process. Lett., 1986

An adaptive and cost-optimal parallel algorithm for minimum spanning trees.
Comput., 1986

Generating Combinations in Parallel.
BIT Comput. Sci. Sect., 1986

Views for Multilevel Database Security.
Proceedings of the 1986 IEEE Symposium on Security and Privacy, 1986

1985
An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy.
IEEE Trans. Computers, 1985

Two New Secret Key Cryptosystems.
Proceedings of the Advances in Cryptology, 1985

1984
An Optimal Algorithm for Parallel Selection.
Inf. Process. Lett., 1984

Optimal parallel algorithms for computing convex hulls and for sorting.
Comput., 1984

A Fast Pseudo Random Permutation Generator With Applications to Cryptology.
Proceedings of the Advances in Cryptology, 1984

1983
Cryptographic Solution to a Problem of Access Control in a Hierarchy
ACM Trans. Comput. Syst., 1983

Remarks on a Digital Signature Scheme.
Cryptologia, 1983

New Key Generation Algorithms for Multilevel Security.
Proceedings of the 1983 IEEE Symposium on Security and Privacy, 1983

On the Security of Compressed Encodings.
Proceedings of the Advances in Cryptology, 1983

1982
Design, Analysis, and Implementation of a Parallel Tree Search Algorithm.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

On the Average-Case Complexity of "Bucketing" Algorithms.
J. Algorithms, 1982

Digital Signature Schemes.
Cryptologia, 1982

A Constant-Time Parallel Algorithm for Computing Convex Hulls.
BIT Comput. Sci. Sect., 1982

Digital Signitures with Blindfolded Arbitrators Who Cannot Form Alliances.
Proceedings of the 1982 IEEE Symposium on Security and Privacy, 1982

Cryptographic Solution to a Multilevel Security Problem.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
A Comparison of Combination Generation Methods.
ACM Trans. Math. Softw., 1981

Feature selection by interactive clustering.
Pattern Recognit., 1981

Digital signature schemes for computer communication networks.
Proceedings of the SIGCOMM '81, 1981

Digital Signature Scheme for Computer Communication Networks.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
The Design and Analysis of a New Hybrid Sorting Algorithm.
Inf. Process. Lett., 1980

Corrigendum on Convex Hull Algorithms.
Inf. Process. Lett., 1980

A New Algorithm for Generating Derangements.
BIT Comput. Sci. Sect., 1980

The Minimal Directed spanning Graph for Combinatorial Optimization.
Aust. Comput. J., 1980

1979
Two Remarks on a Convex Hull Algorithm.
Inf. Process. Lett., 1979

1978
A Fast Convex Hull Algorithm.
Inf. Process. Lett., 1978

An Improved Algorithm to Check for Polygon Similarity.
Inf. Process. Lett., 1978

Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity.
Inf. Process. Lett., 1978

1977
The principal continuation and the killer heuristic.
Proceedings of the 1977 annual conference, 1977


  Loading...