Shaohan Ma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2011

Tight Bounds on Local Search to Approximate the Maximum Satisfiability ProblemsDaming Zhu, Shaohan Ma, Pingping Zhang. cocoon 2011: 49-61 [doi]

2008

A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problemGuohui Yao, Daming Zhu, Hengwu Li, Shaohan Ma. DM, 308(17):3951-3959, 2008. [doi]

2005

An ::::O::::(::::n:::::::2:::) algorithm for signed translocationLusheng Wang, Daming Zhu, Xiaowen Liu, Shaohan Ma. jcss, 70(3):284-299, 2005. [doi]

An O(N:::2:::) algorithm for signed translocation problemLusheng Wang, Daming Zhu, Xiaowen Liu, Shaohan Ma. apbc 2005: 349-358 [doi]

2001

Efficient Mining of Association Rules by Reducing the Number of Passes over the DatabaseQingzhong Li, Haiyang Wang, Zhongmin Yan, Shaohan Ma. jcst, 16(2):182-188, 2001. [doi]

Hardness and Methods to Solve CLIQUEDaming Zhu, Junfeng Luan, Shaohan Ma. jcst, 16(4):388, 2001. [doi]

2000

A Practical Algorithm for the Minimum Rectilinear Steiner TreeMa Jun, Bo Yang, Shaohan Ma. jcst, 15(1):96-99, 2000. [doi]

1999

An efficient parallel graph edge matching algorithm and its applicationsJun Ma, Shaohan Ma. jcst, 14(2):153-158, 1999. [doi]

1997

A practical propositional knowledge base revision algorithmXuehong Tao, Wei Sun, Shaohan Ma. jcst, 12(2):154-159, 1997. [doi]

1994

Two Notes on Low-Density Subset Sum AlgorithmsDaxing Li, Shaohan Ma. isaac 1994: 164-171

An ::::O(k:::: :::2:::n:::2:::) algorithm to find a ::::k:::: -partition in a ::::k:::: -connected graphJun Ma, Shaohan Ma. jcst, 9(1):86-91, 1994. [doi]

Analysis of the Convergency of Topology Preserving Neural Networks on LearningDaming Zhu, Shaohan Ma, Hongze Qiu. isaac 1994: 128-136

1993

Efficient parallel algorithms for some graph theory problemsJun Ma, Shaohan Ma. jcst, 8(4):362-366, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL