Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. Dadush, D. & Vempala, S. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1445–1456, 2012. Paper bibtex @inproceedings{DBLP:conf/soda/DadushV12,
author = {Daniel Dadush and
Santosh Vempala},
title = {Deterministic construction of an approximate M-ellipsoid and its applications
to derandomizing lattice algorithms},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1445--1456},
year = {2012},
crossref = {DBLP:conf/soda/2012},
url = {http://portal.acm.org/citation.cfm?id=2095230\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
timestamp = {Wed, 24 May 2017 08:31:21 +0200},
biburl = {https://dblp.org/rec/bib/conf/soda/DadushV12},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"Ziw4Mfz79cgr7eZHe","bibbaseid":"dadush-vempala-deterministicconstructionofanapproximatemellipsoidanditsapplicationstoderandomizinglatticealgorithms-2012","downloads":0,"creationDate":"2019-02-04T10:40:08.942Z","title":"Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms","author_short":["Dadush, D.","Vempala, S."],"year":2012,"bibtype":"inproceedings","biburl":"https://dblp.org/pid/v/SantoshVempala.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Daniel"],"propositions":[],"lastnames":["Dadush"],"suffixes":[]},{"firstnames":["Santosh"],"propositions":[],"lastnames":["Vempala"],"suffixes":[]}],"title":"Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms","booktitle":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012","pages":"1445–1456","year":"2012","crossref":"DBLP:conf/soda/2012","url":"http://portal.acm.org/citation.cfm?id=2095230&CFID=63838676&CFTOKEN=79617016","timestamp":"Wed, 24 May 2017 08:31:21 +0200","biburl":"https://dblp.org/rec/bib/conf/soda/DadushV12","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/soda/DadushV12,\n author = {Daniel Dadush and\n Santosh Vempala},\n title = {Deterministic construction of an approximate M-ellipsoid and its applications\n to derandomizing lattice algorithms},\n booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},\n pages = {1445--1456},\n year = {2012},\n crossref = {DBLP:conf/soda/2012},\n url = {http://portal.acm.org/citation.cfm?id=2095230\\&\\#38;CFID=63838676\\&\\#38;CFTOKEN=79617016},\n timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n biburl = {https://dblp.org/rec/bib/conf/soda/DadushV12},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Dadush, D.","Vempala, S."],"key":"DBLP:conf/soda/DadushV12","id":"DBLP:conf/soda/DadushV12","bibbaseid":"dadush-vempala-deterministicconstructionofanapproximatemellipsoidanditsapplicationstoderandomizinglatticealgorithms-2012","role":"author","urls":{"Paper":"http://portal.acm.org/citation.cfm?id=2095230&CFID=63838676&CFTOKEN=79617016"},"downloads":0},"search_terms":["deterministic","construction","approximate","ellipsoid","applications","derandomizing","lattice","algorithms","dadush","vempala"],"keywords":[],"authorIDs":[],"dataSources":["o5MdET8K3qoMZxPKp"]}