Marc Bury

According to our database1, Marc Bury authored at least 18 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities.
Algorithmica, 2021

2020
Similarity Search for Dynamic Data Streams.
IEEE Trans. Knowl. Data Eng., 2020

2019
Structural Results on Matching Estimation with Applications to Streaming.
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
Randomized OBDD-based graph algorithms.
Theor. Comput. Sci., 2018

Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data Streams.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017
On Finding the Jaccard Center.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
On the OBDD representation of some graph classes.
Discret. Appl. Math., 2016

Efficient Similarity Search in Dynamic Data Streams.
CoRR, 2016

2015
On graph algorithms for large-scale graphs.
PhD thesis, 2015

SIROCCO 2015 Review.
SIGACT News, 2015

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

Sublinear Estimation of Weighted Matchings in Dynamic Data Streams.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Implicit computation of maximum bipartite matchings by sublinear functional operations.
Theor. Comput. Sci., 2014

2013
OBDD-Based Representation of Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

BICO: BIRCH Meets Coresets for k-Means Clustering.
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


  Loading...