Fan R. K. Chung - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Dirichlet PageRank and Trust-Based Ranking AlgorithmsFan R. K. Chung, Alexander Tsiatas, Wensong Xu. waw 2011: 103-114 [doi]

2010

Tiling Polygons with Lattice TrianglesSteve Butler, Fan R. K. Chung, Ronald L. Graham, Miklós Laczkovich. dcg, 44(4):896-903, 2010. [doi]

Descent polynomials for permutations with bounded drop sizeFan R. K. Chung, Anders Claesson, Mark Dukes, Ronald L. Graham. ejc, 31(7):1853-1867, 2010. [doi]

2009

Distributing Antidote Using PageRank VectorsFan R. K. Chung, Paul Horn, Alexander Tsiatas. im, 6(2):237-254, 2009. [doi]

A Local Graph Partitioning Algorithm Using Heat Kernel PagerankFan R. K. Chung. im, 6(3):315-330, 2009. [doi]

Percolation in General GraphsFan R. K. Chung, Paul Horn, Linyuan Lu. im, 6(3):331-347, 2009. [doi]

2008

Local Partitioning for Directed Graphs Using PageRankReid Andersen, Fan R. K. Chung, Kevin J. Lang. im, 5(1):3-22, 2008. [doi]

2007

No-Three-in-Line-in-3DReid Andersen, Fan R. K. Chung, Linyuan Lu. algorithmica, 47(4):379-397, 2007. [doi]

Detecting Sharp Drops in PageRank and a Simplified Local Partitioning AlgorithmReid Andersen, Fan R. K. Chung. tamc 2007: 1-12 [doi]

Local Partitioning for Directed Graphs Using PageRankReid Andersen, Fan R. K. Chung, Kevin J. Lang. waw 2007: 166-178 [doi]

Drawing Power Law Graphs Using a Local/Global DecompositionReid Andersen, Fan R. K. Chung, Linyuan Lu. algorithmica, 47(4):397, 2007. [doi]

Using PageRank to Locally Partition a GraphReid Andersen, Fan R. K. Chung, Kevin J. Lang. im, 4(1):35-64, 2007. [doi]

Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, ProceedingsAnthony Bonato, Fan R. K. Chung, editors, Volume 4863 of Lecture Notes in Computer Science, Springer, 2007.

Oblivious and Adaptive Strategies for the Majority and Plurality ProblemsFan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao. algorithmica, 48(2):147-157, 2007. [doi]

The Spectral Gap of a Random Subgraph of a GraphFan R. K. Chung, Paul Horn. im, 4(2):225-244, 2007. [doi]

The workshop on internet topology (wit) reportDmitri V. Krioukov, Kimberly C. Claffy, Marina Fomenkov, Fan R. K. Chung, Alessandro Vespignani, Walter Willinger. ccr, 37(1):69-73, 2007. [doi]

2006

Explicit construction of linear sized tolerant networksNoga Alon, Fan R. K. Chung. DM, 306(10-11):1068-1071, 2006. [doi]

Local Graph Partitioning using PageRank VectorsReid Andersen, Fan R. K. Chung, Kevin J. Lang. focs 2006: 475-486 [doi]

Survey: Concentration Inequalities and Martingale Inequalities: A SurveyFan R. K. Chung, Lincoln Lu. im, 3(1), 2006.

Parallelism versus Memory Allocation in Pipelined Router Forwarding EnginesFan R. K. Chung, Ronald L. Graham, Jia Mao, George Varghese. mst, 39(6):829-849, 2006. [doi]

Maximizing data locality in distributed systemsFan R. K. Chung, Ronald L. Graham, Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelker. jcss, 72(8):1309-1316, 2006. [doi]

The Volume of the Giant Component of a Random Graph with Given Expected DegreesFan R. K. Chung, Linyuan Lu. siamdm, 20(2):395-411, 2006. [doi]

The Diameter and Laplacian Eigenvalues of Directed GraphsFan R. K. Chung. combinatorics, 13(1), 2006. [doi]

2005

Modeling the Small-World Phenomenon with Local Network FlowReid Andersen, Fan R. K. Chung, Linyuan Lu. im, 2(3), 2005.

Oblivious and Adaptive Strategies for the Majority and Plurality ProblemsFan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao. cocoon 2005: 329-338 [doi]

2004

2003

2002

2001

Augmented Ring NetworksWilliam Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman. tpds, 12(6):598-609, 2001. [doi]

Random Evolution in Massive GraphsWilliam Aiello, Fan R. K. Chung, Linyuan Lu. focs 2001: 510-519

Distance Realization Problems with Applications to Internet TomographyFan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross. jcss, 63(3):432-448, 2001. [doi]

Guessing secretsFan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton. soda 2001: 723-726 [doi]

Guessing SecretsFan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton. combinatorics, 8(1), 2001. [doi]

Dynamic location problems with limited look-ahead Fan R. K. Chung, Ronald L. Graham. TCS, 261(2):213-226, 2001. [doi]

