Travelled to:1 × Canada
5 × USA
Collaborated with:S.Yau W.Aiello L.Lu N.Alon R.L.Graham D.J.Hajela P.D.Seymour S.N.Bhatt J.Hong F.T.Leighton A.L.Rosenberg
Talks about:graph (4) separ (2) optim (2) eigenvalu (1) butterfli (1) algorithm (1) sequenti (1) network (1) hilbert (1) search (1)
Person: Fan R. K. Chung
DBLP: Chung:Fan_R=_K=
Contributed to:
200019971994199319881985Wrote 6 papers:
- STOC-2000-AielloCL #graph #random
- A random graph model for massive graphs (WA, FRKC, LL), pp. 171–180.
- STOC-1997-ChungY #graph
- Eigenvalues, Flows and Separators of Graphs (FRKC, STY), p. 749.
- STOC-1994-ChungY #algorithm
- A near optimal algorithm for edge separators (FRKC, STY), pp. 1–8.
- STOC-1993-AlonCG #graph #permutation
- Routing permutations on graphs via matchings (NA, FRKC, RLG), pp. 583–591.
- STOC-1988-BhattCHLR #network #simulation
- Optimal Simulations by Butterfly Networks (SNB, FRKC, JWH, FTL, ALR), pp. 192–204.
- STOC-1985-ChungHS #self
- Self-Organizing Sequential Search and Hilbert’s Inequalities (FRKC, DJH, PDS), pp. 217–223.