Marc Bury
According to our database1,
Marc Bury
authored at least 18 papers
between 2011 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2021
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities.
Algorithmica, 2021
2020
2019
Algorithmica, 2019
Oblivious dimension reduction for <i>k</i>-means: beyond subspaces and the Johnson-Lindenstrauss lemma.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018
2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Implicit computation of maximum bipartite matchings by sublinear functional operations.
Theor. Comput. Sci., 2014
2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
Proceedings of the Algorithms - ESA 2013, 2013
2011
Randomized OBDDs for the most significant bit of multiplication need exponential space.
Inf. Process. Lett., 2011
Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011