Si-Qing Zheng

Affiliations:
  • University of Texas at Dallas, Department of Computer Science, TX, USA
  • Louisiana State University, Department of Computer Science, Baton Rouge, LA, USA (former)
  • University of California, Santa Barbara, CA, USA (PhD 1987)


According to our database1, Si-Qing Zheng authored at least 159 papers between 1985 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Minimum Edge Length Rectangular Partitions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2016
A Closer Look at GPGPU.
ACM Comput. Surv., 2016

2015
Switch-Centric Data Center Network Structures Based on Hypergraphs and Combinatorial Block Designs.
IEEE Trans. Parallel Distributed Syst., 2015

Implementing High Throughput Contention-Tolerant Crossbar Switch.
J. Commun., 2015

2013
A high-performance switch architecture based on mesh of trees.
Int. J. Commun. Syst., 2013

A new class of data center network structures.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Online System for Grid Resource Monitoring and Machine Learning-Based Prediction.
IEEE Trans. Parallel Distributed Syst., 2012

Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture.
Proceedings of the 13th ACIS International Conference on Software Engineering, 2012

2011
Contention-tolerant crossbar packet switches.
Int. J. Commun. Syst., 2011

A New Model for Energy-Efficient All-Wireless Networks.
Proceedings of the Intelligent Distributed Computing V - Proceedings of the 5th International Symposium on Intelligent Distributed Computing - IDC 2011, Delft, The Netherlands, 2011

2010
Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System.
IEEE Trans. Parallel Distributed Syst., 2010

Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network.
IEEE/ACM Trans. Netw., 2010

A parallel self-routing rearrangeable nonblocking multi-log2 N photonic switching network.
IEEE/ACM Trans. Netw., 2010

An Optimal Wide-Sense Nonblocking Distributor.
IEEE Trans. Computers, 2010

Algorithm-Hardware Codesign of a Fast Parallel Routing Architecture for Clos Networks.
J. Interconnect. Networks, 2010

Energy efficient all-to-all broadcast in all-wireless networks.
Inf. Sci., 2010

Queueing Analysis of Multi-Layer Contention-Tolerant Crossbar Switch.
IEEE Commun. Lett., 2010

An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-Wireless Networks.
Ad Hoc Sens. Wirel. Networks, 2010

Contention-Tolerant Crossbar Packet Switches without and with Speedup.
Proceedings of IEEE International Conference on Communications, 2010

Designing fully distributed scheduling algorithms for contention-tolerant crossbar switches.
Proceedings of the 11th IEEE International Conference on High Performance Switching and Routing, 2010

Making Contention-Tolerant Crossbar Switch Scalable.
Proceedings of the Global Communications Conference, 2010

2009
Opportunistic Optical Hyperchannel and Its Distributed QoS Assuring Access Control.
IEEE Trans. Parallel Distributed Syst., 2009

Fully distributed work-conserving MAC protocols for opportunistic optical hyperchannels.
IEEE Trans. Commun., 2009

Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy.
J. Comb. Optim., 2009

Fast and Noniterative Scheduling in Input-Queued Switches.
Int. J. Commun. Netw. Syst. Sci., 2009

Fast and noniterative scheduling in input-queued switches: Supporting QoS.
Comput. Commun., 2009

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system.
Comput. Electr. Eng., 2009

Impact of Variable Transmission Range in All-Wireless Networks.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
Design and Performance Evaluation of Sequence Partition Algorithms.
J. Comput. Sci. Technol., 2008

Approximating All-to-All Broadcast in Wireless Networks.
Proceedings of the Intelligent Distributed Computing, Systems and Applications, Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, 2008

1-Persistent Collision-Free CSMA Protocols for Opportunistic Optical Hyperchannels.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

