The following pages link to Sandeep N. Bhatt (Q796304):
Displaying 23 items.
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- Partitioning circuits for improved testability (Q920939) (← links)
- Area-time tradeoffs for universal VLSI circuits (Q959803) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Tight bounds on parallel list marking (Q1268796) (← links)
- (Q2114435) (redirect page) (← links)
- High order compact cubic B-spline collocation method for the solution of Fisher's equation (Q2114436) (← links)
- Tree Search on an Atomic Model for Message Passing (Q2719130) (← links)
- (Q2754165) (← links)
- (Q2766668) (← links)
- (Q3059339) (← links)
- Filament surgery and temporal grid adaptivity extensions to a parallel tree code for simulation and diagnosis in 3D vortex dynamics (Q3127384) (← links)
- (Q3138971) (← links)
- Taking random walks to grow trees in hypercubes (Q3140024) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Convergence Theorems for Perturbed Mann Iteration of Suzuki Generalized Non-Expansive Mappings in Banach Spaces (Q3450500) (← links)
- Universal Graphs for Bounded-Degree Trees and Planar Graphs (Q3828026) (← links)
- Efficient Embeddings of Trees in Hypercubes (Q3990107) (← links)
- Tight Bounds for On-Line Tree Embeddings (Q4268893) (← links)
- Optimal emulations by butterfly-like networks (Q4371672) (← links)
- Traversing Directed Eulerian Mazes (Q4405605) (← links)
- On bufferless routing of variable length messages in leveled networks (Q4420985) (← links)
- Cubic B-spline collocation method on non-uniform mesh for solving non-linear parabolic partial differential equation (Q5076624) (← links)