2000

A random graph model for massive graphsWilliam Aiello, Fan R. K. Chung, Linyuan Lu. stoc 2000: 171-180 [doi]

Discrete Green s FunctionsFan R. K. Chung, S.-T. Yau. JCT, 91(1-2):191-214, 2000. [doi]

1999

1998

Forced Convex n -Gons in the PlaneFan R. K. Chung, Ronald L. Graham. dcg, 19(3):367-371, 1998. [doi]

Combinatorial Problems Arising in Massive Data Sets (Abstract)Fan R. K. Chung, Ronald L. Graham. cocoon 1998: 2 [doi]

Isoperimetric Inequalities for Cartesian Products of GraphsFan R. K. Chung, Prasad Tetali. cpc, 7(2):141-148, 1998.

1997

1996

1995

Salvage-Embeddings of Complete TreesSandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg. siamdm, 8(4):617-637, 1995. [doi]

On the Cover Polynomial of a DigraphFan R. K. Chung, Ronald L. Graham. JCT, 65(2):273-290, 1995. [doi]

Eigenvalues of Graphs and Sobolev InequalitiesFan R. K. Chung, S.-T. Yau. cpc, 4:11-25, 1995.

1994

1993

Routing permutations on graphs via matchingsNoga Alon, Fan R. K. Chung, Ronald L. Graham. stoc 1993: 583-591 [doi]

A Note on Constructive Lower Bounds for the Ramsey Numbers ::::R::::(3, ::::t::::)Fan R. K. Chung, Richard Cleve, Paul Dagum. JCT, 57(1):150-155, 1993. [doi]

On hypergraphs having evenly distributed subhypergraphsFan R. K. Chung, Ronald L. Graham. DM, 111(1-3):125-129, 1993. [doi]

Communication Complexity and Quasi RandomnessFan R. K. Chung, Prasad Tetali. siamdm, 6(1):110-123, 1993.

1992

Efficient Embeddings of Trees in HypercubesSandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg. siamcomp, 21(1):151-162, 1992.

Tolerating Faults in Synchronization NetworksSandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg. conpar 1992: 1-12

The Number of Different Distances Determined by a Set of Points in the Euclidean PlaneFan R. K. Chung, Endre Szemerédi, William T. Trotter. dcg, 7:1-11, 1992.

Universal cycles for combinatorial structuresFan R. K. Chung, Persi Diaconis, Ronald L. Graham. DM, 110(1-3):43-59, 1992. [doi]

Quasi-Random Subsets of Integer::n::Fan R. K. Chung, Ronald L. Graham. JCT, 61(1):64-86, 1992.

Correction to Optical orthogonal codes: Design, analysis, and applications (May 89 595-604)Fan R. K. Chung, Jawad A. Salehi, Victor K.-W. Wei. TIT, 38(4):1429, 1992.

Graphs with Small Diameter After Edge DeletionFan R. K. Chung. DAM, 37/38:73-94, 1992. [doi]

1991

Partitioning Circuits for Improved TestabilitySandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg. algorithmica, 6(1):37-48, 1991.

Regularity Lemmas for Hypergraphs and Quasi-randomnessFan R. K. Chung. rsa, 2(2):241-252, 1991.

1990

Quasi-Random Classes of HypergraphsFan R. K. Chung. rsa, 1(4):363-382, 1990.

Quasi-Random HypergraphsFan R. K. Chung, Ronald L. Graham. rsa, 1(1):105-124, 1990.

The maximum number of edges in 2K::2::-free graphs of bounded degreeFan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter. DM, 81(2):129-135, 1990. [doi]

1989

Universal Graphs for Bounded-Degree Trees and Planar GraphsSandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg. siamdm, 2(2):145-155, 1989.

Pebbling in HypercubesFan R. K. Chung. siamdm, 2(4):467-472, 1989.

Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor PairsFan R. K. Chung. dcg, 4:183-190, 1989.

Optical orthogonal codes: Design, analysis, and applicationsFan R. K. Chung, Jawad A. Salehi, Victor K. Wet. TIT, 35(3):595-604, 1989.

Quasi-random graphsFan R. K. Chung, Ronald L. Graham, Richard M. Wilson. combinatorica, 9(4):345-362, 1989.

Graphs with small bandwidth and cutwidthFan R. K. Chung, Paul D. Seymour. DM, 75(1-3):113-119, 1989. [doi]

A dynamic location problem for graphsFan R. K. Chung, Ronald L. Graham, Michael E. Saks. combinatorica, 9(2):111-131, 1989.

1988

Explicit construction of linear sized tolerant networksNoga Alon, Fan R. K. Chung. DM, 72(1-3):15-19, 1988. [doi]

The Diameter of a Cycle Plus a Random MatchingBéla Bollobás, Fan R. K. Chung. siamdm, 1(3):328-333, 1988.

PreviousNext