Parallel Algorithm

1 2 3

• Transportable Information Agents
  (Jan. 7, 1999)
  
  
• Multiprocessor Systems
  (Apr. 12, 1999)
  
  
• Transportable Agents Support Worldwide Applicaiton
  (Mar. 3, 1999)
  
  
• A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph
  (Mar. 11, 1999)
  
  
• Incrementally Extensible Folded Hypercube Graphs
  (May 11, 1999)
  
  
• A Selection Algorithm for X+Y on Mesh
  (May 11, 1999)
  
  
• An Adaptive Causal Ordering Algorithm to Mobile Computing Environments
  (May 17, 1999)
  
  
• An Adaptive Causal Ordering Algorithm to Mobile Computing Environments
  (May 27, 1999)
  
  
• Broadcast Algorithm for Binary Directed de Bruijn Networks
  (July 27, 1999)
  
  
• Optimally Routable Networks
  (Aug. 10, 1999)
  
  
• Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems
  (Aug. 31, 1999)
  
  
• Pipelined Commnication in Optical Interconnected Arrays
  (Aug. 31, 1999)
  
  
• Parallel Computations on Reconfigurable Meshes
  (Sep. 7, 1999)
  
  
• Optically Interconnected Processor Array with Switching Capability
  (Sep. 14, 1999)
  
  
• An O(1) Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Mesh
  (Sep. 21, 1999)
  
  
• Sorting n Numbers on n ×n Reconfigurable Meshes with Buses
  (Sep. 21, 1999)
  
  
• A Constant Time Parallel Detection of Repetitions
  (Sep. 28, 1999)
  
  
• On Designing Communication-Intensive Algorithms for a Spanning Optical Bus Based Array
  (Oct. 8, 1999)
  
  
• Matrix Operation Using Arrays with Reconfigurable Optical Buses
  (Oct. 8, 1999)
  
  
• Sorting in Constant Number of Row and Column Phases on a Mesh
  (Oct. 11, 1999)
  
  
• Optimal Tree 3-Spanners in Directed Path Graphs
  (Nov. 1, 1999)
  
  
• Sorting, Selection , and Routing on the Array with Reconfigurable Optical Buses
  (Nov. 6, 1999)
  
  
• Deterministic Routing on the Array with Reconfigurable Optical Buses
  (Nov. 6, 1999)
  
  
• A Fault-Tolerant Connected-Cycle-Based Mesh Architecture
  (Nov. 6, 1999)
  
  
• Fast Nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
  (Nov. 19, 1999)
  
  
• Fault-Tolerant Routing Strategy Using Routing Capability in Hypercube Multicomputers
  (Nov. 19, 1999)
  
  
• Efficient Algorithms on the Hyperstar Network
  (Dec. 10, 1999)
  
  
• Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus(1999.12.10)
  
  
• Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses (Dec. 3, 1999) Matrix Decomposition on the Star Graph
  (Dec. 17, 1999)
  
  
• Broadcasting on Uni-directional Hypercubes(1999.12.23)
  
  
• On The Sizes of Extended Fibonacci Cubes
  (Dec. 31, 1999)

• Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks
  (Jan. 6, 2000)
  
  
• A Divide-and-Conquer Algorithm to find the kth largest Element in X+Y
  (Jan. 6, 2000)
  
  
• Fault-Tolerant Routing in Star Graph with Safety Vectors
  (Jan. 6, 2000)
  
  
• Incomplete Star Graph: An Incrementally Scalable Network Based on the Star Graph
  (Jan. 6, 2000)
  
  
• A Reliable Cube-Connected Cycles Structure(2000.1.13)
  
  
• Designing Efficient Parallel Algorithms on CRAP(2000.2.15)
  
  
• A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh
  (Feb. 25, 2000)
  
  
• A Survey of Wormhole Routing Techniques in Direct Networks
  (Mar. 3, 2000)
  
  
• Fibonacci Cubes－A New Interconnection Topology
  (Mar. 3, 2000)
  
  
• Latin Squares for Parallel Array Access (Mar. 7, 2000) Latin Squares for Parallel Array Access
  (Mar. 14, 2000)
  
  
• Routing in Wormhole-Switched Clustered Networks with Applications to Fault Tolerance
  (Mar. 14, 2000)
  
  
• Randomized Initialization Protocols for Packet Radio Networks
  (Apr. 18, 2000)
  
  
• String Superprimivitity Test on the Reconfigurable Bus Model
  (May 24, 2000)