| Publication | Date of Publication | Type |
|---|
An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device
IEEE Transactions on Computers | 2018-07-09 | Paper |
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system
Computers and Electrical Engineering | 2009-11-27 | Paper |
Traffic regulation with single- and dual-homed isps under a percentile-based pricing policy
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
High Performance Computing - HiPC 2003
Lecture Notes in Computer Science | 2009-08-11 | Paper |
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks
International Journal of Parallel, Emergent and Distributed Systems | 2007-05-09 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
| scientific article; zbMATH DE number 1750105 (Why is no real title available?) | 2002-11-06 | Paper |
Generalized coincident pulse technique and new addressing schemes for time-division multiplexing optical buses
Journal of Parallel and Distributed Computing | 2002-07-22 | Paper |
A study of average-case speedup and scalability of parallel computations on static networks
Mathematical and Computer Modelling | 2002-05-05 | Paper |
| scientific article; zbMATH DE number 1500572 (Why is no real title available?) | 2001-03-12 | Paper |
Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
The Journal of Supercomputing | 2000-09-19 | Paper |
Single phase three-layer channel routing algorithms
Integration | 2000-07-06 | Paper |
FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
Parallel Algorithms and Applications | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1302051 (Why is no real title available?) | 1999-06-16 | Paper |
Lower bounds for dynamic tree embedding in bipartite networks
Journal of Parallel and Distributed Computing | 1999-01-06 | Paper |
Performance analysis for dynamic tree embedding in k-partite networks by a random walk
Journal of Parallel and Distributed Computing | 1998-11-01 | Paper |
| scientific article; zbMATH DE number 975346 (Why is no real title available?) | 1997-05-11 | Paper |
| scientific article; zbMATH DE number 922865 (Why is no real title available?) | 1996-11-20 | Paper |
| scientific article; zbMATH DE number 426142 (Why is no real title available?) | 1994-12-04 | Paper |
On optimal guillotine partitions approximating optimal \(d\)-box partitions
Computational Geometry | 1994-06-15 | Paper |
AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES
International Journal of Computational Geometry & Applications | 1994-05-26 | Paper |
A new representation of binary search trees
Information Sciences | 1994-01-13 | Paper |
| scientific article; zbMATH DE number 434488 (Why is no real title available?) | 1993-11-18 | Paper |
| scientific article; zbMATH DE number 140125 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140089 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140114 (Why is no real title available?) | 1993-03-28 | Paper |
Grid stretching algorithms for routing multiterminal nets through a rectangle
Integration | 1993-01-12 | Paper |
| scientific article; zbMATH DE number 4126697 (Why is no real title available?) | 1990-01-01 | Paper |
Approximation algorithms for partitioning a rectangle with interior points
Algorithmica | 1990-01-01 | Paper |
Improved bounds for rectangular and guillotine partitions
Journal of Symbolic Computation | 1989-01-01 | Paper |
