| |
C. K. Wong
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 166 | EE | Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, Larry Heck, Belle L. Tseng: Trada: tree based ranking function adaptation. CIKM 2008: 1143-1152 |
| 2007 | ||
| 165 | EE | Hei Wong, V. Filip, C. K. Wong, P. S. Chung: Silicon integrated photonics begins to revolutionize. Microelectronics Reliability 47(1): 1-10 (2007) |
| 2006 | ||
| 164 | EE | C. K. Wong, Philip Heng Wai Leong: An FPGA-Based Electronic Cochlea with Dual Fixed-Point Arithmetic. FPL 2006: 1-6 |
| 163 | EE | C. K. Wong, H. Wong, M. Chan, C. W. Kok, H. P. Chan: Minimizing hydrogen content in silicon oxynitride by thermal oxidation of silicon-rich silicon nitride. Microelectronics Reliability 46(12): 2056-2061 (2006) |
| 2005 | ||
| 162 | EE | C. K. Wong, Agnes Chan: Immediate Data Authentication for Multicast in Resource Constrained Network. ACISP 2005: 113-121 |
| 2003 | ||
| 161 | Carrison K. S. Tong, Kwok Kwan Chan, C. K. Wong: Common gateway interfacing and dynamic jpeg techniques for remote handheld. CARS 2003: 815-820 | |
| 160 | EE | Yao-Wen Chang, Kai Zhu, Guang-Ming Wu, D. F. Wong, C. K. Wong: Analysis of FPGA/FPIC switch modules. ACM Trans. Design Autom. Electr. Syst. 8(1): 11-37 (2003) |
| 159 | EE | Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong: An experimental analysis of local minima to improve neighbourhood search. Computers & OR 30(14): 2157-2173 (2003) |
| 158 | EE | Jun Wei, F. L. Ng, M. L. Nai, H. Xie, Peck Cheng Lim, C. K. Wong: Wafer Bonding Process Based On The Taguchi Analysis. International Journal of Computational Engineering Science 4(2): 331-334 (2003) |
| 157 | EE | Zhenfeng Wang, G. J. Qi, Jun Wei, Peck Cheng Lim, Yufeng Jin, C. K. Wong: A Novel Wafer-Level Packaging Solution For Mems. International Journal of Computational Engineering Science 4(2): 339-342 (2003) |
| 156 | EE | X. C. Shan, Ryutaro Maeda, Tsuyoshi Ikehara, Z. F. Wang, C. K. Wong: A Polymer-Based Optical Switch Fabricated Using Silicon Process, Electroplating And Micro Hot Embossing. International Journal of Computational Engineering Science 4(3): 724-728 (2003) |
| 155 | C. K. Wong, S. C. Wong: A Lane-Based Optimization Method for Minimizing Delay at Isolated Signal-Controlled Junctions. J. Math. Model. Algorithms 2(4): 379-406 (2003) | |
| 2002 | ||
| 154 | EE | Andreas Alexander Albrecht, Staal A. Vinterbo, C. K. Wong, Lucila Ohno-Machado: A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data. ICANN 2002: 401-407 |
| 153 | EE | Hongbing Fan, Jiping Liu, Yu-Liang Wu, C. K. Wong: Reduction design for generic universal switch blocks. ACM Trans. Design Autom. Electr. Syst. 7(4): 526-546 (2002) |
| 152 | Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong: Bounded-depth threshold circuits for computer-assisted CT image classification. Artificial Intelligence in Medicine 24(2): 179-192 (2002) | |
| 151 | EE | Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong: Fast parallel heuristics for the job shop scheduling problem. Computers & OR 29(2): 151-169 (2002) |
| 150 | EE | Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young: An effective quasi-human based heuristic for solving the rectangle packing problem. European Journal of Operational Research 141(2): 341-358 (2002) |
| 149 | EE | Zong-Ben Xu, Huidong Jin, Kwong-Sak Leung, Yee Leung, Chak-Kuen Wong: An automata network for performing combinatorial optimization. Neurocomputing 47(1-4): 59-83 (2002) |
| 148 | EE | Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong: The convergence of stochastic algorithms solving flow shop scheduling. Theor. Comput. Sci. 285(1): 101-117 (2002) |
| 2001 | ||
| 147 | EE | Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong: Depth-Four Threshold Circuits for Computer-Assisted X-ray Diagnosis. AIME 2001: 369-373 |
| 146 | Andreas Alexander Albrecht, Eike Hein, Daniela Melzer, Kathleen Steinhöfel, Matthias Taupitz, Chak-Kuen Wong: Liver tissue classification by bounded-depth threshold circuits. CARS 2001: 1156-1157 | |
| 145 | EE | Andreas Alexander Albrecht, Martin J. Loomes, Kathleen Steinhöfel, Matthias Taupitz, Chak-Kuen Wong: A local search method for pattern classification. ESANN 2001: 1-6 |
| 144 | EE | Jin-fuw Lee, Daniel L. Ostapko, Jeffery Soreff, C. K. Wong: On the Signal Bounding Problem in Timing Analysis. ICCAD 2001: 507-514 |
| 143 | Andreas Alexander Albrecht, Kathleen Steinhöfel, Matthias Taupitz, C. K. Wong: Logarithmic simulated annealing for X-ray diagnosis. Artificial Intelligence in Medicine 22(3): 249-260 (2001) | |
| 142 | EE | Y. Y. Li, Kwong-Sak Leung, C. K. Wong: Steiner Trees in General Nonuniform Orientations. Computing 66(1): 41-78 (2001) |
| 141 | EE | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Kr-Packing Problem. Computing 66(1): 79-89 (2001) |
| 140 | EE | Hongbing Fan, Yu-Liang Wu, C. K. Wong: On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks. Graphs and Combinatorics 17(2): 213-225 (2001) |
| 139 | Kwong-Sak Leung, Qi-Hong Duan, Zong-Ben Xu, C. K. Wong: A new model of simulated evolutionary computation-convergence analysis and specifications. IEEE Trans. Evolutionary Computation 5(1): 3-16 (2001) | |
| 138 | Andreas Alexander Albrecht, C. K. Wong: Combining the Perceptron Algorithm with Logarithmic Simulated Annealing. Neural Processing Letters 14(1): 75-83 (2001) | |
| 137 | S. C. Wong, C. K. Wong, C. O. Tong: A parallelized genetic algorithm for the calibration of Lowry model. Parallel Computing 27(12): 1523-1536 (2001) | |
| 2000 | ||
| 136 | EE | Andreas Alexander Albrecht, Chak-Kuen Wong: Inhomogeneous Markov Chains Applied to Pattern Classification. AMAI 2000 |
| 135 | EE | Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong: Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems. CIAC 2000: 277-290 |
| 134 | EE | Andreas Alexander Albrecht, Chak-Kuen Wong: On Logarithmic Simulated Annealing. IFIP TCS 2000: 301-314 |
| 133 | Andreas Alexander Albrecht, Uwe Der, Kathleen Steinhöfel, Chak-Kuen Wong: Distributed Simulated Annealing for Job Shop Scheduling. PPSN 2000: 243-252 | |
| 132 | EE | Xiaoyun Lu, Da-Wei Wang, C. K. Wong: On the bounded domination number of tournaments. Discrete Mathematics 220(1-3): 257-261 (2000) |
| 131 | EE | Jin Xu, C. K. Wong: Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs. Discrete Mathematics 223(1-3): 309-326 (2000) |
| 130 | EE | Yu-Liang Wu, Hongbing Fan, Malgorzata Marek-Sadowska, C. K. Wong: OBDD Minimization Based on Two-Level Representation of Boolean Functions. IEEE Trans. Computers 49(12): 1371-1379 (2000) |
| 129 | Y. C. Wong, Kwong-Sak Leung, C. K. Wong: Simulated annealing-based algorithms for the studies of the thermoelastic scaling behavior. IEEE Transactions on Systems, Man, and Cybernetics, Part C 30(4): 506-516 (2000) | |
| 128 | Y. Y. Li, Kwong-Sak Leung, C. K. Wong: Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems. J. Comb. Optim. 4(1): 79-98 (2000) | |
| 127 | EE | Guochuan Zhang, Xiaoqiang Cai, C. K. Wong: Linear time-approximation algorithms for bin packing. Oper. Res. Lett. 26(5): 217-222 (2000) |
| 1999 | ||
| 126 | EE | Jin-yi Cai, C. K. Wong: Foreword. Algorithmica 23(4): 277 (1999) |
| 125 | EE | Xiaoyun Lu, Da-Wei Wang, C. K. Wong: The strong Hall property and symmetric chain orders. Discrete Mathematics 203(1-3): 161-168 (1999) |
| 1998 | ||
| 124 | Jiaofeng Pan, Yu-Liang Wu, C. K. Wong: On the Optimal Sub-routing Structures of 2-D FPGA Greedy Routing Architectures. ASP-DAC 1998: 535-540 | |
| 123 | EE | S. K. Cheung, Kwong-Sak Leung, Andreas Alexander Albrecht, C. K. Wong: Optimal Placements of Flexible Objects: An Adaptive Simulated Annealing Approach. PPSN 1998: 968-977 |
| 122 | EE | Kathleen Steinhöfel, Andreas Alexander Albrecht, C. K. Wong: On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. RANDOM 1998: 260-279 |
| 121 | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong: The Vertex-Disjoint Triangles Problem. WG 1998: 26-37 | |
| 120 | EE | Xiaoyun Lu, Da-Wei Wang, C. K. Wong: On avoidable and unavoidable claws. Discrete Mathematics 184(1-3): 259-265 (1998) |
| 119 | Majid Sarrafzadeh, Wei-Liang Lin, C. K. Wong: Floating Steiner Trees. IEEE Trans. Computers 47(2): 197-211 (1998) | |
| 118 | EE | Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998) |
| 117 | EE | Jiaofeng Pan, Yu-Liang Wu, C. K. Wong, Guiying Yan: On the optimal four-way switch box routing structures of FPGA greedy routing architectures1. Integration 25(2): 137-159 (1998) |
| 116 | Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998) | |
| 1997 | ||
| 115 | S. K. Cheung, Kwong-Sak Leung, Andreas Alexander Albrecht, C. K. Wong: Optimal Placements of Flexible Objects: An Evolutionary Programming Approach. ICGA 1997: 583-590 | |
| 114 | EE | Peter Blomgren, Tony F. Chan, Pep Mulet, C. K. Wong: Total variation image restoration: numerical methods and extensions. ICIP (3) 1997: 384-387 |
| 113 | Andreas Alexander Albrecht, S. K. Cheung, K. C. Hui, Kwong-Sak Leung, C. K. Wong: Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case. IEEE Trans. Computers 46(8): 890-904 (1997) | |
| 112 | Andreas Alexander Albrecht, S. K. Cheung, K. C. Hui, Kwong-Sak Leung, C. K. Wong: Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case. IEEE Trans. Computers 46(8): 905-929 (1997) | |
| 111 | C. D. Yang, D. T. Lee, C. K. Wong: The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon. IEEE Trans. Computers 46(8): 930-941 (1997) | |
| 110 | EE | Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu: Routing for symmetric FPGAs and FPICs. IEEE Trans. on CAD of Integrated Circuits and Systems 16(1): 20-31 (1997) |
| 109 | D. T. Lee, C. D. Yang, C. K. Wong: Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. Int. J. Comput. Geometry Appl. 7(6): 581-598 (1997) | |
| 108 | G. Y. Yan, Andreas Alexander Albrecht, G. H. F. Young, Chak-Kuen Wong: The Steiner Tree Problem in Orientation Metrics. J. Comput. Syst. Sci. 55(3): 529-546 (1997) | |
| 107 | EE | X. Cai, Ton Kloks, C. K. Wong: Time-varying shortest path problems with constraints. Networks 29(3): 141-150 (1997) |
| 1996 | ||
| 106 | Jin-yi Cai, C. K. Wong: Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings Springer 1996 | |
| 105 | EE | Yao-Wen Chang, D. F. Wong, C. K. Wong: Universal Switch-Module Design for Symmetric-Array-Based FPGAs. FPGA 1996: 80-86 |
| 104 | Ton Kloks, Dieter Kratsch, C. K. Wong: Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267 | |
| 103 | Ton Kloks, Haiko Müller, C. K. Wong: Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182 | |
| 102 | X. Cai, Ton Kloks, C. K. Wong: Shortest Path Problems with Time Constraints. MFCS 1996: 255-266 | |
| 101 | EE | Yao-Wen Chang, D. F. Wong, C. K. Wong: Universal switch modules for FPGA design. ACM Trans. Design Autom. Electr. Syst. 1(1): 80-101 (1996) |
| 100 | EE | D. T. Lee, Chung-Do Yang, C. K. Wong: Rectilinear Paths Among Rectilinear Obstacles. Discrete Applied Mathematics 70(3): 185-215 (1996) |
| 99 | EE | Jin-fuw Lee, Donald T. Tang, Chak-Kuen Wong: A timing analysis algorithm for circuits with level-sensitive latches. IEEE Trans. on CAD of Integrated Circuits and Systems 15(5): 535-543 (1996) |
| 1995 | ||
| 98 | EE | Yao-Wen Chang, D. F. Wong, C. K. Wong: FPGA global routing based on a new congestion metric. ICCD 1995: 372- |
| 97 | EE | Yao-Wen Chang, D. F. Wong, C. K. Wong: Design and analysis of FPGA/FPIC switch modules. ICCD 1995: 394-401 |
| 96 | EE | Ting-Chi Wang, Martin D. F. Wong, Yachyang Sun, Chak-Kuen Wong: Optimal net assignment. IEEE Trans. on CAD of Integrated Circuits and Systems 14(2): 265-269 (1995) |
| 95 | Chung-Do Yang, D. T. Lee, C. K. Wong: Rectilinear Path Problems among Rectilinear Obstacles Revisited. SIAM J. Comput. 24(3): 457-472 (1995) | |
| 1994 | ||
| 94 | EE | Shen Lin, C. K. Wong: Process-variation-tolerant clock skew minimization. ICCAD 1994: 284-288 |
| 93 | EE | Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong: The reproducing placement problem with applications. ICCAD 1994: 686-689 |
| 92 | EE | Jin-fuw Lee, Donald T. Tang, C. K. Wong: A timing analysis algorithm for circuits with level-sensitive latches. ICCAD 1994: 743-748 |
| 91 | D. T. Lee, Chung-Do Yang, C. K. Wong: On Bends and Distances of Paths Among Obstacles in Two-Layer Interconnection Model. IEEE Trans. Computers 43(6): 711-724 (1994) | |
| 90 | EE | Majid Sarrafzadeh, Kuo-Feng Liao, Chak-Kuen Wong: Single-layer global routing. IEEE Trans. on CAD of Integrated Circuits and Systems 13(1): 38-47 (1994) |
| 89 | EE | Charles Chiang, Chak-Kuen Wong, Majid Sarrafzadeh: A weighted Steiner tree-based global router with simultaneous length and density minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 13(12): 1461-1469 (1994) |
| 1993 | ||
| 88 | EE | Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu: Routing for symmetric FPGAs and FPICs. ICCAD 1993: 486-490 |
| 87 | C. K. Wong: Determining the Shorest Process Migration Paths for Program Compilation Using a Dynamic Programming Approach. Operating Systems Review 27(2): 1-6 (1993) | |
| 1992 | ||
| 86 | Majid Sarrafzadeh, C. K. Wong: Bottleneck Steiner Trees in the Plane. IEEE Trans. Computers 41(3): 370-374 (1992) | |
| 85 | EE | Jin-fuw Lee, Chak-Kuen Wong: A performance-aimed cell compactor with automatic jogs. IEEE Trans. on CAD of Integrated Circuits and Systems 11(12): 1495-1507 (1992) |
| 84 | EE | Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, Chak-Kuen Wong: Provably good performance-driven global routing. IEEE Trans. on CAD of Integrated Circuits and Systems 11(6): 739-752 (1992) |
| 83 | EE | Majid Sarrafzadeh, Chak-Kuen Wong: Hierarchical Steiner tree construction in uniform orientations. IEEE Trans. on CAD of Integrated Circuits and Systems 11(9): 1095-1103 (1992) |
| 82 | C. D. Yang, D. T. Lee, C. K. Wong: On bends and lengths of rectilinear paths: a graph theoretic approach. Int. J. Comput. Geometry Appl. 2(1): 61-74 (1992) | |
| 1991 | ||
| 81 | Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, C. K. Wong: Performance-Driven Global Routing for Cell Based ICs. ICCD 1991: 170-173 | |
| 80 | C. D. Yang, D. T. Lee, C. K. Wong: On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. WADS 1991: 320-330 | |
| 79 | Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong: Minimum Diameter Spanning Trees and Related Problems. SIAM J. Comput. 20(5): 987-997 (1991) | |
| 1990 | ||
| 78 | EE | Jan-Ming Ho, Majid Sarrafzadeh, Gopalakrishnan Vijayan, Chak-Kuen Wong: Layer assignment for multichip modules. IEEE Trans. on CAD of Integrated Circuits and Systems 9(12): 1272-1277 (1990) |
| 77 | EE | Charles Chiang, Majid Sarrafzadeh, Chak-Kuen Wong: Global routing based on Steiner min-max trees. IEEE Trans. on CAD of Integrated Circuits and Systems 9(12): 1318-1325 (1990) |
| 76 | EE | Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong: New algorithms for the rectilinear Steiner tree problem. IEEE Trans. on CAD of Integrated Circuits and Systems 9(2): 185-193 (1990) |
| 75 | EE | Jan-Ming Ho, Majid Sarrafzadeh, Gopalakrishnan Vijayan, Chak-Kuen Wong: Pad minimization for planar routing of multiple power nets. IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 419-426 (1990) |
| 1989 | ||
| 74 | EE | Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong: A New Approach to the Rectilinear Steiner Tree Problem. DAC 1989: 161-166 |
| 73 | EE | Gopalakrishnan Vijayan, H. H. Chen, Chak-Kuen Wong: On VHV-routing in channels with irregular boundaries. IEEE Trans. on CAD of Integrated Circuits and Systems 8(2): 146-152 (1989) |
| 1987 | ||
| 72 | EE | Fabrizio Luccio, S. Mazzone, C. K. Wong: A note on visibility graphs. Discrete Mathematics 64(2-3): 209-219 (1987) |
| 71 | Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong: Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IEEE Trans. Computers 36(3): 321-331 (1987) | |
| 70 | W. K. Luk, Paolo Sipala, C. K. Wong: Minimum-Area Wiring for Slicing Structures. IEEE Trans. Computers 36(6): 745-760 (1987) | |
| 69 | EE | W. K. Luk, Paolo Sipala, Markku Tamminen, Donald T. Tang, Lin S. Woo, Chak-Kuen Wong: A Hierarchical Global Wiring Algorithm for Custom Chip Design. IEEE Trans. on CAD of Integrated Circuits and Systems 6(4): 518-533 (1987) |
| 68 | Peter Widmayer, Ying-Fung Wu, C. K. Wong: On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16(4): 728-746 (1987) | |
| 1986 | ||
| 67 | EE | W. K. Luk, Donald T. Tang, C. K. Wong: Hierarchial global wiring for custom chip design. DAC 1986: 481-489 |
| 66 | Ying-Fung Wu, Peter Widmayer, C. K. Wong: A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Inf. 23(2): 223-229 (1986) | |
| 65 | Markku Tamminen, W. K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong: Constructing Maximal Slicings from Geometry. Acta Inf. 23(3): 267-288 (1986) | |
| 64 | C. C. Lee, D. T. Lee, C. K. Wong: Generating Binary Trees of Bounded Height. Acta Inf. 23(5): 529-544 (1986) | |
| 63 | James H. Hester, Daniel S. Hirschberg, S.-H. H. Huang, C. K. Wong: Faster Construction of Optimal Binary Split Trees. J. Algorithms 7(3): 412-424 (1986) | |
| 1985 | ||
| 62 | EE | Martine D. F. Schlag, Ellen J. Yoffa, Peter S. Hauge, Chak-Kuen Wong: A Method for Improving Cascode-Switch Macro Wirability. IEEE Trans. on CAD of Integrated Circuits and Systems 4(2): 150-155 (1985) |
| 61 | Peter Widmayer, C. K. Wong: An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. 20(2): 75-82 (1985) | |
| 1984 | ||
| 60 | Shou-Hsuan Stephen Huang, C. K. Wong: Generalized Binary Split Trees. Acta Inf. 21: 113-123 (1984) | |
| 59 | Shou-Hsuan Stephen Huang, C. K. Wong: Optimal Binary Split Trees. J. Algorithms 5(1): 69-79 (1984) | |
| 1983 | ||
| 58 | C. K. Wong: Algorithmic Studies in Mass Storage Systems. Computer Science Press 1983 | |
| 57 | Shou-Hsuan Stephen Huang, C. K. Wong: Binary Search Trees with Limited Rotation. BIT 23(4): 436-455 (1983) | |
| 56 | Tina M. Nicholl, D. T. Lee, Yuh-Zen Liao, Chak-Kuen Wong: On the X-Y Convex Hull of a Set of X-Y Polygons. BIT 23(4): 456-471 (1983) | |
| 55 | Glen S. Miranker, Luong Tang, Chak-Kuen Wong: A ``Zero-Time'' VLSI Sorter. IBM Journal of Research and Development 27(2): 140-148 (1983) | |
| 54 | Inder S. Gopal, Don Coppersmith, C. K. Wong: Optimal Wiring of Movable Terminals. IEEE Trans. Computers 32(9): 845-858 (1983) | |
| 53 | EE | Yuh-Zen Liao, Chak-Kuen Wong: An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints. IEEE Trans. on CAD of Integrated Circuits and Systems 2(2): 62-69 (1983) |
| 52 | U. I. Gupta, D. T. Lee, C. K. Wong: Ranking and Unranking of B-Trees. J. Algorithms 4(1): 51-60 (1983) | |
| 51 | David M. Choy, C. K. Wong: Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval. SIAM J. Comput. 12(3): 426-446 (1983) | |
| 50 | D. T. Lee, C. L. Liu, C. K. Wong: (g 0, g 1, ... g k)-Trees and Unary OL Systems. Theor. Comput. Sci. 22: 209-217 (1983) | |
| 1982 | ||
| 49 | Ingemar Ingemarsson, Donald T. Tang, C. K. Wong: A conference key distribution system. IEEE Transactions on Information Theory 28(5): 714-719 (1982) | |
| 48 | Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong: Analysis of a General Mass Storage System. SIAM J. Comput. 11(1): 94-116 (1982) | |
| 47 | Udai Gupta, D. T. Lee, C. K. Wong: Ranking and Unranking of 2-3 Trees. SIAM J. Comput. 11(3): 582-590 (1982) | |
| 1981 | ||
| 46 | Gian Carlo Bongiovanni, Chak-Kuen Wong: Communication: A Number Representation Convertor for Magnetic Bubble String Comparators. IBM Journal of Research and Development 25(1): (1981) | |
| 45 | D. T. Lee, Hsu Chang, C. K. Wong: An On-Chip Compare/Steer Bubble Sorter. IEEE Trans. Computers 30(6): 396-405 (1981) | |
| 44 | Gian Carlo Bongiovanni, C. K. Wong: Tree Search in Major/Minor Loop Magnetic Bubble Memories. IEEE Trans. Computers 30(8): 537-545 (1981) | |
| 43 | Ingemar Ingemarsson, C. K. Wong: A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function. Inf. Process. Lett. 12(2): 63-67 (1981) | |
| 42 | D. T. Lee, C. K. Wong: Finding Intersection of Rectangles by Range Search. J. Algorithms 2(4): 337-347 (1981) | |
| 41 | U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong: Record Allocation for Minimizing Seek Delay. Theor. Comput. Sci. 16: 307-319 (1981) | |
| 1980 | ||
| 40 | Kin-Man Chung, Fabrizio Luccio, C. K. Wong: Magnetic Bubble Memory Structures for Efficient Sorting and Searching. IFIP Congress 1980: 439-444 | |
| 39 | C. K. Wong: On Some Discrete Optimization Problems in Mass Storage Systems. MFCS 1980: 75-93 | |
| 38 | C. K. Wong: Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems. ACM Comput. Surv. 12(2): 167-178 (1980) | |
| 37 | EE | D. T. Lee, C. K. Wong: Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353 (1980) |
| 36 | Kin-Man Chung, Fabrizio Luccio, Chak-Kuen Wong: On the Complexity of Permuting Records in Magnetic Bubble Memory Systems. IBM Journal of Research and Development 24(1): 75-84 (1980) | |
| 35 | Kin-Man Chung, Fabrizio Luccio, C. K. Wong: A Tree Storage Scheme for Magnetic Bubble Memories. IEEE Trans. Computers 29(10): 864-874 (1980) | |
| 34 | K. M. Chung, C. K. Wong: Construction of a Generalized Connector with 5.8 n log2 n Edges. IEEE Trans. Computers 29(11): 1029-1032 (1980) | |
| 33 | Kin-Man Chung, Fabrizio Luccio, C. K. Wong: On the Complexity of Sorting in Magnetic Bubble Memory Systems. IEEE Trans. Computers 29(7): 553-563 (1980) | |
| 32 | Kin-Man Chung, Fabrizio Luccio, C. K. Wong: A New Permutation Algorithm for Bubble Memories. Inf. Process. Lett. 10(4/5): 226-230 (1980) | |
| 31 | Kin-Man Chung, Fabrizio Luccio, C. K. Wong: Minimum Number of Steps for Permutation in a Bubble Memory. Inf. Process. Lett. 11(2): 81-83 (1980) | |
| 30 | C. K. Wong, Malcolm C. Easton: An Efficient Method for Weighted Sampling Without Replacement. SIAM J. Comput. 9(1): 111-113 (1980) | |
| 29 | D. T. Lee, C. K. Wong: Voronoi Diagrams in L_1 (L_infty) Metrics with 2-Dimensional Storage Applications. SIAM J. Comput. 9(1): 200-211 (1980) | |
| 1979 | ||
| 28 | Ashok K. Chandra, C. K. Wong: The Movement and Permutation of Columns in Magnetic Bubble Lattice Files. IEEE Trans. Computers 28(1): 8-15 (1979) | |
| 27 | Kin-Man Chung, C. K. Wong: Asymtotically Optimal Interconnection Networks from Two-State Cells. IEEE Trans. Computers 28(7): 500-505 (1979) | |
| 26 | EE | Daniel S. Hirschberg, C. K. Wong: Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory, Ser. B 26(1): 66-74 (1979) |
| 25 | Larry J. Stockmeyer, C. K. Wong: On the Number of Comparisons to Find the Intersection of Two Relations. SIAM J. Comput. 8(3): 388-404 (1979) | |
| 24 | James R. Bitner, C. K. Wong: Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage. SIAM J. Comput. 8(4): 479-498 (1979) | |
| 1978 | ||
| 23 | David M. Choy, C. K. Wong: Optimal alpha-beta Trees with Capacity Constraint. Acta Inf. 10: 273-296 (1978) | |
| 22 | Lawrence T. Kou, Larry J. Stockmeyer, C. K. Wong: Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs. Commun. ACM 21(2): 135-139 (1978) | |
| 21 | EE | A. C. McKellar, C. K. Wong: Dynamic Placement of Records in Linear Storage. J. ACM 25(3): 421-434 (1978) |
| 1977 | ||
| 20 | D. T. Lee, C. K. Wong: Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees. Acta Inf. 9: 23-29 (1977) | |
| 19 | Chak-Kuen Wong, Donald T. Tang: Dynamic Memories with Faster Random and Sequential Access. IBM Journal of Research and Development 21(3): 281-287 (1977) | |
| 1976 | ||
| 18 | Chak-Kuen Wong, Po Cheung Yue: Data Organization in Magnetic Bubble Lattice Files. IBM Journal of Research and Development 20(6): 576-581 (1976) | |
| 17 | C. K. Wong, Don Coppersmith: The Generation of Permutations in Magnetic Bubble Memories. IEEE Trans. Computers 25(3): 254-262 (1976) | |
| 16 | EE | C. K. Wong, Ashok K. Chandra: Bounds for the String Editing Problem. J. ACM 23(1): 13-16 (1976) |
| 15 | EE | Daniel S. Hirschberg, C. K. Wong: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23(1): 147-154 (1976) |
| 14 | Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong: Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3(3): 293-304 (1976) | |
| 1975 | ||
| 13 | Lawrence T. Kou, C. K. Wong: A Note on the Set Basis Problem Related to the Compaction of Character Sets. Commun. ACM 18(11): 656-557 (1975) | |
| 12 | EE | Malcolm C. Easton, C. K. Wong: The Effect of a Capacity Constraint on the Minimal Cost of a Partition. J. ACM 22(4): 441-449 (1975) |
| 11 | Ashok K. Chandra, C. K. Wong: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation. SIAM J. Comput. 4(3): 249-263 (1975) | |
| 10 | Richard M. Karp, A. C. McKellar, C. K. Wong: Near-Optimal Solutions to a 2-Dimensional Placement Problem. SIAM J. Comput. 4(3): 271-286 (1975) | |
| 1974 | ||
| 9 | EE | C. K. Wong, Don Coppersmith: A Combinatorial Problem Related to Multimodule Memory Organizations. J. ACM 21(3): 392-402 (1974) |
| 1973 | ||
| 8 | C. K. Wong, C. L. Liu, J. Apter: A drum scheduling algorithm. Automatentheorie und Formale Sprachen 1973: 267-275 | |
| 7 | Donald T. Tang, C. K. Wong: A Modified Branch-and-Bound Strategy. Inf. Process. Lett. 2(3): 65-69 (1973) | |
| 6 | EE | Jürg Nievergelt, C. K. Wong: Upper Bounds for the Total Path Length of Binary Trees. J. ACM 20(1): 1-6 (1973) |
| 5 | EE | P. C. Yue, C. K. Wong: On the Optimality of the Probability Ranking Scheme in Storage Applications. J. ACM 20(4): 624-633 (1973) |
| 1972 | ||
| 4 | A. C. McKellar, C. K. Wong: Bounds on Algorithms for String Generation Acta Inf. 1: 311-319 (1972) | |
| 3 | W. D. Frazer, C. K. Wong: Sorting by Natural Selection. Commun. ACM 15(10): 910-913 (1972) | |
| 2 | Jürg Nievergelt, J. Pradels, C. K. Wong, P. C. Yue: Bounds on the Weighted Path Length of Binary Trees. Inf. Process. Lett. 1(6): 220-225 (1972) | |
| 1971 | ||
| 1 | Jürg Nievergelt, C. K. Wong: On Binary Search Trees. IFIP Congress (1) 1971: 91-98 | |