dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Daniel Dadush Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush: A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. LATIN 2012: 207-218
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santosh Vempala: Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. SODA 2012: 1445-1456
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar: Unconditional differentially private mechanisms for linear queries. STOC 2012: 1269-1284
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santosh Vempala: Deterministic 2^{O(n)} Algorithms for M-Ellipsoids, Lattice Problems and Volume Estimation CoRR abs/1201.5972: (2012)
2011
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Chris Peikert, Santosh Vempala: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. FOCS 2011: 580-589
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santanu S. Dey, Juan Pablo Vielma: On the Chvátal-Gomory Closure of a Compact Convex Set. IPCO 2011: 130-142
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santosh Vempala: Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms CoRR abs/1107.5478: (2011)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush: A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming CoRR abs/1109.2477: (2011)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santanu S. Dey, Juan Pablo Vielma: The Chvátal-Gomory Closure of a Strictly Convex Body. Math. Oper. Res. 36(2): 227-239 (2011)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Santanu S. Dey, Juan Pablo Vielma: The split closure of a strictly convex body. Oper. Res. Lett. 39(2): 121-126 (2011)
2010
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala: Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. SODA 2010: 1630-1645
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Dadush, Chris Peikert, Santosh Vempala: Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings CoRR abs/1011.5666: (2010)
2009
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala: Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families CoRR abs/0904.0583: (2009)

Coauthor Index

1Aditya Bhaskara [11]
2Karthekeyan Chandrasekaran [1] [3]
3Santanu S. Dey [4] [5] [8]
4Ravishankar Krishnaswamy [11]
5Chris Peikert [2] [9]
6Kunal Talwar [11]
7Santosh Vempala [1] [2] [3] [7] [9] [10] [12]
8Juan Pablo Vielma [4] [5] [8]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page