Pipelined Implementation of TCAM-Based Search Engines in High-Performance IP Routers.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Maximizing Throughput of an Optical Opportunistic Hyperchannel Subject to QoS Constraint.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007
Minimum-Edge Length Rectangular Partitions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Algorithm-Hardware Codesign of Fast Parallel Round-Robin Arbiters.
IEEE Trans. Parallel Distributed Syst., 2007

Segmentation and recognition of motion streams by similarity search.
ACM Trans. Multim. Comput. Commun. Appl., 2007

Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks.
Int. J. Parallel Emergent Distributed Syst., 2007

A Parallel Scheduler Based on Acyclic Stable Matching.
Int. J. Comput. Their Appl., 2007

A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences.
Proceedings of the Theory and Applications of Models of Computation, 2007

Finding Minimum-Cost Paths with Minimum Sharability.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Hypergraph Algorithms with Network Applications.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2006
Dual-Homing Based Scalable Partia Multicast Protection.
IEEE Trans. Computers, 2006

Scalable and Practical Nonblocking Switching Networks.
J. Comput. Sci. Technol., 2006

Efficient Scheduling for SDMG CIOQ Switches.
IEICE Trans. Commun., 2006

Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations.
Proceedings of the Theory and Applications of Models of Computation, 2006

SLiT (strongly connected light-trail) for WDM rings.
Proceedings of the International Symposium on Computer Networks, 2006

Light-trains: A Cross-Layer Delivery Mechanism for High Bandwidth Applications in Moving Metro-Trains.
Proceedings of IEEE International Conference on Communications, 2006

A Rearrangeable Nonblocking Multi-log2N Multicast Switching Network.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

SMART: An Optical Infrastructure for Future Internet.
Proceedings of the 3rd International Conference on Broadband Communications, 2006

A practical fast parallel routing architecture for Clos networks.
Proceedings of the 2006 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, 2006

Message Scheduling on a Wormhole-Switched Linear Client-Server Network.
Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005
Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks.
IEEE Trans. Parallel Distributed Syst., 2005

Optimal methods for coordinated enroute web caching for tree networks.
ACM Trans. Internet Techn., 2005

Next-generation optical storage area networks: the light-trails approach.
IEEE Commun. Mag., 2005

A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

Virtual Nonblocking Switching Networks.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

Finding Two Disjoint Paths in a Network with Normalized alpha-MIN-SUM Objective Function.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

Scalable and Practical Nonblocking Switching Networks (Extended Abstract).
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars.
Proceedings of the 8th International Symposium on Parallel Architectures, 2005

Finding Two Disjoint Paths in a Network with Normalized <i>alpha</i><sup>+</sup>-MIN-SUM Objective Function.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Similarity measure for multi-attribute data [haptic data recognition].
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004
Classifying Matrices Separating Rows and Columns.
IEEE Trans. Parallel Distributed Syst., 2004

Indexing of variable length multi-attribute motion data.
Proceedings of the Second ACM International Workshop on Multimedia Databases, 2004

Segmentation and recognition of multi-attribute motion sequences.
Proceedings of the 12th ACM International Conference on Multimedia, 2004

Parallel Routing Algorithms for Nonblocking Electronic and Photonic Multistage Switching Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Parallel Routing and Wavelength Assignment for Optical Multistage Interconnection Networks.
Proceedings of the 33rd International Conference on Parallel Processing (ICPP 2004), 2004

Group Switching for DWDM Optical Networks.
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 2004), 2004

Hierarchical scheduling for DiffServ classes.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

A class of self-routing strictly nonblocking photonic switching networks.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

An Optimal Generalized Columnsort Algorithm for a Simplified 2D ARPBS.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches..
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

An Efficient Scheduling Algorithm for CIOQ Switches with Space-Division Multiplexing Expansion.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Scheduling with dynamic bandwidth allocation for DiffServ classes.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

High-speed crosstalk-free routing for optical multistage interconnection networks.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

A Parallel Iterative Improvement Stable Matching Algorithm.
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

Design and implementation of an acyclic stable matching scheduler.
Proceedings of the Global Telecommunications Conference, 2003

2002
Efficient parallel algorithms for distance maps of 2D binary images using an optical bus.
IEEE Trans. Syst. Man Cybern. Part A, 2002

Hardware Scheduling in High-speed, High-capacity IP Routers.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

A Fast Parallel Routing Algorithm for Benes Group Switches.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

t-Error Correcting/ d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes with Neural Network (Part II).
Proceedings of the 2002 International Symposium on Information Technology (ITCC 2002), 2002

Optimized scheduling and mapping of logarithm and arctangent functions on TI TMS320C67X processor.
Proceedings of the IEEE International Conference on Acoustics, 2002

2001
An Improved Generalization of Mesh-Connected Computers with Multiple Buses.
IEEE Trans. Parallel Distributed Syst., 2001

Generalized Coincident Pulse Technique and New Addressing Schemes for Time-Division Multiplexing Optical Buses.
J. Parallel Distributed Comput., 2001

t-Error Correcting/ d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes with Neural Network (Part I).
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

A QoS supporting scheduling algorithm for optical burst switching DWDM networks.
Proceedings of the Global Telecommunications Conference, 2001

2000
An Efficient Parallel VLSI Sorting Architecture.
VLSI Design, 2000

Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems.
J. Supercomput., 2000

An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device.
IEEE Trans. Computers, 2000

Dual of a Complete Graph as an Interconnection Network.
J. Parallel Distributed Comput., 2000

Semigroup and Prefix Computations on Improved Generalized Mesh-Connected Computers with Multiple Buses.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Computing Distance Maps Efficiently Using an Optical Bus.
Proceedings of the Parallel and Distributed Processing, 2000

1999
Finding Combined <i>L</i><sub>1</sub> and Link Metric Shortest Paths in the Presence of Orthogonal Obstacles: A Heuristic Approach.
VLSI Design, 1999

How to Sort <i>N</i> Items Using a Sorting Network of Fixed I/O Size.
IEEE Trans. Parallel Distributed Syst., 1999

An Efficient General In-Place Parallel Sorting Scheme.
J. Supercomput., 1999

Constructing Optimal Search Trees in Optimal Time.
IEEE Trans. Computers, 1999

Parallel Matrix Computations Using a Reconfigurable Pipelined Optical Bus.
J. Parallel Distributed Comput., 1999

Efficient Algorithms for Fault-Tolerant Communication in Optical WDM Networks.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

An Optimal Hardware-Algorithm for Selection Using a Fixed-Size Parallel Classifier Device.
Proceedings of the High Performance Computing, 1999

Separators Are as Simple as Cutsets.
Proceedings of the Advances in Computing Science, 1999

1998
On Ensuring Multilayer Wirability by Stretching Layouts.
VLSI Design, 1998

Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System.
IEEE Trans. Parallel Distributed Syst., 1998

A Symmetric Processor Array with Synchronous Optical Buses and Switches.
Parallel Process. Lett., 1998

Fast nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System.
Parallel Algorithms Appl., 1998

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks.
J. Parallel Distributed Comput., 1998

An Optical Interconnection Structure Based on the Dual of a Hypercube.
Informatica (Slovenia), 1998

Constructing optical networks using combinatorial designs.
Proceedings of the Robust Communication Networks: Interconnection and Survivability, 1998

1997
A Partitionability of Interconnection Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Simulation of Parallel Random Access Machines on Linear Arrays with Reconfigurable Pipelined Bus Systems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

A Study of Average-Case Speedup and Scalability of Parallel Computations on Static Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

A Pipelined TDM Optical Bus with Improved Performance.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Performance analysis for dynamic tree embedding in k-partite networks by random walk.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996
Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes.
IEEE Trans. Parallel Distributed Syst., 1996

Finding obstacle-avoiding shortest paths using implicit connection graphs.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996

