2003 |
49 | EE | Ching Law,
Kai-Yeung Siu:
Distributed Construction of Random Expander Networks.
INFOCOM 2003 |
48 | EE | Kayi Lee,
Kai-Yeung Siu:
On the reconfigurability of single-hub WDM ring networks.
IEEE/ACM Trans. Netw. 11(2): 273-284 (2003) |
47 | EE | Saad Mneimneh,
Kai-Yeung Siu:
On achieving throughput in an input-queued switch.
IEEE/ACM Trans. Netw. 11(5): 858-867 (2003) |
46 | EE | Ching Law,
Amar K. Mehta,
Kai-Yeung Siu:
A New Bluetooth Scatternet Formation Protocol.
MONET 8(5): 485-498 (2003) |
2002 |
45 | EE | Saad Mneimneh,
Vishal Sharma,
Kai-Yeung Siu:
Switching using parallel input-output queued switches with no speedup.
IEEE/ACM Trans. Netw. 10(5): 653-665 (2002) |
2001 |
44 | EE | Ching Law,
Amar K. Mehta,
Kai-Yeung Siu:
Performance of a new Bluetooth scatternet formation protocol.
MobiHoc 2001: 183-192 |
43 | EE | Paolo Narváez,
Kai-Yeung Siu,
Hong-Yi Tzeng:
New dynamic SPT algorithm based on a ball-and-string model.
IEEE/ACM Trans. Netw. 9(6): 706-718 (2001) |
2000 |
42 | EE | Ching Law,
Kayi Lee,
Kai-Yeung Siu:
Efficient memoryless protocol for tag identification.
DIAL-M 2000: 75-84 |
41 | EE | Paolo Narváez,
Kai-Yeung Siu,
Hong-Yi Tzeng:
New dynamic algorithms for shortest path tree computation.
IEEE/ACM Trans. Netw. 8(6): 734-746 (2000) |
1999 |
40 | EE | Craig Barrack,
Kai-Yeung Siu:
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks.
ICNP 1999: 245-253 |
39 | | Paolo Narváez,
Kai-Yeung Siu,
Hong-Yi Tzeng:
New Dynamic SPT Algorithm Based on a Ball-and-String Model.
INFOCOM 1999: 973-981 |
38 | EE | Wenge Ren,
Kai-Yeung Siu,
Hiroshi Suzuki:
Excess buffer requirement for EPD schemes in ATM networks.
Computer Communications 22(15-16): 1367-1381 (1999) |
1998 |
37 | EE | Anthony C. Kam,
Kai-Yeung Siu:
Linear Complexity Algorithms for Bandwidth Reservations and Delay Guarantees in Input-Queued Switches with No Speedup.
ICNP 1998: 2-11 |
36 | EE | Paolo Narváez,
Kai-Yeung Siu:
New Techniques for Regulating TCP Flow over Heterogeneous Networks.
LCN 1998: 42-51 |
35 | EE | Hong-Yi Tzeng,
Kai-Yeung Siu:
Performance of TCP over UBR in ATM with EPD and virtual queuing techniques.
Computer Communications 21(12): 1070-1079 (1998) |
34 | EE | Wenge Ren,
Kai-Yeung Siu,
Hiroshi Suzuki,
Gopalakrishnan Ramamurthy:
Performance of TCP in IP/ATM internetworks.
Computer Communications 21(17): 1610-1623 (1998) |
33 | EE | Paolo Narváez,
Kai-Yeung Siu:
Acknowledgment Bucket Scheme for Regulating TCP Flow over ATM.
Computer Networks 30(19): 1775-1791 (1998) |
32 | EE | Wenge Ren,
Kai-Yeung Siu,
Hiroshi Suzuki,
Masayuki Shinohara:
Meltipoint-to-Multipoint ABR Service in ATM.
Computer Networks 30(19): 1793-1810 (1998) |
1997 |
31 | | Wenge Ren,
Kai-Yeung Siu,
Hiroshi Suzuki:
Multipoint-to-Point ABR Service in ATM Networks.
ICC (3) 1997: 1185-1190 |
30 | EE | Yuan Wu,
Kai-Yeung Siu,
Wenge Ren:
Improved virtual queueing and dynamic EPD techniques for TCP over ATM.
ICNP 1997: 212-219 |
29 | EE | Paolo Narváez,
Kai-Yeung Siu:
Optimal Feedback Control for ABR Service in ATM.
ICNP 1997: 32- |
28 | | Hong-Yi Tzeng,
Kai-Yeung Siu:
On Max-Min Fair Congestion Control for Multicast ABR Service in ATM.
IEEE Journal on Selected Areas in Communications 15(3): 545-556 (1997) |
1996 |
27 | | Hongqing Li,
Kai-Yeung Siu,
Hong-Yi Tzeng,
Chinatsu Ikeda,
Hiroshi Suzuki:
A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services.
INFOCOM 1996: 1269-1276 |
26 | EE | Kai-Yeung Siu,
Hong-Yi Tzeng:
Performance of TCP over ATM with time-varying available bandwidth.
Computer Communications 19(11): 927-936 (1996) |
25 | EE | Hongqing Li,
Kai-Yeung Siu,
Hong-Yi Tzeng,
Chinatsu Ikeda,
Hiroshi Suzuki:
On TCP performance in ATM networks with per-VC early packet discard mechanisms.
Computer Communications 19(13): 1065-1076 (1996) |
24 | | Haigeng Wang,
Alexandru Nicolau,
Kai-Yeung Siu:
The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints.
IEEE Trans. Computers 45(11): 1257-1271 (1996) |
23 | EE | Haigeng Wang,
Alexandru Nicolau,
Stephen Keung,
Kai-Yeung Siu:
Computing Programs Containing Band Linear Recurrences on Vector Supercomputers.
IEEE Trans. Parallel Distrib. Syst. 7(8): 769-782 (1996) |
1995 |
22 | EE | Kai-Yeung Siu,
Hong-Yi Tzeng:
How Effective Are One-bit Protocols?
FTDCS 1995: 135-142 |
21 | EE | Stephen Keung,
Kai-Yeung Siu:
Efficient protocols secure against guessing and replay attacks.
ICCCN 1995: 105 |
20 | EE | Kai-Yeung Siu,
Hong-Yi Tzeng:
On the Latency in Client/Server Networks.
ICCCN 1995: 88 |
19 | | Hong-Yi Tzeng,
Kai-Yeung Siu:
On the Message and Time Complexity of Protocols for Reliable Broadcasts/Multicasts in Networks with Omission Failures.
IEEE Journal on Selected Areas in Communications 13(7): 1296-1308 (1995) |
18 | | Hong-Yi Tzeng,
Kai-Yeung Siu:
Message-Optimal Protocols for Fault-Tolerant Broadcasts/Multicasts in Distributed Systems with Crash Failures.
IEEE Trans. Computers 44(2): 346-352 (1995) |
17 | | Vwani P. Roychowdhury,
Kai-Yeung Siu,
Alon Orlitsky,
Thomas Kailath:
Vector Analysis of Threshold Functions
Inf. Comput. 120(1): 22-31 (1995) |
1994 |
16 | | Haigeng Wang,
Alexandru Nicolau,
Stephen Keung,
Kai-Yeung Siu:
Scalable Techniques for Computing Band Linear Recurrences on Massively Parallel and Vector Supercomputers.
IPPS 1994: 502-508 |
15 | | Kai-Yeung Siu,
Vwani P. Roychowdhury,
Thomas Kailath:
Rational approximation techniques for analysis of neural networks.
IEEE Transactions on Information Theory 40(2): 455-466 (1994) |
14 | | Vwani P. Roychowdhury,
Alon Orlitsky,
Kai-Yeung Siu:
Lower bounds on threshold and related circuits via communication complexity.
IEEE Transactions on Information Theory 40(2): 467-474 (1994) |
13 | | Kai-Yeung Siu,
Amir Dembo,
Thomas Kailath:
On the Perceptron Learning Algorithm on Data with High Precision.
J. Comput. Syst. Sci. 48(2): 347-356 (1994) |
12 | EE | Kai-Yeung Siu,
Vwani P. Roychowdhury:
On Optimal Depth Threshold Circuits for Multiplication andRelated Problems.
SIAM J. Discrete Math. 7(2): 284-292 (1994) |
1993 |
11 | EE | Haigeng Wang,
Nikil D. Dutt,
Alexandru Nicolau,
Kai-Yeung Siu:
High-Level Synthesis of Scalable Architectures for IIR Filters using Multichip Modules.
DAC 1993: 336-342 |
10 | EE | Vwani P. Roychowdhury,
Kai-Yeung Siu:
Complexity Issues in Neural Computation and Learning.
NIPS 1993: 1161-1162 |
9 | | Kai-Yeung Siu,
Jehoshua Bruck,
Thomas Kailath,
Thomas Hofmeister:
Depth efficient neural networks for division and related problems.
IEEE Transactions on Information Theory 39(3): 946-956 (1993) |
1992 |
8 | EE | Kai-Yeung Siu,
Vwani P. Roychowdhury,
Thomas Kailath:
Computing with Almost Optimal Size Neural Networks.
NIPS 1992: 19-26 |
7 | EE | Kai-Yeung Siu,
Vwani P. Roychowdhury:
Optimal Depth Neural Networks for Multiplication and Related Problems.
NIPS 1992: 59-64 |
1991 |
6 | EE | Vwani P. Roychowdhury,
Kai-Yeung Siu,
Alon Orlitsky,
Thomas Kailath:
A Geometric Approach to Threshold Circuit Complexity.
COLT 1991: 97-111 |
5 | EE | Kai-Yeung Siu,
Jehoshua Bruck:
Neural Computing with Small Weights.
NIPS 1991: 944-949 |
4 | | Kai-Yeung Siu,
Vwani P. Roychowdhury,
Thomas Kailath:
Depth-Size Tradeoffs for Neural Computation.
IEEE Trans. Computers 40(12): 1402-1412 (1991) |
3 | | Kai-Yeung Siu,
Jehoshua Bruck:
On the Power of Threshold Circuits with Small Weights.
SIAM J. Discrete Math. 4(3): 423-435 (1991) |
1990 |
2 | EE | Vwani P. Roychowdhury,
Alon Orlitsky,
Kai-Yeung Siu,
Thomas Kailath:
On the Circuit Complexity of Neural Networks.
NIPS 1990: 953-959 |
1989 |
1 | EE | Amir Dembo,
Kai-Yeung Siu,
Thomas Kailath:
Complexity of Finite Precision Neural Network Classifier.
NIPS 1989: 668-675 |