Hong Zhu

Int. J. Comput. Geom. Appl., 2011

2010

A Measurement of Software Trustworthiness Based on Approximation Algorithms.

[BibT_eX]

[DOI]

Jie Zhou

Proceedings of the Symposia and Workshops on Ubiquitous, 2010

2009

Preface: Algorithms, complexity and models of computation.

[BibT_eX]

[DOI]

S. Barry Cooper

Theor. Comput. Sci., 2009

On Construction of Almost-Ramanujan Graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2009

A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Algorithmica, 2009

Average Transitive Trustworthy Degrees for Trustworthy Networks.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology, 2009

The Closest Pair Problem under the Hamming Metric.

[BibT_eX]

[DOI]

Kerui Min

Ming-Yang Kao

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Greedy Construction of 2-Approximation Minimum Manhattan Network.

[BibT_eX]

[DOI]

Zeyu Guo

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem.

[BibT_eX]

[DOI]

Zeyu Guo

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Efficient algorithms for finding a longest common increasing subsequence.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Greedy online frequency allocation in cellular networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Approximating the Maximum Sharing Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Efficient Algorithms for <i>k</i> -Disjoint Paths Problems on DAGs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

Online OVSF Code Assignment with Resource Augmentation.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Approximating the minimum weight weak vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An Improved Algorithm for Finding the Closest Pair of Points.

[BibT_eX]

[DOI]

Qi Ge

Haitao Wang

J. Comput. Sci. Technol., 2006

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Very Fast Region-Connected Segmentation for Spatial Data: Case Study.

[BibT_eX]

[DOI]

Li Chen

Wei Cui

Proceedings of the IEEE International Conference on Systems, 2006

On Approximating the Maximum Simple Sharing Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Frequency Allocation Problems for Linear Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Traversing the Machining Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Non-metric Multicommodity and Multilevel Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Progress in Computational Complexity Theory.

[BibT_eX]

[DOI]

Jin-yi Cai

J. Comput. Sci. Technol., 2005

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Approximation Algorithm for Weighted Weak Vertex Cover.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

(2+f(n))-SAT and its properties.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Approximation for Dominating Set Problem with Measure Functions.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2004

Minimizing Mean Completion Time in a Batch Processing System.

[BibT_eX]

[DOI]

Algorithmica, 2004

Fully Truthful Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Quantum m-out-of-n oblivious transfer.

[BibT_eX]

[DOI]

Zhide Chen

Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

A Probabilistic Parameterized Algorithm for Vertex Cover in Sticker Model.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Nash Equilibria in Parallel Downloading with Multiple Clients.

[BibT_eX]

[DOI]

Jiantao Song

Chaofeng Sha

Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

General Public Key m-Out-of-n Oblivious Transfer.

[BibT_eX]

[DOI]

Zhide Chen

Proceedings of the Computational and Information Science, First International Symposium, 2004

Some Observations on Zap and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2004

2003

Combinatorial auction across independent markets (extended abstract).

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Building Semantic Peer-to-Peer Networks upon CAN.

[BibT_eX]

[DOI]

Proceedings of the Group Communications and Charges; Technology and Business Models, 2003

Double Auction in Two-Level Markets.

[BibT_eX]

[DOI]

Xiaotie Deng

Proceedings of the Computational Science - ICCS 2003, 2003

The Closest Vector Problem on Some Lattices.

[BibT_eX]

[DOI]

Haibin Kan

Hong Shen

Proceedings of the Grid and Cooperative Computing, Second International Workshop, 2003

Resettable Zero-Knowledge in the Weak Public-Key Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

Incentive Compatible Mechanism Based on Linear Pricing Scheme for Single-Minded Auction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 2003

2002

Reduction Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Security in Communication Networks, Third International Conference, 2002

2001

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1999

Money Conservation via Atomicity in Fair Off-Line E-Cash.

[BibT_eX]

[DOI]

Proceedings of the Information Security, Second International Workshop, 1999

1998

On the Security of Three-Party Cryptographic Protocols.

[BibT_eX]

[DOI]

Shouhuai Xu

Gendu Zhang

ACM SIGOPS Oper. Syst. Rev., 1998

1997

On the Properties of Cryptographic Protocols and the Weakness of the BAN-like Logics.

[BibT_eX]

[DOI]

Shouhuai Xu

Gendu Zhang

ACM SIGOPS Oper. Syst. Rev., 1997

MNP: A class of NP optimization problems.

[BibT_eX]

[DOI]

Qi Cheng

J. Comput. Sci. Technol., 1997

1995

MNP: A Class of NP Optimization Problems (Extended Abstract).

[BibT_eX]

[DOI]

Qi Cheng

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

The least basic operations on heap and improved heapsort.

[BibT_eX]

[DOI]

Jigang Wu

J. Comput. Sci. Technol., 1994

1993

Learning Decision Lists from Noisy Examples.

[BibT_eX]

[DOI]

Jilei Yin

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On the Learnability of a Restricted Predicate Formulae.

[BibT_eX]

[DOI]

Jilei Yin