default search action
Chak-Kuen Wong
C. K. Wong
Person information
- affiliation: Chinese University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
- [j163]C. K. Wong
:
Designs for Safer Signal-Controlled Intersections by Statistical Analysis of Accident Data at Accident Blacksites. IEEE Access 7: 111302-111314 (2019) - [j162]Chun Huang, C. K. Wong
Optimization of Vertical Elevator Movements and Material Storage Locations for High-Rise Building Construction with Overtime Cost Effects. J. Comput. Civ. Eng. 33(1) (2019) - 2014
- [j161]S. C. Ng, T. S. Lee, C. K. Wong, F. Y. Lee:
C1: an Automated Online Eduication Management System Based on an Object-Oriented Approach. J. Web Eng. 13(1&2): 87-96 (2014) - 2010
- [j160]Deqiang Zeng, Yiu Yin Raymond Lee
Analysis of a nonlinear oscillator with discontinuity. Comput. Math. Appl. 59(8): 2510-2515 (2010)
2000 – 2009
- 2008
- [j159]C. K. Wong, Hei Wong
Silicon oxynitride integrated waveguide for on-chip optical interconnects applications. Microelectron. Reliab. 48(2): 212-218 (2008) - [j158]C. K. Wong, John H. L. Pang
The influence of solder volume and pad area on Sn-3.8Ag-0.7Cu and Ni UBM reaction in reflow soldering and isothermal aging. Microelectron. Reliab. 48(4): 611-621 (2008) - [c44]Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, Larry P. Heck, Belle L. Tseng:
Trada: tree based ranking function adaptation. CIKM 2008: 1143-1152 - 2007
- [j157]Hei Wong
Silicon integrated photonics begins to revolutionize. Microelectron. Reliab. 47(1): 1-10 (2007) - 2006
- [j156]C. K. Wong, Hei Wong
Minimizing hydrogen content in silicon oxynitride by thermal oxidation of silicon-rich silicon nitride. Microelectron. Reliab. 46(12): 2056-2061 (2006) - [c43]C. K. Wong, Philip Heng Wai Leong
An FPGA-Based Electronic Cochlea with Dual Fixed-Point Arithmetic. FPL 2006: 1-6 - 2005
- [c42]C. K. Wong, Agnes Chan:
Immediate Data Authentication for Multicast in Resource Constrained Network. ACISP 2005: 113-121 - 2004
- [j155]Andreas Alexander Albrecht, Chak-Kuen Wong:
Approximation of Boolean Functions by Local Search. Comput. Optim. Appl. 27(1): 53-82 (2004) - [c41]C. K. Wong, K. K. Lo, Philip Heng Wai Leong:
An FPGA-based Othello endgame solver. FPT 2004: 81-88 - 2003
- [j154]Kathleen Steinhöfel
An experimental analysis of local minima to improve neighbourhood search. Comput. Oper. Res. 30(14): 2157-2173 (2003) - [j153]Jun Wei, F. L. Ng, M. L. Nai, H. Xie, Peck Cheng Lim, C. K. Wong:
Wafer Bonding Process Based On The Taguchi Analysis. Int. J. Comput. Eng. Sci. 4(2): 331-334 (2003) - [j152]Zhenfeng Wang, G. J. Qi, Jun Wei, Peck Cheng Lim, Yufeng Jin, C. K. Wong:
A Novel Wafer-Level Packaging Solution For Mems. Int. J. Comput. Eng. Sci. 4(2): 339-342 (2003) - [j151]Xuechuan 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. Int. J. Comput. Eng. Sci. 4(3): 724-728 (2003) - [j150]C. K. Wong
A Lane-Based Optimization Method for Minimizing Delay at Isolated Signal-Controlled Junctions. J. Math. Model. Algorithms 2(4): 379-406 (2003) - [j149]Yao-Wen Chang
Analysis of FPGA/FPIC switch modules. ACM Trans. Design Autom. Electr. Syst. 8(1): 11-37 (2003) - [c40]Carrison K. S. Tong, Kwok Kwan Chan, C. K. Wong:
Common gateway interfacing and dynamic jpeg techniques for remote handheld. CARS 2003: 815-820 - 2002
- [j148]Andreas Alexander Albrecht, Eike Hein, Kathleen Steinhöfel
Bounded-depth threshold circuits for computer-assisted CT image classification. Artif. Intell. Medicine 24(2): 179-192 (2002) - [j147]Kathleen Steinhöfel
Fast parallel heuristics for the job shop scheduling problem. Comput. Oper. Res. 29(2): 151-169 (2002) - [j146]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. Eur. J. Oper. Res. 141(2): 341-358 (2002) - [j145]Zongben Xu, Huidong Jin
An automata network for performing combinatorial optimization. Neurocomputing 47(1-4): 59-83 (2002) - [j144]Kathleen Steinhöfel
The convergence of stochastic algorithms solving flow shop scheduling. Theor. Comput. Sci. 285(1): 101-117 (2002) - [j143]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) - [c39]Andreas Alexander Albrecht, Staal Amund 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 - 2001
- [j142]Andreas Alexander Albrecht, Kathleen Steinhöfel
Logarithmic simulated annealing for X-ray diagnosis. Artif. Intell. Medicine 22(3): 249-260 (2001) - [j141]Andreas Alexander Albrecht, S. K. Cheung, Kwong-Sak Leung, Chak-Kuen Wong:
On the Convergence of Inhomogeneous Markov Chains Approximating Equilibrium Placements of Flexible Objects. Comput. Optim. Appl. 19(2): 179-208 (2001) - [j140]Y. Y. Li, Kwong-Sak Leung, C. K. Wong:
Steiner Trees in General Nonuniform Orientations. Computing 66(1): 41-78 (2001) - [j139]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang
The Kr-Packing Problem. Computing 66(1): 79-89 (2001) - [j138]Xiaoqiang Cai, Dan Sha, C. K. Wong:
Time-varying minimum cost flow problems. Eur. J. Oper. Res. 131(2): 352-374 (2001) - [j137]Hongbing Fan, Yu-Liang Wu, C. K. Wong:
On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks. Graphs Comb. 17(2): 213-225 (2001) - [j136]Andreas Alexander Albrecht, C. K. Wong:
Combining the Perceptron Algorithm with Logarithmic Simulated Annealing. Neural Process. Lett. 14(1): 75-83 (2001) - [j135]Sze Chun Wong
A parallelized genetic algorithm for the calibration of Lowry model. Parallel Comput. 27(12): 1523-1536 (2001) - [j134]Kwong-Sak Leung, Qihong Duan
A new model of simulated evolutionary computation-convergence analysis and specifications. IEEE Trans. Evol. Comput. 5(1): 3-16 (2001) - [c38]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 - [c37]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 - [c36]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 - [c35]Jin-Fuw Lee, Daniel L. Ostapko, Jeffery Soreff, C. K. Wong:
On the Signal Bounding Problem in Timing Analysis. ICCAD 2001: 507-514 - 2000
- [j133]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
On the bounded domination number of tournaments. Discret. Math. 220(1-3): 257-261 (2000) - [j132]Jin Xu, C. K. Wong:
Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs. Discret. Math. 223(1-3): 309-326 (2000) - [j131]Guiying Yan, Jiaofeng Pan, C. K. Wong, Taro Tokuda:
Decomposition of Graphs into (g, f)-Factors. Graphs Comb. 16(1): 117-126 (2000) - [j130]Xiaoyun Lu, Da-Wei Wang, Jiaofeng Pan, C. K. Wong:
Rooted Spanning Trees in Tournaments. Graphs Comb. 16(4): 411-427 (2000) - [j129]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) - [j128]Guochuan Zhang
Linear time-approximation algorithms for bin packing. Oper. Res. Lett. 26(5): 217-222 (2000) - [j127]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) - [j126]Y. C. Wong, Kwong-Sak Leung, C. K. Wong:
Simulated annealing-based algorithms for the studies of the thermoelastic scaling behavior. IEEE Trans. Syst. Man Cybern. Part C 30(4): 506-516 (2000) - [c34]Andreas Alexander Albrecht, Chak-Kuen Wong:
Inhomogeneous Markov Chains Applied to Pattern Classification. AI&M 2000 - [c33]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 - [c32]Andreas Alexander Albrecht, Chak-Kuen Wong:
On Logarithmic Simulated Annealing. IFIP TCS 2000: 301-314 - [c31]Andreas Alexander Albrecht, Uwe Der, Kathleen Steinhöfel, Chak-Kuen Wong:
Distributed Simulated Annealing for Job Shop Scheduling. PPSN 2000: 243-252
1990 – 1999
- 1999
- [j125]Jin-yi Cai, C. K. Wong:
Foreword. Algorithmica 23(4): 277 (1999) - [j124]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
The strong Hall property and symmetric chain orders. Discret. Math. 203(1-3): 161-168 (1999) - [j123]Kathleen Steinhöfel
Two simulated annealing-based heuristics for the job shop scheduling problem. Eur. J. Oper. Res. 118(3): 524-548 (1999) - [j122]Xiaoyun Lu, Da-Wei Wang, Gerard J. Chang, In-Jen Lin, C. K. Wong:
On k-ary spanning trees of tournaments. J. Graph Theory 30(3): 167-176 (1999) - [p1]Wenqi Huang, Yu-Liang Wu, C. K. Wong:
A Cogitative Algorithm for Solving the Equal Circles Packing Problem. Handbook of Combinatorial Optimization 1999: 591-605 - 1998
- [j121]Xiaoyun Lu, Da-Wei Wang, C. K. Wong:
On avoidable and unavoidable claws. Discret. Math. 184(1-3): 259-265 (1998) - [j120]Jiaofeng Pan, Yu-Liang Wu, C. K. Wong, Guiying Yan:
On the optimal four-way switch box routing structures of FPGA greedy routing architectures1. Integr. 25(2): 137-159 (1998) - [j119]Ton Kloks, Haiko Müller
Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998) - [j118]Ton Kloks, Dieter Kratsch, C. K. Wong:
Minimum Fill-in on Circle and Circular-Arc Graphs. J. Algorithms 28(2): 272-289 (1998) - [j117]Majid Sarrafzadeh, Wei-Liang Lin, C. K. Wong:
Floating Steiner Trees. IEEE Trans. Computers 47(2): 197-211 (1998) - [c30]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 - [c29]Yu-Liang Wu, Hongbing Fan, C. K. Wong:
On thin Boolean functions and related optimum OBDD ordering. ICCD 1998: 216-218 - [c28]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 - [c27]Kathleen Steinhöfel
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem. RANDOM 1998: 260-279 - [c26]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong:
The Vertex-Disjoint Triangles Problem. WG 1998: 26-37 - 1997
- [j116]D. T. Lee, Chung-Do Yang, C. K. Wong:
Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. Int. J. Comput. Geom. Appl. 7(6): 581-598 (1997) - [j115]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) - [j114]X. Cai, Ton Kloks, C. K. Wong:
Time-varying shortest path problems with constraints. Networks 29(3): 141-150 (1997) - [j113]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) - [j112]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) - [j111]Chung-Do 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) - [j110]Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu:
Routing for symmetric FPGAs and FPICs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(1): 20-31 (1997) - [c25]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 - [c24]Peter Blomgren, Tony F. Chan, Pep Mulet
Total variation image restoration: numerical methods and extensions. ICIP (3) 1997: 384-387 - 1996
- [j109]D. T. Lee, Chung-Do Yang, C. K. Wong:
Rectilinear Paths Among Rectilinear Obstacles. Discret. Appl. Math. 70(3): 185-215 (1996) - [j108]Jin-Fuw Lee, Donald T. Tang, Chak-Kuen Wong:
A timing analysis algorithm for circuits with level-sensitive latches. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(5): 535-543 (1996) - [j107]Yao-Wen Chang, D. F. Wong
Universal switch modules for FPGA design. ACM Trans. Design Autom. Electr. Syst. 1(1): 80-101 (1996) - [c23]Yao-Wen Chang, D. F. Wong
Universal Switch-Module Design for Symmetric-Array-Based FPGAs. FPGA 1996: 80-86 - [c22]Ton Kloks, Dieter Kratsch, C. K. Wong:
Minimum Fill-In on Circle and Circular-Arc Graphs. ICALP 1996: 256-267 - [c21]Ton Kloks, Haiko Müller
Vertex Ranking of Asteroidal Triple-Free Graphs. ISAAC 1996: 174-182 - [c20]X. Cai, Ton Kloks, C. K. Wong:
Shortest Path Problems with Time Constraints. MFCS 1996: 255-266 - [e1]Jin-yi Cai, C. K. Wong:
Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings. Lecture Notes in Computer Science 1090, Springer 1996, ISBN 3-540-61332-3 [contents] - 1995
- [j106]Chung-Do Yang, D. T. Lee, C. K. Wong:
Rectilinear Path Problems among Rectilinear Obstacles Revisited. SIAM J. Comput. 24(3): 457-472 (1995) - [j105]Ting-Chi Wang, Martin D. F. Wong
Optimal net assignment. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(2): 265-269 (1995) - [c19]Yao-Wen Chang, D. F. Wong
FPGA global routing based on a new congestion metric. ICCD 1995: 372-378 - [c18]Yao-Wen Chang, D. F. Wong
Design and analysis of FPGA/FPIC switch modules. ICCD 1995: 394-401 - 1994
- [j104]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) - [j103]Majid Sarrafzadeh, Kuo-Feng Liao, Chak-Kuen Wong:
Single-layer global routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(1): 38-47 (1994) - [j102]Charles C. Chiang, Chak-Kuen Wong, Majid Sarrafzadeh:
A weighted Steiner tree-based global router with simultaneous length and density minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(12): 1461-1469 (1994) - [c17]Shen Lin, C. K. Wong:
Process-variation-tolerant clock skew minimization. ICCAD 1994: 284-288 - [c16]Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong:
The reproducing placement problem with applications. ICCAD 1994: 686-689 - [c15]Jin-Fuw Lee, Donald T. Tang, C. K. Wong:
A timing analysis algorithm for circuits with level-sensitive latches. ICCAD 1994: 743-748 - 1993
- [j101]C. K. Wong:
Determining the Shorest Process Migration Paths for Program Compilation Using a Dynamic Programming Approach. ACM SIGOPS Oper. Syst. Rev. 27(2): 1-6 (1993) - [c14]Ting-Chi Wang, D. F. Wong
On over-the-cell channel routing. EURO-DAC 1993: 110-115 - [c13]Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu:
Routing for symmetric FPGAs and FPICs. ICCAD 1993: 486-490 - 1992
- [j100]Chung-Do Yang, D. T. Lee, C. K. Wong:
On bends and lengths of rectilinear paths: a graph theoretic approach. Int. J. Comput. Geom. Appl. 2(1): 61-74 (1992) - [j99]Majid Sarrafzadeh, C. K. Wong:
Bottleneck Steiner Trees in the Plane. IEEE Trans. Computers 41(3): 370-374 (1992) - [j98]Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, Chak-Kuen Wong:
Provably good performance-driven global routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(6): 739-752 (1992) - [j97]Majid Sarrafzadeh, Chak-Kuen Wong:
Hierarchical Steiner tree construction in uniform orientations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(9): 1095-1103 (1992) - [j96]Jin-Fuw Lee, Chak-Kuen Wong:
A performance-aimed cell compactor with automatic jogs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(12): 1495-1507 (1992) - 1991
- [j95]Charles C. Chiang, Majid Sarrafzadeh, C. K. Wong:
An optimal algorithm for rectilinear steiner trees for channels with obstacles. Int. J. Circuit Theory Appl. 19(6): 551-563 (1991) - [j94]Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong:
Planar topological routing of pad nets. Integr. 11(3): 295-316 (1991) - [j93]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) - [j92]Maurizio A. Bonuccelli, Inder S. Gopal, C. K. Wong:
Incremental time-slot assignment in SS/TDMA satellite systems. IEEE Trans. Commun. 39(7): 1147-1156 (1991) - [c12]Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, C. K. Wong:
Performance-Driven Global Routing for Cell Based ICs. ICCD 1991: 170-173 - [c11]Chung-Do Yang, D. T. Lee, C. K. Wong:
On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach. WADS 1991: 320-330 - 1990
- [j91]Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong:
New algorithms for the rectilinear Steiner tree problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(2): 185-193 (1990) - [j90]Jan-Ming Ho, Majid Sarrafzadeh, Gopalakrishnan Vijayan, Chak-Kuen Wong:
Pad minimization for planar routing of multiple power nets. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(4): 419-426 (1990) - [j89]Jan-Ming Ho, Majid Sarrafzadeh, Gopalakrishnan Vijayan, Chak-Kuen Wong:
Layer assignment for multichip modules. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(12): 1272-1277 (1990) - [j88]Charles C. Chiang, Majid Sarrafzadeh, Chak-Kuen Wong:
Global routing based on Steiner min-max trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(12): 1318-1325 (1990)
1980 – 1989
- 1989
- [j87]Gopalakrishnan Vijayan, Hai Hsia Chen, Chak-Kuen Wong:
On VHV-routing in channels with irregular boundaries. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(2): 146-152 (1989) - [c10]Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong:
A New Approach to the Rectilinear Steiner Tree Problem. DAC 1989: 161-166 - [c9]Charles C. Chiang, Majid Sarrafzadeh, Chak-Kuen Wong:
A powerful global router: based on Steiner min-max trees. ICCAD 1989: 2-5 - [c8]Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong:
Constructing the optimal rectilinear Steiner tree derivable from a minimum spanning tree. ICCAD 1989: 6-9 - 1988
- [j86]Peter Widmayer, Lin S. Woo, C. K. Wong:
Maximizing pin alignment in semi-custom chip circuit layout. Integr. 6(1): 3-33 (1988) - 1987
- [j85]Fabrizio Luccio, S. Mazzone, C. K. Wong:
A note on visibility graphs. Discret. Math. 64(2-3): 209-219 (1987) - [j84]Peter Widmayer, Ying-Fung Wu, C. K. Wong:
On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16(4): 728-746 (1987) - [j83]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) - [j82]Wing K. Luk, Paolo Sipala, C. K. Wong:
Minimum-Area Wiring for Slicing Structures. IEEE Trans. Computers 36(6): 745-760 (1987) - [j81]Wing 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. Comput. Aided Des. Integr. Circuits Syst. 6(4): 518-533 (1987) - 1986
- [j80]Ying-Fung Wu, Peter Widmayer, C. K. Wong:
A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Informatica 23(2): 223-229 (1986) - [j79]Markku Tamminen, Wing K. Luk, Paolo Sipala, Lin S. Woo, C. K. Wong:
Constructing Maximal Slicings from Geometry. Acta Informatica 23(3): 267-288 (1986) - [j78]C. C. Lee, D. T. Lee, C. K. Wong:
Generating Binary Trees of Bounded Height. Acta Informatica 23(5): 529-544 (1986) - [j77]Peter Widmayer, Ying-Fung Wu, Martine D. F. Schlag, Chak-Kuen Wong:
On some union and intersection problems for polygons with fixed orientations. Computing 36(3): 183-197 (1986) - [j76]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) - [j75]Madeleine Paoli, W. W. Wong, C. K. Wong:
Minimum k-hamiltonian graphs, II. J. Graph Theory 10(1): 79-95 (1986) - [c7]Wing K. Luk, Donald T. Tang, C. K. Wong:
Hierarchial global wiring for custom chip design. DAC 1986: 481-489 - 1985
- [j74]Peter Widmayer, C. K. Wong:
An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. 20(2): 75-82 (1985) - [j73]Martine D. F. Schlag, Ellen J. Yoffa, Peter S. Hauge, Chak-Kuen Wong:
A Method for Improving Cascode-Switch Macro Wirability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4(2): 150-155 (1985) - [j72]Inder S. Gopal, C. K. Wong:
Minimizing the Number of Switchings in an SS/TDMA System. IEEE Trans. Commun. 33(6): 497-501 (1985) - [c6]Peter Widmayer, Ying-Fung Wu, C. K. Wong:
Distance problems in computational geometry with fixed orientations. SCG 1985: 186-195 - 1984
- [j71]Shou-Hsuan Stephen Huang, C. K. Wong:
Generalized Binary Split Trees. Acta Informatica 21: 113-123 (1984) - [j70]Martine D. F. Schlag, Lin S. Woo, Chak-Kuen Wong:
Maximizing pin alignment by pin permutations. Integr. 2(4): 279-307 (1984) - [j69]Shou-Hsuan Stephen Huang, C. K. Wong:
Optimal Binary Split Trees. J. Algorithms 5(1): 69-79 (1984) - [j68]W. W. Wong, C. K. Wong:
Minimum K-hamiltonian graphs. J. Graph Theory 8(1): 155-165 (1984) - 1983
- [b1]C. K. Wong:
Algorithmic Studies in Mass Storage Systems. Computer Science Press 1983 - [j67]Shou-Hsuan Stephen Huang, C. K. Wong:
Binary Search Trees with Limited Rotation. BIT 23(4): 436-455 (1983) - [j66]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) - [j65]Glen S. Miranker, Luong Tang, Chak-Kuen Wong:
A "Zero-Time" VLSI Sorter. IBM J. Res. Dev. 27(2): 140-148 (1983) - [j64]Martine D. F. Schlag, Yuh-Zen Liao, C. K. Wong:
An algorithm for optimal two-dimensional compaction of VLSI layouts. Integr. 1(2-3): 179-209 (1983) - [j63]Udaiprakash I. Gupta, D. T. Lee, C. K. Wong:
Ranking and Unranking of B-Trees. J. Algorithms 4(1): 51-60 (1983) - [j62]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) - [j61]Inder S. Gopal, Don Coppersmith, C. K. Wong:
Optimal Wiring of Movable Terminals. IEEE Trans. Computers 32(9): 845-858 (1983) - [j60]Yuh-Zen Liao, Chak-Kuen Wong:
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2(2): 62-69 (1983) - [j59]Inder S. Gopal, Maurizio A. Bonuccelli, C. K. Wong:
Scheduling in Multibeam Satellites with Interfering Zones. IEEE Trans. Commun. 31(8): 941-951 (1983) - [j58]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) - [c5]Yuh-Zen Liao, Chak-Kuen Wong:
An algorithm to compact a VLSI symbolic layout with mixed constraints. DAC 1983: 107-112 - 1982
- [j57]Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong:
Analysis of a General Mass Storage System. SIAM J. Comput. 11(1): 94-116 (1982) - [j56]Udai Gupta, D. T. Lee, C. K. Wong:
Ranking and Unranking of 2-3 Trees. SIAM J. Comput. 11(3): 582-590 (1982) - [j55]Inder S. Gopal, Don Coppersmith, C. K. Wong:
Minimizing Packet Waiting Time in a Multibeam Satellite System. IEEE Trans. Commun. 30(2): 305-316 (1982) - [j54]Inder S. Gopal, Giancarlo Bongiovanni, Maurizio A. Bonuccelli, Donald T. Tang, C. K. Wong:
An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth Beams. IEEE Trans. Commun. 30(11): 2475-2481 (1982) - [j53]Ingemar Ingemarsson, Donald T. Tang, C. K. Wong:
A conference key distribution system. IEEE Trans. Inf. Theory 28(5): 714-719 (1982) - 1981
- [j52]Gian Carlo Bongiovanni, Chak-Kuen Wong:
Communication: A Number Representation Convertor for Magnetic Bubble String Comparators. IBM J. Res. Dev. 25(1): 83-87 (1981) - [j51]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) - [j50]D. T. Lee, C. K. Wong:
Finding Intersection of Rectangles by Range Search. J. Algorithms 2(4): 337-347 (1981) - [j49]D. T. Lee, Hsu Chang, C. K. Wong:
An On-Chip Compare/Steer Bubble Sorter. IEEE Trans. Computers 30(6): 396-405 (1981) - [j48]Gian Carlo Bongiovanni, C. K. Wong:
Tree Search in Major/Minor Loop Magnetic Bubble Memories. IEEE Trans. Computers 30(8): 537-545 (1981) - [j47]Giancarlo Bongiovanni, Don Coppersmith, C. K. Wong:
An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders. IEEE Trans. Commun. 29(5): 721-726 (1981) - [j46]Giancarlo Bongiovanni, Donald T. Tang, C. K. Wong:
A General Multibeam Satellite Switching Algorithm. IEEE Trans. Commun. 29(7): 1025-1036 (1981) - [j45]Ingemar Ingemarsson, C. K. Wong:
Encryption and Authentication in On-Board Processing Satellite Communication Systems. IEEE Trans. Commun. 29(11): 1684-1687 (1981) - [j44]Udaiprakash 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
- [j43]C. K. Wong:
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems. ACM Comput. Surv. 12(2): 167-178 (1980) - [j42]Kin-Man Chung, Fabrizio Luccio, Chak-Kuen Wong:
On the Complexity of Permuting Records in Magnetic Bubble Memory Systems. IBM J. Res. Dev. 24(1): 75-84 (1980) - [j41]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
A New Permutation Algorithm for Bubble Memories. Inf. Process. Lett. 10(4/5): 226-230 (1980) - [j40]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) - [j39]C. K. Wong, Malcolm C. Easton:
An Efficient Method for Weighted Sampling Without Replacement. SIAM J. Comput. 9(1): 111-113 (1980) - [j38]D. T. Lee, C. K. Wong:
Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications. SIAM J. Comput. 9(1): 200-211 (1980) - [j37]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) - [j36]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
A Tree Storage Scheme for Magnetic Bubble Memories. IEEE Trans. Computers 29(10): 864-874 (1980) - [j35]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) - [j34]D. T. Lee, C. K. Wong:
Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353 (1980) - [c4]Kin-Man Chung, Fabrizio Luccio, C. K. Wong:
Magnetic Bubble Memory Structures for Efficient Sorting and Searching. IFIP Congress 1980: 439-444 - [c3]C. K. Wong:
On Some Discrete Optimization Problems in Mass Storage Systems. MFCS 1980: 75-93
1970 – 1979
- 1979
- [j33]Daniel S. Hirschberg, C. K. Wong:
Upper and lower bounds for graph-diameter problems with application to record allocation. J. Comb. Theory B 26(1): 66-74 (1979) - [j32]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) - [j31]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) - [j30]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) - [j29]Kin-Man Chung, C. K. Wong:
Asymtotically Optimal Interconnection Networks from Two-State Cells. IEEE Trans. Computers 28(7): 500-505 (1979) - 1978
- [j28]David M. Choy, C. K. Wong:
Optimal alpha-beta Trees with Capacity Constraint. Acta Informatica 10: 273-296 (1978) - [j27]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) - [j26]A. K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Bin Packing with Geometric Constraints in Computer Network Design. Oper. Res. 26(5): 760-772 (1978) - [j25]A. C. McKellar, C. K. Wong:
Dynamic Placement of Records in Linear Storage. J. ACM 25(3): 421-434 (1978) - 1977
- [j24]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 Informatica 9: 23-29 (1977) - [j23]Chak-Kuen Wong, Donald T. Tang:
Dynamic Memories with Faster Random and Sequential Access. IBM J. Res. Dev. 21(3): 281-287 (1977) - 1976
- [j22]Chak-Kuen Wong, Po Cheung Yue:
Data Organization in Magnetic Bubble Lattice Files. IBM J. Res. Dev. 20(6): 576-581 (1976) - [j21]C. K. Wong, Ashok K. Chandra:
Bounds for the String Editing Problem. J. ACM 23(1): 13-16 (1976) - [j20]Daniel S. Hirschberg, C. K. Wong:
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables. J. ACM 23(1): 147-154 (1976) - [j19]C. K. Wong, Don Coppersmith:
The Generation of Permutations in Magnetic Bubble Memories. IEEE Trans. Computers 25(3): 254-262 (1976) - [j18]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
- [j17]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) - [j16]P. C. Yue, C. K. Wong:
Near-optimal heuristics for an assignment problem in mass storage. Int. J. Parallel Program. 4(4): 281-294 (1975) - [j15]P. C. Yue, C. K. Wong:
Storage cost considerations in secondary index selection. Int. J. Parallel Program. 4(4): 307-327 (1975) - [j14]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) - [j13]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) - [j12]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
- [j11]C. K. Wong, Don Coppersmith:
A Combinatorial Problem Related to Multimodule Memory Organizations. J. ACM 21(3): 392-402 (1974) - [j10]C. K. Wong, Shi-Kuo Chang:
Parallel Generation of Binary Search Trees. IEEE Trans. Computers 23(3): 268-271 (1974) - 1973
- [j9]Chak-Kuen Wong, P. C. Yue:
A majorization theorem for the number of distinct outcomes in n independent trials. Discret. Math. 6(4): 391-398 (1973) - [j8]Donald T. Tang, C. K. Wong:
A Modified Branch-and-Bound Strategy. Inf. Process. Lett. 2(3): 65-69 (1973) - [j7]Jürg Nievergelt, C. K. Wong:
Upper Bounds for the Total Path Length of Binary Trees. J. ACM 20(1): 1-6 (1973) - [j6]P. C. Yue, C. K. Wong:
On the Optimality of the Probability Ranking Scheme in Storage Applications. J. ACM 20(4): 624-633 (1973) - [j5]Chak-Kuen Wong, P. C. Yue:
The Anticipatory Control of a Cyclically Permutable Memory. IEEE Trans. Computers 22(5): 481-488 (1973) - [c2]C. K. Wong, C. L. Liu, J. Apter:
A drum scheduling algorithm. Automatentheorie und Formale Sprachen 1973: 267-275 - 1972
- [j4]A. C. McKellar, C. K. Wong:
Bounds on Algorithms for String Generation. Acta Informatica 1: 311-319 (1972) - [j3]W. Donald Frazer, C. K. Wong:
Sorting by Natural Selection. Commun. ACM 15(10): 910-913 (1972) - [j2]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) - [j1]C. K. Wong, P. C. Yue:
Reconstruction of patterns by block-projection. Inf. Sci. 4(3-4): 357-366 (1972) - 1971
- [c1]Jürg Nievergelt, C. K. Wong:
On Binary Search Trees. IFIP Congress (1) 1971: 91-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: