Author:
Bredereck Robert,Nichterlein André,Niedermeier Rolf,Philip Geevarghese
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference44 articles.
1. Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Proceedings of the 10th international conference on database theory (ICDT ’05), Springer, LNCS, vol 3363, pp 246–258
2. Aggarwal G, Feder T, Kenthapadi K, Khuller S, Panigrahy R, Thomas D, Zhu A (2010) Achieving anonymity via clustering. ACM Trans Algorithms 6(3): 1–19
3. Blocki J, Williams R (2010) Resolving the complexity of some data privacy problems. In: Proceedings of the 37th international colloquium on automata, languages and programming (ICALP ’10), Springer, LNCS, vol 6199, pp 393–404
4. Bonizzoni P, Della Vedova G, Dondi R (2011a) Anonymizing binary and small tables is hard to approximate. J Comb Optim 22(1): 97–119
5. Bonizzoni P, Della Vedova G, Dondi R, Pirola Y (2011b) Parameterized complexity of k-anonymity: hardness and tractability. J Comb Optim (available online)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献