Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDavid P. Woodruff
Person information
- affiliation: IBM Almaden Research Center
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[c138]Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang:
Testing Matrix Rank, Optimally. SODA 2019: 727-746- [c137]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for ℓp-Low Rank Approximation. SODA 2019: 747-766 - [c136]Ruosong Wang, David P. Woodruff:
Tight Bounds for ℓp Oblivious Subspace Embeddings. SODA 2019: 1825-1843 - [c135]Zhao Song, David P. Woodruff, Peilin Zhong:
Relative Error Tensor Low Rank Approximation. SODA 2019: 2772-2789 - 2018
- [c134]Huaian Diao, Zhao Song, Wen Sun, David P. Woodruff:
Sketching for Kronecker Product Regression and P-splines. AISTATS 2018: 1299-1308 - [c133]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. APPROX-RANDOM 2018: 7:1-7:22 - [c132]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p Norms. APPROX-RANDOM 2018: 15:1-15:20 - [c131]Yi Li, Vasileios Nakos, David P. Woodruff:
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. APPROX-RANDOM 2018: 19:1-19:13 - [c130]
- [c129]Christian Sohler, David P. Woodruff:
Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. FOCS 2018: 802-813 - [c128]Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang:
Revisiting Frequency Moment Estimation in Random Order Streams. ICALP 2018: 25:1-25:14 - [c127]Sumit Ganguly, David P. Woodruff:
High Probability Frequency Moment Sketches. ICALP 2018: 58:1-58:15 - [c126]Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang:
Improved Algorithms for Adaptive Compressed Sensing. ICALP 2018: 90:1-90:14 - [c125]Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, Lin F. Yang:
Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. ICML 2018: 648-657 - [c124]Graham Cormode, Charlie Dickens, David P. Woodruff:
Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms. ICML 2018: 1048-1056 - [c123]Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, Hongyang Zhang:
Matrix Completion and Related Problems via Strong Duality. ITCS 2018: 5:1-5:22 - [c122]Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, David P. Woodruff:
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness. ITCS 2018: 8:1-8:21 - [c121]Yogesh Dahiya, Dimitris Konomis, David P. Woodruff:
An Empirical Evaluation of Sketching for Numerical Linear Algebra. KDD 2018: 1292-1300 - [c120]Ainesh Bakshi, David P. Woodruff:
Sublinear Time Low-Rank Approximation of Distance Matrices. NeurIPS 2018: 3786-3796 - [c119]Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff:
On Coresets for Logistic Regression. NeurIPS 2018: 6562-6571 - [c118]Roie Levin, Anish Prasad Sevekari, David P. Woodruff:
Robust Subspace Approximation in a Stream. NeurIPS 2018: 10706-10716 - [c117]
- [c116]
- [r2]
- [i89]Ruosong Wang, David P. Woodruff:
Tight Bounds for 𝓁p Oblivious Subspace Embeddings. CoRR abs/1801.04414 (2018) - [i88]Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang:
Revisiting Frequency Moment Estimation in Random Order Streams. CoRR abs/1803.02270 (2018) - [i87]
- [i86]Vasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang:
Improved Algorithms for Adaptive Compressed Sensing. CoRR abs/1804.09673 (2018) - [i85]Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou:
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows. CoRR abs/1805.00212 (2018) - [i84]Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff:
On Coresets for Logistic Regression. CoRR abs/1805.08571 (2018) - [i83]Sumit Ganguly, David P. Woodruff:
High Probability Frequency Moment Sketches. CoRR abs/1805.10885 (2018) - [i82]Aditya Krishnan, Sidhanth Mohanty, David P. Woodruff:
On Sketching the q to p norms. CoRR abs/1806.06429 (2018) - [i81]John Hainline, Brendan Juba, Hai S. Le, David P. Woodruff:
Conditional Sparse 𝓁p-norm Regression With Optimal Probability. CoRR abs/1806.10222 (2018) - [i80]David P. Woodruff, Qin Zhang:
Distributed Statistical Estimation of Matrix Products with Applications. CoRR abs/1807.00878 (2018) - [i79]Graham Cormode, Charlie Dickens, David P. Woodruff:
Leveraging Well-Conditioned Bases: Streaming \& Distributed Summaries in Minkowski p-Norms. CoRR abs/1807.02571 (2018) - [i78]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for 𝓁p-Low Rank Approximation. CoRR abs/1807.06101 (2018) - [i77]
- [i76]Christian Sohler, David P. Woodruff:
Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. CoRR abs/1809.02961 (2018) - [i75]Ainesh Bakshi, David P. Woodruff:
Sublinear Time Low-Rank Approximation of Distance Matrices. CoRR abs/1809.06986 (2018) - [i74]Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang:
Testing Matrix Rank, Optimally. CoRR abs/1810.08171 (2018) - [i73]Zhao Song, David P. Woodruff, Peilin Zhong:
Towards a Zero-One Law for Entrywise Low Rank Approximation. CoRR abs/1811.01442 (2018) - [i72]Ainesh Bakshi, Rajesh Jayaram, David P. Woodruff:
Learning Two Layer Rectified Neural Networks in Polynomial Time. CoRR abs/1811.01885 (2018) - [i71]Zhao Song, David P. Woodruff, Peilin Zhong:
Relative Error Tensor Low Rank Approximation. Electronic Colloquium on Computational Complexity (ECCC) 25: 103 (2018) - 2017
- [j23]David P. Woodruff, Qin Zhang:
When distributed computation is communication expensive. Distributed Computing 30(5): 309-323 (2017) - [j22]Christos Boutsidis, David P. Woodruff:
Optimal CUR Matrix Decompositions. SIAM J. Comput. 46(2): 543-589 (2017) - [j21]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Faster Kernel Ridge Regression Using Sketching and Preconditioning. SIAM J. Matrix Analysis Applications 38(4): 1116-1138 (2017) - [c115]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Sharper Bounds for Regularized Data Fitting. APPROX-RANDOM 2017: 27:1-27:22 - [c114]
- [c113]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal Lower Bounds for Universal Relation, and for Samplers and Finding Duplicates in Streams. FOCS 2017: 475-486 - [c112]Cameron Musco, David P. Woodruff:
Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices. FOCS 2017: 672-683 - [c111]Eric Price, Zhao Song, David P. Woodruff:
Fast Regression with an $ell_infty$ Guarantee. ICALP 2017: 59:1-59:14 - [c110]Yi Li, David P. Woodruff:
Embeddings of Schatten Norms with Applications to Data Streams. ICALP 2017: 60:1-60:14 - [c109]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low-Rank Approximation. ICML 2017: 806-814 - [c108]Xingguo Li, Jarvis D. Haupt, David P. Woodruff:
Near Optimal Sketching of Low-Rank Tensor Regression. NIPS 2017: 3469-3479 - [c107]Cameron Musco, David P. Woodruff:
Is Input Sparsity Time Possible for Kernel Low-Rank Approximation? NIPS 2017: 4438-4448 - [c106]Karl Bringmann, Pavel Kolev, David P. Woodruff:
Approximation Algorithms for l0-Low Rank Approximation. NIPS 2017: 6651-6662 - [c105]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: An ℓ2 Heavy Hitters Algorithm Using Constant Memory. PODS 2017: 361-376 - [c104]
- [c103]Kenneth L. Clarkson, David P. Woodruff:
Low-Rank PSD Approximation in Input-Sparsity Time. SODA 2017: 2061-2072 - [c102]Zhao Song, David P. Woodruff, Peilin Zhong:
Low rank approximation with entrywise l1-norm error. STOC 2017: 688-701 - [i70]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. CoRR abs/1702.00196 (2017) - [i69]Yi Li, David P. Woodruff:
Embeddings of Schatten Norms with Applications to Data Streams. CoRR abs/1702.05626 (2017) - [i68]Michael Kapralov, Jelani Nelson, Jakub Pachocki, Zhengyu Wang, David P. Woodruff, Mobin Yahyazadeh:
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams. CoRR abs/1704.00633 (2017) - [i67]Cameron Musco, David P. Woodruff:
Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices. CoRR abs/1704.03371 (2017) - [i66]Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, David P. Woodruff:
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness. CoRR abs/1704.04163 (2017) - [i65]Zhao Song, David P. Woodruff, Peilin Zhong:
Relative Error Tensor Low Rank Approximation. CoRR abs/1704.08246 (2017) - [i64]Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, Hongyang Zhang:
Optimal Sample Complexity for Matrix Completion and Related Problems via 𝓁s2-Regularization. CoRR abs/1704.08683 (2017) - [i63]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low Rank Approximation. CoRR abs/1705.06730 (2017) - [i62]Eric Price, Zhao Song, David P. Woodruff:
Fast Regression with an $\ell_\infty$ Guarantee. CoRR abs/1705.10723 (2017) - [i61]Yi Li, Vasileios Nakos, David P. Woodruff:
On Low-Risk Heavy Hitters and Sparse Recovery Schemes. CoRR abs/1709.02919 (2017) - [i60]Jarvis D. Haupt, Xingguo Li, David P. Woodruff:
Near Optimal Sketching of Low-Rank Tensor Regression. CoRR abs/1709.07093 (2017) - [i59]Karl Bringmann, Pavel Kolev, David P. Woodruff:
Approximation Algorithms for ࡁ0-Low Rank Approximation. CoRR abs/1710.11253 (2017) - [i58]Cameron Musco, David P. Woodruff:
Is Input Sparsity Time Possible for Kernel Low-Rank Approximation? CoRR abs/1711.01596 (2017) - [i57]Huaian Diao, Zhao Song, Wen Sun, David P. Woodruff:
Sketching for Kronecker Product Regression and P-splines. CoRR abs/1712.09473 (2017) - [i56]Martin Dietzfelbinger, Michael Mitzenmacher, Rasmus Pagh, David P. Woodruff, Martin Aumüller:
Theory and Applications of Hashing (Dagstuhl Seminar 17181). Dagstuhl Reports 7(5): 1-21 (2017) - 2016
- [j20]Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff:
Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica 74(2): 787-811 (2016) - [j19]Mark Braverman, David P. Woodruff:
Guest Editorial for Information Complexity and Applications. Algorithmica 76(3): 595-596 (2016) - [j18]Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev:
Certifying Equality With Limited Interaction. Algorithmica 76(3): 796-845 (2016) - [j17]Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff:
The Fast Cauchy Transform and Faster Robust Linear Regression. SIAM J. Comput. 45(3): 763-810 (2016) - [j16]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions: Simple and Deterministic Matrix Sketching. SIAM J. Comput. 45(5): 1762-1792 (2016) - [j15]Yuval Rabani, Andréa W. Richa, Jared Saia, David P. Woodruff:
Editorial to the Special Issue on SODA'12. ACM Trans. Algorithms 12(1): 1:1 (2016) - [j14]Yung-Yu Chung, Srikanta Tirthapura, David P. Woodruff:
A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream. IEEE Trans. Knowl. Data Eng. 28(6): 1356-1368 (2016) - [c101]Yi Li, David P. Woodruff:
Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings. APPROX-RANDOM 2016: 39:1-39:11 - [c100]Yuqing Ai, Wei Hu, Yi Li, David P. Woodruff:
New Characterizations in Turnstile Streams with Applications. Conference on Computational Complexity 2016: 20:1-20:22 - [c99]Michael S. Crouch, Andrew McGregor, Gregory Valiant, David P. Woodruff:
Stochastic Streams: Sample Complexity vs. Space Complexity. ESA 2016: 32:1-32:15 - [c98]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal Approximate Matrix Product in Terms of Stable Rank. ICALP 2016: 11:1-11:14 - [c97]David P. Woodruff, Peilin Zhong:
Distributed low rank approximation of implicit functions of a matrix. ICDE 2016: 847-858 - [c96]David P. Woodruff:
New Algorithms for Heavy Hitters in Data Streams (Invited Talk). ICDT 2016: 4:1-4:12 - [c95]Michael Kapralov, Vamsi K. Potluru, David P. Woodruff:
How to Fake Multiply by a Gaussian Matrix. ICML 2016: 2101-2110 - [c94]Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang:
On Sketching Quadratic Forms. ITCS 2016: 311-319 - [c93]Maria-Florina Balcan, Yingyu Liang, Le Song, David P. Woodruff, Bo Xie:
Communication Efficient Distributed Kernel Principal Component Analysis. KDD 2016: 725-734 - [c92]Zhao Song, David P. Woodruff, Huan Zhang:
Sublinear Time Orthogonal Tensor Decomposition. NIPS 2016: 793-801 - [c91]Jiecao Chen, He Sun, David P. Woodruff, Qin Zhang:
Communication-Optimal Distributed Clustering. NIPS 2016: 3720-3728 - [c90]Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang:
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. PODS 2016: 261-276 - [c89]Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. PODS 2016: 385-400 - [c88]Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. SODA 2016: 318-337 - [c87]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Brief Announcement: Applications of Uniform Sampling: Densest Subgraph and Beyond. SPAA 2016: 397-399 - [c86]Christos Boutsidis, David P. Woodruff, Peilin Zhong:
Optimal principal component analysis in distributed and streaming models. STOC 2016: 236-249 - [c85]Ilya P. Razenshteyn, Zhao Song, David P. Woodruff:
Weighted low rank approximations with provable guarantees. STOC 2016: 250-263 - [c84]
- [c83]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff:
Beating CountSketch for heavy hitters in insertion streams. STOC 2016: 740-753 - [c82]Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff:
Communication lower bounds for statistical estimation problems via a distributed data processing inequality. STOC 2016: 1011-1020 - [i55]Vladimir Braverman, Stephen R. Chestnut, David P. Woodruff, Lin F. Yang:
Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors. CoRR abs/1601.07473 (2016) - [i54]David P. Woodruff, Peilin Zhong:
Distributed Low Rank Approximation of Implicit Functions of a Matrix. CoRR abs/1601.07721 (2016) - [i53]Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems. CoRR abs/1603.00213 (2016) - [i52]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, Jelani Nelson, Zhengyu Wang, David P. Woodruff:
BPTree: an ℓ2 heavy hitters algorithm using constant memory. CoRR abs/1603.00759 (2016) - [i51]
- [i50]Yi Li, David P. Woodruff:
On Approximating Functions of the Singular Values in a Stream. CoRR abs/1604.08679 (2016) - [i49]Michael Kapralov, Vamsi K. Potluru, David P. Woodruff:
How to Fake Multiply by a Gaussian Matrix. CoRR abs/1606.05732 (2016) - [i48]Zhao Song, David P. Woodruff, Peilin Zhong:
Low Rank Approximation with Entrywise ℓ1-Norm Error. CoRR abs/1611.00898 (2016) - [i47]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Faster Kernel Ridge Regression Using Sketching and Preconditioning. CoRR abs/1611.03220 (2016) - [i46]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Sharper Bounds for Regression and Low-Rank Approximation with Regularization. CoRR abs/1611.03225 (2016) - [i45]Ravindran Kannan, Michael W. Mahoney, David P. Woodruff:
Recent Advances in Randomized Numerical Linear Algebra (NII Shonan Meeting 2016-10). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j13]Srikanta Tirthapura, David P. Woodruff:
A General Method for Estimating Correlated Aggregates Over a Data Stream. Algorithmica 73(2): 235-260 (2015) - [c81]Xiaoming Sun, David P. Woodruff:
Tight Bounds for Graph Problems in Insertion Streams. APPROX-RANDOM 2015: 435-448 - [c80]Kenneth L. Clarkson, David P. Woodruff:
Input Sparsity and Hardness for Robust Subspace Approximation. FOCS 2015: 310-329 - [c79]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. ICALP (1) 2015: 960-972 - [c78]Omri Weinstein, David P. Woodruff:
The Simultaneous Communication of Disjointness with Applications to Data Streams. ICALP (1) 2015: 1082-1093 - [c77]Dirk Van Gucht, Ryan Williams, David P. Woodruff, Qin Zhang:
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication. PODS 2015: 199-212 - [c76]Kenneth L. Clarkson, David P. Woodruff:
Sketching for M-Estimators: A Unified Approach to Robust Regression. SODA 2015: 921-939 - [i44]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions : Simple and Deterministic Matrix Sketching. CoRR abs/1501.01711 (2015) - [i43]Maria-Florina Balcan, Yingyu Liang, Le Song, David P. Woodruff, Bo Xie:
Distributed Kernel Principal Component Analysis. CoRR abs/1503.06858 (2015) - [i42]Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR abs/1504.01076 (2015) - [i41]Christos Boutsidis, David P. Woodruff:
Communication-optimal Distributed Principal Component Analysis in the Column-partition Model. CoRR abs/1504.06729 (2015) - [i40]Hossein Esfandiari, MohammadTaghi Hajiaghayi, David P. Woodruff:
Applications of Uniform Sampling: Densest Subgraph and Beyond. CoRR abs/1506.04505 (2015) - [i39]Mark Braverman, Ankit Garg, Tengyu Ma, Huy L. Nguyen, David P. Woodruff:
Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality. CoRR abs/1506.07216 (2015) - [i38]Michael B. Cohen, Jelani Nelson, David P. Woodruff:
Optimal approximate matrix product in terms of stable rank. CoRR abs/1507.02268 (2015) - [i37]Kenneth L. Clarkson, David P. Woodruff:
Input Sparsity and Hardness for Robust Subspace Approximation. CoRR abs/1510.06073 (2015) - [i36]Vladimir Braverman, Stephen R. Chestnut, Nikita Ivkin, David P. Woodruff:
Beating CountSketch for Heavy Hitters in Insertion Streams. CoRR abs/1511.00661 (2015) - [i35]Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, Qin Zhang:
On Sketching Quadratic Forms. CoRR abs/1511.06099 (2015) - [i34]Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. Electronic Colloquium on Computational Complexity (ECCC) 22: 31 (2015) - [i33]Omri Weinstein, David P. Woodruff:
The Simultaneous Communication of Disjointness with Applications to Data Streams. Electronic Colloquium on Computational Complexity (ECCC) 22: 83 (2015) - 2014
- [j12]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. Combinatorica 34(3): 255-277 (2014) - [j11]