BibTeX Export for Efficient Removal Lemmas for Matrices

Copy to Clipboard Download

@InProceedings{alon_et_al:LIPIcs.APPROX-RANDOM.2017.25,
  author =	{Alon, Noga and Ben-Eliezer, Omri},
  title =	{{Efficient Removal Lemmas for Matrices}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
  pages =	{25:1--25:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-044-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{81},
  editor =	{Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.25},
  URN =		{urn:nbn:de:0030-drops-75744},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2017.25},
  annote =	{Keywords: Property Testing, Removal Lemma, Matrix Regularity Lemma, Binary Matrix}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode