This web page lists papers citing my paper:

"Some Intersection Theorems for Ordered Sets and Graphs" with F.R.K. Chung, P. Frankl and R.L. Graham, Journal of Combinatorial Theory Series A, 43(1986), p. 23-37.

• J. R. Griggs and J. W. Walker, "Anticlusters and Intersecting Families of Subsets", Journal of Combinatorial Theory Series A, 51(1989), p. 90-103.
• Z. Furedi, J. R. Griggs, R. Holzman and D. J. Kleitman, "Representations of Families of Triples over Gf(2)", Journal of Combinatorial Theory Series A, 53(1990), p. 306-315.
• S. A. Vavasis, "Automatic Domain Partitioning in 3 Dimensions", Siam Journal on Scientific and Statistical Computing, 12(1991), p. 950-970.
• J. Korner and M. Lucertini, "Compressing Inconsistent Data", IEEE Transactions on Information Theory", 40(1994), p. 706-715.
• N. Alon, R. M. Karp, D. Peleg and D. West, "A Graph-Theoretic Game, and Its Application to the K-Server Problem", SIAM Journal on Computing, 24(1995), p. 78-100.
• Z. Furdei, "Scrambling Permutations and Entropy of Hypergraphs", Random Structures and Algorithms, 8(1996), p. 97-104.
• A. Albanese, J. Blomer, J. Edmonds, M. Luby and M. Sudan, "Priority Encoding Transmission", IEEE Transactions on Information Theory, It-42(1996), p. 1737-1744.
• E. Friedgut and J. Kahn, "On the Number of Copies of One Hypergraph in Another", Israel Journal of Mathematics, 105(1998), p. 251-256.
• J. J. Zhang, "On Lower Transcendence Degree", Advances in Mathematics, 139(1998), p. 157-193.
• A. Sali and G. Simonyi, "Intersecting set systems and graphic matroids", Discrete Mathematics, 185(1998), p. 279-285.
• J. Kahn and R. Meshhulam, "On the Number of Group-Weighted Matchings", Journal of Algebraic Combinatorics, 7(1998), p. 285-290.
• A. Ben-Dor, S. Halevi and A. Schuster, "Potential Function Analysis of Greedy Hot-Potato Routing", Theory Computing Systems, 31(1998), p. 41-61.

[ IBM Research home page | James B. Shearer's home page | Up ]
[ IBM home page | Order | Search | Contact IBM | Legal ]