Question selection for crowd entity resolution SE Whang, P Lofgren, H Garcia-Molina Proceedings of the VLDB Endowment 6 (6), 349-360, 2013 | 204 | 2013 |

Personalized pagerank estimation and search: A bidirectional approach P Lofgren, S Banerjee, A Goel Proceedings of the Ninth ACM International Conference on Web Search and Data …, 2016 | 121 | 2016 |

Fast-ppr: Scaling personalized pagerank estimation for large graphs PA Lofgren, S Banerjee, A Goel, C Seshadhri Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014 | 114 | 2014 |

Approximate personalized pagerank on dynamic graphs H Zhang, P Lofgren, A Goel Proceedings of the 22nd ACM SIGKDD international conference on knowledge …, 2016 | 59 | 2016 |

tdp: An optimal-latency budget allocation strategy for crowdsourced MAXIMUM operations V Verroios, P Lofgren, H Garcia-Molina Proceedings of the 2015 ACM SIGMOD International Conference on Management of …, 2015 | 32 | 2015 |

Personalized pagerank to a target node P Lofgren, A Goel arXiv preprint arXiv:1304.4658, 2013 | 32 | 2013 |

Efficient algorithms for personalized pagerank P Lofgren Stanford University, 2015 | 27 | 2015 |

Bidirectional pagerank estimation: From average-case to worst-case P Lofgren, S Banerjee, A Goel International Workshop on Algorithms and Models for the Web-Graph, 164-176, 2015 | 24 | 2015 |

Fast bidirectional probability estimation in markov models S Banerjee, P Lofgren Advances in Neural Information Processing Systems 28, 2015 | 21 | 2015 |

Faust: Efficient, ttp-free abuse prevention by anonymous whitelisting P Lofgren, N Hopper Proceedings of the 10th annual ACM workshop on Privacy in the electronic …, 2011 | 14 | 2011 |

BNymble: More anonymous blacklisting at almost no cost (a short paper) P Lofgren, N Hopper International Conference on Financial Cryptography and Data Security, 268-275, 2011 | 10 | 2011 |

Sublinear estimation of a single element in sparse linear systems N Shyamkumar, S Banerjee, P Lofgren 2016 54th Annual Allerton Conference on Communication, Control, and …, 2016 | 8 | 2016 |

On the complexity of the Monte Carlo method for incremental PageRank P Lofgren Information Processing Letters 114 (3), 104-106, 2014 | 8 | 2014 |

BNymble (a short paper): More anonymous blacklisting at almost no cost P Lofgren in Proceedings of FC 2011, 2011 | 8 | 2011 |

Determining identities of multiple people in a digital image P Dandekar, A Goel, P Lofgren US Patent 10,552,471, 2020 | 5 | 2020 |

Determining identity of a person in a digital image P Dandekar, A Goel, P Lofgren, M Fisher US Patent 10,311,288, 2019 | 5 | 2019 |

Fast bidirectional probability estimation in markov models P Lofgren, S Banerjee CoRR, abs/1507.05998, 2015 | 2 | 2015 |

Systems and methods for using one or more networks to assess a metric about an entity P Dandekar, P Lofgren, A Goel US Patent 10,469,504, 2019 | 1 | 2019 |

FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. S Comandur, P Lofgren, S Banerjee, A Goel Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2014 | 1 | 2014 |

On the worst-case performance of the monte carlo method for incremental pagerank P Lofgren CoRR, abs/1204.5500, 2012 | 1 | 2012 |