Constant-Time Algorithms for Complex Networks

2016 ◽  
Author(s):  
Hiro Ito
Keyword(s):  
Complex Networks ◽  
Constant Time ◽  
Constant Time Algorithms

scholarly journals Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes

VLSI Design ◽  
1999 ◽  
Vol 9 (1) ◽  
pp. 69-81 ◽  
Author(s):  
Martin Middendorf ◽  
Hartmut Schmeck ◽  
Heiko Schröder ◽  
Gavin Turner
Keyword(s):  
Lower Bound ◽  
Sparse Matrix ◽  
Sparse Matrices ◽  
The Other ◽  
Constant Time ◽  
Dynamically Reconfigurable ◽  
Reconfigurable Meshes ◽  
Constant Time Algorithms

Algorithms for multiplying several types of sparse n x n-matrices on dynamically reconfigurable n x n-arrays are presented. For some classes of sparse matrices constant time algorithms are given, e.g., when the first matrix has at most kn elements in each column or in each row and the second matrix has at most kn nonzero elements in each row, where k is a constant. Moreover, O(kn ) algorithms are obtained for the case that one matrix is a general sparse matrix with at most kn nonzero elements and the other matrix has at most k nonzero elements in every row or in every column. Also a lower bound of Ω(Kn ) is proved for this and other cases which shows that the algorithms are close to the optimum.

Constant time algorithms for computational geometry on the reconfigurable mesh

1997 ◽  
Vol 8 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Jin-Wook Jang ◽  
M. Nigam ◽  
V.K. Prasanna ◽  
S. Sahni
Keyword(s):  
Computational Geometry ◽  
Constant Time ◽  
Reconfigurable Mesh ◽  
Constant Time Algorithms

scholarly journals Constant Time Algorithms for Computing the Contour of Maximal Elements on a Reconfigurable Mesh

1998 ◽  
Vol 08 (03) ◽  
pp. 351-361 ◽  
Author(s):  
M. Manzur Murshed ◽  
Richard P. Brent
Keyword(s):  
Parallel Architectures ◽  
Constant Time ◽  
Maximal Elements ◽  
Reconfigurable Mesh ◽  
Constant Time Algorithms

There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them the Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents three constant time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N × N while the second one uses a 3-D RM of size [Formula: see text]. We further extend the result to k-D RM of size N1/(k - 1) × N1/(k - 1) × … × N1/(k - 1).

Constant Time Algorithms for ROLLO-I-128

2021 ◽  
Vol 2 (5) ◽  
Author(s):  
Carlos Aguilar-Melchor ◽  
Nicolas Aragon ◽  
Emanuele Bellini ◽  
Florian Caullery ◽  
Rusydi H. Makarim ◽  
...  
Keyword(s):  
Constant Time ◽  
Constant Time Algorithms

Constant-time algorithms for constrained triangulations on reconfigurable meshes

1998 ◽  
Vol 9 (11) ◽  
pp. 1057-1072 ◽  
Author(s):  
V.V. Bokka ◽  
H. Gurla ◽  
S. Olariu ◽  
J.L. Schwing
Keyword(s):  
Constant Time ◽  
Reconfigurable Meshes ◽  
Constant Time Algorithms
Sign in / Sign up

Export Citation Format

Share Document