default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalil P. Vadhan
Person information
- affiliation: Harvard University, Cambridge, USA
- award (2009): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j50]Jayshree Sarathy, Salil P. Vadhan:
Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression. Proc. Priv. Enhancing Technol. 2025(1): 216-235 (2025)- 2024
- [j49]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. Algorithmica 86(10): 3153-3185 (2024) - [j48]Patrick Song
, Jayshree Sarathy, Michael Shoemate, Salil P. Vadhan:
"I inherently just trust that it works": Investigating Mental Models of Open-Source Libraries for Differential Privacy. Proc. ACM Hum. Comput. Interact. 8(CSCW2): 1-39 (2024) - [j47]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Small-Space Spectral Sparsification via Bounded-Independence Sampling. ACM Trans. Comput. Theory 16(2): 7:1-7:32 (2024) - [c126]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. STOC 2024: 1071-1082 - [i125]Nico Manzonelli, Wanrong Zhang, Salil P. Vadhan:
Membership Inference Attacks and Privacy in Topic Modeling. CoRR abs/2403.04451 (2024) - [i124]Marco Gaboardi, Michael Hay, Salil P. Vadhan:
Programming Frameworks for Differential Privacy. CoRR abs/2403.11088 (2024) - [i123]Patrick Song, Jayshree Sarathy, Michael Shoemate, Salil P. Vadhan:
"I inherently just trust that it works": Investigating Mental Models of Open-Source Libraries for Differential Privacy. CoRR abs/2410.09721 (2024) - 2023
- [j46]Daniel Alabi, Salil P. Vadhan:
Differentially Private Hypothesis Testing for Linear Regression. J. Mach. Learn. Res. 24: 361:1-361:50 (2023) - [c125]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. APPROX/RANDOM 2023: 44:1-44:22 - [c124]Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang:
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CCS 2023: 1949-1963 - [c123]Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan:
Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CHI 2023: 164:1-164:19 - [c122]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs. FOCS 2023: 846-854 - [c121]Salil P. Vadhan, Wanrong Zhang:
Concurrent Composition Theorems for Differential Privacy. STOC 2023: 507-519 - [i122]AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan:
Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification. CoRR abs/2301.13541 (2023) - [i121]Jayshree Sarathy, Sophia Song, Audrey Haque, Tania Schlatter, Salil P. Vadhan:
Don't Look at the Data! How Differential Privacy Reconfigures the Practices of Data Science. CoRR abs/2302.11775 (2023) - [i120]Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi:
On the works of Avi Wigderson. CoRR abs/2307.09524 (2023) - [i119]Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang:
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters. CoRR abs/2309.05901 (2023) - [i118]Lukman Olagoke, Salil P. Vadhan, Seth Neel:
Black-Box Training Data Identification in GANs via Detector Networks. CoRR abs/2310.12063 (2023) - [i117]Sílvia Casacuberta, Cynthia Dwork, Salil P. Vadhan:
Complexity-Theoretic Implications of Multicalibration. CoRR abs/2312.17223 (2023) - [i116]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
On the Power of Regular and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j45]Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan:
Differentially Private Simple Linear Regression. Proc. Priv. Enhancing Technol. 2022(2): 184-204 (2022) - [c120]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. APPROX/RANDOM 2022: 2:1-2:21 - [c119]Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman:
Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CCS 2022: 471-484 - [c118]Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. CCC 2022: 27:1-27:13 - [c117]Daniel Alabi, Salil P. Vadhan:
Hypothesis Testing for Differentially Private Linear Regression. NeurIPS 2022 - [c116]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. SOSA 2022: 57-67 - [i115]Daniel Alabi, Salil P. Vadhan:
Hypothesis Testing for Differentially Private Linear Regression. CoRR abs/2206.14449 (2022) - [i114]Salil P. Vadhan, Wanrong Zhang:
Concurrent Composition Theorems for all Standard Variants of Differential Privacy. CoRR abs/2207.08335 (2022) - [i113]Sílvia Casacuberta, Michael Shoemate, Salil P. Vadhan, Connor Wagaman:
Widespread Underestimation of Sensitivity in Differentially Private Libraries and How to Fix It. CoRR abs/2207.10635 (2022) - [i112]Jayshree Sarathy, Salil P. Vadhan:
Analyzing the Differentially Private Theil-Sen Estimator for Simple Linear Regression. CoRR abs/2207.13289 (2022) - [i111]Louis Golowich, Salil P. Vadhan:
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - [i110]Chin Ho Lee, Edward Pyne, Salil P. Vadhan:
Fourier Growth of Regular Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j44]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. SIAM J. Comput. 50(6): 1892-1922 (2021) - [j43]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. Theory Comput. 17: 1-35 (2021) - [c115]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM 2021: 58:1-58:21 - [c114]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract). CCC 2021: 33:1-33:15 - [c113]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. COCOON 2021: 3-12 - [c112]William M. Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. ITCS 2021: 7:1-7:20 - [c111]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. TCC (2) 2021: 582-604 - [i109]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - [i108]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. CoRR abs/2105.14427 (2021) - [i107]Jordan Awan, Salil P. Vadhan:
Canonical Noise Distributions and Private Hypothesis Tests. CoRR abs/2108.04303 (2021) - [i106]Edward Pyne, Salil P. Vadhan:
Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size. CoRR abs/2111.01997 (2021) - [i105]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i104]Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators. Electron. Colloquium Comput. Complex. TR21 (2021) - [i103]Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i102]Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. IACR Cryptol. ePrint Arch. 2021: 1196 (2021) - 2020
- [j42]Jonathan R. Ullman, Salil P. Vadhan:
PCPs and the Hardness of Generating Synthetic Data. J. Cryptol. 33(4): 2078-2112 (2020) - [j41]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. ACM Trans. Economics and Comput. 8(2): 9:1-9:37 (2020) - [j40]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020) - [c110]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. FOCS 2020: 1295-1306 - [c109]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. ICALP 2020: 39:1-39:21 - [p7]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms 2020: 567-585 - [i101]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. CoRR abs/2002.11237 (2020) - [i100]Daniel Alabi, Audra McMillan, Jayshree Sarathy, Adam D. Smith, Salil P. Vadhan:
Differentially Private Simple Linear Regression. CoRR abs/2007.05157 (2020) - [i99]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR abs/2010.05586 (2020) - [i98]Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman:
Spectral Sparsification via Bounded-Independence Sampling. Electron. Colloquium Comput. Complex. TR20 (2020) - [i97]William Hoza, Edward Pyne, Salil P. Vadhan:
Pseudorandom Generators for Unbounded-Width Permutation Branching Programs. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j39]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. J. Priv. Confidentiality 9(2) (2019) - [c108]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. APPROX-RANDOM 2019: 42:1-42:22 - [c107]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying Computational Entropies via Kullback-Leibler Divergence. CRYPTO (2) 2019: 831-858 - [p6]Salil P. Vadhan:
Computational entropy. Providing Sound Foundations for Cryptography 2019: 693-726 - [i96]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. CoRR abs/1902.11202 (2019) - [i95]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. CoRR abs/1903.06361 (2019) - [i94]AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan:
High-precision Estimation of Random Walks in Small Space. CoRR abs/1912.04524 (2019) - [i93]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. IACR Cryptol. ePrint Arch. 2019: 264 (2019) - 2018
- [j38]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. J. Cryptol. 31(4): 1012-1063 (2018) - [j37]Mark Bun, Jonathan R. Ullman, Salil P. Vadhan:
Fingerprinting Codes and the Price of Approximate Differential Privacy. SIAM J. Comput. 47(5): 1888-1938 (2018) - [j36]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. Theory Comput. 14(1): 1-35 (2018) - [c106]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. CCC 2018: 23:1-23:28 - [c105]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. ITCS 2018: 43:1-43:21 - [c104]Vishesh Karwa, Salil P. Vadhan:
Finite Sample Differentially Private Confidence Intervals. ITCS 2018: 44:1-44:9 - [i92]Jack Murtagh, Kathryn Taylor, George Kellaris, Salil P. Vadhan:
Usable Differential Privacy: A Case Study with PSI. CoRR abs/1809.04103 (2018) - [i91]Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, Jiapeng Zhang:
A Tight Lower Bound for Entropy Flattening. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j35]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs. Theory Comput. 13(1): 1-50 (2017) - [c103]Salil P. Vadhan:
On Learning vs. Refutation. COLT 2017: 1835-1848 - [c102]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS 2017: 801-812 - [p5]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Tutorials on the Foundations of Cryptography 2017: 159-217 - [p4]Salil P. Vadhan:
The Complexity of Differential Privacy. Tutorials on the Foundations of Cryptography 2017: 347-450 - [i90]Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, Xiaodi Wu:
Computational Notions of Quantum Min-Entropy. CoRR abs/1704.07309 (2017) - [i89]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR abs/1708.04634 (2017) - [i88]Victor Balcer, Salil P. Vadhan:
Differential Privacy on Finite Computers. CoRR abs/1709.05396 (2017) - [i87]Vishesh Karwa, Salil P. Vadhan:
Finite Sample Differentially Private Confidence Intervals. CoRR abs/1711.03908 (2017) - [i86]Iftach Haitner, Salil P. Vadhan:
The Many Entropies in One-Way Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j34]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful Mechanisms for Agents That Value Privacy. ACM Trans. Economics and Comput. 4(3): 13:1-13:30 (2016) - [c101]Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan:
Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. ICML 2016: 2111-2120 - [c100]Ryan M. Rogers, Salil P. Vadhan, Aaron Roth, Jonathan R. Ullman:
Privacy Odometers and Filters: Pay-as-you-Go Composition. NIPS 2016: 1921-1929 - [c99]Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Locating a Small Cluster Privately. PODS 2016: 413-427 - [c98]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. TCC (A1) 2016: 157-175 - [c97]Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. TCC (B1) 2016: 607-634 - [i85]Marco Gaboardi, Hyun-Woo Lim, Ryan M. Rogers, Salil P. Vadhan:
Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing. CoRR abs/1602.03090 (2016) - [i84]Lorrie Faith Cranor, Tal Rabin, Vitaly Shmatikov, Salil P. Vadhan, Daniel J. Weitzner:
Towards a Privacy Research Roadmap for the Computing Community. CoRR abs/1604.03160 (2016) - [i83]Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Locating a Small Cluster Privately. CoRR abs/1604.05590 (2016) - [i82]Ryan M. Rogers, Aaron Roth, Jonathan R. Ullman, Salil P. Vadhan:
Privacy Odometers and Filters: Pay-as-you-Go Composition. CoRR abs/1605.08294 (2016) - [i81]Marco Gaboardi, James Honaker, Gary King, Kobbi Nissim, Jonathan R. Ullman, Salil P. Vadhan:
PSI (Ψ): a Private data Sharing Interface. CoRR abs/1609.04340 (2016) - [i80]Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. IACR Cryptol. ePrint Arch. 2016: 820 (2016) - 2015
- [c96]Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Differentially Private Release and Learning of Threshold Functions. FOCS 2015: 634-649 - [c95]Cynthia Dwork, Adam D. Smith, Thomas Steinke, Jonathan R. Ullman, Salil P. Vadhan:
Robust Traceability from Trace Amounts. FOCS 2015: 650-669 - [i79]Sitan Chen, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Read-Once, Constant-Depth Circuits. CoRR abs/1504.04675 (2015) - [i78]Mark Bun, Kobbi Nissim, Uri Stemmer, Salil P. Vadhan:
Differentially Private Release and Learning of Threshold Functions. CoRR abs/1504.07553 (2015) - [i77]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. CoRR abs/1507.03113 (2015) - [i76]Jack Murtagh, Salil P. Vadhan:
The Complexity of Computing the Optimal Composition of Differential Privacy. IACR Cryptol. ePrint Arch. 2015: 1057 (2015) - 2014
- [c94]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs. APPROX-RANDOM 2014: 885-899 - [c93]Parikshit Gopalan, Salil P. Vadhan, Yuan Zhou:
Locally testable codes and cayley graphs. ITCS 2014: 81-92 - [c92]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the boundaries on purchasing data from privacy-sensitive individuals. ITCS 2014: 411-422 - [c91]Mark Bun, Jonathan R. Ullman, Salil P. Vadhan:
Fingerprinting codes and the price of approximate differential privacy. STOC 2014: 1-10 - [c90]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. WINE 2014: 371-385 - [i75]Kobbi Nissim, Salil P. Vadhan, David Xiao:
Redrawing the Boundaries on Purchasing Data from Privacy-Sensitive Individuals. CoRR abs/1401.4092 (2014) - [i74]Thomas Steinke, Salil P. Vadhan, Andrew Wan:
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs. CoRR abs/1405.7028 (2014) - [i73]Yiling Chen, Or Sheffet, Salil P. Vadhan:
Privacy Games. CoRR abs/1410.1920 (2014) - 2013
- [j33]Yakir Reshef, Salil P. Vadhan:
On extractors and exposure-resilient functions for sublogarithmic entropy. Random Struct. Algorithms 42(3): 386-401 (2013) - [j32]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42(3): 1405-1430 (2013) - [j31]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. 9: 897-945 (2013) - [c89]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM 2013: 655-670 - [c88]Salil P. Vadhan, Colin Jia Zheng:
A Uniform Min-Max Theorem with Applications in Cryptography. CRYPTO (1) 2013: 93-110 - [c87]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. EUROCRYPT 2013: 93-110 - [c86]Mohammad Mahmoody, Tal Moran, Salil P. Vadhan:
Publicly verifiable proofs of sequential work. ITCS 2013: 373-388 - [c85]Yiling Chen, Stephen Chong, Ian A. Kash, Tal Moran, Salil P. Vadhan:
Truthful mechanisms for agents that value privacy. EC 2013: 215-232 - [c84]Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson:
Interactive proofs of proximity: delegating computation in sublinear time. STOC 2013: 793-802 - [i72]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR abs/1306.3004 (2013)