default search action
Search dblp for Publications
export results for "Florian Thaeter"
@article{DBLP:journals/corr/abs-2307-02969, author = {Yara Sch{\"{u}}tt and Johannes Liebenow and Tanya Braun and Marcel Gehrke and Florian Thaeter and Esfandiar Mohammadi}, title = {{DPM:} Clustering Sensitive Data through Separation}, journal = {CoRR}, volume = {abs/2307.02969}, year = {2023} }
@phdthesis{DBLP:phd/dnb/Thaeter21, author = {Florian Thaeter}, title = {{\(\kappa\)}-anonymous Microaggregation}, school = {University of L{\"{u}}beck, Germany}, year = {2021} }
@article{DBLP:journals/dam/ThaeterR21, author = {Florian Thaeter and R{\"{u}}diger Reischuk}, title = {Hardness of k-anonymous microaggregation}, journal = {Discret. Appl. Math.}, volume = {303}, pages = {149--158}, year = {2021} }
@inproceedings{DBLP:conf/icete/ThaeterR21, author = {Florian Thaeter and R{\"{u}}diger Reischuk}, title = {Improving Time Complexity and Utility of k-anonymous Microaggregation}, booktitle = {{ICETE} (Selected Papers)}, series = {Communications in Computer and Information Science}, volume = {1795}, pages = {195--223}, publisher = {Springer}, year = {2021} }
@inproceedings{DBLP:conf/secrypt/ThaeterR21, author = {Florian Thaeter and R{\"{u}}diger Reischuk}, title = {Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss}, booktitle = {{SECRYPT}}, pages = {87--98}, publisher = {{SCITEPRESS}}, year = {2021} }
@inproceedings{DBLP:conf/sicherheit/ThaeterR18, author = {Florian Thaeter and R{\"{u}}diger Reischuk}, title = {Improving Anonymization Clustering}, booktitle = {Sicherheit}, series = {{LNI}}, volume = {{P-281}}, pages = {69--82}, publisher = {Gesellschaft f{\"{u}}r Informatik e.V.}, year = {2018} }
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.