On the Learnability of a Restricted Predicate Formulae. - Jilei Yin; Hong Zhu 004 (FCT, 1993)

Learning Decision Lists from Noisy Examples. - Jilei Yin; Hong Zhu 004 (MFCS, 1993)

The least basic operations on heap and improved heapsort. - Jigang Wu; Hong Zhu 004 (J. Comput. Sci. Technol., 1994)

MNP: A Class of NP Optimization Problems (Extended Abstract). - Qi Cheng 001; Hong Zhu 004 (COCOON, 1995)

MNP: A class of NP optimization problems. - Qi Cheng 001; Hong Zhu 004 (J. Comput. Sci. Technol., 1997)

On the Properties of Cryptographic Protocols and the Weakness of the BAN-like Logics. - Shouhuai Xu; Gendu Zhang; Hong Zhu 004 (ACM SIGOPS Oper. Syst. Rev., 1997)

On the Security of Three-Party Cryptographic Protocols. - Shouhuai Xu; Gendu Zhang; Hong Zhu 004 (ACM SIGOPS Oper. Syst. Rev., 1998)

Money Conservation via Atomicity in Fair Off-Line E-Cash. - Shouhuai Xu; Moti Yung; Gendu Zhang; Hong Zhu 004 (ISW, 1999)

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. - Xiaotie Deng; Haodi Feng; Pixing Zhang; Hong Zhu 004 (ISAAC, 2001)

Reduction Zero-Knowledge. - Xiaotie Deng; Chan H. Lee; Yunlei Zhao; Hong Zhu 004 (SCN, 2002)

Incentive Compatible Mechanism Based on Linear Pricing Scheme for Single-Minded Auction. - Ning Chen 005; Hong Zhu 004 (ASIAN, 2003)

Resettable Zero-Knowledge in the Weak Public-Key Model. - Yunlei Zhao; Xiaotie Deng; Chan H. Lee; Hong Zhu 004 (EUROCRYPT, 2003)

The Closest Vector Problem on Some Lattices. - Haibin Kan; Hong Shen 001; Hong Zhu 004 (GCC (2), 2003)

Double Auction in Two-Level Markets. - Ning Chen 005; Xiaotie Deng; Hong Zhu 004 (International Conference on Computational Science, 2003)

Building Semantic Peer-to-Peer Networks upon CAN. - Jiantao Song; Yong Zhang 001; Chaofeng Sha; Hong Zhu 004 (Networked Group Communication, 2003)

Combinatorial auction across independent markets (extended abstract). - Ning Chen 005; Xiaotie Deng; Hong Zhu 004 (EC, 2003)

Some Observations on Zap and Its Applications. - Yunlei Zhao; Chan H. Lee; Yiming Zhao; Hong Zhu 004 (ACNS, 2004)

General Public Key m-Out-of-n Oblivious Transfer. - Zhide Chen; Hong Zhu 004 (CIS, 2004)

An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs. - Yong Zhang 001; Hong Zhu 004 (COCOON, 2004)

Nash Equilibria in Parallel Downloading with Multiple Clients. - Jiantao Song; Chaofeng Sha; Hong Zhu 004 (ICDCS, 2004)

A Probabilistic Parameterized Algorithm for Vertex Cover in Sticker Model. - Zhiyun Chen; Huiqin Qu; Mingming Lu; Hong Zhu 004 (IPDPS, 2004)

Quantum m-out-of-n oblivious transfer. - Zhide Chen; Hong Zhu 004 (ISCC, 2004)

Fully Truthful Mechanisms. - Ning Chen 005; Hong Zhu 004 (SOFSEM, 2004)

Minimizing Mean Completion Time in a Batch Processing System. - Xiaotie Deng; Haodi Feng; Pixing Zhang; Yuzhong Zhang; Hong Zhu 004 (Algorithmica, 2004)

Approximation for Dominating Set Problem with Measure Functions. - Ning Chen 005; Jie Meng; Jiawei Rong; Hong Zhu 004 (Comput. Artif. Intell., 2004)

(2+f(n))-SAT and its properties. - Yunlei Zhao; Xiaotie Deng; Chan H. Lee; Hong Zhu 004 (Discret. Appl. Math., 2004)

Approximation Algorithm for Weighted Weak Vertex Cover. - Yong Zhang 001; Hong Zhu 004 (J. Comput. Sci. Technol., 2004)

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. - Wun-Tat Chan; Francis Y. L. Chin; Yong Zhang 001; Hong Zhu 004; Hong Shen 001; Prudence W. H. Wong (COCOON, 2005)

Progress in Computational Complexity Theory. - Jin-yi Cai; Hong Zhu 004 (J. Comput. Sci. Technol., 2005)

Non-metric Multicommodity and Multilevel Facility Location. - Rudolf Fleischer; Jian Li 015; Shijun Tian; Hong Zhu 004 (AAIM, 2006)

