S. Q. Zheng

Available identifiers

zbMath Open zheng.si-qingMaRDI QIDQ1123612

List of research outcomes

Publication	Date of Publication	Type
An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device	2018-07-09	Paper
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system	2009-11-27	Paper
Traffic regulation with single- and dual-homed isps under a percentile-based pricing policy	2009-10-09	Paper
High Performance Computing - HiPC 2003	2009-08-11	Paper
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences	2007-11-13	Paper
Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks	2007-05-09	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Algorithms and Computation	2006-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q4532754	2002-11-06	Paper
Generalized coincident pulse technique and new addressing schemes for time-division multiplexing optical buses	2002-07-22	Paper
A study of average-case speedup and scalability of parallel computations on static networks	2002-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q4501593	2001-03-12	Paper
Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems	2000-09-19	Paper
Single phase three-layer channel routing algorithms	2000-07-06	Paper
FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM	1999-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4247294	1999-06-16	Paper
Lower bounds for dynamic tree embedding in bipartite networks	1999-01-06	Paper
Performance analysis for dynamic tree embedding in \(k\)-partite networks by a random walk	1998-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q5284016	1997-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q4893434	1996-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q3136965	1994-12-04	Paper
On optimal guillotine partitions approximating optimal \(d\)-box partitions	1994-06-15	Paper
AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES	1994-05-26	Paper
A new representation of binary search trees	1994-01-13	Paper
https://portal.mardi4nfdi.de/entity/Q3139279	1993-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4028506	1993-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q4028464	1993-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q4028492	1993-03-28	Paper
Grid stretching algorithms for routing multiterminal nets through a rectangle	1993-01-12	Paper
Approximation algorithms for partitioning a rectangle with interior points	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4206398	1990-01-01	Paper
Improved bounds for rectangular and guillotine partitions	1989-01-01	Paper

Research outcomes over time

This page was built for person: S. Q. Zheng