The following pages link to Fan R. K. Chung (Q920938):
Displaying 50 items.
- (Q161498) (redirect page) (← links)
- On the discrepancy of circular sequences of reals (Q266584) (← links)
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (Q280185) (← links)
- The matrix cover polynomial (Q286760) (← links)
- From quasirandom graphs to graph limits and graphlets (Q402587) (← links)
- A note on an alternating upper bound for random walks on semigroups (Q403558) (← links)
- Discrepancy inequalities for directed graphs (Q403560) (← links)
- Single-processor scheduling with time restrictions (Q490336) (← links)
- Edge flipping in the complete graph (Q492703) (← links)
- (Q583242) (redirect page) (← links)
- A dynamic location problem for graphs (Q583245) (← links)
- On unavoidable graphs (Q595677) (← links)
- Tiling polygons with lattice triangles (Q603872) (← links)
- On the spectra of general random graphs (Q648409) (← links)
- Edge flipping in graphs (Q651046) (← links)
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
- Logarithmic Harnack inequalities (Q676124) (← links)
- On hypergraphs having evenly distributed subhypergraphs (Q686453) (← links)
- Descent polynomials for permutations with bounded drop size (Q709255) (← links)
- Sum sequences modulo \(n\) (Q721051) (← links)
- A generalized Alon-Boppana bound and weak Ramanujan graphs (Q726663) (← links)
- Extreme values of the stationary distribution of random walks on directed graphs (Q730638) (← links)
- Extremal subgraphs for two graphs (Q759768) (← links)
- Edge-colored complete graphs with precisely colored subgraphs (Q787167) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- The number of different distances determined by n points in the plane (Q791525) (← links)
- Unavoidable stars in 3-graphs (Q793053) (← links)
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs (Q795067) (← links)
- The diameter and Laplacian eigenvalues of directed graphs (Q819189) (← links)
- Maximizing data locality in distributed systems (Q856409) (← links)
- Parallelism versus memory allocation in pipelined router forwarding engines (Q863192) (← links)
- Random walks and local cuts in graphs (Q876299) (← links)
- Drawing power law graphs using a local/global decomposition (Q879956) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- Partitioning circuits for improved testability (Q920939) (← links)
- A symmetrical Eulerian identity (Q989227) (← links)
- Packing equal squares into a large square (Q1040832) (← links)
- Cross-monotone subsequences (Q1057271) (← links)
- Quantitative forms of a theorem of Hilbert (Q1065804) (← links)
- On the addressing problem for directed graphs (Q1068101) (← links)
- Monotone subsequences in (0,1)-matrices (Q1076026) (← links)
- Random walks arising in random number generation (Q1091018) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- Self-organizing sequential search and Hilbert's inequalities (Q1104755) (← links)
- On induced subgraphs of the cube (Q1107541) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- Explicit construction of linear sized tolerant networks (Q1110541) (← links)
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs (Q1113458) (← links)
- Graphs with small bandwidth and cutwidth (Q1117949) (← links)
- On the coverings of graphs (Q1147719) (← links)
