| Publication | Date of Publication | Type |
|---|
| PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography | 2024-03-14 | Paper |
A permutation approach to validation*
Statistical Analysis and Data Mining: The ASA Data Science Journal | 2020-10-14 | Paper |
Feature selection for linear SVM with provable guarantees
Pattern Recognition | 2019-05-29 | Paper |
The fast Cauchy transform and faster robust linear regression
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
A maximum likelihood approach to volatility estimation for a Brownian motion using high, low and close price data
Quantitative Finance | 2019-01-14 | Paper |
| Recovering PCA and sparse PCA via hybrid-\((\ell_1,\ell_2)\) sparse sampling of data elements | 2018-04-17 | Paper |
Recovering PCA and sparse PCA via hybrid-\((\ell_1,\ell_2)\) sparse sampling of data elements
(available as arXiv preprint) | 2018-04-17 | Paper |
Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
SIAM Journal on Matrix Analysis and Applications | 2018-04-06 | Paper |
Optimal Oblivious Path Selection on the Mesh
IEEE Transactions on Computers | 2017-11-10 | Paper |
NP-hardness and inapproximability of sparse PCA
Information Processing Letters | 2017-06-30 | Paper |
Near-Optimal Coresets for Least-Squares Regression
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Deterministic Feature Selection for K-Means Clustering
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
The fast Cauchy transform and faster robust linear regression
SIAM Journal on Computing | 2016-06-16 | Paper |
Near-optimal column-based matrix reconstruction
SIAM Journal on Computing | 2014-07-30 | Paper |
Near Optimal Column-Based Matrix Reconstruction
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A note on sparse least-squares regression
Information Processing Letters | 2014-04-15 | Paper |
| Fast approximation of matrix coherence and statistical leverage | 2014-04-01 | Paper |
Fast approximation of matrix coherence and statistical leverage
(available as arXiv preprint) | 2014-04-01 | Paper |
Contention-free MAC protocols for asynchronous wireless sensor networks
Distributed Computing | 2013-06-28 | Paper |
Exponential inapproximability of selecting a maximum volume sub-matrix
Algorithmica | 2013-03-05 | Paper |
Defining and discovering communities in social networks
Handbook of Optimization in Complex Networks | 2012-09-27 | Paper |
| Spreading Processes and Large Components in Ordered, Directed Random Graphs | 2012-09-10 | Paper |
An analysis of optimal link bombs
Theoretical Computer Science | 2012-08-08 | Paper |
Column subset selection via sparse approximation of SVD
Theoretical Computer Science | 2012-03-13 | Paper |
Embedding a forest in a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Embedding a forest in a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Embedding a forest in a graph
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Oblivious routing for sensor network topologies
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Evolutionary algorithms on volunteer computing platforms: The MilkyWay\@Home project
Studies in Computational Intelligence | 2010-04-23 | Paper |
Using a linear fit to determine monotonicity directions.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
On selecting a maximum volume sub-matrix of a matrix and related problems
Theoretical Computer Science | 2009-11-06 | Paper |
| scientific article; zbMATH DE number 5605064 (Why is no real title available?) | 2009-09-19 | Paper |
Atomic routing games on maximum congestion
Theoretical Computer Science | 2009-08-21 | Paper |
A linear fit gets the correct monotonicity directions
Machine Learning | 2009-03-31 | Paper |
Deterministic Sparse Column Based Matrix Reconstruction via Greedy Approximation of SVD
Algorithms and Computation | 2009-01-29 | Paper |
Universal Bufferless Packet Switching
SIAM Journal on Computing | 2008-08-14 | Paper |
Atomic Routing Games on Maximum Congestion
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing | 2007-10-24 | Paper |
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Graph Drawing | 2007-08-28 | Paper |
Direct routing: Algorithms and complexity
Algorithmica | 2007-06-21 | Paper |
Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Euro-Par 2004 Parallel Processing
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Contention-Free MAC Protocols for Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-17 | Paper |
On the maximum drawdown of a Brownian motion
Journal of Applied Probability | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 1962847 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1927185 (Why is no real title available?) | 2003-06-12 | Paper |
| scientific article; zbMATH DE number 1893568 (Why is no real title available?) | 2003-04-07 | Paper |
On the Height of a Random Set of Points in a d-Dimensional Unit Cube
Experimental Mathematics | 2002-09-12 | Paper |
