The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

H. T. Kung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. H. T. Kung, John T. Robinson
    On Optimistic Methods for Concurrency Control. [Citation Graph (119, 12)][DBLP]
    ACM Trans. Database Syst., 1981, v:6, n:2, pp:213-226 [Journal]
  2. H. T. Kung, Christos H. Papadimitriou
    An Optimality Theory of Concurrency Control for Databases. [Citation Graph (23, 8)][DBLP]
    SIGMOD Conference, 1979, pp:116-126 [Conf]
  3. H. T. Kung, Philip L. Lehman
    Concurrent Manipulation of Binary Search Trees. [Citation Graph (21, 17)][DBLP]
    ACM Trans. Database Syst., 1980, v:5, n:3, pp:354-382 [Journal]
  4. Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
    Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP]
    FOCS, 1979, pp:286-297 [Conf]
  5. H. T. Kung, Philip L. Lehman
    Systolic (VLSI) Arrays for Relational Database Operations. [Citation Graph (12, 3)][DBLP]
    SIGMOD Conference, 1980, pp:105-116 [Conf]
  6. H. T. Kung, Christos H. Papadimitriou
    An Optimality Theory of Concurrency Control for Databases. [Citation Graph (9, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:1-11 [Journal]
  7. H. T. Kung, John T. Robinson
    On Optimistic Methods for Concurrency Control. [Citation Graph (6, 0)][DBLP]
    VLDB, 1979, pp:351- [Conf]
  8. H. T. Kung, S. W. Song
    An Efficient Parallel Garbage Collection System and Its Correctness Proof [Citation Graph (5, 0)][DBLP]
    FOCS, 1977, pp:120-131 [Conf]
  9. Jia-Wei Hong, H. T. Kung
    I/O Complexity: The Red-Blue Pebble Game [Citation Graph (4, 0)][DBLP]
    STOC, 1981, pp:326-333 [Conf]
  10. Clark D. Thompson, H. T. Kung
    Sorting on a Mesh-Connected Parallel Computer. [Citation Graph (3, 0)][DBLP]
    Commun. ACM, 1977, v:20, n:4, pp:263-271 [Journal]
  11. H. T. Kung
    The Structure of Parallel Algorithms. [Citation Graph (2, 0)][DBLP]
    Advances in Computers, 1980, v:19, n:, pp:65-112 [Journal]
  12. H. T. Kung
    Why Systolic Architectures? [Citation Graph (2, 0)][DBLP]
    IEEE Computer, 1982, v:15, n:1, pp:37-46 [Journal]
  13. Jon Louis Bentley, H. T. Kung, Mario Schkolnick, Clark D. Thompson
    On the Average Number of Maxima in a Set of Vectors and Applications. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1978, v:25, n:4, pp:536-543 [Journal]
  14. Emmanuel A. Arnould, Francois J. Bitz, Eric C. Cooper, H. T. Kung, Robert D. Sansom, Peter Steenkiste
    The Design of Nectar: A Network Backplane for Heterogeneous Multicomputers. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 1989, pp:205-216 [Conf]
  15. 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
    Architecture of Warp. [Citation Graph (0, 0)][DBLP]
    COMPCON, 1987, pp:264-267 [Conf]
  16. Marco Annaratone, F. Bitz, Ed Clune, H. T. Kung, Prabir C. Maulik, Hudson Benedito Ribas, P. S. Tseng, Jon A. Webb
    Applications and Algorithm Partitioning on Warp. [Citation Graph (0, 0)][DBLP]
    COMPCON, 1987, pp:272-279 [Conf]
  17. Chen-Mou Cheng, H. T. Kung, Koan-Sin Tan, Scott Bradner
    ANON: An IP-Layer Anonymizing Infrastructure. [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:78-80 [Conf]
  18. H. T. Kung, Chen-Mou Cheng, Koan-Sin Tan, Scott Bradner
    Design and Analysis of an IP-Layer Anonymizing Infrastructure. [Citation Graph (0, 0)][DBLP]
    DISCEX (1), 2003, pp:62-0 [Conf]
  19. H. T. Kung
    On the Computational Complexity of Finding the Maxima of a Set of Vectors [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:117-121 [Conf]
  20. I-Chen Wu, H. T. Kung
    Communication Complexity for Parallel Divide-and-Conquer [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:151-162 [Conf]
  21. H. T. Kung
    New Flow Control Methods for High-Speed Networks. [Citation Graph (0, 0)][DBLP]
    HPDC, 1993, pp:4- [Conf]
  22. Peter Steenkiste, Brian Zill, H. T. Kung, Steven Schlick, Jim Hughes, Bob Kowalski, John Mullaney
    A Host Interface Architecture for High-Speed Networks. [Citation Graph (0, 0)][DBLP]
    HPN, 1992, pp:31-46 [Conf]
  23. H. T. Kung, Shie Yuan Wang
    TCP Trunking: Design, Implementation and Performance. [Citation Graph (0, 0)][DBLP]
    ICNP, 1999, pp:222-0 [Conf]
  24. H. T. Kung
    Warp experience: we can map computations onto a parallel computer efficiently. [Citation Graph (0, 0)][DBLP]
    ICS, 1988, pp:668-675 [Conf]
  25. H. T. Kung, F. Zhu, M. Iansiti
    A Stateless Network Architecture for Inter-Enterprise Authentication, Authorization and Accounting. [Citation Graph (0, 0)][DBLP]
    ICWS, 2003, pp:235-242 [Conf]
  26. Richard P. Brent, H. T. Kung, Franklin T. Luk
    Some Linear-Time Algorithms for Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:865-876 [Conf]
  27. H. T. Kung
    Supercomputing in Japan - Response. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:565-570 [Conf]
  28. Koling Chang, Robert Morris, H. T. Kung
    NFS Dynamics Over Flow-Controlled Wide Area Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:619-625 [Conf]
  29. Pai-Hsiang Hsiao, Adon Hwang, H. T. Kung, Dario Vlah
    Load Balancing Routing for Wireless Access Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:986-995 [Conf]
  30. H. T. Kung, Koling Chang
    Receiver-Oriented Adaptive Buffer Allocation in Credit-Based Flow Control for ATM Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:239-252 [Conf]
  31. H. T. Kung, Shie Yuan Wang
    Client-Server Performance on Flow-Controlled ATM Networks: A Web Database of Simulation Results. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1997, pp:1218-1226 [Conf]
  32. H. T. Kung, Shie Yuan Wang
    Zero Queueing Flow Control and Applications. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:192-200 [Conf]
  33. Dong Lin, H. T. Kung
    TCP Fast Recovery Strategies: Analysis and Improvements. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1998, pp:263-271 [Conf]
  34. Shie Yuan Wang, H. T. Kung
    A Simple Methodology for Constructing an Extensible and High-Fidelity TCP/IP Network Simulators. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1134-1143 [Conf]
  35. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Ken Sarocky, Jon A. Webb
    Warp Architecture and Implementation. [Citation Graph (0, 0)][DBLP]
    ISCA, 1986, pp:346-356 [Conf]
  36. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Ken Sarocky, Jon A. Webb
    Warp Architecture and Implementation. [Citation Graph (0, 0)][DBLP]
    25 Years ISCA: Retrospectives and Reprints, 1998, pp:309-319 [Conf]
  37. 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
    Supporting Systolic and Memory Communciation in iWarp. [Citation Graph (0, 0)][DBLP]
    ISCA, 1990, pp:70-81 [Conf]
  38. Allan L. Fisher, H. T. Kung
    Synchronizing Large VLSI Processor Arrays [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:54-58 [Conf]
  39. Allan L. Fisher, H. T. Kung, Louis Monier, Yasunori Dohi
    Architecture of the PSC: A Programmable Systolic Chip [Citation Graph (0, 0)][DBLP]
    ISCA, 1983, pp:48-53 [Conf]
  40. M. J. Foster, H. T. Kung
    Design of Special-Purpose VLSI Chips: Example and Opinions. [Citation Graph (0, 0)][DBLP]
    ISCA, 1980, pp:300-307 [Conf]
  41. H. T. Kung
    Memory Requirements for Balanced Computer Architectures. [Citation Graph (0, 0)][DBLP]
    ISCA, 1986, pp:49-54 [Conf]
  42. H. T. Kung
    Deadlock Avoidance for Systolic Communication. [Citation Graph (0, 0)][DBLP]
    ISCA, 1988, pp:252-260 [Conf]
  43. H. T. Kung, Koan-Sin Tan, Pai-Hsiang Hsiao
    TCP with sender-based delay control. [Citation Graph (0, 0)][DBLP]
    ISCC, 2002, pp:283-290 [Conf]
  44. Pai-Hsiang Hsiao, H. T. Kung
    Gravity Routing in Ad Hoc Networks: Integrating Geographical and Topology-based Routing. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:397-403 [Conf]
  45. Brad Karp, H. T. Kung
    GPSR: greedy perimeter stateless routing for wireless networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2000, pp:243-254 [Conf]
  46. Zong Da Chen, H. T. Kung, Dario Vlah
    Ad hoc relay wireless networks over moving vehicles on highways. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2001, pp:247-250 [Conf]
  47. Pai-Hsiang Hsiao, H. T. Kung, Koan-Sin Tan
    Video over TCP with receiver-based delay control. [Citation Graph (0, 0)][DBLP]
    NOSSDAV, 2001, pp:199-208 [Conf]
  48. H. T. Kung, Shie Yuan Wang
    Behavior of Competing TCP Connections on a Packet-Switched Ring: A Study Using the Harvard TCP/IP Network Simulator. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:2143-2149 [Conf]
  49. H. T. Kung, Peter Steenkiste, Marco Gubitoso, Manpreet Khaira
    Parallelizing a New Class of Large Applications over High-speed Networks. [Citation Graph (0, 0)][DBLP]
    PPOPP, 1991, pp:167-177 [Conf]
  50. Roberto Bisiani, M. J. Foster, H. T. Kung, Kemal Oflazer
    MISE: Machine for In-System Evaluation of Custom VLSI Chips for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1982, pp:211-220 [Conf]
  51. H. T. Kung, Jaspal Subhlok
    A new approach for automatic parallelization of blocked linear Algebra computations. [Citation Graph (0, 0)][DBLP]
    SC, 1991, pp:122-129 [Conf]
  52. 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
    Network-based multicomputers: an emerging parallel architecture. [Citation Graph (0, 0)][DBLP]
    SC, 1991, pp:664-673 [Conf]
  53. H. T. Kung, Trevor Blackwell, Alan Chapman
    Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation and Statistical Multiplexing. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1994, pp:101-114 [Conf]
  54. Richard P. Brent, H. T. Kung
    The Chip Complexity of Binary Arithmetic [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:190-200 [Conf]
  55. Laurent Hyafil, H. T. Kung
    The Complexity of Parallel Evaluation of Linear Recurrence [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:12-22 [Conf]
  56. H. T. Kung
    A Bound on the Multiplication Efficiency of Iteration [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:102-107 [Conf]
  57. H. T. Kung
    The Computational Complexity of Algebraic Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:152-159 [Conf]
  58. H. T. Kung
    New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:323-333 [Conf]
  59. Clark D. Thompson, H. T. Kung
    Sorting on a Mesh-Connected Parallel Computer [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:58-64 [Conf]
  60. 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
    Secure Short-Cut Routing for Mobile IP. [Citation Graph (0, 0)][DBLP]
    USENIX Summer, 1994, pp:305-316 [Conf]
  61. H. T. Kung, Philip L. Lehman
    A Concurrent Database Manipulation Problem: Binary Search Trees (Abstract). [Citation Graph (0, 0)][DBLP]
    VLDB, 1978, pp:498- [Conf]
  62. H. T. Kung
    Putting Inner Loops Automatically in Silicon. [Citation Graph (0, 0)][DBLP]
    VLSI Engineering, 1984, pp:70-104 [Conf]
  63. Gérard M. Baudet, Richard P. Brent, H. T. Kung
    Parallel Execution of a Sequence of tasks on a Asynchronous Multiprocessor. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1980, v:12, n:3, pp:105-112 [Journal]
  64. Shie Yuan Wang, H. T. Kung
    A new methodology for easily constructing extensible and high-fidelity TCP/IP network simulators. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2002, v:40, n:2, pp:257-278 [Journal]
  65. H. T. Kung, Koan-Sin Tan, Pai-Hsiang Hsiao
    TCP with sender-based delay control. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2003, v:26, n:14, pp:1614-1621 [Journal]
  66. H. T. Kung, S. Y. Wang
    TCP Trunking [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  67. H. T. Kung, Jon A. Webb
    Mapping Image Processing Operations onto a Linear Systolic Machine. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1986, v:1, n:4, pp:246-257 [Journal]
  68. Richard P. Brent, H. T. Kung
    On the Area of Binary Tree Layouts. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:11, n:1, pp:46-48 [Journal]
  69. H. T. Kung
    A New Upper Bound on the Complexity of Derivative Evaluation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1973, v:2, n:5, pp:146-147 [Journal]
  70. H. T. Kung, Lawrence M. Ruane, David W. L. Yen
    Two-level pipelined systolic array for multidimensional convolution. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1983, v:1, n:1, pp:30-36 [Journal]
  71. Richard P. Brent, H. T. Kung
    Fast Algorithms for Manipulating Formal Power Series. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:4, pp:581-595 [Journal]
  72. Richard P. Brent, H. T. Kung
    The Area-Time Complexity of Binary Multiplication. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:3, pp:521-534 [Journal]
  73. Richard P. Brent, H. T. Kung
    Corrigendum: ``The Area-Time Complexity of Binary Multiplication''. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:904- [Journal]
  74. Laurent Hyafil, H. T. Kung
    The Complexity of Parallel Evaluation of Linear Recurrences. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:513-521 [Journal]
  75. H. T. Kung
    New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:2, pp:252-261 [Journal]
  76. H. T. Kung, Fabrizio Luccio, Franco P. Preparata
    On Finding the Maxima of a Set of Vectors. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:4, pp:469-476 [Journal]
  77. H. T. Kung, J. F. Traub
    Optimal Order of One-Point and Multipoint Iteration. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1974, v:21, n:4, pp:643-651 [Journal]
  78. H. T. Kung, J. F. Traub
    All Algebraic Functions Can Be Computed Fast. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:2, pp:245-260 [Journal]
  79. H. T. Kung
    Memory requirements for balanced computer architectures. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1985, v:1, n:1, pp:147-157 [Journal]
  80. H. T. Kung
    Deadlock avoidance for systolic communication. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1988, v:4, n:2, pp:87-105 [Journal]
  81. H. T. Kung
    A Bound on the Multiplicative Efficiency of Iteration. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:4, pp:334-342 [Journal]
  82. H. T. Kung, D. M. Tong
    Fast Algorithms for Partial Fraction Decomposition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:582-593 [Journal]
  83. Marco Annaratone, Emmanuel A. Arnould, Thomas R. Gross, H. T. Kung, Monica S. Lam, Onat Menzilcioglu, Jon A. Webb
    The Warp Computer: Architecture, Implementation, and Performance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:12, pp:1523-1538 [Journal]
  84. Richard P. Brent, H. T. Kung
    A Regular Layout for Parallel Adders. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:3, pp:260-264 [Journal]
  85. Richard P. Brent, H. T. Kung
    Systolic VLSI Arrays for Polynomial GCD Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:8, pp:731-736 [Journal]
  86. Allan L. Fisher, H. T. Kung
    Synchronizing Large VLSI Processor Arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:8, pp:734-740 [Journal]
  87. Shie Yuan Wang, H. T. Kung
    Use of TCP Decoupling in Improving TCP Performance over Wireless Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:3, pp:221-236 [Journal]
  88. Chen-Mou Cheng, Pai-Hsiang Hsiao, H. T. Kung, Dario Vlah
    Adjacent Channel Interference in Dual-radio 802.11a Nodes and Its Impact on Multi-hop Networking. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]

  89. CARGuide: on-board computer for automobile route guidance. [Citation Graph (, )][DBLP]


  90. Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement. [Citation Graph (, )][DBLP]


  91. Wireless Computing, Networking and Sensing. [Citation Graph (, )][DBLP]


  92. Use of Content Tags in Managing Advertisements for Online Videos. [Citation Graph (, )][DBLP]


  93. Transmit Antenna Selection Based on Link-layer Channel Probing. [Citation Graph (, )][DBLP]


  94. Some linear-time algorithms for systolic arrays [Citation Graph (, )][DBLP]


Search in 0.411secs, Finished in 0.416secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002