| Publication | Date of Publication | Type |
|---|
| Cubic B-spline collocation method on a non-uniform mesh for solving nonlinear parabolic partial differential equation | 2022-05-17 | Paper |
High order compact cubic B-spline collocation method for the solution of Fisher's equation
International Journal of Applied and Computational Mathematics | 2022-03-15 | Paper |
Convergence theorems for perturbed Mann iteration of Suzuki generalized non-expansive mappings in Banach spaces
Journal of Advanced Studies in Topology | 2015-11-06 | Paper |
| scientific article; zbMATH DE number 6180997 (Why is no real title available?) | 2013-06-25 | Paper |
| scientific article; zbMATH DE number 6127577 (Why is no real title available?) | 2013-01-21 | Paper |
| scientific article; zbMATH DE number 5823958 (Why is no real title available?) | 2010-12-08 | Paper |
Area-time tradeoffs for universal VLSI circuits
Theoretical Computer Science | 2008-12-12 | Paper |
On bufferless routing of variable length messages in leveled networks
IEEE Transactions on Computers | 2003-11-02 | Paper |
Traversing Directed Eulerian Mazes
Journal of Graph Algorithms and Applications | 2003-06-23 | Paper |
Tight bounds on parallel list marking
Journal of Parallel and Distributed Computing | 2002-11-24 | Paper |
| scientific article; zbMATH DE number 1696520 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1670844 (Why is no real title available?) | 2001-12-09 | Paper |
Tree search on an atomic model for message passing
SIAM Journal on Computing | 2001-06-21 | Paper |
Tight Bounds for On-Line Tree Embeddings
SIAM Journal on Computing | 1999-10-28 | Paper |
Optimal emulations by butterfly-like networks
Journal of the ACM | 1998-01-21 | Paper |
Filament surgery and temporal grid adaptivity extensions to a parallel tree code for simulation and diagnosis in 3D vortex dynamics
ESAIM: Proceedings | 1997-04-08 | Paper |
Salvage-Embeddings of Complete Trees
SIAM Journal on Discrete Mathematics | 1996-02-20 | Paper |
Taking random walks to grow trees in hypercubes
Journal of the ACM | 1993-12-09 | Paper |
| scientific article; zbMATH DE number 432837 (Why is no real title available?) | 1993-10-20 | Paper |
Efficient Embeddings of Trees in Hypercubes
SIAM Journal on Computing | 1992-06-28 | Paper |
Partitioning circuits for improved testability
Algorithmica | 1991-01-01 | Paper |
Routing multiple paths in hypercubes
Mathematical Systems Theory | 1991-01-01 | Paper |
Universal Graphs for Bounded-Degree Trees and Planar Graphs
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
The complexity of minimizing wire lengths in VLSI layouts
Information Processing Letters | 1987-01-01 | Paper |
A framework for solving VLSI graph layout problems
Journal of Computer and System Sciences | 1984-01-01 | Paper |
