Abstract On Planar Path Transformation (2008)
Selim G. Akl, Md. Kamrul, Islam Henk Meijer
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f � = e) is inserted such that the resulting object belongs to the...
We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NLOGSPACE) can be solved in real time by a parallel machine, no matter how tight the real-time...
Nordic Journal ol Computing 3(1996). 63 7t GtrI\trRATII\G,-ARY TREES III PARALLEL (2008)
Selim G. Akl, Ivan Stojmenovic
Abstract. We present a cost-optimal parallel algorithm for generating f-ary trees. Using a known inversion table representation, our algorithm generates all tree sequences in lexicographic order. It...
Ivan Stojmenovic, W. Preilowski, E. Dahlhaus, G. Wechsung, Selim G. Akl, Kelly A. Lyons, ...
Self-references are not included. Total count: 146 citations Number of cited articles: 19 **10*****************************************************************************
Technical Report 2007-542 Key Distribution versus Key Enhancement in Quantum Cryptography (2008)
Naya Nagy, Marius Nagy, Selim G. Akl
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum...
Abstract The aim of quantum key distribution protocols is to establish a secret key among two parties with high security confidence. Such algorithms generally require a quantum channel and an...
Technical Report No. 97-412 On the Power of Some PRAM Models (2008)
The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved...
Technical Report No. 2006-516 Quantum Key Distribution Revisited (2008)
Abstract We propose a new approach to quantum key distribution under the assumption that the qubits received during the execution of a protocol can be stored for a pre-determined amount of time. This...
Abstract This paper is structured around the idea that a finite Universal Computer cannot be realized and presents in detail a series of unconventional computing paradigms supporting this idea from a...
Technical Report No. 2006-526 UNCONVENTIONAL COMPUTING PROBLEMS? (2008)
Abstract. An evolving computation is one whose characteristics vary during its execution. These variations have many di erent origins and can manifest themselves in several ways. Thus, for example,...
This paper is structured around the idea that a nite Universal Computer cannot be realized and presents in detail a series of unconventional computing paradigms supporting this idea from a quantum...
We develop parallel algorithms for both one-dimensional and two-dimensional versions of the maximum sum problem (or max sum for short) on several interconnection networks. These algorithms are all...
Technical Report No. 2006{516 Quantum Key Distribution Revisited (2008)
We propose a new approach to quantum key distribution under the assumption that the qubits received during the execution of a protocol can be stored for a pre-determined amount of time. This...
Technical Report No. 2002-457 COMPUTING IN THE PRESENCE OF UNCERTAINTY: DISTURBING THE (2008)
2002 Abstract Are there computations whose characteristics are akin to certain unique phenomena that are witnessed in different domains of science? We are particularly interested in systems whose...
Technical Report 2007-542 Key Distribution versus Key Enhancement in Quantum Cryptography (2008)
Naya Nagy, Marius Nagy, Selim G. Akl
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum...
Technical Report No. 2001-444 The Maximum Flow Problem: A Real-Time Approach (2008)
The dynamic version of the maximum ow problem allows the graph underlying the ow network to change over time. The graph receives corrections to its structure or capacities and consequently the value...
On limits on the computational power of data-accumulating algorithms (2008)
In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are processed before another datum arrives. Previous...
Discrete steepest descent in real time (2007)
A general framework is proposed for the study of real-time algorithms. The framework unifies previous algorithmic definitions of real-time computation. In it, state space traversal is used as a model...
Real-Time Computation: A Formal Denition and its Applications (2007)
The concept of \real-time " has dierent meanings in the systems and theory communities. As a consequence, the currently available formal real-time models do not capture all the practically...
Pursuit and Evasion on a Ring: An Innite Hierarchy for Parallel Real-Time Systems (2007)
We present a new complexity theoretic approach to real-time parallel computations. Based on the theory of timed!-languages, we dene complexity classes that capture the intuitive notion of resource...
Technical Report No. 2007-530 Quantum Authenticated Key Distribution (2007)
Quantum key distribution algorithms use a quantum communication channel with quantum information and a classical communication channel for binary information. The classical channel, in all algorithms...
Arezou Mohammadi, Selim G. Akl
A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it...
Arezou Mohammadi, Selim G. Akl
A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it...
Arezou Mohammadi, Selim G. Akl
In this report, we study the problem of scheduling a set of n periodic preemptive independent hard real-time tasks on the minimum number of processors. We assume that the partitioning strategy is...
Arezou Mohammadi, Selim G. Akl
A soft real-time task is one whose completion time is recommended by a specific deadline. However, should the deadline be missed, such a task is not considered to have failed; only the later it...
Arezou Mohammadi, Selim G. Akl
In this report, we study the problem of scheduling a set of n periodic preemptive independent hard real-time tasks on the minimum number of processors. We assume that the partitioning strategy is...
Coping with uncertainty and stress: a parallel computation approach (2006)
This paper is concerned with computations whose characteristics are akin to certain unique phenomena that occur in different domains of science. We are particularly interested in systems whose...
Coping with uncertainty and stress: a parallel computation approach (2006)
This paper is concerned with computations whose characteristics are akin to certain unique phenomena that occur in different domains of science. We are particularly interested in systems whose...
Abstract Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of...
Technical Report No. 2006-510 ACCELERATING MACHINES (2006)
This paper presents an overview of accelerating machines. We begin by exploring the history of the accelerating machine model and the potential power that it provides. We look at some of the problems...
Technical Report No. 2006-508 EVEN ACCELERATING MACHINES ARE NOT UNIVERSAL (2006)
We draw an analogy between Godel's Incompleteness Theorem in mathematics, and the impossibility ofachieving a Universal Computer in computer science. Speci cally, Godel proved that there exist...
Quantum computation and quantum information (2006)
The paper is intended to be a survey of all the important aspects and results that have shaped the eld of quantum computation and quantum information. The reader is rst familiarized with those...
Rank-varying computational complexity describes those computa-tions in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order...
Thanks to advances in wide-area network technologies and the low cost of computing resources, Grid computing came into being and is currently an active research area. One motivation of Grid computing...
Thanks to advances in wide-area network technologies and the low cost of computing resources, Grid computing came into being and is currently an active research area. One motivation of Grid computing...
Technical Report No. 2006-508 EVEN ACCELERATING MACHINES ARE NOT UNIVERSAL (2006)
We draw an analogy between Godel's Incompleteness Theorem in mathematics, and the impossibility ofachieving a Universal Computer in computer science. Speci cally, Godel proved that there exist...
Technical Report No. 2006-526 UNCONVENTIONAL COMPUTING PROBLEMS? (2006)
Abstract. An evolving computation is one whose characteristics vary during its execution. These variations have many di erent origins and can manifest themselves in several ways. Thus, for example,...
Abstract Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of...
Coping with decoherence: Parallelizing the Quantum Fourier Transform (2006)
Rank-varying computational complexity describes those computa-tions in which the complexity of executing each step is not a constant, but evolves throughout the computation as a function of the order...
On planar path transformation (2006)
Selim G. Akl, Md. Kamrul Islam, Henk Meijer, Communicated F. Dehne
This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and educational use, including for instruction at the author’s...
THREE UNCONVENTIONAL COMPUTATIONAL PARADIGMS (2005)
My recent work has uncovered at least three general unconventional computational paradigms within which parallel algorithms lead to a superlinear improvement in performance (that is, speed and...
Technical Report No. 2005-500 Quantum computing: Beyond the limits of (2005)
conventional computation \Lambda
COMPUTER \Lambda
Technical Report No. 2005-492 THE MYTH OF UNIVERSAL COMPUTATION ∗ (2005)
It is shown that the concept of a Universal Computer cannot be realized. Specifically, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable of...
Technical Report No. 2005-499 Scheduling Algorithms for Real-Time Systems ∗ (2005)
Arezou Mohammadi, Selim G. Akl
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the...
The role played by parallelism in the theory of computation de-pends on the particular paradigm or computational environment con-sidered, but its importance has been con rmed with the emergence of...
Technical Report No. 2005-499 Scheduling Algorithms for Real-Time Systems (2005)
Arezou Mohammadi, Selim G. Akl
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the...
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum...
Technical Report No. 2005-499 Scheduling Algorithms for Real-Time Systems ∗ (2005)
Arezou Mohammadi, Selim G. Akl
The problem of real-time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithms. In this paper, we study the...
Technical Report No. 2005-492 THE MYTH OF UNIVERSAL COMPUTATION (2005)
It is shown that the concept of a Universal Computer cannot be realized. Speci-cally, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable of...
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum...
The myth of universal computation (2005)
It is shown that the concept of a Universal Computer cannot be realized. Specifically, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable of...
In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are processed before another datum arrives. Previous...
Technical Report No. 2005-492 THE MYTH OF UNIVERSAL COMPUTATION (2005)
It is shown that the concept of a Universal Computer cannot be realized. Speci-cally, instances of a computable function F are exhibited that cannot be computed on any machine U that is capable of...
Technical Report No. 2004-490 Parallel Computation and Avoidance of Chaos ∗ (2004)
Brendan J. Cordy, Selim G. Akl
Many well known mathematical models display a transition from simple motion to chaos as parameters of the system change. Here we will look at a particular example, the forced damped oscillation...
Technical Report No. 2004-480 INHERENTLY PARALLEL GEOMETRIC PROBLEMS (2004)
A new computational paradigm is described which o ers the possibility ofsuperlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to...
Technical Report No. 2004-480 INHERENTLY PARALLEL GEOMETRIC PROBLEMS (2004)
A new computational paradigm is described which o ers the possibility ofsuperlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to...
Technical Report No. 2004-490 Parallel Computation and Avoidance of Chaos ∗ (2004)
Brendan J. Cordy, Selim G. Akl
Many well known mathematical models display a transition from simple motion to chaos as parameters of the system change. Here we will look at a particular example, the forced damped oscillation...
Computing nearest neighbors in real time (2003)
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples into a predefined set...
In certain physical systems measuring one variable of the system modi es the values of any number of other variables unpredictably. We show in this paper that under these conditions a parallel...
In certain physical systems measuring one variable of the system modi es the values of any number of other variables unpredictably. We show in this paper that under these conditions a parallel...
An Application Of Parallel Computation To Dynamical Systems (2003)
An RLC circuit, certain parameters of which are measured sequentially, that is, one after the other, undergoes significant perturbations that affect its dynamical behavior. By contrast, these...
Technical Report No. 2003-466 AN APPLICATION OF PARALLEL COMPUTATION TO DYNAMICAL SYSTEMS (2003)
An RLC circuit, certain parameters of which are measured sequen-tially, that is, one after the other, undergoes signi cant perturbations that a ect its dynamical behavior. By contrast, these...
On the relation between parallel real-time computations and logarithmic space (2002)
We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NLOGSPACE) can be solved in real time by a parallel machine, no matter how tight the real-time...
Locating the median of a tree in real time (2002)
Determining the optimal location of a switching center in a tree network of users is accurately modeled by the median problem. A real-time approach is used in this paper to investigate the dynamics...
An Algorithmic Model for Real Time Computation (2002)
A general framework is proposed for the study of real-time algorithms. The framework unifies previous algorithmic definitions of real-time computation. In it, state space traversal is used as a model...
Computing In The Presence Of Uncertainty: Disturbing The Peace (2002)
Are there computations whose characteristics are akin to certain unique phenomena that are witnessed in dierent domains of science? We are particularly interested in systems whose parameters are...
Parallel Real-Time Computation: Sometimes Quantity Means Quality (2002)
The primary purpose of parallel computation is the fast execution of computational tasks that require an inordinate amount of time to perform sequentially. As a consequence, interest in parallel...
The maximum flow problem: A real-time approach (2001)
The dynamic version of the maximum flow problem allows the graph underlying the flow network to change over time. The graph receives corrections to its structure or capacities and consequently the...
Superlinear performance in real-time parallel computation (2001)
Can a parallel computer with n processors solve a computational problem more than n times faster than a sequential computer? Can it solve it more than n times better? New computational paradigms...
Real-time minimum vertex cover for two-terminal series-parallel graphs (2001)
Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a...
Superlinear Performance In Real-Time Parallel Computation (2001)
Can a parallel computer with n processors solve a computational problem more than n times faster than a sequential computer? Can it solve it more than n times better? New computational paradigms...
We show that all the problems solvable by a nondeterministic machine with logarithmic work space (NLOGSPACE) can be solved in real time by aparallel machine, no matter how tight the real-time...
Technical Report No. 2001-443 Superlinear Performance In Real-Time Parallel Computation (2001)
Can a parallel computer with n processors solve a computational problem more than n times faster than a sequential computer? Can it solve it more than n times better? New computational paradigms o er...
Technical Report No. 2001-445 Locating The Median Of A Tree In Real Time (2001)
Determining the optimal location of a switching center in a tree network of users is accurately modeled by the median problem. A real-time approach is used in this paper to investigate the dynamics...
Technical Report No. 2001-448 Computing Nearest Neighbors In Real Time (2001)
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples into a prede ned set...
Superlinear performance in real-time parallel computation (2001)
Can a parallel computer with n processors solve a computational problem more than n times faster than a sequential computer? Can it solve it more than n times better? New computational paradigms o er...
On the necessity of formal models for real-time parallel computations (2000)
We assume the multitape real-time Turing machine as a formal model for parallel real-time computation. Then, we show that, for any positive integer k, there is at least one language L k which is...
Parallel real-time computation: Sometimes quantity means quality (2000)
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. As a consequence, interest in parallel computation to date has...
Real-Time Computation: A Formal Definition and its Applications (2000)
There are few formal definitions of real-time problems, and the currently available definitions do not capture all the relevant aspects of such computations. We propose a new definition, and we...
Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems (2000)
We present a new complexity theoretic approach to real-time parallel computations. Based on the theory of timed omega-languages, we define complexity classes that capture the intuitive notion of...
Parallel Real-Time Cryptography: Beyond Speedup II (2000)
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second equally important...
Technical Report No. 2000-435 Real-Time Computation: A Formal De nition and its Applications (2000)
There are few formal de nitions of real-time problems, and the currently available de nitions do not capture all the relevant aspects of such computations. We propose a new de nition, and we believe...
Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively de nable graphs. The method is based on processing the parse tree associated with a...
Parallel real-time numerical computation: Beyond speedup III (2000)
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential computers. This fact...
Nonlinearity, maximization and parallel real-time computation (2000)
This paper focuses on the improvement in the quality of computation provided by parallelism. The problem of interest is that of computing the maximum of a nonlinear feedback function in a realtime...
Parallel real-time cryptography: Beyond speedup II (2000)
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second equally important...
We present a new complexity theoretic approach to real-time parallel computations. Based on the theory of timed!-languages, we de ne complexity classes that capture the intuitive notion of resource...
Generating Regular k-ary Trees Efficiently (2000)
Xiang, Limin, Ushijima, Kazuo, Akl, Selim G.
A recursive algorithm GenWordsR and a non-recursive algorithm GenWordsNR are presented in this paper to generate sequences for regular k-ary trees efficiently. They are compared with some of the...
The characterization of data-accumulating algorithms (1999)
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data have been processed...
The characterization of data-accumulating algorithms (1999)
Data-accumulating algorithms (d-algorithms for short), extensively studied in [12], work on a input considered as a virtually endless stream. The computation terminates when all the currently arrived...
Parallel Maximum Sum Algorithms on Interconnection Networks (1999)
We develop parallel algorithms for both one-dimensional and two-dimensional versions of the maximum sum problem (or max sum for short) on several interconnection networks. These algorithms are all...
Secure File Transfer: A Computational Analog to the Furniture Moving Paradigm (1999)
One of the most compelling illustrations of the power of parallelism is the furniture-moving paradigm. In it, a large item of furniture needs to be moved from one place to another. A single mover,...
Parallel Real-Time Optimization: Beyond Speedup (1999)
Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a different type of question: Can...
On the Power of Real-Time Turing Machines: k Tapes Are More Powerful than k-1 Tapes (1999)
We show that, for any integer k, there is at least one language which is accepted by a k-tape real-time Turing machine, but cannot be accepted by a (k-1)-tape real-time Turing machine. We show...
Towards a Meaningful Formal Definition of Real-Time Computations (1999)
There are few formal definitions of real--time problems, and the currently available definitions do not capture all the relevant aspects of such computations. We propose a new definition, and we...
Parallel Real-Time Numerical Computation: Beyond Speedup III (1999)
Parallel computers can do more than simply speed up sequential computations. They are capable of finding solutions that are far better in quality than those obtained by sequential computers. This...
Secure File Transfer: A Computational Analog to the Furniture Moving Paradigm (1999)
One of the most compelling illustrations of the power of parallelism is the furniture-moving paradigm. In it, a large item of furniture needs to be moved from one place to another. A single mover,...
A Case Study in Real-Time Parallel Computation: Correcting Algorithms (1999)
A correcting algorithm is one that receives an endless stream of corrections to its initial input data and terminates when all the corrections received have been taken into account. We give a...
Parallel Real-Time Optimization: Beyond Speedup (1999)
Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a different type of question: Can...
Parallel Real-Time Optimization: Beyond Speedup (1999)
Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a different type of question: Can...
Parallel Real-Time Cryptography: Beyond Speedup II (1999)
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second equally important...
Parallel real-time optimization: beyond speedup (1999)
Traditionally, interest in parallel computation centered around the speedup provided by parallel algorithms over their sequential counterparts. In this paper, we ask a di erent type of question: Can...
Secure file transfer: A computational analog to the furniture moving paradigm (1999)
One of the most compelling illustrations of the power of parallelism is the furniture-moving paradigm. In it, a large item of furniture needs to be moved from one place to another. A single mover,...
Towards a meaningful formal definition of real-time computations (1999)
There are few formal definitions of real-time problems, and the currently available definitions do not capture all the relevant aspects of such computations. We propose a new definition, and we...
On the power of real-time Turing machines: k tapes are more powerful than k \Gamma 1 tapes (1999)
We show that, for any integer k, there is at least one language which is accepted by ak-tape real{time Turing machine, but cannot be accepted by a (k, 1)-tape real{time Turing machine. We show...
On the data-accumulating paradigm (1998)
In the data{accumulating paradigm, the input is an endless stream. A computation is considered to be nished when all the already received data are processed before another datum arrives. We study...
A case study in real-time parallel computation: Correcting algorithms (1998)
A correcting algorithm is one that receives an endless stream of corrections to its initial input data and terminates when all the corrections received have been taken into account. We give a...
Technical Report No. 98-417 On the Data--Accumulating Paradigm (1998)
In the data--accumulating paradigm, the input is an endless stream. A computation is considered to be finished when all the already received data are processed before another datum arrives. We study...
On the Data-Accumulating Paradigm (1998)
In the data-accumulating paradigm, the input is an endless stream. A computation is considered to be finished when all the already received data are processed before another datum arrives. We study...
Technical Report No. 98-418 The Characterization of Data-Accumulating Algorithms (1998)
A data-accumulating algorithm (d-algorithm for short) works on an input consid-ered as a virtually endless stream. The computation terminates when all the currently arrived data have been processed...
A case study in real-time parallel computation: Correcting algorithms (1998)
A correcting algorithm is one that receives an endless stream of corrections to its initial input data and terminates when all the corrections received have been taken into account. We give...
Technical Report No. 98-417 On the Data{Accumulating Paradigm (1998)
In the data{accumulating paradigm, the input is an endless stream. A computation is considered to be nished when all the already received data are processed before another datum arrives. We study...
We present several novel data communication algorithms for hypercubes. Specifically, we obtain (1) an algorithm that broadcasts m messages of unit size on a hypercube of size N in optimal time O(m +...
On the Power of Some PRAM Models (1997)
The focus here is the power of some underexplored CRCW PRAMs, which are strictly more powerful than exclusive write PRAM but strictly less powerful than BSR. We show that some problems can be solved...
Efficient Sorting On The Star Graph Interconnection Network (1997)
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algorithms are based on arranging the n! processors of the n-star in a virtual (n \Gamma 1)-dimensional...
EFFICIENT SORTING ON THE STAR GRAPH INTERCONNECTION NETWORK (1997)
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algorithms are based on arranging the n! processors of the n-star in a virtual (n, 1)-dimensional array....
We present several novel data communication algorithms for hypercubes. Speci-cally, we obtain (1) an algorithm that broadcasts m messages of unit size on a hypercube of size N in optimal time O(m +...
On the Power of Arrays with Reconfigurable Optical Buses (1996)
Sandy Pavel, Y Pavel, Selim G. Akl
This paper examines some computational aspects of different arrays enhanced with optical pipelined buses. The array processors with optical pipelined buses (APPB) are shown to be extremely flexible,...
Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses (1996)
Sandy Pavel, Y Pavel, Selim G. Akl
This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). The AROB combines some of the advantages and...
Edge-disjoint spanning trees on the star network with applications to fault tolerance (1996)
Paraskevi Fragopoulou, Selim G. Akl
Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication isby exploiting and e ectively utilizing the disjoint paths that...
Optimal communication primitives on the generalized hypercube network (1996)
Paraskevi Fragopoulou, Selim G. Akl, Henk Meijer
E cient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the generalized hypercube, a network that is...
Efficient algorithms for the hough transform on arrays with reconfigurable optical buses (1996)
This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for...
On the Power of Arrays with Recon gurable Optical Buses (1995)
This paper examines some computational aspects of di erent arrays enhanced with optical pipelined buses. The array processors with optical pipelined buses (APPB) are shown to be extremely exible, as...
Optimal communication algorithms on star graphs using spanning tree constructions (1995)
Paraskevi Fragopoulou, Selim G. Akl
In this paper we consider three fundamental communication problems on the star interconnection network: the problem of simultaneous broadcasting of the same message from every node to all other...
Experiences with the implementation of geometric algorithms (1995)
Mehlhorn, Kurt, Akl, Selim G., Dehne, Frank, Sack, Jörg-Rüdiger, Santoro, Nicola
On Some Properties of the Star Graph (1995)
We derive some properties of the star graph in this paper. In particular, we compute the number of nodes at distance i from a fixed node e in a star graph. To this end, a recursive formula is first...
A parallel algorithm for computing Fourier transforms on the star graph (1994)
Paraskevi Fragopoulou, Student Member, Selim G. Akl, Senior Member
Abstmcr-The n-star graph, denoted by S,, is one of the graph networks that have been recently proposed as attractive alter-natives to the n-cube topology for interconnecting processors in parallel...
A Framework For Optimal Communication On The Multidimensional Torus Network (1994)
Paraskevi Fragopoulou, Selim G. Akl
Efficient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the multidimensional torus, a network that is...
Optimal Communication Primitives On The Generalized Hypercube Network (1994)
Paraskevi Fragopoulou, Selim G. Akl, Henk Meijer
Efficient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the generalized hypercube, a network that is...
A framework for optimal communication on the multidimensional torus network (1994)
Paraskevi Fragopoulou, Selim G. Akl
E cient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the multidimensional torus, a network that is...
Optimal Communication Algorithms On Star Graphs Using Spanning Tree Constructions (1993)
Paraskevi Fragopoulou, Selim G. Akl
In this paper we consider three fundamental communicationproblems on the star interconnection network: the problem of simultaneous broadcasting of the same message from every node to all other nodes,...
Edge-Disjoint Spanning Trees On The Star Network With Applications To Fault Tolerance (1993)
Paraskevi Fragopoulou, Selim G. Akl
Data communication and fault tolerance are important issues in multiprocessor systems. One way to achieve fault tolerant communication is by exploiting and effectively utilizing the disjoint paths...
An analysis of various aspects of the traveling salesman problem /--by Selim G. Akl. (1978)
Includes abstracts in English and French.
An analysis of various aspects of the traveling saleman problem / (1978)
Written for the School of Computer Science.