Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDRocco A. Servedio
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c126]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha
:
Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime. ITCS 2021: 20:1-20:20- [c125]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Quantitative Correlation Inequalities via Semigroup Interpolation. ITCS 2021: 69:1-69:20 - [c124]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. SODA 2021: 54-73 - [i91]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
On the Approximation Power of Two-Layer Networks of Random ReLUs. CoRR abs/2102.02336 (2021) - [i90]Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan, Daniel Kane:
Fooling Gaussian PTFs via Local Hyperconcentration. CoRR abs/2103.07809 (2021) - 2020
- [j69]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Sharp Bounds for Population Recovery. Theory Comput. 16: 1-20 (2020) - [c123]Clément L. Canonne, Anindya De, Rocco A. Servedio:
Learning from satisfying assignments under continuous distributions. SODA 2020: 82-101 - [c122]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. SODA 2020: 2936-2952 - [c121]Xue Chen, Anindya De, Rocco A. Servedio:
Testing noisy linear functions for sparsity. STOC 2020: 610-623 - [c120]Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Fooling Gaussian PTFs via local hyperconcentration. STOC 2020: 1170-1183 - [i89]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. CoRR abs/2007.09599 (2020) - [i88]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the smoothed complexity model. CoRR abs/2008.12386 (2020) - [i87]Xi Chen, Anindya De, Chin Ho Lee, Rocco A. Servedio, Sandip Sinha:
Polynomial-time trace reconstruction in the low deletion rate regime. CoRR abs/2012.02844 (2020) - [i86]Anindya De, Shivam Nadimpalli, Rocco A. Servedio:
Quantitative Correlation Inequalities via Semigroup Interpolation. CoRR abs/2012.12216 (2020)
2010 – 2019
- 2019
- [j68]Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free Junta Testing. ACM Trans. Algorithms 15(1): 1:1-1:23 (2019) - [c119]Frank Ban, Xi Chen, Rocco A. Servedio, Sandip Sinha:
Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions. APPROX-RANDOM 2019: 44:1-44:18 - [c118]Rocco A. Servedio, Li-Yang Tan:
Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas. APPROX-RANDOM 2019: 45:1-45:23 - [c117]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio:
Simple and Efficient Pseudorandom Generators from Gaussian Processes. Computational Complexity Conference 2019: 4:1-4:33 - [c116]Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel. FOCS 2019: 745-768 - [c115]Anindya De, Philip M. Long, Rocco A. Servedio:
Density Estimation for Shift-Invariant Multidimensional Distributions. ITCS 2019: 28:1-28:20 - [c114]Rocco A. Servedio, Li-Yang Tan:
Pseudorandomness for read-k DNF formulas. SODA 2019: 621-638 - [c113]Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Fooling polytopes. STOC 2019: 614-625 - [i85]Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond trace reconstruction: Population recovery from the deletion channel. CoRR abs/1904.05532 (2019) - [i84]Clément L. Canonne, Anindya De, Rocco A. Servedio:
Learning from satisfying assignments under continuous distributions. CoRR abs/1907.01619 (2019) - [i83]Frank Ban, Xi Chen, Rocco A. Servedio, Sandip Sinha:
Efficient average-case population recovery in the presence of insertions and deletions. CoRR abs/1907.05964 (2019) - [i82]Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. CoRR abs/1907.12106 (2019) - [i81]Anindya De, Rocco A. Servedio:
Kruskal-Katona for convex sets, with applications. CoRR abs/1911.00178 (2019) - [i80]Xue Chen, Anindya De, Rocco A. Servedio:
Testing noisy linear functions for sparsity. CoRR abs/1911.00911 (2019) - 2018
- [j67]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-adaptive Junta Testing. J. ACM 65(6): 40:1-40:18 (2018) - [c112]Rocco A. Servedio, Li-Yang Tan:
Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits. APPROX-RANDOM 2018: 56:1-56:20 - [c111]Anindya De, Philip M. Long, Rocco A. Servedio:
Learning Sums of Independent Random Variables with Sparse Collective Support. FOCS 2018: 297-308 - [c110]Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free junta testing. STOC 2018: 749-759 - [e5]Rocco A. Servedio:
33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA. LIPIcs 102, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-069-9 [contents] - [i79]Rocco A. Servedio, Li-Yang Tan:
Deterministic search for CNF satisfying assignments in almost polynomial time. CoRR abs/1801.03588 (2018) - [i78]Rocco A. Servedio, Li-Yang Tan:
Improved pseudorandom generators from pseudorandom multi-switching lemmas. CoRR abs/1801.03590 (2018) - [i77]Xi Chen, Zhengyang Liu, Rocco A. Servedio, Ying Sheng, Jinyu Xie:
Distribution-free Junta Testing. CoRR abs/1802.04859 (2018) - [i76]Rocco A. Servedio, Li-Yang Tan:
Luby-Veličković-Wigderson revisited: Improved correlation bounds and pseudorandom generators for depth-two circuits. CoRR abs/1803.04553 (2018) - [i75]Anindya De, Philip M. Long, Rocco A. Servedio:
Learning Sums of Independent Random Variables with Sparse Collective Support. CoRR abs/1807.07013 (2018) - [i74]Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Fooling Polytopes. CoRR abs/1808.04035 (2018) - [i73]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Learning sparse mixtures of rankings from noisy information. CoRR abs/1811.01216 (2018) - [i72]Anindya De, Philip M. Long, Rocco A. Servedio:
Density estimation for shift-invariant multidimensional distributions. CoRR abs/1811.03744 (2018) - [i71]Eshan Chattopadhyay, Anindya De, Rocco A. Servedio:
Simple and efficient pseudorandom generators from Gaussian processes. Electron. Colloquium Comput. Complex. 25: 100 (2018) - [i70]Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Fooling Polytopes. Electron. Colloquium Comput. Complex. 25: 145 (2018) - 2017
- [j66]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley value problem. Games Econ. Behav. 105: 122-147 (2017) - [j65]Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An Average-Case Depth Hierarchy Theorem for Boolean Circuits. J. ACM 64(5): 35:1-35:27 (2017) - [c109]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-Based High-Dimensional Convexity Testing. APPROX-RANDOM 2017: 37:1-37:20 - [c108]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. APPROX-RANDOM 2017: 38:1-38:21 - [c107]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the Query Complexity of Non-Adaptive Junta Testing. Computational Complexity Conference 2017: 26:1-26:19 - [c106]Rocco A. Servedio, Li-Yang Tan:
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time. FOCS 2017: 813-823 - [c105]Rocco A. Servedio, Li-Yang Tan:
Fooling Intersections of Low-Weight Halfspaces. FOCS 2017: 824-835 - [c104]Rocco A. Servedio, Li-Yang Tan:
What Circuit Classes Can Be Learned with Non-Trivial Savings?. ITCS 2017: 30:1-30:21 - [c103]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Optimal mean-based algorithms for trace reconstruction. STOC 2017: 1047-1056 - [c102]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. STOC 2017: 1232-1245 - [i69]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Sharp bounds for population recovery. CoRR abs/1703.01474 (2017) - [i68]Rocco A. Servedio, Li-Yang Tan:
Fooling intersections of low-weight halfspaces. CoRR abs/1704.04855 (2017) - [i67]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. CoRR abs/1704.06314 (2017) - [i66]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten:
Adaptivity is exponentially powerful for testing monotonicity of halfspaces. CoRR abs/1706.05556 (2017) - [i65]Xi Chen, Adam Freilich, Rocco A. Servedio, Timothy Sun:
Sample-based high-dimensional convexity testing. CoRR abs/1706.09362 (2017) - [i64]Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie:
Settling the query complexity of non-adaptive junta testing. Electron. Colloquium Comput. Complex. 24: 68 (2017) - 2016
- [j64]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. SIAM J. Discret. Math. 30(2): 1058-1094 (2016) - [c101]Parikshit Gopalan, Rocco A. Servedio, Avi Wigderson:
Degree and Sensitivity: Tails of Two Distributions. Computational Complexity Conference 2016: 13:1-13:23 - [c100]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity Functions. ITCS 2016: 59-70 - [c99]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. STOC 2016: 612-625 - [c98]Toniann Pitassi, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
Poly-logarithmic Frege depth lower bounds via an expander switching lemma. STOC 2016: 644-657 - [i63]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. CoRR abs/1604.07432 (2016) - [i62]Anindya De, Ryan O'Donnell, Rocco A. Servedio:
Optimal mean-based algorithms for trace reconstruction. CoRR abs/1612.03148 (2016) - [i61]Parikshit Gopalan, Rocco A. Servedio, Avishay Tal, Avi Wigderson:
Degree and Sensitivity: tails of two distributions. Electron. Colloquium Comput. Complex. 23: 69 (2016) - 2015
- [j63]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning Poisson Binomial Distributions. Algorithmica 72(1): 316-357 (2015) - [j62]Dana Ron, Rocco A. Servedio:
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. Algorithmica 72(2): 400-429 (2015) - [j61]Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
Noise Stable Halfspaces are Close to Very Small Juntas. Chic. J. Theor. Comput. Sci. 2015 (2015) - [j60]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing Probability Distributions using Conditional Samples. SIAM J. Comput. 44(3): 540-616 (2015) - [j59]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
Complexity Theory Column 89: The Polynomial Hierarchy, Random Oracles, and Boolean Circuits. SIGACT News 46(4): 50-68 (2015) - [c97]Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning Circuits with few Negations. APPROX-RANDOM 2015: 512-527 - [c96]Rocco A. Servedio, Li-Yang Tan, John Wright:
Adaptivity Helps for Testing Juntas. Computational Complexity Conference 2015: 264-279 - [c95]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An Average-Case Depth Hierarchy Theorem for Boolean Circuits. FOCS 2015: 1030-1048 - [c94]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Learning from satisfying assignments. SODA 2015: 478-497 - [c93]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean Function Monotonicity Testing Requires (Almost) n1/2 Non-adaptive Queries. STOC 2015: 519-528 - [e4]Rocco A. Servedio, Ronitt Rubinfeld:
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. ACM 2015, ISBN 978-1-4503-3536-2 [contents] - [i60]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An average-case depth hierarchy theorem for Boolean circuits. CoRR abs/1504.03398 (2015) - [i59]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. CoRR abs/1508.02420 (2015) - [i58]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. CoRR abs/1508.03061 (2015) - [i57]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Near-optimal small-depth lower bounds for small distance connectivity. CoRR abs/1509.07476 (2015) - [i56]Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An average-case depth hierarchy theorem for Boolean circuits. Electron. Colloquium Comput. Complex. 22: 65 (2015) - [i55]Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. Electron. Colloquium Comput. Complex. 22: 123 (2015) - [i54]Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. Electron. Colloquium Comput. Complex. 22: 131 (2015) - 2014
- [j58]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces. J. ACM 61(2): 11:1-11:36 (2014) - [j57]Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan:
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions. SIAM J. Comput. 43(1): 231-253 (2014) - [j56]Philip M. Long, Rocco A. Servedio:
On the Weight of Halfspaces over Hamming Balls. SIAM J. Discret. Math. 28(3): 1035-1061 (2014) - [j55]Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
A Regularity Lemma and Low-Weight Approximators for Low-Degree Polynomial Threshold Functions. Theory Comput. 10: 27-53 (2014) - [j54]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning k-Modal Distributions via Testing. Theory Comput. 10: 535-570 (2014) - [c92]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Computational Complexity Conference 2014: 229-240 - [c91]Xi Chen, Rocco A. Servedio, Li-Yang Tan:
New Algorithms and Lower Bounds for Monotonicity Testing. FOCS 2014: 286-295 - [c90]Eric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan:
On DNF Approximators for Monotone Boolean Functions. ICALP (1) 2014: 235-246 - [c89]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. NIPS 2014: 1844-1852 - [c88]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. SODA 2014: 628-644 - [c87]Clément L. Canonne, Dana Ron, Rocco A. Servedio:
Testing equivalence between distributions using conditional samples. SODA 2014: 1174-1192 - [c86]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Efficient density estimation via piecewise polynomial approximation. STOC 2014: 604-613 - [c85]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low-degree polynomial threshold functions. STOC 2014: 832-841 - [i53]Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning circuits with few negations. CoRR abs/1410.8420 (2014) - [i52]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms. CoRR abs/1411.0169 (2014) - [i51]Xi Chen, Rocco A. Servedio, Li-Yang Tan:
New algorithms and lower bounds for monotonicity testing. CoRR abs/1412.5655 (2014) - [i50]Xi Chen, Anindya De, Rocco A. Servedio, Li-Yang Tan:
Boolean function monotonicity testing requires (almost) n1/2 non-adaptive queries. CoRR abs/1412.5657 (2014) - [i49]Eric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan:
Learning circuits with few negations. Electron. Colloquium Comput. Complex. 21: 144 (2014) - 2013
- [j53]Ilias Diakonikolas, Rocco A. Servedio:
Improved Approximation of Linear Threshold Functions. Comput. Complex. 22(3): 623-677 (2013) - [j52]Philip M. Long, Rocco A. Servedio:
Algorithms and hardness results for parallel large margin learning. J. Mach. Learn. Res. 14(1): 3105-3128 (2013) - [c84]Constantinos Daskalakis, Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Learning Sums of Independent Integer Random Variables. FOCS 2013: 217-226 - [c83]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry. ICALP (1) 2013: 376-387 - [c82]Philip M. Long, Rocco A. Servedio:
Consistency versus Realizable H-Consistency for Multiclass Classification. ICML (3) 2013: 801-809 - [c81]Philip M. Long, Rocco A. Servedio:
Low-weight halfspaces for sparse boolean vectors. ITCS 2013: 21-36 - [c80]Dana Ron, Rocco A. Servedio:
Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. SODA 2013: 1319-1336 - [c79]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. SODA 2013: 1380-1394 - [c78]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant:
Testing k-Modal Distributions: Optimal Algorithms via Reductions. SODA 2013: 1833-1852 - [i48]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Efficient Density Estimation via Piecewise Polynomial Approximation. CoRR abs/1305.3207 (2013) - [i47]Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio:
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. CoRR abs/1307.3621 (2013) - [i46]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions. CoRR abs/1311.7105 (2013) - [i45]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions. CoRR abs/1311.7115 (2013) - [i44]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low-degree polynomial threshold functions. CoRR abs/1311.7178 (2013) - [i43]Dana Ron, Rocco A. Servedio:
Exponentially improved algorithms and lower bounds for testing signed majorities. Electron. Colloquium Comput. Complex. 20: 96 (2013) - [i42]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. 20: 171 (2013) - [i41]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions. Electron. Colloquium Comput. Complex. 20: 172 (2013) - [i40]Anindya De, Rocco A. Servedio:
Efficient deterministic approximate counting for low degree polynomial threshold functions. Electron. Colloquium Comput. Complex. 20: 173 (2013) - 2012
- [j51]Rocco A. Servedio:
A high-dimensional surprise: technical perspective. Commun. ACM 55(10): 89 (2012) - [j50]Nicole Immorlica, Jonathan Katz, Michael Mitzenmacher, Rocco A. Servedio, Chris Umans:
Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009). SIAM J. Comput. 41(6): 1591-1592 (2012) - [c77]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
The Inverse Shapley Value Problem. ICALP (1) 2012: 266-277 - [c76]Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio:
Private data release via learning thresholds. SODA 2012: 168-187 - [c75]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning k-modal distributions via testing. SODA 2012: 1371-1385 - [c74]Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio:
Learning poisson binomial distributions. STOC 2012: 709-728 - [c73]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces. STOC 2012: 729-746 - [c72]Rocco A. Servedio, Li-Yang Tan, Justin Thaler:
Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions. COLT 2012: 14.1-14.19 - [c71]Lisa Hellerstein, Devorah Kletenik, Linda Sellie, Rocco A. Servedio:
Tight Bounds on Proper Equivalence Query Learning of DNF. COLT 2012: 31.1-31.18 - [e3]Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science 7408, Springer 2012, ISBN 978-3-642-32511-3 [contents] - [i39]Ilias Diakonikolas, Ragesh Jaiswal, Rocco A. Servedio, Li-Yang Tan, Andrew Wan:
On the Distribution of the Fourier Spectrum of Halfspaces. CoRR abs/1202.6680 (2012) - [i38]Anindya De, Ilias Diakonikolas, Vitaly Feldman, Rocco A. Servedio:
Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. CoRR abs/1206.0985 (2012) - [i37]Anindya De, Ilias Diakonikolas, Rocco A. Servedio:
A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry. CoRR abs/1207.2229 (2012) - [i36]Siu-on Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun:
Learning mixtures of structured distributions over discrete domains. CoRR abs/1210.0864 (2012) - [i35]