BibTeX Export for Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm

Copy to Clipboard Download

@InProceedings{aggarwal_et_al:LIPIcs.ISAAC.2018.35,
  author =	{Aggarwal, Divesh and Mukhopadhyay, Priyanka},
  title =	{{Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm}},
  booktitle =	{29th International Symposium on Algorithms and Computation (ISAAC 2018)},
  pages =	{35:1--35:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.35},
  URN =		{urn:nbn:de:0030-drops-99837},
  doi =		{10.4230/LIPIcs.ISAAC.2018.35},
  annote =	{Keywords: Lattice, Shortest Vector Problem, Closest Vector Problem, l\underlineinfty norm}
}

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