Planar Convex Hull Algorithms on Linear Arrays.
Parallel Algorithms Appl., 1996

Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs.
Networks, 1996

The Bus-Connected Ringed Tree: A Versatile Interconnection Network.
J. Parallel Distributed Comput., 1996

Routing using implicit connection graphs [VLSI design.
Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

Sorting N items using a p-sorter in optimal time.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Efficient in-place sorting algorithms using feasible parallel machine models.
Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

Algorithms for Sorting Arbitrary InputUsing a Fixed-Size Parallel Sorting Device.
Proceedings of the 1996 International Conference on Parallel Processing, 1996

1995
Trade-Off Considerations in Designing Efficient VLSI Feasible Interconnection Networks.
VLSI Design, 1995

Improved recursive bisection line drawing algorithms.
Comput. Graph., 1995

Design and analysis of a systolic sorting architecture.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Constructing Hypernetworks Using Dual Hypergraphs.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

A Generalized Approach for Computing Convex Hulls Using Linear Arrays.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

Sparse Hypernetworks Based on Steiner Triple Systems.
Proceedings of the 1995 International Conference on Parallel Processing, 1995

1994
Preface.
VLSI Design, 1994

Compressed Tree Machines.
IEEE Trans. Computers, 1994

Single phase three-layer channel routing algorithms.
Integr., 1994

On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.
Comput. Geom., 1994

1993
A new representation of binary search trees.
Inf. Sci., 1993

An efficient divide and conquer approximation algorithm for partitionning into D-boxes.
Int. J. Comput. Geom. Appl., 1993

Euclidean Shortest Path Problem with Rectilinear Obstacles.
Proceedings of the Sixth International Conference on VLSI Design, 1993

Sparse Hypercube-Like Interconnection Networks.
Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993

Time-Space Optimal Convex Hull Algorithms.
Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993

On Simulations of Linear Arrays, Rings, and 2-D Meshes on Fibonacci Cube Networks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Bus-Based Tree Structures for Efficient Parallel Computation.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

A potential-driven approach to constructing rectilinear Steiner trees.
Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

Switch-Box Routing under the two-Overlap wiring Model.
Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

1992
Grid stretching algorithms for routing multiterminal nets through a rectangle.
Integr., 1992

Near-optimal triangulation of a point set by simulated annealing.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

An efficient algorithm for sparse matrix computations.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

Constructing Voronoi Diagram of a Point Set on Mesh of Trees.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

An Efficient Line Drawing Algorithm for Parallel Machines.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

An Optimal Algorithm for Finding Maximum Induced Bipartitie Subgraphs of Circular-Arc Graphs.
Proceedings of the Computing and Information, 1992

Optimal Ring Embedding in Hypercubes with Faulty Links.
Proceedings of the Digest of Papers: FTCS-22, 1992

A simplified optimal algorithm for constructing the convex hull of a simple polygon.
Proceedings of the 30th Annual Southeast Regional Conference, 1992

On constructing minimum height <i>B</i>*-trees in optimal time.
Proceedings of the 30th Annual Southeast Regional Conference, 1992

1991
A general greedy channel routing algorithm.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991

SIMD Data Communication Algorithms for Multiply Twisted Hypercubes.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

1990
Approximation Algorithms for Partitioning a Rectangle with Interior Points.
Algorithmica, 1990

Multiterminal-net routing by grid stretching.
Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990

1989
Inproved Bounds for Rectangular and Guillotine Partitions.
J. Symb. Comput., 1989

Stretching and three-layer wiring planar layouts.
Integr., 1989

A Simple and Powerful Representation of Binary Search Trees.
Proceedings of the Computing in the 90's, 1989

1988
Simple Three-Layer Channel Routing Algorithms.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1985
Bounds for partitioning rectilinear polygons.
Proceedings of the First Annual Symposium on Computational Geometry, 1985


  Loading...