![]() | ![]() |
S. Q. Zheng
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
110 | EE | Doina Bein, Ajoy Kumar Datta, Prathima Sajja, Si-Qing Zheng: Impact of Variable Transmission Range in All-Wireless Networks. HICSS 2009: 1-10 |
109 | EE | Kevin F. Chen, Edwin Hsing-Mean Sha, Si-Qing Zheng: Fast and noniterative scheduling in input-queued switches: Supporting QoS. Computer Communications 32(5): 834-846 (2009) |
108 | EE | Jianping Wang, Jing Chen, Mei Yang, S. Q. Zheng: Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy. J. Comb. Optim. 17(3): 247-273 (2009) |
2008 | ||
107 | Anu G. Bourgeois, Si-Qing Zheng: Algorithms and Architectures for Parallel Processing, 8th International Conference, ICA3PP 2008, Cyprus, June 9-11, 2008, Proceedings Springer 2008 | |
106 | EE | Hui Yu, Jing Chen, Jianping Wang, Si-Qing Zheng: Pipelined Implementation of TCAM-Based Search Engines in High-Performance IP Routers. GLOBECOM 2008: 2329-2333 |
105 | EE | Jing Chen, Jianping Wang, Hui Yu, Si-Qing Zheng: Maximizing Throughput of an Optical Opportunistic Hyperchannel Subject to QoS Constraint. GLOBECOM 2008: 2670-2674 |
104 | EE | Jing Chen, Jianping Wang, Hui Yu, Ashwin Gumaste, Si-Qing Zheng: 1-Persistent Collision-Free CSMA Protocols for Opportunistic Optical Hyperchannels. ICA3PP 2008: 144-156 |
103 | EE | Doina Bein, Si-Qing Zheng: An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-Wireless Networks. ICDCS Workshops 2008: 273-278 |
102 | EE | Doina Bein, S. Q. Zheng: Approximating All-to-All Broadcast in Wireless Networks. IDC 2008: 65-74 |
101 | EE | Bing Yang, Jing Chen, Enyue Lu, Si-Qing Zheng: Design and Performance Evaluation of Sequence Partition Algorithms. J. Comput. Sci. Technol. 23(5): 711-718 (2008) |
2007 | ||
100 | David S. Munro, Hong Shen, Quan Z. Sheng, Henry Detmold, Katrina E. Falkner, Cruz Izu, Paul D. Coddington, Bradley Alexander, Si-Qing Zheng: Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007), 3-6 December 2007, Adelaide, Australia IEEE Computer Society 2007 | |
99 | S. Q. Zheng, Shaoyang Liu: Hypergraph Algorithms with Network Applications. FCS 2007: 349-355 | |
98 | Bing Yang, S. Q. Zheng, Enyue Lu: Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function. FCS 2007: 356-361 | |
97 | EE | Si-Qing Zheng, Bing Yang, Mei Yang, Jianping Wang: Finding Minimum-Cost Paths with Minimum Sharability. INFOCOM 2007: 1532-1540 |
96 | EE | Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng: A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. TAMC 2007: 46-57 |
95 | Enyue Lu, Mei Yang, S. Q. Zheng, Shankar N. Neelakrishnan, Ju-Yeon Jo: A Parallel Scheduler Based on Acyclic Stable Matching. I. J. Comput. Appl. 14(2): 109-115 (2007) | |
94 | EE | Si-Qing Zheng, Mei Yang: Algorithm-Hardware Codesign of Fast Parallel Round-Robin Arbiters. IEEE Trans. Parallel Distrib. Syst. 18(1): 84-95 (2007) |
93 | EE | Enyue Lu, S. Q. Zheng: Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks. IJPEDS 22(1): 39-58 (2007) |
92 | EE | Chuanjun Li, S. Q. Zheng, B. Prabhakaran: Segmentation and recognition of motion streams by similarity search. TOMCCAP 3(3): (2007) |
2006 | ||
91 | EE | Si-Qing Zheng, Ashwin Gumaste, Enyue Lu: A practical fast parallel routing architecture for Clos networks. ANCS 2006: 21-30 |
90 | EE | Si-Qing Zheng, Ashwin Gumaste: SMART: An Optical Infrastructure for Future Internet. BROADNETS 2006 |
89 | EE | Si-Qing Zheng, Ashwin Gumaste, Hong Shen: A Rearrangeable Nonblocking Multi-log2N Multicast Switching Network. GLOBECOM 2006 |
88 | Bing Yang, Ashwin Gumaste, Enyue Lu, Si-Qing Zheng: Message Scheduling on a Wormhole-Switched Linear Client-Server Network. ISCA PDCS 2006: 146-151 | |
87 | EE | Ashwin Gumaste, Nasir Ghani, Shakesh Jain, Si-Qing Zheng: SLiT (strongly connected light-trail) for WDM rings. ISCN 2006: 152-157 |
86 | EE | Bing Yang, S. Q. Zheng: Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. TAMC 2006: 206-216 |
85 | EE | Jianping Wang, Mei Yang, Bin Yang, S. Q. Zheng: Dual-Homing Based Scalable Partia Multicast Protection. IEEE Trans. Computers 55(9): 1130-1141 (2006) |
84 | EE | Mei Yang, Si-Qing Zheng: Efficient Scheduling for SDMG CIOQ Switches. IEICE Transactions 89-B(9): 2457-2468 (2006) |
83 | EE | Si-Qing Zheng, Ashwin Gumaste: Scalable and Practical Nonblocking Switching Networks. J. Comput. Sci. Technol. 21(4): 466-475 (2006) |
2005 | ||
82 | S. Q. Zheng: International Conference on Parallel and Distributed Computing Systems, PDCS 2005, November 14-16, 2005, Phoenix, AZ, USA IASTED/ACTA Press 2005 | |
81 | Bing Yang, S. Q. Zheng, Enyue Lu: Finding Two Disjoint Paths in a Network with Normalized alpha-MIN-SUM Objective Function. IASTED PDCS 2005: 342-348 | |
80 | Si-Qing Zheng, Ashwin Gumaste: Virtual Nonblocking Switching Networks. IASTED PDCS 2005: 742-748 | |
79 | EE | Bing Yang, S. Q. Zheng, Enyue Lu: Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function. ISAAC 2005: 954-963 |
78 | EE | Kevin F. Chen, Edwin Hsing-Mean Sha, S. Q. Zheng: A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars. ISPAN 2005: 230-235 |
77 | EE | Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng: Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. ISPAN 2005: 334-339 |
76 | EE | S. Q. Zheng: Scalable and Practical Nonblocking Switching Networks (Extended Abstract). PDCAT 2005: 8-10 |
75 | Enyue Lu, S. Q. Zheng, Bing Yang: A Fast Parallel Routing Algorithm for Strictly Nonblocking Switching Networks. PDPTA 2005: 91-97 | |
74 | EE | Keqiu Li, Hong Shen, Francis Y. L. Chin, Si-Qing Zheng: Optimal methods for coordinated enroute web caching for tree networks. ACM Trans. Internet Techn. 5(3): 480-507 (2005) |
73 | EE | Enyue Lu, S. Q. Zheng: Parallel Routing Algorithms for Nonblocking Electronic and Photonic Switching Networks. IEEE Trans. Parallel Distrib. Syst. 16(8): 702-713 (2005) |
2004 | ||
72 | EE | Chuanjun Li, Peng Zhai, Si-Qing Zheng, Balakrishnan Prabhakaran: Segmentation and recognition of multi-attribute motion sequences. ACM Multimedia 2004: 836-843 |
71 | Yuanyuan Yang, S. Q. Zheng, Dominique Verchère: Group Switching for DWDM Optical Networks. ICCCN 2004: 193-198 | |
70 | EE | Enyue Lu, S. Q. Zheng: Parallel Routing and Wavelength Assignment for Optical Multistage Interconnection Networks. ICPP 2004: 214-221 |
69 | EE | Enyue Lu, S. Q. Zheng: Parallel Routing Algorithms for Nonblocking Electronic and Photonic Multistage Switching Networks. IPDPS 2004 |
68 | Min He, Si-Qing Zheng: An Optimal Generalized Columnsort Algorithm for a Simplified 2D ARPBS. ISCA PDCS 2004: 33-38 | |
67 | EE | Chuanjun Li, Gaurav N. Pradhan, Si-Qing Zheng, B. Prabhakaran: Indexing of variable length multi-attribute motion data. MMDB 2004: 75-84 |
66 | EE | Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: Classifying Matrices Separating Rows and Columns. IEEE Trans. Parallel Distrib. Syst. 15(7): 654-665 (2004) |
2003 | ||
65 | EE | Enyue Lu, S. Q. Zheng: A Parallel Iterative Improvement Stable Matching Algorithm. HiPC 2003: 55-65 |
64 | EE | Mei Yang, Si-Qing Zheng: An Efficient Scheduling Algorithm for CIOQ Switches with Space-Division Multiplexing Expansion. INFOCOM 2003 |
63 | EE | Mei Yang, Si-Qing Zheng: Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches.. ISCC 2003: 521-526 |
2002 | ||
62 | Si-Qing Zheng, Mei Yang, Francesco Masetti: Hardware Scheduling in High-speed, High-capacity IP Routers. IASTED PDCS 2002: 631-636 | |
61 | Enyue Lu, S. Q. Zheng: A Fast Parallel Routing Algorithm for Benes Group Switches. IASTED PDCS 2002: 67-72 | |
60 | EE | Maung Maung Htay, S. Sitharama Iyengar, Si-Qing Zheng: t-Error Correcting/ d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes with Neural Network (Part II). ITCC 2002: 383-389 |
59 | Yi Pan, Yamin Li, Jie Li, Keqin Li, Si-Qing Zheng: Efficient parallel algorithms for distance maps of 2D binary images using an optical bus. IEEE Transactions on Systems, Man, and Cybernetics, Part A 32(2): 228-236 (2002) | |
2001 | ||
58 | EE | Maung Maung Htay, S. Sitharama Iyengar, Si-Qing Zheng: t-Error Correcting/ d-Error Detecting (d>t) and All Unidirectional Error Detecting Codes with Neural Network (Part I). ITCC 2001: 529-536 |
57 | EE | Yi Pan, Si-Qing Zheng, Keqin Li, Hong Shen: An Improved Generalization of Mesh-Connected Computers with Multiple Buses. IEEE Trans. Parallel Distrib. Syst. 12(3): 293-305 (2001) |
56 | EE | Si-Qing Zheng, Keqin Li, Yi Pan, Maria Cristina Pinotti: Generalized Coincident Pulse Technique and New Addressing Schemes for Time-Division Multiplexing Optical Buses. J. Parallel Distrib. Comput. 61(8): 1033-1051 (2001) |
2000 | ||
55 | EE | Yi Pan, Si-Qing Zheng, Keqin Li, Hong Shen: Semigroup and Prefix Computations on Improved Generalized Mesh-Connected Computers with Multiple Buses. IPDPS 2000: 251-256 |
54 | EE | Yi Pan, Yamin Li, Jie Li, Keqin Li, Si-Qing Zheng: Computing Distance Maps Efficiently Using an Optical Bus. IPDPS Workshops 2000: 178-185 |
53 | EE | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device. IEEE Trans. Computers 49(12): 1310-1324 (2000) |
52 | Si-Qing Zheng, Jie Wu: Dual of a Complete Graph as an Interconnection Network. J. Parallel Distrib. Comput. 60(8): 1028-1046 (2000) | |
51 | EE | Keqin Li, Yi Pan, Si-Qing Zheng: Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems. The Journal of Supercomputing 15(2): 163-181 (2000) |
1999 | ||
50 | EE | Hong Shen, Keqin Li, Si-Qing Zheng: Separators Are as Simple as Cutsets. ASIAN 1999: 347-358 |
49 | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: An Optimal Hardware-Algorithm for Selection Using a Fixed-Size Parallel Classifier Device. HiPC 1999: 284-288 | |
48 | EE | Hong Shen, Keqin Li, Yi Pan, Si-Qing Zheng: Efficient Algorithms for Fault-Tolerant Communication in Optical WDM Networks. ISPAN 1999: 119-124 |
47 | Si-Qing Zheng, M. Sun: Constructing Optimal Search Trees in Optimal Time. IEEE Trans. Computers 48(7): 738-743 (1999) | |
46 | EE | Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng: How to Sort N Items Using a Sorting Network of Fixed I/O Size. IEEE Trans. Parallel Distrib. Syst. 10(5): 487-499 (1999) |
45 | Keqin Li, Yi Pan, Si-Qing Zheng: Parallel Matrix Computations Using a Reconfigurable Pipelined Optical Bus. J. Parallel Distrib. Comput. 59(1): 13-30 (1999) | |
44 | EE | S. Q. Zheng, Balaji Calidas, Yanjun Zhang: An Efficient General In-Place Parallel Sorting Scheme. The Journal of Supercomputing 14(1): 5-17 (1999) |
1998 | ||
43 | EE | Keqin Li, Yi Pan, Si-Qing Zheng: Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System. IEEE Trans. Parallel Distrib. Syst. 9(8): 705-720 (1998) |
42 | Yueming Li, Si-Qing Zheng, Jie Wu: An Optical Interconnection Structure Based on the Dual of a Hypercube. Informatica (Slovenia) 22(4): (1998) | |
41 | Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-Qing Zheng: Lower Bounds for Dynamic Tree Embedding in Bipartite Networks. J. Parallel Distrib. Comput. 53(2): 119-143 (1998) | |
40 | EE | Yi Pan, Keqin Li, Si-Qing Zheng: Fast nearest Neighbor Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System. Parallel Algorithms Appl. 13(1): 1-25 (1998) |
39 | Yueming Li, Jianhui Tao, Si-Qing Zheng: A Symmetric Processor Array with Synchronous Optical Buses and Switches. Parallel Processing Letters 8(3): 283-295 (1998) | |
1997 | ||
38 | EE | Yi Pan, Keqin Li, Si-Qing Zheng: Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system. ISPAN 1997: 444-450 |
37 | EE | Hong Shen, Keqin Li, Yi Pan, Gilbert H. Young, Si-Qing Zheng: Performance analysis for dynamic tree embedding in k-partite networks by random walk. ISPAN 1997: 451-457 |
36 | EE | Si-Qing Zheng, Yueming Li: A Pipelined TDM Optical Bus with Improved Performance. ISPAN 1997: 49-55 |
35 | Si-Qing Zheng, Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young: A Partitionability of Interconnection Networks. PDPTA 1997: 1349-1355 | |
34 | Keqin Li, Yi Pan, Hong Shen, Si-Qing Zheng: A Study of Average-Case Speedup and Scalability of Parallel Computations on Static Networks. PDPTA 1997: 1362- | |
33 | Keqin Li, Yi Pan, Si-Qing Zheng: Simulation of Parallel Random Access Machines on Linear Arrays with Reconfigurable Pipelined Bus Systems. PDPTA 1997: 590-599 | |
1996 | ||
32 | Si-Qing Zheng: Algorithms for Sorting Arbitrary InputUsing a Fixed-Size Parallel Sorting Device. ICPP, Vol. 2 1996: 95-99 | |
31 | EE | S. Q. Zheng, Balaji Calidas, Yanjun Zhang: Efficient in-place sorting algorithms using feasible parallel machine models. ISPAN 1996: 15-21 |
30 | EE | Si-Qing Zheng, Joon Shik Lim, S. Sitharama Iyengar: Routing using implicit connection graphs [VLSI design. VLSI Design 1996: 49-52 |
29 | EE | Si-Qing Zheng, Shahram Latifi: Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes. IEEE Trans. Parallel Distrib. Syst. 7(6): 612-619 (1996) |
28 | EE | Si-Qing Zheng, Joon Shik Lim, S. Sitharama Iyengar: Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Trans. on CAD of Integrated Circuits and Systems 15(1): 103-110 (1996) |
27 | Omkar M. Dighe, Ramachandran Vaidyanathan, Si-Qing Zheng: The Bus-Connected Ringed Tree: A Versatile Interconnection Network. J. Parallel Distrib. Comput. 33(2): 189-196 (1996) | |
26 | EE | Si-Qing Zheng: Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. Networks 28(1): 15-19 (1996) |
25 | EE | Doris L. Carver, Jigang Liu, S. Q. Zheng: Planar Convex Hull Algorithms on Linear Arrays. Parallel Algorithms Appl. 10(1-2): 59-70 (1996) |
1995 | ||
24 | Si-Qing Zheng: Sparse Hypernetworks Based on Steiner Triple Systems. ICPP (1) 1995: 92-95 | |
23 | S. Q. Zheng, G. Wang: Constructing Hypernetworks Using Dual Hypergraphs. Parallel and Distributed Computing and Systems 1995: 167-169 | |
22 | Jigang Liu, Doris L. Carver, Si-Qing Zheng: A Generalized Approach for Computing Convex Hulls Using Linear Arrays. Parallel and Distributed Computing and Systems 1995: 269-272 | |
21 | EE | Phil Graham, S. Sitharama Iyengar, Si-Qing Zheng: Improved recursive bisection line drawing algorithms. Computers & Graphics 19(6): 847-860 (1995) |
1994 | ||
20 | Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng: On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. Comput. Geom. 4: 1-11 (1994) | |
19 | Si-Qing Zheng: Compressed Tree Machines. IEEE Trans. Computers 43(2): 222-225 (1994) | |
1993 | ||
18 | Omkar M. Dighe, Ramachandran Vaidyanathan, Si-Qing Zheng: Bus-Based Tree Structures for Efficient Parallel Computation. ICPP 1993: 158-161 | |
17 | Bin Cong, Si-Qing Zheng, Sanjay Sharma: On Simulations of Linear Arrays, Rings, and 2-D Meshes on Fibonacci Cube Networks. IPPS 1993: 748-751 | |
16 | EE | Hla Min, Si-Qing Zheng: Time-Space Optimal Convex Hull Algorithms. SAC 1993: 687-693 |
15 | EE | Si-Qing Zheng, Shahram Latifi, E. K. Park: Sparse Hypercube-Like Interconnection Networks. SAC 1993: 694-700 |
14 | Joon Shik Lim, S. Sitharama Iyengar, Si-Qing Zheng: Euclidean Shortest Path Problem with Rectilinear Obstacles. VLSI Design 1993: 90-93 | |
13 | EE | Si-Qing Zheng: A new representation of binary search trees. Inf. Sci. 74(3): 275-282 (1993) |
12 | Teofilo F. Gonzalez, Si-Qing Zheng: An efficient divide and conquer approximation algorithm for partitionning into D-boxes. Int. J. Comput. Geometry Appl. 3(4): 417-428 (1993) | |
1992 | ||
11 | EE | Jigang Liu, Si-Qing Zheng: A simplified optimal algorithm for constructing the convex hull of a simple polygon. ACM Southeast Regional Conference 1992: 453-456 |
10 | Shahram Latifi, Si-Qing Zheng, Nader Bagherzadeh: Optimal Ring Embedding in Hypercubes with Faulty Links. FTCS 1992: 178-184 | |
9 | Si-Qing Zheng: An Optimal Algorithm for Finding Maximum Induced Bipartitie Subgraphs of Circular-Arc Graphs. ICCI 1992: 50-53 | |
8 | Phil Graham, S. Sitharama Iyengar, Si-Qing Zheng: An Efficient Line Drawing Algorithm for Parallel Machines. ICPIA 1992: 113-132 | |
7 | Fenglien Lee, Si-Qing Zheng: Constructing Voronoi Diagram of a Point Set on Mesh of Trees. ICPP (3) 1992: 136-140 | |
1991 | ||
6 | Si-Qing Zheng: SIMD Data Communication Algorithms for Multiply Twisted Hypercubes. IPPS 1991: 120-125 | |
5 | EE | Tai-Tsung Ho, S. Sitharama Iyengar, Si-Qing Zheng: A general greedy channel routing algorithm. IEEE Trans. on CAD of Integrated Circuits and Systems 10(2): 204-211 (1991) |
1990 | ||
4 | Teofilo F. Gonzalez, Si-Qing Zheng: Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica 5(1): 11-42 (1990) | |
1989 | ||
3 | Si-Qing Zheng: A Simple and Powerful Representation of Binary Search Trees. Great Lakes Computer Science Conference 1989: 192-198 | |
2 | Teofilo F. Gonzalez, Si-Qing Zheng: Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. 7(6): 591-610 (1989) | |
1988 | ||
1 | Teofilo F. Gonzalez, Si-Qing Zheng: Simple Three-Layer Channel Routing Algorithms. AWOC 1988: 237-246 |