Rina Panigrahy

Affiliations:
  • Google


According to our database1, Rina Panigrahy authored at least 103 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Simple Mechanisms for Representing, Indexing and Manipulating Concepts.
CoRR, 2023

The Power of External Memory in Increasing Predictive Model Capacity.
CoRR, 2023

Alternating Updates for Efficient Transformers.
CoRR, 2023

Alternating Updates for Efficient Transformers.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Benefits of Learning to Route in Mixture-of-Experts Models.
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, 2023

2022
Sketching based Representations for Robust Image Classification with Provable Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Theoretical View on Sparsely Activated Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Unified Cascaded Encoder ASR Model for Dynamic Model Sizes.
Proceedings of the Interspeech 2022, 2022

2021
Provable Hierarchical Lifelong Learning with a Sketch-based Modular Architecture.
CoRR, 2021

For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions.
CoRR, 2021

One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks.
Proceedings of the 9th International Conference on Learning Representations, 2021

Sketch based Memory for Neural Networks.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Learning the gravitational force law and other analytic functions.
CoRR, 2020

On the Learnability of Random Deep Networks.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
How does the Mind store Information?
CoRR, 2019

On the Learnability of Deep Random Networks.
CoRR, 2019

Learning Two layer Networks with Multinomial Activation and High Thresholds.
CoRR, 2019

Recursive Sketches for Modular Deep Learning.
Proceedings of the 36th International Conference on Machine Learning, 2019

Faster Algorithms for Binary Matrix Factorization.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Convergence Results for Neural Networks via Electrodynamics.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Electron-Proton Dynamics in Deep Learning.
CoRR, 2017

Algorithms for $\ell_p$ Low-Rank Approximation.
Proceedings of the 34th International Conference on Machine Learning, 2017

Partitioning Orders in Online Shopping Services.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2015
Fractal Structures in Adversarial Prediction.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Optimal amortized regret in every interval.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Learning Sparse Polynomial Functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Learning Polynomials with Neural Networks.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
A Differential Equations Approach to Optimizing Regret Trade-offs
CoRR, 2013

Sparse Matrix Factorization.
CoRR, 2013

Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Debiasing social wisdom.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
The Mind Grows Circuits
CoRR, 2012

Understanding cyclic trends in social choices.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

How user behavior is related to social affinity.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Spectral sparsification via random spanners.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

NNS Lower Bounds via Metric Expansion for l ∞ and EMD.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Estimating PageRank on graph streams.
J. ACM, 2011

Context-based Online Configuration-Error Detection.
Proceedings of the 2011 USENIX Annual Technical Conference, 2011

Prediction strategies without loss.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Multiplicative Approximations of Random Walk Transition Probabilities.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Achieving anonymity via clustering.
ACM Trans. Algorithms, 2010

Understanding the Cycle of Knowledge: Its rise, preservation and decay
CoRR, 2010

A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning
CoRR, 2010

Understanding Fashion Cycles as a Social Choice
CoRR, 2010

Revisiting the Examination Hypothesis with Query Specific Position Bias
CoRR, 2010

Ranking mechanisms in twitter-like forums.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

A sketch-based distance oracle for web-scale graphs.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

Lower Bounds on Near Neighbor Search via Metric Expansion.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
A hardware platform for efficient worm outbreak detection.
ACM Trans. Design Autom. Electr. Syst., 2009

Error-Correcting Codes for Ternary Content Addressable Memories.
IEEE Trans. Computers, 2009

Less is more: sampling the neighborhood graph makes SALSA better and faster.
Proceedings of the Second International Conference on Web Search and Web Data Mining, 2009

Sparse Cut Projections in Graph Streams.
Proceedings of the Algorithms, 2009

The Oil Searching Problem.
Proceedings of the Algorithms, 2009

3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit.
Proceedings of the Algorithms, 2009

2008
Deterministic Approximation Algorithms for the Nearest Codeword Problem.
Electron. Colloquium Comput. Complex., 2008

Better Bounds for Frequency Moments in Random-Order Streams
CoRR, 2008

Design Tradeoffs for SSD Performance.
Proceedings of the 2008 USENIX Annual Technical Conference, 2008

Trace reconstruction with constant deletion probability and related results.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Spamming botnets: signatures and characteristics.
Proceedings of the ACM SIGCOMM 2008 Conference on Applications, 2008

The power of two min-hashes for similarity search among hierarchical data objects.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Hashing, searching, sketching.
PhD thesis, 2007

A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding.
IEEE Trans. Computers, 2007

Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

Lower Bounds on Locality Sensitive Hashing.
SIAM J. Discret. Math., 2007

Computing shortest paths with uncertainty.
J. Algorithms, 2007

Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Estimating Sum by Weighted Sampling.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

A Real-Time Worm Outbreak Detection System Using Shared Counters.
Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects, 2007

Finding Frequent Elements in Non-bursty Streams.
Proceedings of the Algorithms, 2007

On Finding Frequent Elements in a Data Stream.
Proceedings of the Approximation, 2007

2006
Entropy based nearest neighbor search in high dimensions.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Balanced allocation on graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Analyzing BitTorrent and related peer-to-peer networks.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Beyond bloom filters: from approximate membership checks to approximate state machines.
Proceedings of the ACM SIGCOMM 2006 Conference on Applications, 2006

An Improved Construction for Counting Bloom Filters.
Proceedings of the Algorithms, 2006

A dictionary for approximate string search and longest prefix search.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Exploiting asymmetry in hierarchical topic extraction.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Estimating corpus size via queries.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

Fractional Matching Via Balls-and-Bins.
Proceedings of the Approximation, 2006

2005
The smallest grammar problem.
IEEE Trans. Inf. Theory, 2005

Efficient hashing with lookups in two memory accesses.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Algorithms for the Database Layout Problem.
Proceedings of the Database Theory, 2005

Anonymizing Tables.
Proceedings of the Database Theory, 2005

High-Speed and Low-Power Network Search Engine Using Adaptive Block-Selection Scheme.
Proceedings of the 13th Annual IEEE Symposium on High Performance Interconnects (HOTIC 2005), 2005

2004
Combining request scheduling with web caching.
Theor. Comput. Sci., 2004

Clustering to minimize the sum of cluster diameters.
J. Comput. Syst. Sci., 2004

Minimum Enclosing Polytope in High Dimensions
CoRR, 2004

Efficient multicast on a terabit router.
Proceedings of the 12th Annual IEEE Symposium on High Performance Interconnects, 2004

2003
Computing the Median with Uncertainty.
SIAM J. Comput., 2003

Sorting and Searching using Ternary CAMs.
IEEE Micro, 2003

A combinatorial algorithm for MAX CSP.
Inf. Process. Lett., 2003

Better streaming algorithms for clustering problems.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Representing Graph Metrics with Fewest Edges.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002
Approximating the smallest grammar: Kolmogorov complexity in natural models.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Web caching with request reordering.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Reducing TCAM Power Consumption and Increasing Throughput.
Proceedings of the 10th Annual IEEE Symposium on High Performance Interconnects (HOTIC 2002), August 21, 2002

2000
On the decidability of accessibility problems (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1998
An O(log* n) Approximation Algorithm for the Asymmetric <i>p</i>-Center Problem.
J. Algorithms, 1998

1997
A Note on Optical Routing on Trees.
Inf. Process. Lett., 1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997


  Loading...