Marc Bury (né Gillé)
Title
Cited by
Cited by
Year
Sublinear estimation of weighted matchings in dynamic data streams
M Bury, C Schwiegelshohn
Algorithms-ESA 2015, 263-274, 2015
532015
BICO: BIRCH meets coresets for k-means clustering
H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler
European Symposium on Algorithms, 481-492, 2013
502013
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma
L Becchetti, M Bury, V Cohen-Addad, F Grandoni, C Schwiegelshohn
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
172019
Structural results on matching estimation with applications to streaming
M Bury, E Grigorescu, A McGregor, M Monemizadeh, C Schwiegelshohn, ...
Algorithmica 81 (1), 367-392, 2019
82019
OBDD-based representation of interval graphs
M Gillé
International Workshop on Graph-Theoretic Concepts in Computer Science, 286-297, 2013
52013
Implicit computation of maximum bipartite matchings by sublinear functional operations
B Bollig, M Gillé, T Pröger
International Conference on Theory and Applications of Models of Computation …, 2012
52012
Implicit computation of maximum bipartite matchings by sublinear functional operations
B Bollig, M Gillé, T Pröger
Theoretical Computer Science 560, 131-146, 2014
42014
Sketch'Em All: Fast Approximate Similarity Search for Dynamic Data Streams
M Bury, C Schwiegelshohn, M Sorella
Proceedings of the Eleventh ACM International Conference on Web Search and …, 2018
22018
On the OBDD representation of some graph classes
B Bollig, M Bury
Discrete Applied Mathematics 214, 34-53, 2016
22016
Randomized OBDDs for the most significant bit of multiplication need exponential space
B Bollig, M Gillé
Information processing letters 111 (4), 151-155, 2011
22011
Similarity search for dynamic data streams
M Bury, C Schwiegelshohn, M Sorella
IEEE Transactions on Knowledge and Data Engineering, 2019
12019
Randomized OBDD-based graph algorithms
M Bury
Theoretical Computer Science 751, 24-45, 2018
12018
On finding the Jaccard center
M Bury, C Schwiegelshohn
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
12017
SIROCCO 2015 review
M Bury
ACM SIGACT News 46 (4), 88-93, 2015
12015
Random projections for k-means: maintaining coresets beyond merge & reduce
M Bury, C Schwiegelshohn
arXiv preprint arXiv:1504.01584, 2015
12015
Efficient Similarity Search in Dynamic Data Streams
M Bury, C Schwiegelshohn, M Sorella
arXiv preprint arXiv:1605.03949, 2016
2016
OBDDs and (Almost) -wise Independent Random Variables
M Bury
arXiv preprint arXiv:1504.03842, 2015
2015
On graph algorithms for large-scale graphs
M Bury
2015
Analyse der BDD-Komplexität des höchstwertigen Bits der Multiplikation
M Gillé
2011
Randomized OBDDs for the most significant bit of multiplication need exponential size
B Bollig, M Gillé
International Conference on Current Trends in Theory and Practice of …, 2011
2011
The system can't perform the operation now. Try again later.
Articles 1–20