The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Reid Andersen" ( http://dblp.L3S.de/Authors/Reid_Andersen )

  Author page on DBLP  Author page in RDF  Community of Reid Andersen in ASPL-2

Publication years (Num. hits)
2004-2007 (16) 2008-2010 (15) 2012-2016 (2)
Publication types (Num. hits)
article(14) inproceedings(19)
Venues (Conferences, Journals, ...)
Internet Mathematics(5) CoRR(4) WAW(4) Algorithmica(2) SODA(2) WSDM(2) WWW(2) ACM Trans. Algorithms(1) AIRWeb(1) CIKM(1) FOCS(1) Graph Drawing(1) INFOCOM(1) ISAAC(1) J. ACM(1) J. UCS(1) More (+10 of total 19)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 19 keywords

Results
Found 34 publication records. Showing 33 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan Almost Optimal Local Graph Clustering Using Evolving Sets. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Reid Andersen, David F. Gleich, Vahab S. Mirrokni Overlapping clusters for distributed computation. Search on Bibsonomy WSDM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Reid Andersen A local algorithm for finding dense subgraphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jack W. Stokes, Reid Andersen, Christian Seifert, Kumar Chellapilla WebCop: Locating Neighborhoods of Malware on the Web. Search on Bibsonomy LEET The full citation details ... 2010 DBLP  BibTeX  RDF
1Chinmay Karande, Kumar Chellapilla, Reid Andersen Speeding Up Algorithms on Compressed Web Graphs. Search on Bibsonomy Internet Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Uriel Feige Interchanging distance and capacity in probabilistic mappings Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Reid Andersen, Kumar Chellapilla Finding Dense Subgraphs with Size Bounds. Search on Bibsonomy WAW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Yuval Peres Finding sparse cuts locally using evolving sets. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF evolving sets, graph partitioning, local algorithms
1Chinmay Karande, Kumar Chellapilla, Reid Andersen Speeding up algorithms on compressed web graphs. Search on Bibsonomy WSDM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph compression, web graph analysis, algorithms, stochastic processes
1Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng Local Computation of PageRank Contributions. Search on Bibsonomy Internet Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Kevin J. Lang Local Partitioning for Directed Graphs Using PageRank. Search on Bibsonomy Internet Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Yuval Peres Finding Sparse Cuts Locally Using Evolving Sets Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng On the Stability of Web Crawling and Web Search. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Kevin J. Lang An algorithm for improving graph partitions. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
1Reid Andersen A local algorithm for finding dense subgraphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
1Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz Trust-based recommendation systems: an axiomatic approach. Search on Bibsonomy WWW The full citation details ... 2008 DBLP  DOI  BibTeX  RDF recommendation systems, reputation systems, trust networks, axiomatic approach
1Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng Robust PageRank and locally computable spam detection features. Search on Bibsonomy AIRWeb The full citation details ... 2008 DBLP  DOI  BibTeX  RDF graph algorithms, unsupervised learning, directed graphs, PageRank, local algorithms, link spam
1Reid Andersen, Fan R. K. Chung, Kevin J. Lang Using PageRank to Locally Partition a Graph. Search on Bibsonomy Internet Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Sebastian M. Cioaba Spectral Densest Subgraph and Independence Number of a Graph. Search on Bibsonomy J. UCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Linyuan Lu No-Three-in-Line-in-3D. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Linyuan Lu Drawing Power Law Graphs Using a Local/Global Decomposition. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen A Local Algorithm for Finding Dense Subgraphs Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Reid Andersen Finding large and small dense subgraphs Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Kevin J. Lang, Reid Andersen Finding dense and isolated submarkets in a sponsored search spending graph. Search on Bibsonomy CIKM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF parametric flow, sparse cuts, vector-valued optimization, e-commerce, pareto-optimality, sponsored search, dense subgraphs
1Reid Andersen, Fan R. K. Chung Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng Local Computation of PageRank Contributions. Search on Bibsonomy WAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Kevin J. Lang Local Partitioning for Directed Graphs Using PageRank. Search on Bibsonomy WAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Kevin J. Lang Communities from seed sets. Search on Bibsonomy WWW The full citation details ... 2006 DBLP  DOI  BibTeX  RDF community finding, graph conductance, seed sets, random walks, link analysis
1Reid Andersen, Fan R. K. Chung, Kevin J. Lang Local Graph Partitioning using PageRank Vectors. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Linyuan Lu Modeling the Small-World Phenomenon with Local Network Flow. Search on Bibsonomy Internet Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Lincoln Lu Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). Search on Bibsonomy WAW The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Arunabha Sen, Guoliang Xue On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. Search on Bibsonomy INFOCOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Reid Andersen, Fan R. K. Chung, Lincoln Lu Drawing Power Law Graphs. Search on Bibsonomy Graph Drawing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #33 of 33 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license