Search
Now showing items 1-8 of 8
A parallel textured algorithm for optimal routing in data networks
(Texas A&M University, 1991)
Not available
Constant time algorithms for some geometric intersection problems on processor arrays with reconfigurable bus systems
(Texas A&M University, 1991)
Not available
An efficient technique for writing regular expressions of special finite state machines
(Texas A&M University, 1993)
Not available
Fault-tolerant distributed construction of a spanning tree and leader election in asynchronous general networks
(Texas A&M University, 1993)
Not available
Two partitioned approaches for finding the length of the longest common subsequence
(Texas A&M University, 1992)
Not available
Algorithm for leader election in a synchronous network of the order three
(Texas A&M University, 1993)
Not available
Highly parallel algorithms and architectures for finding the length of the longest common subsequence
(Texas A&M University, 1991)
Not available
Design and implementation of high speed parallel multipliers
(Texas A&M University, 1992)
Not available