![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Peter Lofgren
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c9]Nitin Shyamkumar, Siddhartha Banerjee, Peter Lofgren:
Sublinear estimation of a single element in sparse linear systems. Allerton 2016: 856-860 - [c8]Hongyang Zhang, Peter Lofgren, Ashish Goel:
Approximate Personalized PageRank on Dynamic Graphs. KDD 2016: 1315-1324 - [c7]Peter Lofgren, Siddhartha Banerjee, Ashish Goel:
Personalized PageRank Estimation and Search: A Bidirectional Approach. WSDM 2016: 163-172 - [i8]Hongyang Zhang, Peter Lofgren, Ashish Goel:
Approximate Personalized PageRank on Dynamic Graphs. CoRR abs/1603.07796 (2016) - 2015
- [b1]Peter Lofgren:
Efficient algorithms for Personalized PageRank. Stanford University, USA, 2015 - [c6]Siddhartha Banerjee, Peter Lofgren:
Fast Bidirectional Probability Estimation in Markov Models. NIPS 2015: 1423-1431 - [c5]Vasilis Verroios, Peter Lofgren, Hector Garcia-Molina:
tDP: An Optimal-Latency Budget Allocation Strategy for Crowdsourced MAXIMUM Operations. SIGMOD Conference 2015: 1047-1062 - [c4]Peter Lofgren, Siddhartha Banerjee, Ashish Goel:
Bidirectional PageRank Estimation: From Average-Case to Worst-Case. WAW 2015: 164-176 - [i7]Peter Lofgren, Siddhartha Banerjee:
Fast Bidirectional Probability Estimation in Markov Models. CoRR abs/1507.05998 (2015) - [i6]Peter Lofgren, Siddhartha Banerjee, Ashish Goel:
Personalized PageRank Estimation and Search: A Bidirectional Approach. CoRR abs/1507.05999 (2015) - [i5]Peter Lofgren, Siddhartha Banerjee, Ashish Goel:
Bidirectional PageRank Estimation: From Average-Case to Worst-Case. CoRR abs/1507.08705 (2015) - [i4]Peter Lofgren:
Efficient Algorithms for Personalized PageRank. CoRR abs/1512.04633 (2015) - 2014
- [j2]Peter Lofgren:
On the complexity of the Monte Carlo method for incremental PageRank. Inf. Process. Lett. 114(3): 104-106 (2014) - [c3]Peter Lofgren, Siddhartha Banerjee, Ashish Goel, Seshadhri Comandur:
FAST-PPR: scaling personalized pagerank estimation for large graphs. KDD 2014: 1436-1445 - [i3]Peter Lofgren, Siddhartha Banerjee, Ashish Goel, C. Seshadhri:
FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs. CoRR abs/1404.3181 (2014) - 2013
- [j1]Steven Euijong Whang, Peter Lofgren, Hector Garcia-Molina:
Question Selection for Crowd Entity Resolution. Proc. VLDB Endow. 6(6): 349-360 (2013) - [i2]Peter Lofgren, Ashish Goel:
Personalized PageRank to a Target Node. CoRR abs/1304.4658 (2013) - 2012
- [i1]Peter Lofgren:
On the Worst-Case Performance of the Monte Carlo Method for Incremental Pagerank. CoRR abs/1204.5500 (2012) - 2011
- [c2]Peter Lofgren, Nicholas Hopper:
BNymble: More Anonymous Blacklisting at Almost No Cost (A Short Paper). Financial Cryptography 2011: 268-275 - [c1]Peter Lofgren, Nicholas Hopper:
FAUST: efficient, TTP-free abuse prevention by anonymous whitelisting. WPES 2011: 125-130
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint