Rina Panigrahy

From MaRDI portal
Person:287097

Available identifiers

zbMath Open panigrahy.rinaMaRDI QIDQ287097

List of research outcomes

PublicationDate of PublicationType
Convergence Results for Neural Networks via Electrodynamics2021-06-15Paper
On the Learnability of Random Deep Networks2021-02-02Paper
Learning Sparse Polynomial Functions2019-06-20Paper
Error-Correcting Codes for Ternary Content Addressable Memories2017-08-08Paper
Fractal Structures in Adversarial Prediction2017-05-19Paper
Spectral sparsification via random spanners2016-10-07Paper
A note on optical routing on trees2016-05-26Paper
Querying priced information in databases2015-09-02Paper
Clustering to minimize the sum of cluster diameters2015-02-27Paper
Achieving anonymity via clustering2014-11-18Paper
https://portal.mardi4nfdi.de/entity/Q29217482014-10-13Paper
On the decidability of accessibility problems (extended abstract)2014-09-26Paper
Computing the median with uncertainty2014-09-26Paper
NNS Lower Bounds via Metric Expansion for l  ∞  and EMD2013-08-12Paper
Multiplicative Approximations of Random Walk Transition Probabilities2011-08-17Paper
Estimating PageRank on graph streams2011-07-14Paper
Better streaming algorithms for clustering problems2010-08-16Paper
Entropy based nearest neighbor search in high dimensions2010-08-16Paper
Balanced allocation on graphs2010-08-16Paper
Analyzing BitTorrent and related peer-to-peer networks2010-08-16Paper
Sparse Cut Projections in Graph Streams2009-10-29Paper
The Oil Searching Problem2009-10-29Paper
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit2009-10-29Paper
Deterministic Approximation Algorithms for the Nearest Codeword Problem2009-10-28Paper
A combinatorial algorithm for MAX CSP2009-03-23Paper
On Finding Frequent Elements in a Data Stream2009-02-17Paper
https://portal.mardi4nfdi.de/entity/Q36015342009-02-10Paper
The Smallest Grammar Problem2008-12-21Paper
Lower Bounds on Locality Sensitive Hashing2008-12-05Paper
Finding Frequent Elements in Non-bursty Streams2008-09-25Paper
An Improved Algorithm Finding Nearest Neighbor Using Kd-trees2008-04-15Paper
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms2008-04-11Paper
An Improved Construction for Counting Bloom Filters2008-03-11Paper
Estimating Sum by Weighted Sampling2007-11-28Paper
Fractional Matching Via Balls-and-Bins2007-08-28Paper
Computing shortest paths with uncertainty2007-05-14Paper
Database Theory - ICDT 20052005-09-13Paper
Database Theory - ICDT 20052005-09-13Paper
https://portal.mardi4nfdi.de/entity/Q48289202004-11-29Paper
Combining request scheduling with web caching2004-11-23Paper
Clustering to minimize the sum of cluster diameters2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q47371792004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44186642003-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44186652003-08-11Paper
Computing the Median with Uncertainty2003-06-19Paper
https://portal.mardi4nfdi.de/entity/Q45270332001-03-01Paper
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem1998-12-02Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rina Panigrahy