The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Daniel Dadush" ( http://dblp.L3S.de/Authors/Daniel_Dadush )

  Author page on DBLP  Author page in RDF  Community of Daniel Dadush in ASPL-2

Publication years (Num. hits)
2009 (1) 2010 (2) 2011 (6) 2012 (3)
Publication types (Num. hits)
article(7) inproceedings(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 12 publication records. Showing 12 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Daniel Dadush, Santosh Vempala Deterministic 2^{O(n)} Algorithms for M-Ellipsoids, Lattice Problems and Volume Estimation Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel Dadush, Santosh Vempala Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel Dadush A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma The split closure of a strictly convex body. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma The Chvátal-Gomory Closure of a Strictly Convex Body. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Santosh Vempala Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel Dadush A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma On the Chvátal-Gomory Closure of a Compact Convex Set. Search on Bibsonomy IPCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Chris Peikert, Santosh Vempala Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Chris Peikert, Santosh Vempala Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. Search on Bibsonomy SODA The full citation details ... 2010 DBLP  BibTeX  RDF
1Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
Displaying result #1 - #12 of 12 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.