List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Convergence results for neural networks via electrodynamics (available as arXiv preprint) | 2021-06-15 | Paper |
| On the Learnability of Random Deep Networks Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Learning sparse polynomial functions Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Error-Correcting Codes for Ternary Content Addressable Memories IEEE Transactions on Computers | 2017-08-08 | Paper |
| Fractal Structures in Adversarial Prediction Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| Spectral sparsification via random spanners Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
| A note on optical routing on trees Information Processing Letters | 2016-05-26 | Paper |
| Querying priced information in databases ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Clustering to minimize the sum of cluster diameters Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Achieving anonymity via clustering ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Efficient hashing with lookups in two memory accesses | 2014-10-13 | Paper |
| Computing the median with uncertainty Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
| On the decidability of accessibility problems (extended abstract) Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
| NNS lower bounds via metric expansion for \(l _{ \infty }\) and EMD Automata, Languages, and Programming | 2013-08-12 | Paper |
| Multiplicative Approximations of Random Walk Transition Probabilities Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
| Estimating PageRank on graph streams Journal of the ACM | 2011-07-14 | Paper |
| Balanced allocation on graphs Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Analyzing BitTorrent and related peer-to-peer networks Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Better streaming algorithms for clustering problems Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Entropy based nearest neighbor search in high dimensions Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| The Oil Searching Problem Lecture Notes in Computer Science | 2009-10-29 | Paper |
| Sparse Cut Projections in Graph Streams Lecture Notes in Computer Science | 2009-10-29 | Paper |
| 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit Lecture Notes in Computer Science | 2009-10-29 | Paper |
| Deterministic Approximation Algorithms for the Nearest Codeword Problem Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| A combinatorial algorithm for MAX CSP Information Processing Letters | 2009-03-23 | Paper |
| On Finding Frequent Elements in a Data Stream Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| scientific article; zbMATH DE number 5506204 (Why is no real title available?) | 2009-02-10 | Paper |
| The Smallest Grammar Problem IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Lower Bounds on Locality Sensitive Hashing SIAM Journal on Discrete Mathematics | 2008-12-05 | Paper |
| Finding Frequent Elements in Non-bursty Streams Algorithms – ESA 2007 | 2008-09-25 | Paper |
| An Improved Algorithm Finding Nearest Neighbor Using Kd-trees Lecture Notes in Computer Science | 2008-04-15 | Paper |
| Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms Algorithms and Models for the Web-Graph | 2008-04-11 | Paper |
| An Improved Construction for Counting Bloom Filters Lecture Notes in Computer Science | 2008-03-11 | Paper |
| Estimating Sum by Weighted Sampling Automata, Languages and Programming | 2007-11-28 | Paper |
| Fractional Matching Via Balls-and-Bins Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
| Computing shortest paths with uncertainty Journal of Algorithms | 2007-05-14 | Paper |
| Database Theory - ICDT 2005 Lecture Notes in Computer Science | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 Lecture Notes in Computer Science | 2005-09-13 | Paper |
| scientific article; zbMATH DE number 2119649 (Why is no real title available?) | 2004-11-29 | Paper |
| Combining request scheduling with web caching Theoretical Computer Science | 2004-11-23 | Paper |
| Clustering to minimize the sum of cluster diameters Journal of Computer and System Sciences | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2086643 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1962828 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1962827 (Why is no real title available?) | 2003-08-11 | Paper |
| Computing the Median with Uncertainty SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1559581 (Why is no real title available?) | 2001-03-01 | Paper |
| AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem Journal of Algorithms | 1998-12-02 | Paper |
Research outcomes over time
This page was built for person: Rina Panigrahy
