The following pages link to Bhabani P. Sinha (Q676655):
Displaying 46 items.
- A new topology with odd degree for multiprocessor systems. (Q676656) (← links)
- Efficient algorithm for placing a given number of base stations to cover a convex region (Q861306) (← links)
- On the distribution of runs of ones in binary strings (Q979847) (← links)
- (Q1129506) (redirect page) (← links)
- Fast parallel algorithms for Graeffe's root squaring technique (Q1129507) (← links)
- A new algorithm to compute vertex cutsets in a graph (Q1161296) (← links)
- Properties of a class of trivalent network graphs and optimal routing (Q1179383) (← links)
- Reliability analysis of networks using stochastic model (Q1194253) (← links)
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (Q1201873) (← links)
- A lower bound for the worst case of bottom-up-heapsort (Q1207959) (← links)
- A simple \(O(\log N)\) time parallel algorithm for testing isomorphism of maximal outerplanar graphs (Q1288544) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- An extensible fault-tolerant network architecture (Q1329504) (← links)
- Fast parallel algorithm for polynomial interpolation (Q1346834) (← links)
- Fast parallel algorithms for forecasting (Q1376706) (← links)
- A family of network topologies with multiple loops and logarithmic diameter (Q1392075) (← links)
- Impossible pair constrained test path generation in a program (Q1838316) (← links)
- Parallel prefix computation on extended multi-mesh network. (Q1853159) (← links)
- A new approach to program verification (Q2266579) (← links)
- (Q2998615) (← links)
- One Byte per Clock: A Novel RC4 Hardware (Q3058738) (← links)
- On the Numerical Complexity of Short-Circuit Faults in Logic Networks (Q3218069) (← links)
- (Q3343427) (← links)
- (Q3481706) (← links)
- A simple way to near minimization of microprogram control memory (Q3666750) (← links)
- (Q3735728) (← links)
- A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation (Q3758251) (← links)
- (Q4138757) (← links)
- A new method to find out the chromatic partition of a symmetric graph (Q4186345) (← links)
- (Q4414574) (← links)
- (Q4417475) (← links)
- Implementation of four common functions on an LNS co-processor (Q4419618) (← links)
- A new family of bridged and twisted hypercubes (Q4419796) (← links)
- Fault-tolerant routing in distributed loop networks (Q4421137) (← links)
- A new network topology with multiple meshes (Q4571401) (← links)
- (Q4893347) (← links)
- Fast Parallel Algorithm for Prefix Computation in Multi-Mesh Architecture (Q5087835) (← links)
- High-Performance Hardware Implementation for RC4 Stream Cipher (Q5274365) (← links)
- Euro-Par 2004 Parallel Processing (Q5311352) (← links)
- Fast parallel algorithms for binary multiplication and their implementation on systolic architectures (Q5375462) (← links)
- Channel Assignment in Multimedia Cellular Networks (Q5445786) (← links)
- Distributed Computing - IWDC 2004 (Q5465903) (← links)
- Distributed Computing - IWDC 2004 (Q5465907) (← links)
- Distributed Computing – IWDC 2005 (Q5491766) (← links)
- Distributed Computing – IWDC 2005 (Q5491783) (← links)
- A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks (Q5696920) (← links)
