H. T. Kung

Loading Google Thumbnails...
2010
99Some linear-time algorithms for systolic arrays. Richard P. Brent, Franklin T. Luk, H. T. Kung. CoRR (abs/1004.3716) (2010). Web SearchBibTeXDownload
98A spectral clustering approach to validating sensors via their peers in distributed sensor networks. H. T. Kung, Dario Vlah. IJSNet (8): 202-208 (2010). Web SearchBibTeXDownload
2009
97A Spectral Clustering Approach to Validating Sensors via Their Peers in Distributed Sensor Networks. H. T. Kung, Dario Vlah. ICCCN 2009, 1-7. Web SearchBibTeXDownload
96Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement. H. T. Kung, Chit-Kwan Lin, Tsung-Han Lin, Dario Vlah. MOBICOM 2009, 333-344. Web SearchBibTeXDownload
95Wireless Computing, Networking and Sensing. H. T. Kung. SEKE 2009, 1. Web SearchBibTeX
2008
94Use of Content Tags in Managing Advertisements for Online Videos. Chia-Hsin Huang, H. T. Kung, Chia-Yung Su. CEC/EEE 2008, 249-254. Web SearchBibTeXDownload
93Construction of block orthogonal golay sequences and application to channel estimation of mimo-ofdm systems. Oh-Soon Shin, H. T. Kung, Vahid Tarokh. IEEE Transactions on Communications (56): 27-31 (2008). Web SearchBibTeXDownload
2007
92A Hub Matrix Theory and Applications to Wireless Communications. H. T. Kung, Bruce Wilsey Suter. EURASIP J. Adv. Sig. Proc. (2007) (2007). Web SearchBibTeXDownload
91Transmit Antenna Selection Based on Link-layer Channel Probing. Chen-Mou Cheng, Pai-Hsiang Hsiao, H. T. Kung, Dario Vlah. WOWMOM 2007, 1-6. Web SearchBibTeXDownload
2006
90Adjacent Channel Interference in Dual-radio 802.11a Nodes and Its Impact on Multi-hop Networking. Chen-Mou Cheng, Pai-Hsiang Hsiao, H. T. Kung, Dario Vlah. GLOBECOM 2006. Web SearchBibTeXDownload
2004
89Gravity Routing in Ad Hoc Networks: Integrating Geographical and Topology-based Routing. Pai-Hsiang Hsiao, H. T. Kung. ISPAN 2004, 397-403. Web SearchBibTeXDownload
2003
88TCP with sender-based delay control. H. T. Kung, Koan-Sin Tan, Pai-Hsiang Hsiao. Computer Communications (26): 1614-1621 (2003). Web SearchBibTeXDownload
87Design and Analysis of an IP-Layer Anonymizing Infrastructure. H. T. Kung, Chen-Mou Cheng, Koan-Sin Tan, Scott Bradner. DISCEX (1) 2003, 62. Web SearchBibTeXDownload
86ANON: An IP-Layer Anonymizing Infrastructure. Chen-Mou Cheng, H. T. Kung, Koan-Sin Tan, Scott Bradner. DISCEX (2) 2003, 78-80. Web SearchBibTeXDownload
85A Stateless Network Architecture for Inter-Enterprise Authentication, Authorization and Accounting. H. T. Kung, F. Zhu, Marco Iansiti. ICWS 2003, 235-242. Web SearchBibTeX
2002
84A new methodology for easily constructing extensible and high-fidelity TCP/IP network simulators. Shie Yuan Wang, H. T. Kung. Computer Networks (40): 257-278 (2002). Web SearchBibTeXDownload
83TCP with sender-based delay control. H. T. Kung, Koan-Sin Tan, Pai-Hsiang Hsiao. ISCC 2002, 283-290. Web SearchBibTeXDownload
2001
82Load Balancing Routing for Wireless Access Networks. Pai-Hsiang Hsiao, Adon Hwang, H. T. Kung, Dario Vlah. INFOCOM 2001, 986-995. Web SearchBibTeXDownload
81Ad hoc relay wireless networks over moving vehicles on highways. Zong Da Chen, H. T. Kung, Dario Vlah. MobiHoc 2001, 247-250. Web SearchBibTeXDownload
80Video over TCP with receiver-based delay control. Pai-Hsiang Hsiao, H. T. Kung, Koan-Sin Tan. NOSSDAV 2001, 199-208. Web SearchBibTeXDownload
79Use of TCP Decoupling in Improving TCP Performance over Wireless Networks. Shie Yuan Wang, H. T. Kung. Wireless Networks (7): 221-236 (2001). Web SearchBibTeXDownload
2000
78GPSR: greedy perimeter stateless routing for wireless networks. Brad Karp, H. T. Kung. MOBICOM 2000, 243-254. Web SearchBibTeXDownload
1999
77TCP Trunking: Design, Implementation and Performance. H. T. Kung, Shie Yuan Wang. ICNP 1999, 222. Web SearchBibTeXDownload
76A Simple Methodology for Constructing an Extensible and High-Fidelity TCP/IP Network Simulators. Shie Yuan Wang, H. T. Kung. INFOCOM 1999, 1134-1143. Web SearchBibTeX
75Behavior of Competing TCP Connections on a Packet-Switched Ring: A Study Using the Harvard TCP/IP Network Simulator. H. T. Kung, Shie Yuan Wang. PDPTA 1999, 2143-2149. Web SearchBibTeX
1998
74Warp Architecture and Implementation. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Ken Sarocky, Jon A. Webb. 25 Years ISCA: Retrospectives and Reprints 1998, 309-319. Web SearchBibTeXDownload
73TCP Trunking. H. T. Kung, S. Y. Wang. CoRR (cs.NI/9811028) (1998). Web SearchBibTeXDownload
72Zero Queueing Flow Control and Applications. H. T. Kung, Shie Yuan Wang. INFOCOM 1998, 192-200. Web SearchBibTeX
71TCP Fast Recovery Strategies: Analysis and Improvements. Dong Lin, H. T. Kung. INFOCOM 1998, 263-271. Web SearchBibTeX
1997
70NFS Dynamics Over Flow-Controlled Wide Area Networks. Koling Chang, Robert Morris, H. T. Kung. INFOCOM 1997, 619-625. Web SearchBibTeX
69Client-Server Performance on Flow-Controlled ATM Networks: A Web Database of Simulation Results. H. T. Kung, Shie Yuan Wang. INFOCOM 1997, 1218-1226. Web SearchBibTeX
1995
68Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks. H. T. Kung, Koling Chang. INFOCOM 1995, 239-252. Web SearchBibTeX
1994
67Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation and Statistical Multiplexing. H. T. Kung, Trevor Blackwell, Alan Chapman. SIGCOMM 1994, 101-114. Cited by 393Web SearchBibTeXDownload
66Secure Short-Cut Routing for Mobile IP. Trevor Blackwell, Kee Chan, Koling Chang, Thomas Charuhas, James Gwertzman, Brad Karp, H. T. Kung, David Li, Dong Lin, Robert Morris, Rob Polansky, Diane Tang, Cliff Young, John Zao. USENIX Summer 1994, 305-316. Web SearchBibTeX
1993
65New Flow Control Methods for High-Speed Networks. H. T. Kung. HPDC 1993, 4. Web SearchBibTeX
1992
64A Host Interface Architecture for High-Speed Networks. Peter Steenkiste, Brian Zill, H. T. Kung, Steven Schlick, Jim Hughes, Bob Kowalski, John Mullaney. HPN 1992, 31-46. Web SearchBibTeX
1991
63Communication Complexity for Parallel Divide-and-Conquer. I-Chen Wu, H. T. Kung. FOCS 1991, 151-162. Web SearchBibTeXDownload
62Parallelizing a New Class of Large Applications over High-speed Networks. H. T. Kung, Peter Steenkiste, Marco Gubitoso, Manpreet Khaira. PPOPP 1991, 167-177. Web SearchBibTeXDownload
61Network-based multicomputers: an emerging parallel architecture. H. T. Kung, Robert D. Sansom, Steven Schlick, Peter Steenkiste, Matthieu Arnould, Francois J. Bitz, Fred Christianson, Eric C. Cooper, Onat Menzilcioglu, Denise Ombres, Brian Zill. SC 1991, 664-673. Web SearchBibTeXDownload
60A new approach for automatic parallelization of blocked linear Algebra computations. H. T. Kung, Jaspal Subhlok. SC 1991, 122-129. Web SearchBibTeXDownload
1990
59Supporting Systolic and Memory Communciation in iWarp. Shekhar Borkar, Robert Cohn, George W. Cox, Thomas R. Gross, H. T. Kung, Monica S. Lam, Margie Levine, Brian Moore, Wire Moore, Craig Peterson, Jim Susman, Jim Sutton, John Urbanski, Jon A. Webb. ISCA 1990, 70-81. Web SearchBibTeX
1989
58The Design of Nectar: A Network Backplane for Heterogeneous Multicomputers. Emmanuel A. Arnould, Francois J. Bitz, Eric C. Cooper, H. T. Kung, Robert D. Sansom, Peter Steenkiste. ASPLOS 1989, 205-216. Web SearchBibTeXDownload
57Comprehensive evaluation of a two-dimensional configurable array. Onat Menzilcioglu, H. T. Kung, Siang Wun Song. FTCS 1989, 93-100. Web SearchBibTeXDownload
1988
56Warp experience: we can map computations onto a parallel computer efficiently. H. T. Kung. ICS 1988, 668-675. Web SearchBibTeXDownload
55Deadlock Avoidance for Systolic Communication. H. T. Kung. ISCA 1988, 252-260. Web SearchBibTeX
54Deadlock avoidance for systolic communication. H. T. Kung. J. Complexity (4): 87-105 (1988). Web SearchBibTeXDownload
1987
53Applications and Algorithm Partitioning on Warp. Marco Annaratone, Francois J. Bitz, Ed Clune, H. T. Kung, Prabir C. Maulik, Hudson Benedito Ribas, P. S. Tseng, Jon A. Webb. COMPCON 1987, 272-279. Web SearchBibTeX
52Architecture of Warp. Marco Annaratone, Emmanuel A. Arnould, Robert Cohn, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Ken Sarocky, John Senko, Jon A. Webb. COMPCON 1987, 264-267. Web SearchBibTeX
51The Warp Computer: Architecture, Implementation, and Performance. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Jon A. Webb. IEEE Trans. Computers (36): 1523-1538 (1987). Web SearchBibTeXDownload
1986
50Mapping Image Processing Operations onto a Linear Systolic Machine. H. T. Kung, Jon A. Webb. Distributed Computing (1): 246-257 (1986). Web SearchBibTeXDownload
49Supercomputing in Japan - Response. H. T. Kung. IFIP Congress 1986, 565-570. Web SearchBibTeX
48Memory Requirements for Balanced Computer Architectures. H. T. Kung. ISCA 1986, 49-54. Web SearchBibTeX
47Warp Architecture and Implementation. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Ken Sarocky, Jon A. Webb. ISCA 1986, 346-356. Web SearchBibTeX
1985
46Synchronizing Large VLSI Processor Arrays. Allan L. Fisher, H. T. Kung. IEEE Trans. Computers (34): 734-740 (1985). Web SearchBibTeXDownload
45Memory requirements for balanced computer architectures. H. T. Kung. J. Complexity (1): 147-157 (1985). Web SearchBibTeXDownload
1984
44CARGuide: on-board computer for automobile route guidance. M. Sugie, Onat Menzilcioglu, H. T. Kung. AFIPS National Computer Conference 1984, 695-706. Web SearchBibTeXDownload
43Systolic VLSI Arrays for Polynomial GCD Computation. Richard P. Brent, H. T. Kung. IEEE Trans. Computers (33): 731-736 (1984). Web SearchBibTeXDownload
42Putting Inner Loops Automatically in Silicon. H. T. Kung. VLSI Engineering 1984, 70-104. Web SearchBibTeXDownload
1983
41An Optimality Theory of Concurrency Control for Databases. H. T. Kung, Christos H. Papadimitriou. Acta Inf. (19): 1-11 (1983). Web SearchBibTeXDownload
40Some Linear-Time Algorithms for Systolic Arrays. Richard P. Brent, H. T. Kung, Franklin T. Luk. IFIP Congress 1983, 865-876. Web SearchBibTeX
39Two-level pipelined systolic array for multidimensional convolution. H. T. Kung, Lawrence M. Ruane, David W. L. Yen. Image Vision Comput. (1): 30-36 (1983). Web SearchBibTeXDownload
38Architecture of the PSC: A Programmable Systolic Chip. Allan L. Fisher, H. T. Kung, Louis Monier, Yasunori Dohi. ISCA 1983, 48-53. Cited by 49Web SearchBibTeX
37Synchronizing Large VLSI Processor Arrays. Allan L. Fisher, H. T. Kung. ISCA 1983, 54-58. Web SearchBibTeX
1982
36Why Systolic Architectures?. H. T. Kung. IEEE Computer (15): 37-46 (1982). Web SearchBibTeXDownload
35MISE: Machine for In-System Evaluation of Custom VLSI Chips for Real-Time Systems. Roberto Bisiani, M. J. Foster, H. T. Kung, Kemal Oflazer. IEEE Real-Time Systems Symposium 1982, 211-220. Web SearchBibTeX
34A Regular Layout for Parallel Adders. Richard P. Brent, H. T. Kung. IEEE Trans. Computers (31): 260-264 (1982). Web SearchBibTeXDownload
33Corrigendum: ``The Area-Time Complexity of Binary Multiplication''. Richard P. Brent, H. T. Kung. J. ACM (29): 904 (1982). Web SearchBibTeXDownload
1981
32On Optimistic Methods for Concurrency Control. H. T. Kung, John T. Robinson. ACM Trans. Database Syst. (6): 213-226 (1981). Web SearchBibTeXDownload
31The Area-Time Complexity of Binary Multiplication. Richard P. Brent, H. T. Kung. J. ACM (28): 521-534 (1981). Web SearchBibTeXDownload
30I/O Complexity: The Red-Blue Pebble Game. Jia-Wei Hong, H. T. Kung. STOC 1981, 326-333. Web SearchBibTeXDownload
1980
29Concurrent Manipulation of Binary Search Trees. H. T. Kung, Philip L. Lehman. ACM Trans. Database Syst. (5): 354-382 (1980). Web SearchBibTeXDownload
28The Structure of Parallel Algorithms. H. T. Kung. Advances in Computers (19): 65-112 (1980). Web SearchBibTeXDownload
27Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor. Gérard M. Baudet, Richard P. Brent, H. T. Kung. Australian Computer Journal (12): 105-112 (1980). Web SearchBibTeX
26On the Area of Binary Tree Layouts. Richard P. Brent, H. T. Kung. Inf. Process. Lett. (11): 46-48 (1980). Web SearchBibTeXDownload
25Design of Special-Purpose VLSI Chips: Example and Opinions. M. J. Foster, H. T. Kung. ISCA 1980, 300-307. Web SearchBibTeX
24Systolic (VLSI) Arrays for Relational Database Operations. H. T. Kung, Philip L. Lehman. SIGMOD Conference 1980, 105-116. Web SearchBibTeX
23The Chip Complexity of Binary Arithmetic. Richard P. Brent, H. T. Kung. STOC 1980, 190-200. Web SearchBibTeXDownload
1979
22Locking Policies: Safety and Freedom from Deadlock. Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung. FOCS 1979, 286-297. Web SearchBibTeXDownload
21An Optimality Theory of Concurrency Control for Databases. H. T. Kung, Christos H. Papadimitriou. SIGMOD Conference 1979, 116-126. Web SearchBibTeX
20On Optimistic Methods for Concurrency Control. H. T. Kung, John T. Robinson. VLDB 1979, 351. Web SearchBibTeX
1978
19All Algebraic Functions Can Be Computed Fast. H. T. Kung, J. F. Traub. J. ACM (25): 245-260 (1978). Web SearchBibTeXDownload
18On the Average Number of Maxima in a Set of Vectors and Applications. Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson. J. ACM (25): 536-543 (1978). Cited by 164Web SearchBibTeXDownload
17Fast Algorithms for Manipulating Formal Power Series. Richard P. Brent, H. T. Kung. J. ACM (25): 581-595 (1978). Web SearchBibTeXDownload
16A Concurrent Database Manipulation Problem: Binary Search Trees (Abstract). H. T. Kung, Philip L. Lehman. VLDB 1978, 498. Web SearchBibTeX
1977
15Sorting on a Mesh-Connected Parallel Computer. Clark D. Thompson, H. T. Kung. Commun. ACM (20): 263-271 (1977). Cited by 398Web SearchBibTeXDownload
14An Efficient Parallel Garbage Collection System and Its Correctness Proof. H. T. Kung, S. W. Song. FOCS 1977, 120-131. Web SearchBibTeXDownload
13The Complexity of Parallel Evaluation of Linear Recurrences. Laurent Hyafil, H. T. Kung. J. ACM (24): 513-521 (1977). Web SearchBibTeXDownload
12Fast Algorithms for Partial Fraction Decomposition. H. T. Kung, D. M. Tong. SIAM J. Comput. (6): 582-593 (1977). Web SearchBibTeXDownload
1976
11New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences. H. T. Kung. J. ACM (23): 252-261 (1976). Web SearchBibTeXDownload
10Sorting on a Mesh-Connected Parallel Computer. Clark D. Thompson, H. T. Kung. STOC 1976, 58-64. Cited by 398Web SearchBibTeXDownload
1975
9On Finding the Maxima of a Set of Vectors. H. T. Kung, Fabrizio Luccio, Franco P. Preparata. J. ACM (22): 469-476 (1975). Web SearchBibTeXDownload
8The Complexity of Parallel Evaluation of Linear Recurrence. Laurent Hyafil, H. T. Kung. STOC 1975, 12-22. Web SearchBibTeXDownload
1974
7Optimal Order of One-Point and Multipoint Iteration. H. T. Kung, J. F. Traub. J. ACM (21): 643-651 (1974). Web SearchBibTeXDownload
6New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions. H. T. Kung. STOC 1974, 323-333. Web SearchBibTeXDownload
5On the Computational Complexity of Finding the Maxima of a Set of Vectors. H. T. Kung. SWAT (FOCS) 1974, 117-121. Web SearchBibTeXDownload
1973
4A New Upper Bound on the Complexity of Derivative Evaluation. H. T. Kung. Inf. Process. Lett. (2): 146-147 (1973). Web SearchBibTeXDownload
3A Bound on the Multiplicative Efficiency of Iteration. H. T. Kung. J. Comput. Syst. Sci. (7): 334-342 (1973). Web SearchBibTeXDownload
2The Computational Complexity of Algebraic Numbers. H. T. Kung. STOC 1973, 152-159. Web SearchBibTeXDownload
1972
1A Bound on the Multiplication Efficiency of Iteration. H. T. Kung. STOC 1972, 102-107. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research