|
2016-present
-
Efficient packings of unit squares in a large square
, Discrete and Computational Geometry, 64, (2020), 690--699,
(with R. Graham)
-
A strong Harnack inequality for graphs,
Comm. Analysis and Geometry, 25, no. 3, (2017), 557--588,
(with S.-T. Yau).
2011-2015
2006-2010
Back to top
-
Tiling polygons with lattice triangles
,
Discrete and Computational Geometry, 44, (2010), 898--
903,
(with Steve Butler, Ron Graham and Mikl'os Laczkovich).
-
PageRank
as a discrete Green's function,
Geometry and Analysis, I, ALM 17, (2010), 285--302.
-
Packing equal squares into a large square
,
JCT(A), 116, (2009), 1167--1175,
(with R. L. Graham).
-
Maximizing data locality in distributed systems,
Journal of Computer System Sciences, 72 (December 2006),
1309-1316,
(with Ronald Graham, Ranjita Bhagwan, Stefan Savage and Geoffrey M. Voelker).
2001-2005
Back to top
-
Parallelism versus Memory Allocation
in Pipelined Router Forwarding Engines,
SPAA'04, Barcelona, Spain, (2004), 103--111,
(with Ronald Graham and George Varghese).
-
Discrete isoperimetric inequalities,
Surveys in Differential Geometry IX, International Press, (2004), 53--82.
1996-2000
Back to top
-
Higher eigenvalues and isoperimetric inequalities on
Riemannian manifolds and graphs,
Communications on Analysis and Geometry 8, (2000), 969--1026,
(with A. Grigor'yan and S.-T. Yau).
-
Weighted graph Laplacians and isoperimetric inequalities,
Pacific Journal of Mathematics 192 (2000), 257--273,
(with Kevin Oden).
-
A Harnack inequality for Dirichlet eigenvalues,
Journal of Graph Theory, 34 (2000), 247--257,
(with S.-T. Yau).
-
Spanning trees in subgraphs of lattices,
Comtempory Math. 245, Amer. Math. Soc., Providence, R. I., 1999, 201--219.
-
Coverings, heat kernels and spanning trees,
Electronic Journal of Combinatorics 6 (1999), R12, 21 pp,
(with S.-T. Yau).
-
Logarithmic Sobolev techniques for random walks on graphs,
Emerging Applications of Number Theory, IMA Volumes in Math. and its Applications
109 (eds. D. A. Hejhal et. al.), 175--186, Springer, 1999.
-
Forced convex n-gons in the plane,
Discrete and Computational Geometry 19 (1998), 367--371,
(with R.L. Graham).
- Isoperimetric inequalities for Cartesian products of graphs,
Combinatorics, Probability and Computing 7 (1998), 141--148,
(with Prasad Tetali).
-
Eigenvalue inequalities for graphs and convex subgraphs,
Communications on Analysis and Geometry 5 (1997), 575--623,
(with S.-T. Yau).
-
A combinatorial trace formula,
Tsing Hua Lectures on Geometry and Analysis,
International Press, Cambridge, Massachusetts, 1997, 107--116,
(with S.-T. Yau)
-
Eigenvalues and diameters for manifolds and graphs,
Tsing Hua Lectures on Geometry and Analysis,
International Press, Cambridge, Massachusetts, 1997, 79--106,
(with A. Grigor'yan and S.-T. Yau).
-
Logarithmic Harnack inequalities,
Mathematical Research Letters 3 (1996), 793--812,
(with S.-T. Yau).
-
Upper bounds for eigenvalues of the discrete and continuous
Laplace operators,
Advances in Mathematics 117 (1996) 165--178,
(with A. Grigor'yan and S.-T. Yau).
-
On sampling with Markov chains,
Random Structures and Algorithms 9 (1996) 55--77.
(with R. L. Graham and S. -T. Yau).
1991-1995
Back to top
-
A Harnack inequality for homogeneous graphs and subgraphs,
Communications on Analysis and Geometry 2
(1994), 627--640,
also in Turkish J. Math. 19 (1995), 273--290,
(with S.-T. Yau).
-
Eigenvalues of graphs,
Proceedings of the International Congress of Mathematicians (Zurich, 1994),
Birkhäuser Verlag, Berlin, 1333--1342.
-
Eigenvalues of graphs and Sobolev inequalities,
Combinatorics, Probability and Computing 4 (1995), 11--26,
(with S.-T. Yau).
-
Groups and the Buckyball,
in Lie Theory and Geometry: In honor of Bertram Kostant (Eds. J.-L. Brylinski, R. Brylinski, V. Guillemin and V. Kac)
PM 123, Birkhäuser, Boston, 1994, 97--126,
(with Bertram Kostant and Shlomo Sternberg).
- The number of
different distances determined by a set of points in the Euclidean place,
Discrete and Computational Geometry 7 (1992), 1--11,
(with E. Szemeredi and W.T. Trotter).
-
A note on finding a strict saddlepoint,
Amer. Math. Monthly 98 (1991), 418--419,
(with Daniel Bienstock, Michael Fredman, Alejandro A. Schaffer, Peter W. Shor and Subhash Suri).
1986-1990
Back to top
1981-1985
Back to top
-
A new bound for Euclidean Steiner minimal
trees,
Discrete geometry and convexity (New York, 1982), 328--346,
Ann. New York Acad. Sci. 440, New York Acad. Sci., New York, 1985,
(with R. L. Graham).
-
On Steiner trees for bounded point sets,
Geometriae Dedicata 11 (1981), 353--361,
(with R. L. Graham).
1975-1980
Back to top
1973-1975
Back to top
|