Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Anthony K. H. Tung

◀ ▶ joint publications with Laks V. S. Lakshmanan

> Home > Persons > Anthony K. H. Tung

Publications

2009
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tkdd/ZhangLT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tkdd/ZhangLT09
Zhenjie Zhang, Laks V. S. Lakshmanan, Anthony K. H. Tung:
On domination game analysis for microeconomic data mining. ACM Trans. Knowl. Discov. Data 2(4): 18:1-18:27 (2009)
2006
[e1]
- view
  - table of contents in dblp
  - no references & citations available
- export record
  dblp key:
  - conf/comad/2006
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/comad/2006
Laks V. S. Lakshmanan, Prasan Roy, Anthony K. H. Tung:
Proceedings of the 13th International Conference on Management of Data, December 14-16, 2006, Delhi, India. Tata McGraw-Hill Publishing Company Limited 2006, ISBN 0-07-063374-6 [contents]
2001
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/icdt/KungNLH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icdt/KungNLH01
Anthony K. H. Tung, Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han:
Constraint-based clustering in large databases. ICDT 2001: 405-419
2000
[c5]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/kdd/TongNLH00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kdd/TongNLH00
Anthony K. H. Tung, Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han:
Geo-Spatial Clustering with User-Specified Constraints. MDM/KDD 2000: 1-7

a service of

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.