Traversing the Machining Graph. - Danny Z. Chen; Rudolf Fleischer; Jian Li 015; Haitao Wang 001; Hong Zhu 004 (ESA, 2006)

Frequency Allocation Problems for Linear Cellular Networks. - Joseph Wun-Tat Chan; Francis Y. L. Chin; Deshi Ye; Yong Zhang 001; Hong Zhu 004 (ISAAC, 2006)

On Approximating the Maximum Simple Sharing Problem. - Danny Z. Chen; Rudolf Fleischer; Jian Li 015; Zhiyi Xie; Hong Zhu 004 (ISAAC, 2006)

Very Fast Region-Connected Segmentation for Spatial Data: Case Study. - Li Chen; Hong Zhu 004; Wei Cui (SMC, 2006)

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. - Wun-Tat Chan; Francis Y. L. Chin; Yong Zhang 001; Hong Zhu 004; Hong Shen 001; Prudence W. H. Wong (J. Comb. Optim., 2006)

An Improved Algorithm for Finding the Closest Pair of Points. - Qi Ge; Haitao Wang 001; Hong Zhu 004 (J. Comput. Sci. Technol., 2006)

Approximating the minimum weight weak vertex cover. - Yong Zhang 001; Qi Ge; Rudolf Fleischer; Tao Jiang; Hong Zhu 004 (Theor. Comput. Sci., 2006)

Online OVSF Code Assignment with Resource Augmentation. - Francis Y. L. Chin; Yong Zhang 001; Hong Zhu 004 (AAIM, 2007)

Efficient Algorithms for k -Disjoint Paths Problems on DAGs. - Rudolf Fleischer; Qi Ge; Jian Li 015; Hong Zhu 004 (AAIM, 2007)

A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. - Francis Y. L. Chin; Yong Zhang 001; Hong Zhu 004 (COCOON, 2007)

Approximating the Maximum Sharing Problem. - Amitabh Chaudhary; Danny Z. Chen; Rudolf Fleischer; Xiaobo Sharon Hu; Jian Li 015; Michael T. Niemier; Zhiyi Xie; Hong Zhu 004 (WADS, 2007)

Greedy online frequency allocation in cellular networks. - Joseph Wun-Tat Chan; Francis Y. L. Chin; Deshi Ye; Yong Zhang 001; Hong Zhu 004 (Inf. Process. Lett., 2007)

Efficient algorithms for finding a longest common increasing subsequence. - Wun-Tat Chan; Yong Zhang 001; Stanley P. Y. Fung; Deshi Ye; Hong Zhu 004 (J. Comb. Optim., 2007)

A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (AAIM, 2008)

Greedy Construction of 2-Approximation Minimum Manhattan Network. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (ISAAC, 2008)

The Closest Pair Problem under the Hamming Metric. - Kerui Min; Ming-Yang Kao; Hong Zhu 004 (COCOON, 2009)

Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks. - Yixiang Chen 001; Tian-Ming Bu; Min Zhang 007; Hong Zhu 004 (Web Intelligence/IAT Workshops, 2009)

Average Transitive Trustworthy Degrees for Trustworthy Networks. - Yixiang Chen 001; Min Zhang 007; Hong Zhu 004; Tian-Ming Bu (RSKT, 2009)

A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. - Yong Zhang 001; Francis Y. L. Chin; Hong Zhu 004 (Algorithmica, 2009)

Approximation algorithms for inner-node weighted minimum spanning trees. - Chao Peng 004; Yasuo Tan; Naixue Xiong; Laurence Tianruo Yang; Hong Zhu 004 (Comput. Syst. Sci. Eng., 2009)

On Construction of Almost-Ramanujan Graphs. - He Sun 001; Hong Zhu 004 (Discret. Math. Algorithms Appl., 2009)

Preface: Algorithms, complexity and models of computation. - S. Barry Cooper; Hong Zhu 004 (Theor. Comput. Sci., 2009)

A Measurement of Software Trustworthiness Based on Approximation Algorithms. - Jie Zhou; Hong Zhu 004 (UIC/ATC Workshops, 2010)

Greedy Construction of 2-Approximate Minimum Manhattan Networks. - Zeyu Guo 001; He Sun 001; Hong Zhu 004 (Int. J. Comput. Geom. Appl., 2011)

Minimum common string partition revisited. - Haitao Jiang; Binhai Zhu; Daming Zhu; Hong Zhu 004 (J. Comb. Optim., 2012)

Vehicle Scheduling Problem on Trees. - Jie Zhou; Tian-Ming Bu; Hong Zhu 004; Yixiang Chen 001 (BIC-TA, 2013)

The Program Download Problem: Complexity and Algorithms. - Chao Peng 004; Jie Zhou; Binhai Zhu; Hong Zhu 004 (COCOON, 2013)

Complexity analysis and algorithms for the Program Download Problem. - Chao Peng 004; Jie Zhou; Binhai Zhu; Hong Zhu 004 (J. Comb. Optim., 2015)