13 citations · 36 across the 4 of their papers we have counts for
5 papers
Using Large Language Models to Generate, Validate, and Apply User Intent Taxonomies
Chirag Shah, Ryen W. White, Reid Andersen +13
Log data can reveal valuable information about how users interact with Web search services, what they want, and how satisfied they are. However, analyzing user intents in log data…
Interchanging distance and capacity in probabilistic mappings
Reid Andersen, Uriel Feige
Harald Racke [STOC 2008] described a new method to obtain hierarchical decompositions of networks in a way that minimizes the congestion. Racke's approach is based on an equivalenc…
Finding Sparse Cuts Locally Using Evolving Sets
Reid Andersen, Yuval Peres
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph , starting from a spe…
A Local Algorithm for Finding Dense Subgraphs
Reid Andersen
We present a local algorithm for finding dense subgraphs of bipartite graphs, according to the definition of density proposed by Kannan and Vinay. Our algorithm takes as input a bi…
Finding large and small dense subgraphs
Reid Andersen
We consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree a…