Peter Lofgren
Peter Lofgren
PhD Student, Stanford University
Verified email at cs.stanford.edu
Title
Cited by
Cited by
Year
Question selection for crowd entity resolution
SE Whang, P Lofgren, H Garcia-Molina
Proceedings of the VLDB Endowment 6 (6), 349-360, 2013
1842013
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
932016
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
922014
Approximate personalized pagerank on dynamic graphs
H Zhang, P Lofgren, A Goel
Proceedings of the 22nd ACM SIGKDD International Conference on knowledge …, 2016
422016
Personalized pagerank to a target node
P Lofgren, A Goel
arXiv preprint arXiv:1304.4658, 2013
272013
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
242015
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
222015
Fast bidirectional probability estimation in markov models
S Banerjee, P Lofgren
arXiv preprint arXiv:1507.05998, 2015
192015
Efficient algorithms for personalized pagerank
P Lofgren
arXiv preprint arXiv:1512.04633, 2015
172015
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
142011
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
102011
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
82016
On the complexity of the Monte Carlo method for incremental PageRank
P Lofgren
Information Processing Letters 114 (3), 104-106, 2014
82014
BNymble (a short paper): More anonymous blacklisting at almost no cost
P Lofgren
in Proceedings of FC 2011, 2011
82011
Fast bidirectional probability estimation in markov models
P Lofgren, S Banerjee
CoRR, abs/1507.05998, 2015
22015
Determining identity of a person in a digital image
P Dandekar, A Goel, P Lofgren, M Fisher
US Patent 10,311,288, 2019
12019
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
12014
On the worst-case performance of the monte carlo method for incremental pagerank
P Lofgren
12012
Shared learning across separate entities with private data features
A Goel, P Lofgren
US Patent App. 16/258,116, 2020
2020
Determining identity in an image that has multiple people
P Dandekar, A Goel, P Lofgren
US Patent App. 16/711,253, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20