Marcel R. Ackermann

Orcid: 0000-0001-7644-2495

Affiliations:
  • Schloss Dagstuhl LZI, dblp computer science bibliography, Trier, Germany (since 2011)
  • University of Paderborn, Department of Computer Science, Germany (until 2011, PhD 2009)


According to our database1, Marcel R. Ackermann authored at least 15 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023

Research Knowledge Graphs in NFDI4DS.
Proceedings of the 53. Jahrestagung der Gesellschaft für Informatik, INFORMATIK 2023, Designing Future, 2023

2018
Homonym Detection in Curated Bibliographies: Learning from dblp's Experience (full version).
arXiv, 2018

Homonym Detection in Curated Bibliographies: Learning from dblp's Experience.
Proceedings of the Digital Libraries for Open Knowledge, 2018

2014
Analysis of Agglomerative Clustering.
Algorithmica, 2014

2012
StreamKM++: A clustering algorithm for data streams.
ACM J. Exp. Algorithmics, 2012

2011
Hardness and Non-Approximability of Bregman Clustering Problems.
Electron. Colloquium Comput. Complex., 2011

2010
Clustering for metric and nonmetric distance measures.
ACM Trans. Algorithms, 2010

Bregman Clustering for Separable Instances.
Proceedings of the Algorithm Theory, 2010

StreamKM++: A Clustering Algorithms for Data Streams.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

On the Initialization of Dynamic Models for Speech Features.
Proceedings of the 9. ITG-Fachtagung Sprachkommunikation 2010, 2010

2009
Algorithms for the Bregman k-Median problem.
PhD thesis, 2009

Coresets and approximate clustering for Bregman divergences.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Clustering for metric and non-metric distance measures.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Reliable Evidence of Data Integrity from an Untrusted Storage Service.
Proceedings of the Fourth International Conference on Networking and Services, 2008


  Loading...