BibTeX records: Marc Bury

download as .bib file

@article{DBLP:journals/algorithmica/BuryGSS21,
  author       = {Marc Bury and
                  Michele Gentili and
                  Chris Schwiegelshohn and
                  Mara Sorella},
  title        = {Polynomial Time Approximation Schemes for All 1-Center Problems on
                  Metric Rational Set Similarities},
  journal      = {Algorithmica},
  volume       = {83},
  number       = {5},
  pages        = {1371--1392},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00453-020-00787-3},
  doi          = {10.1007/S00453-020-00787-3},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BuryGSS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tkde/BurySS20,
  author       = {Marc Bury and
                  Chris Schwiegelshohn and
                  Mara Sorella},
  title        = {Similarity Search for Dynamic Data Streams},
  journal      = {{IEEE} Trans. Knowl. Data Eng.},
  volume       = {32},
  number       = {11},
  pages        = {2241--2253},
  year         = {2020},
  url          = {https://doi.org/10.1109/TKDE.2019.2916858},
  doi          = {10.1109/TKDE.2019.2916858},
  timestamp    = {Tue, 20 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tkde/BurySS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/algorithmica/BuryGMMSVZ19,
  author       = {Marc Bury and
                  Elena Grigorescu and
                  Andrew McGregor and
                  Morteza Monemizadeh and
                  Chris Schwiegelshohn and
                  Sofya Vorotnikova and
                  Samson Zhou},
  title        = {Structural Results on Matching Estimation with Applications to Streaming},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {1},
  pages        = {367--392},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0449-y},
  doi          = {10.1007/S00453-018-0449-Y},
  timestamp    = {Fri, 18 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BuryGMMSVZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BecchettiBC0S19,
  author       = {Luca Becchetti and
                  Marc Bury and
                  Vincent Cohen{-}Addad and
                  Fabrizio Grandoni and
                  Chris Schwiegelshohn},
  editor       = {Moses Charikar and
                  Edith Cohen},
  title        = {Oblivious dimension reduction for \emph{k}-means: beyond subspaces
                  and the Johnson-Lindenstrauss lemma},
  booktitle    = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
  pages        = {1039--1050},
  publisher    = {{ACM}},
  year         = {2019},
  url          = {https://doi.org/10.1145/3313276.3316318},
  doi          = {10.1145/3313276.3316318},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BecchettiBC0S19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bury18,
  author       = {Marc Bury},
  title        = {Randomized OBDD-based graph algorithms},
  journal      = {Theor. Comput. Sci.},
  volume       = {751},
  pages        = {24--45},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2016.11.028},
  doi          = {10.1016/J.TCS.2016.11.028},
  timestamp    = {Tue, 27 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bury18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wsdm/BurySS18,
  author       = {Marc Bury and
                  Chris Schwiegelshohn and
                  Mara Sorella},
  editor       = {Yi Chang and
                  Chengxiang Zhai and
                  Yan Liu and
                  Yoelle Maarek},
  title        = {Sketch 'Em All: Fast Approximate Similarity Search for Dynamic Data
                  Streams},
  booktitle    = {Proceedings of the Eleventh {ACM} International Conference on Web
                  Search and Data Mining, {WSDM} 2018, Marina Del Rey, CA, USA, February
                  5-9, 2018},
  pages        = {72--80},
  publisher    = {{ACM}},
  year         = {2018},
  url          = {https://doi.org/10.1145/3159652.3159694},
  doi          = {10.1145/3159652.3159694},
  timestamp    = {Thu, 13 Aug 2020 18:13:38 +0200},
  biburl       = {https://dblp.org/rec/conf/wsdm/BurySS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/BuryS17,
  author       = {Marc Bury and
                  Chris Schwiegelshohn},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {On Finding the Jaccard Center},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {23:1--23:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.23},
  doi          = {10.4230/LIPICS.ICALP.2017.23},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BuryS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BolligB16,
  author       = {Beate Bollig and
                  Marc Bury},
  title        = {On the {OBDD} representation of some graph classes},
  journal      = {Discret. Appl. Math.},
  volume       = {214},
  pages        = {34--53},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2016.05.028},
  doi          = {10.1016/J.DAM.2016.05.028},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BolligB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BuryS16,
  author       = {Marc Bury and
                  Chris Schwiegelshohn},
  title        = {Efficient Similarity Search in Dynamic Data Streams},
  journal      = {CoRR},
  volume       = {abs/1605.03949},
  year         = {2016},
  url          = {http://arxiv.org/abs/1605.03949},
  eprinttype    = {arXiv},
  eprint       = {1605.03949},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuryS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/dnb/Bury15,
  author       = {Marc Bury},
  title        = {On graph algorithms for large-scale graphs},
  school       = {Technical University of Dortmund, Germany},
  year         = {2015},
  url          = {https://hdl.handle.net/2003/35114},
  urn          = {urn:nbn:de:101:1-201608293172},
  timestamp    = {Wed, 04 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/dnb/Bury15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigact/Bury15,
  author       = {Marc Bury},
  title        = {{SIROCCO} 2015 Review},
  journal      = {{SIGACT} News},
  volume       = {46},
  number       = {4},
  pages        = {88--93},
  year         = {2015},
  url          = {https://doi.org/10.1145/2852040.2852057},
  doi          = {10.1145/2852040.2852057},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/sigact/Bury15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/BuryS15,
  author       = {Marc Bury and
                  Chris Schwiegelshohn},
  editor       = {Nikhil Bansal and
                  Irene Finocchi},
  title        = {Sublinear Estimation of Weighted Matchings in Dynamic Data Streams},
  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
                  Greece, September 14-16, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9294},
  pages        = {263--274},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48350-3\_23},
  doi          = {10.1007/978-3-662-48350-3\_23},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BuryS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sirocco/Bury15,
  author       = {Marc Bury},
  editor       = {Christian Scheideler},
  title        = {Randomized OBDD-Based Graph Algorithms},
  booktitle    = {Structural Information and Communication Complexity - 22nd International
                  Colloquium, {SIROCCO} 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9439},
  pages        = {254--269},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-25258-2\_18},
  doi          = {10.1007/978-3-319-25258-2\_18},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/Bury15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/Bury15,
  author       = {Marc Bury},
  title        = {OBDDs and (Almost) {\textdollar}k{\textdollar}-wise Independent Random
                  Variables},
  journal      = {CoRR},
  volume       = {abs/1504.03842},
  year         = {2015},
  url          = {http://arxiv.org/abs/1504.03842},
  eprinttype    = {arXiv},
  eprint       = {1504.03842},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Bury15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BuryS15a,
  author       = {Marc Bury and
                  Chris Schwiegelshohn},
  title        = {Sublinear Estimation of Weighted Matchings in Dynamic Data Streams},
  journal      = {CoRR},
  volume       = {abs/1505.02019},
  year         = {2015},
  url          = {http://arxiv.org/abs/1505.02019},
  eprinttype    = {arXiv},
  eprint       = {1505.02019},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuryS15a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BolligGP14,
  author       = {Beate Bollig and
                  Marc Gill{\'{e}} and
                  Tobias Pr{\"{o}}ger},
  title        = {Implicit computation of maximum bipartite matchings by sublinear functional
                  operations},
  journal      = {Theor. Comput. Sci.},
  volume       = {560},
  pages        = {131--146},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.07.020},
  doi          = {10.1016/J.TCS.2014.07.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BolligGP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/esa/FichtenbergerGSSS13,
  author       = {Hendrik Fichtenberger and
                  Marc Gill{\'{e}} and
                  Melanie Schmidt and
                  Chris Schwiegelshohn and
                  Christian Sohler},
  editor       = {Hans L. Bodlaender and
                  Giuseppe F. Italiano},
  title        = {{BICO:} {BIRCH} Meets Coresets for k-Means Clustering},
  booktitle    = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
                  France, September 2-4, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8125},
  pages        = {481--492},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40450-4\_41},
  doi          = {10.1007/978-3-642-40450-4\_41},
  timestamp    = {Mon, 03 Jan 2022 22:19:39 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/FichtenbergerGSSS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/Gille13,
  author       = {Marc Gill{\'{e}}},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  R{\"{u}}diger Reischuk},
  title        = {OBDD-Based Representation of Interval Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 39th International
                  Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
                  Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8165},
  pages        = {286--297},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45043-3\_25},
  doi          = {10.1007/978-3-642-45043-3\_25},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/Gille13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1305-2772,
  author       = {Marc Gill{\'{e}}},
  title        = {OBDD-Based Representation of Interval Graphs},
  journal      = {CoRR},
  volume       = {abs/1305.2772},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.2772},
  eprinttype    = {arXiv},
  eprint       = {1305.2772},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-2772.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tamc/BolligGP12,
  author       = {Beate Bollig and
                  Marc Gill{\'{e}} and
                  Tobias Pr{\"{o}}ger},
  editor       = {Manindra Agrawal and
                  S. Barry Cooper and
                  Angsheng Li},
  title        = {Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional
                  Operations},
  booktitle    = {Theory and Applications of Models of Computation - 9th Annual Conference,
                  {TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7287},
  pages        = {473--486},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29952-0\_45},
  doi          = {10.1007/978-3-642-29952-0\_45},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/BolligGP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BolligG11,
  author       = {Beate Bollig and
                  Marc Gill{\'{e}}},
  title        = {Randomized OBDDs for the most significant bit of multiplication need
                  exponential space},
  journal      = {Inf. Process. Lett.},
  volume       = {111},
  number       = {4},
  pages        = {151--155},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.ipl.2010.11.013},
  doi          = {10.1016/J.IPL.2010.11.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BolligG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sofsem/BolligG11,
  author       = {Beate Bollig and
                  Marc Gill{\'{e}}},
  editor       = {Ivana Cern{\'{a}} and
                  Tibor Gyim{\'{o}}thy and
                  Juraj Hromkovic and
                  Keith G. Jeffery and
                  Rastislav Kr{\'{a}}lovic and
                  Marko Vukolic and
                  Stefan Wolf},
  title        = {Randomized OBDDs for the Most Significant Bit of Multiplication Need
                  Exponential Size},
  booktitle    = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
                  on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
                  Smokovec, Slovakia, January 22-28, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6543},
  pages        = {135--145},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-18381-2\_11},
  doi          = {10.1007/978-3-642-18381-2\_11},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/BolligG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.