default search action
Reid Andersen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c22]Ying-Chun Lin, Jennifer Neville, Jack W. Stokes, Longqi Yang, Tara Safavi, Mengting Wan, Scott Counts, Siddharth Suri, Reid Andersen, Xiaofeng Xu, Deepak Gupta, Sujay Kumar Jauhar, Xia Song, Georg Buscher, Saurabh Tiwary, Brent J. Hecht, Jaime Teevan:
Interpretable User Satisfaction Estimation for Conversational Systems with Large Language Models. ACL (1) 2024: 11100-11115 - [c21]Sarkar Snigdha Sarathi Das, Chirag Shah, Mengting Wan, Jennifer Neville, Longqi Yang, Reid Andersen, Georg Buscher, Tara Safavi:
S3-DST: Structured Open-Domain Dialogue Segmentation and State Tracking in the Era of LLMs. ACL (Findings) 2024: 14996-15014 - [c20]Mengting Wan
, Tara Safavi
TnT-LLM: Text Mining at Scale with Large Language Models. KDD 2024: 5836-5847 - [i9]Mengting Wan, Tara Safavi, Sujay Kumar Jauhar, Yujin Kim, Scott Counts, Jennifer Neville, Siddharth Suri, Chirag Shah
TnT-LLM: Text Mining at Scale with Large Language Models. CoRR abs/2403.12173 (2024) - [i8]Ying-Chun Lin, Jennifer Neville, Jack W. Stokes, Longqi Yang, Tara Safavi, Mengting Wan, Scott Counts, Siddharth Suri, Reid Andersen, Xiaofeng Xu, Deepak Gupta, Sujay Kumar Jauhar, Xia Song, Georg Buscher, Saurabh Tiwary, Brent J. Hecht, Jaime Teevan:
Interpretable User Satisfaction Estimation for Conversational Systems with Large Language Models. CoRR abs/2403.12388 (2024) - [i7]Siddharth Suri, Scott Counts, Leijie Wang, Chacha Chen, Mengting Wan, Tara Safavi, Jennifer Neville, Chirag Shah
The Use of Generative Search Engines for Knowledge Work and Complex Tasks. CoRR abs/2404.04268 (2024) - 2023
- [i6]Sarkar Snigdha Sarathi Das, Chirag Shah
S3-DST: Structured Open-Domain Dialogue Segmentation and State Tracking in the Era of LLMs. CoRR abs/2309.08827 (2023) - [i5]Chirag Shah
Using Large Language Models to Generate, Validate, and Apply User Intent Taxonomies. CoRR abs/2309.13063 (2023)
2010 – 2019
- 2016
- [j10]Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan
Almost Optimal Local Graph Clustering Using Evolving Sets. J. ACM 63(2): 15:1-15:31 (2016) - 2012
- [c19]Reid Andersen, David F. Gleich, Vahab S. Mirrokni:
Overlapping clusters for distributed computation. WSDM 2012: 273-282 - 2010
- [j9]Reid Andersen:
A local algorithm for finding dense subgraphs. ACM Trans. Algorithms 6(4): 60:1-60:12 (2010) - [c18]Jack W. Stokes, Reid Andersen, Christian Seifert, Kumar Chellapilla:
WebCop: Locating Neighborhoods of Malware on the Web. LEET 2010
2000 – 2009
- 2009
- [j8]Chinmay Karande, Kumar Chellapilla, Reid Andersen:
Speeding Up Algorithms on Compressed Web Graphs. Internet Math. 6(3): 373-398 (2009) - [c17]Reid Andersen, Yuval Peres:
Finding sparse cuts locally using evolving sets. STOC 2009: 235-244 - [c16]Reid Andersen, Kumar Chellapilla:
Finding Dense Subgraphs with Size Bounds. WAW 2009: 25-37 - [c15]Chinmay Karande, Kumar Chellapilla, Reid Andersen:
Speeding up algorithms on compressed web graphs. WSDM 2009: 272-281 - [i4]Reid Andersen, Uriel Feige:
Interchanging distance and capacity in probabilistic mappings. CoRR abs/0907.3631 (2009) - 2008
- [j7]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank. Internet Math. 5(1): 3-22 (2008) - [j6]Reid Andersen, Christian Borgs
Local Computation of PageRank Contributions. Internet Math. 5(1): 23-45 (2008) - [c14]Reid Andersen, Christian Borgs
Robust PageRank and locally computable spam detection features. AIRWeb 2008: 69-76 - [c13]Reid Andersen, Christian Borgs
On the Stability of Web Crawling and Web Search. ISAAC 2008: 680-691 - [c12]Reid Andersen, Kevin J. Lang:
An algorithm for improving graph partitions. SODA 2008: 651-660 - [c11]Reid Andersen:
A local algorithm for finding dense subgraphs. SODA 2008: 1003-1009 - [c10]Reid Andersen, Christian Borgs
Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208 - [i3]Reid Andersen, Yuval Peres:
Finding Sparse Cuts Locally Using Evolving Sets. CoRR abs/0811.3779 (2008) - 2007
- [j5]Reid Andersen, Fan R. K. Chung, Linyuan Lu:
No-Three-in-Line-in-3D. Algorithmica 47(4): 379-397 (2007) - [j4]Reid Andersen, Fan R. K. Chung, Linyuan Lu:
Drawing Power Law Graphs Using a Local/Global Decomposition. Algorithmica 47(4): 397 (2007) - [j3]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Using PageRank to Locally Partition a Graph. Internet Math. 4(1): 35-64 (2007) - [j2]Reid Andersen, Sebastian M. Cioaba:
Spectral Densest Subgraph and Independence Number of a Graph. J. Univers. Comput. Sci. 13(11): 1501-1513 (2007) - [c9]Kevin J. Lang, Reid Andersen:
Finding dense and isolated submarkets in a sponsored search spending graph. CIKM 2007: 613-622 - [c8]Reid Andersen, Fan R. K. Chung:
Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. TAMC 2007: 1-12 - [c7]Reid Andersen, Christian Borgs
Local Computation of PageRank Contributions. WAW 2007: 150-165 - [c6]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank. WAW 2007: 166-178 - [i2]Reid Andersen:
Finding large and small dense subgraphs. CoRR abs/cs/0702032 (2007) - [i1]Reid Andersen:
A Local Algorithm for Finding Dense Subgraphs. CoRR abs/cs/0702078 (2007) - 2006
- [c5]Reid Andersen, Fan R. K. Chung, Kevin J. Lang:
Local Graph Partitioning using PageRank Vectors. FOCS 2006: 475-486 - [c4]Reid Andersen, Kevin J. Lang:
Communities from seed sets. WWW 2006: 223-232 - 2005
- [j1]Reid Andersen, Fan R. K. Chung, Linyuan Lu:
Modeling the Small-World Phenomenon with Local Network Flow. Internet Math. 2(3): 359-385 (2005) - 2004
- [c3]Reid Andersen, Fan R. K. Chung, Lincoln Lu:
Drawing Power Law Graphs. GD 2004: 12-17 - [c2]Reid Andersen, Fan R. K. Chung, Arunabha Sen, Guoliang Xue:
On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. INFOCOM 2004 - [c1]Reid Andersen, Fan R. K. Chung, Lincoln Lu:
Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). WAW 2004: 19-30
Coauthor Index
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-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: