Search results for "Rina Panigrahy"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Rina Panigrahy, Li Zhang	The Mind Grows Circuits	CoRR	2012	DBLP BibTeX RDF
1	Michael Kapralov, Rina Panigrahy	Spectral sparsification via random spanners.	ITCS	2012	DBLP DOI BibTeX RDF
1	Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang	Understanding cyclic trends in social choices.	WSDM	2012	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Marc Najork, Yinglian Xie	How user behavior is related to social affinity.	WSDM	2012	DBLP DOI BibTeX RDF
1	Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy	Estimating PageRank on graph streams.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Michael Kapralov, Rina Panigrahy	Multiplicative Approximations of Random Walk Transition Probabilities.	APPROX-RANDOM	2011	DBLP DOI BibTeX RDF
1	Michael Kapralov, Rina Panigrahy	Prediction strategies without loss.	NIPS	2011	DBLP BibTeX RDF
1	Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu	Achieving anonymity via clustering.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang	Understanding Fashion Cycles as a Social Choice	CoRR	2010	DBLP BibTeX RDF
1	Michael Kapralov, Rina Panigrahy	Prediction strategies without loss	CoRR	2010	DBLP BibTeX RDF
1	Rina Panigrahy	A non-expert view on Turing machines, Proof Verifiers, and Mental reasoning	CoRR	2010	DBLP BibTeX RDF
1	Sreenivas Gollapudi, Rina Panigrahy	Revisiting the Examination Hypothesis with Query Specific Position Bias	CoRR	2010	DBLP BibTeX RDF
1	Rina Panigrahy	Understanding the Cycle of Knowledge: Its rise, preservation and decay	CoRR	2010	DBLP BibTeX RDF
1	Rina Panigrahy, Kunal Talwar, Udi Wieder	Lower Bounds on Near Neighbor Search via Metric Expansion	CoRR	2010	DBLP BibTeX RDF
1	Rina Panigrahy, Kunal Talwar, Udi Wieder	Lower Bounds on Near Neighbor Search via Metric Expansion.	FOCS	2010	DBLP DOI BibTeX RDF
1	Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy	A sketch-based distance oracle for web-scale graphs.	WSDM	2010	DBLP DOI BibTeX RDF	algorithms, embedding, shortest path, sketching, distance computation
1	Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy	Ranking mechanisms in twitter-like forums.	WSDM	2010	DBLP DOI BibTeX RDF	ranking mechanisms, thumb-based ranking, comparisons
1	Miad Faezipour, Mehrdad Nourani, Rina Panigrahy	A hardware platform for efficient worm outbreak detection.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	shared counters, worm outbreak, hashing, false positive, Network Intrusion Detection System, false negative, polymorphic worm
1	Sriram C. Krishnan, Rina Panigrahy, Sunil Parthasarathy	Error-Correcting Codes for Ternary Content Addressable Memories.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
1	Andrew McGregor, Krzysztof Onak, Rina Panigrahy	The Oil Searching Problem.	ESA	2009	DBLP DOI BibTeX RDF
1	Eric Lehman, Rina Panigrahy	3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit.	ESA	2009	DBLP DOI BibTeX RDF
1	Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy	Sparse Cut Projections in Graph Streams.	ESA	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Marc Najork, Sreenivas Gollapudi, Rina Panigrahy	Less is more: sampling the neighborhood graph makes SALSA better and faster.	WSDM	2009	DBLP DOI BibTeX RDF	MAX, web search, HITS, retrieval performance, link-based ranking, SALSA
1	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Alexandr Andoni, Andrew McGregor, Krzysztof Onak, Rina Panigrahy	Better Bounds for Frequency Moments in Random-Order Streams	CoRR	2008	DBLP BibTeX RDF
1	Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder	Trace reconstruction with constant deletion probability and related results.	SODA	2008	DBLP DOI BibTeX RDF
1	Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark S. Manasse, Rina Panigrahy	Design Tradeoffs for SSD Performance.	USENIX Annual Technical Conference	2008	DBLP BibTeX RDF
1	Rina Panigrahy	An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.	LATIN	2008	DBLP DOI BibTeX RDF
1	Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigrahy, Geoff Hulten, Ivan Osipkov	Spamming botnets: signatures and characteristics.	SIGCOMM	2008	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Kunal Talwar, Udi Wieder	A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match.	FOCS	2008	DBLP DOI BibTeX RDF
1	Sreenivas Gollapudi, Rina Panigrahy	The power of two min-hashes for similarity search among hierarchical data objects.	PODS	2008	DBLP DOI BibTeX RDF	earth movers distance, similarity, locality sensitive hashing
1	Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy	Estimating PageRank on graph streams.	PODS	2008	DBLP DOI BibTeX RDF	graph conductance, random walk, PageRank, streaming algorithms, mixing time
1	Mohammad J. Akhbarizadeh, Mehrdad Nourani, Rina Panigrahy, Samar Sharma	A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	throughput increase, Internet packet forwarding engine, block selection scheme, System design, ternary content addressable memory
1	Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas	Querying priced information in databases: The conjunctive case.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	online algorithms, Competitive analysis
1	Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy	Computing shortest paths with uncertainty.	J. Algorithms	2007	DBLP DOI BibTeX RDF
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower Bounds on Locality Sensitive Hashing.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Dilys Thomas	Finding Frequent Elements in Non-bursty Streams.	ESA	2007	DBLP DOI BibTeX RDF
1	Rajeev Motwani, Rina Panigrahy, Ying Xu 0002	Estimating Sum by Weighted Sampling.	ICALP	2007	DBLP DOI BibTeX RDF
1	Sreenivas Gollapudi, Marc Najork, Rina Panigrahy	Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms.	WAW	2007	DBLP DOI BibTeX RDF
1	Ravi Kumar, Rina Panigrahy	On Finding Frequent Elements in a Data Stream.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
1	Miad Faezipour, Mehrdad Nourani, Rina Panigrahy	A Real-Time Worm Outbreak Detection System Using Shared Counters.	Hot Interconnects	2007	DBLP DOI BibTeX RDF
1	Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese	An Improved Construction for Counting Bloom Filters.	ESA	2006	DBLP DOI BibTeX RDF
1	David Arthur, Rina Panigrahy	Analyzing BitTorrent and related peer-to-peer networks.	SODA	2006	DBLP DOI BibTeX RDF
1	Krishnaram Kenthapadi, Rina Panigrahy	Balanced allocation on graphs.	SODA	2006	DBLP DOI BibTeX RDF
1	Rina Panigrahy	Entropy based nearest neighbor search in high dimensions.	SODA	2006	DBLP DOI BibTeX RDF
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower bounds on locality sensitive hashing.	Symposium on Computational Geometry	2006	DBLP DOI BibTeX RDF	lower bounds, nearest neighbor search, locality sensitive hashing
1	Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese	Beyond bloom filters: from approximate membership checks to approximate state machines.	SIGCOMM	2006	DBLP DOI BibTeX RDF	network flows, bloom filters, state machines
1	Rajeev Motwani, Rina Panigrahy, Ying Xu 0002	Fractional Matching Via Balls-and-Bins.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu	Achieving anonymity via clustering.	PODS	2006	DBLP DOI BibTeX RDF	clustering, privacy, approximation algorithms, anonymity
1	Andrei Z. Broder, Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Rajeev Motwani, Shubha U. Nabar, Rina Panigrahy, Andrew Tomkins, Ying Xu 0002	Estimating corpus size via queries.	CIKM	2006	DBLP DOI BibTeX RDF	corpus size, estimator, random sampling
1	Sreenivas Gollapudi, Rina Panigrahy	A dictionary for approximate string search and longest prefix search.	CIKM	2006	DBLP DOI BibTeX RDF	hamming space, embeddings
1	Sreenivas Gollapudi, Rina Panigrahy	Exploiting asymmetry in hierarchical topic extraction.	CIKM	2006	DBLP DOI BibTeX RDF	latent semantic indexing, locality-sensitive hashing
1	Rina Panigrahy	Entropy based Nearest Neighbor Search in High Dimensions	CoRR	2005	DBLP BibTeX RDF
1	Rajeev Motwani, Assaf Naor, Rina Panigrahy	Lower bounds on Locality Sensitive Hashing	CoRR	2005	DBLP BibTeX RDF
1	Krishnaram Kenthapadi, Rina Panigrahy	Balanced Allocation on Graphs	CoRR	2005	DBLP BibTeX RDF
1	Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat	The smallest grammar problem.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Rina Panigrahy	Efficient hashing with lookups in two memory accesses.	SODA	2005	DBLP DOI BibTeX RDF
1	Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu	Anonymizing Tables.	ICDT	2005	DBLP DOI BibTeX RDF
1	Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu	Algorithms for the Database Layout Problem.	ICDT	2005	DBLP DOI BibTeX RDF
1	Mohammad J. Akhbarizadeh, Mehrdad Nourani, Rina Panigrahy, Samar Sharma	High-Speed and Low-Power Network Search Engine Using Adaptive Block-Selection Scheme.	Hot Interconnects	2005	DBLP DOI BibTeX RDF
1	Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu	Combining request scheduling with web caching.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
1	Rina Panigrahy	Efficient Hashing with Lookups in two Memory Accesses	CoRR	2004	DBLP BibTeX RDF
1	Rina Panigrahy	Minimum Enclosing Polytope in High Dimensions	CoRR	2004	DBLP BibTeX RDF
1	Moses Charikar, Rina Panigrahy	Clustering to minimize the sum of cluster diameters.	J. Comput. Syst. Sci.	2004	DBLP DOI BibTeX RDF
1	Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy	A combinatorial algorithm for MAX CSP.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Samar Sharma	Sorting and Searching using Ternary CAMs.	IEEE Micro	2003	DBLP DOI BibTeX RDF
1	Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom	Computing the Median with Uncertainty.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
1	Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy	Representing Graph Metrics with Fewest Edges.	STACS	2003	DBLP DOI BibTeX RDF
1	Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy	Computing Shortest Paths with Uncertainty.	STACS	2003	DBLP DOI BibTeX RDF
1	Moses Charikar, Liadan O'Callaghan, Rina Panigrahy	Better streaming algorithms for clustering problems.	STOC	2003	DBLP DOI BibTeX RDF	clustering, streaming algorithm, k-median
1	Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu	Web caching with request reordering.	SODA	2002	DBLP DOI BibTeX RDF
1	Moses Charikar, Piotr Indyk, Rina Panigrahy	New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems.	ICALP	2002	DBLP DOI BibTeX RDF
1	Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat	Approximating the smallest grammar: Kolmogorov complexity in natural models.	STOC	2002	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Samar Sharma	Reducing TCAM Power Consumption and Increasing Throughput.	Hot Interconnects	2002	DBLP DOI BibTeX RDF
1	Samar Sharma, Rina Panigrahy	Sorting and Searching Using Ternary CAMs.	Hot Interconnects	2002	DBLP DOI BibTeX RDF
1	Moses Charikar, Rina Panigrahy	Clustering to minimize the sum of cluster diameters.	STOC	2001	DBLP DOI BibTeX RDF
1	Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom	Computing the median with uncertainty.	STOC	2000	DBLP DOI BibTeX RDF
1	Rajeev Motwani, Rina Panigrahy, Vijay A. Saraswat, Suresh Venkatasubramanian	On the decidability of accessibility problems (extended abstract).	STOC	2000	DBLP DOI BibTeX RDF
1	Rina Panigrahy, Sundar Vishwanathan	An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.	J. Algorithms	1998	DBLP DOI BibTeX RDF
1	Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram	A Note on Optical Routing on Trees.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
1	David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin	Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.	STOC	1997	DBLP DOI BibTeX RDF	Internet

Publications of "Rina Panigrahy" ( http://dblp.L3S.de/Authors/Rina_Panigrahy )