Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size. - Beate Bollig; Marc Gillé (SOFSEM, 2011)

Randomized OBDDs for the most significant bit of multiplication need exponential space. - Beate Bollig; Marc Gillé (Inf. Process. Lett., 2011)

BICO: BIRCH Meets Coresets for k-Means Clustering. - Hendrik Fichtenberger; Marc Gillé; Melanie Schmidt 001; Chris Schwiegelshohn; Christian Sohler (ESA, 2013)

OBDD-Based Representation of Interval Graphs. - Marc Gillé (WG, 2013)

Implicit computation of maximum bipartite matchings by sublinear functional operations. - Beate Bollig; Marc Gillé; Tobias Pröger (Theor. Comput. Sci., 2014)

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams. - Marc Bury; Chris Schwiegelshohn (ESA, 2015)

OBDDs and (Almost) $k$-wise Independent Random Variables. - Marc Bury (CoRR, 2015)

SIROCCO 2015 Review. - Marc Bury (SIGACT News, 2015)

On graph algorithms for large-scale graphs. - Marc Bury (2015)

Efficient Similarity Search in Dynamic Data Streams. - Marc Bury; Chris Schwiegelshohn (CoRR, 2016)

On the OBDD representation of some graph classes. - Beate Bollig; Marc Bury (Discret. Appl. Math., 2016)

On Finding the Jaccard Center. - Marc Bury; Chris Schwiegelshohn (ICALP, 2017)

Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams. - Marc Bury; Chris Schwiegelshohn; Mara Sorella (WSDM, 2018)

Randomized OBDD-based graph algorithms. - Marc Bury (Theor. Comput. Sci., 2018)

Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. - Luca Becchetti; Marc Bury; Vincent Cohen-Addad; Fabrizio Grandoni 001; Chris Schwiegelshohn (STOC, 2019)

Structural Results on Matching Estimation with Applications to Streaming. - Marc Bury; Elena Grigorescu; Andrew McGregor 001; Morteza Monemizadeh; Chris Schwiegelshohn; Sofya Vorotnikova; Samson Zhou (Algorithmica, 2019)

Similarity Search for Dynamic Data Streams. - Marc Bury; Chris Schwiegelshohn; Mara Sorella (IEEE Trans. Knowl. Data Eng., 2020)

Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities. - Marc Bury; Michele Gentili; Chris Schwiegelshohn; Mara Sorella (Algorithmica, 2021)