( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table.

, , и . PODS, стр. 252-258. ACM Press, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Marina Maier

Monitoring, Mobilität und Bioverfügbarkeit von Palladiumemissionen aus Kraftfahrzeugen. TU München, (2010)

Marina Mikhaylova

Molecular dynamics of the neuronal Ca_1hn2_1hn+-binding proteins caldendrin and calneuron. Uni Magdeburg, (2009)

Marina Hammerschlag

Marina Lewkowicz

Marina Viets

 

Другие публикации лиц с тем же именем

Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata., , и . WG, стр. 219-229. Hanser, Munich, (1981)Minimal Coverings of Acyclic Database Schemata., , и . Advances in Data Base Theory, стр. 27-51. New York, Plemum Press, (1982)The contour of a bridged graph is geodetic., и . Discret. Appl. Math., (2016)Looking for Alternative Ways to Query Database through the Web: an Iconic Approach with IVQS., , и . WebNet, стр. 953-954. AACE, (2000)A Fast Algorithm for Query Optimization in Universal Relation Databases., и . SEBD, стр. 343-361. (1995)Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table., , и . PODS, стр. 252-258. ACM Press, (1991)Decomposability of abstract and path-induced convexities in hypergraphs., и . Discussiones Mathematicae Graph Theory, 35 (3): 493-515 (2015)Privacy in Multidimensional Databases., и . Multidimensional Databases, Idea Group, (2003)A Fast Algorithm for Query Optimization in Universal-Relation Databases., и . J. Comput. Syst. Sci., 56 (3): 299-309 (1998)Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network., и . Theor. Comput. Sci., 411 (7-9): 958-966 (2010)