16 papers found.

Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

.
Noga Alon . On the number of subgraphs of prescribed type of graphs with a given number of edges . Israel Journal of Mathematics , 1981 .
Sepehr Assadi , Michael Kapralov , and **Sanjeev** **Khanna** . A Simple

Given a non-negative real matrix A, the matrix scaling problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it. The matrix scaling problem arises in many algorithmic applications, perhaps most notably as a preconditioning step in solving linear system of equations. One of the most natural and...

Given a non-negative real matrix A, the matrix scaling problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it. The matrix scaling problem arises in many algorithmic applications, perhaps most notably as a preconditioning step in solving linear system of equations. One of the most natural and...

Given a non-negative real matrix A, the matrix scaling problem is to determine if it is possible to scale the rows and columns so that each row and each column sums to a specified target value for it. The matrix scaling problem arises in many algorithmic applications, perhaps most notably as a preconditioning step in solving linear system of equations. One of the most natural and...

. Addison-Wesley , 1995 .
Noga Alon , Yossi Matias, and Mario Szegedy . The space complexity of approximating the frequency moments . In STOC , pages 20 - 29 . ACM, 1996 .
Sepehr Assadi , **Sanjeev** **Khanna**, Yang ... ., 49 ( 2 ), 2011 .
T.J. Green , G. Karvounarakis , and V. Tannen . Provenance semirings . In PODS , pages 31 - 40 , 2007 .
Michael Greenwald and **Sanjeev** **Khanna** . Space-efficient online computation of

Algorithms, SODA, pages 279?293, 2014.
Acknowledgments.
discussions.
We are grateful to Chandra Chekuri and Michael Saks for helpful
Sepehr Assadi , **Sanjeev** **Khanna**, Yang Li , and Val Tannen . Dynamic

We study the problem of space-efficient polynomial-time algorithms for {\em directed st-connectivity} (STCON). Given a directed graph $G$, and a pair of vertices $s, t$, the STCON problem is to decide if there exists a path from $s$ to $t$ in $G$. For general graphs, the best polynomial-time algorithm for STCON uses space that is only slightly sublinear. However, for special...