|
2016-present
-
Permanental generating functions and sequential importance sampling
, Advances in Applied Math. 126 (2021) article 101916,
(with Persi Diaconis and Ron Graham)
-
Slow Fibonacci walks, Journal of Number Theory, 210, (2020), 142--170,
(with Ron Graham and Sam Spiro)
-
Efficient packings of unit squares in a large square
, Discrete and Computational Geometry, 64, (2020), 690--699,
(with R. Graham)
-
Well dispersed sequences in [0,1]^d
, J. Number Theory, 189, (2018), 1--24,
(with Ron Graham)
-
The digraph drop polynomial, in Connections in Discrete Mathematics,
(S. Butler, J. Cooper, G. Hurlbert, eds.) Cambridge University Press, 2018, 86-103,
(with Ron Graham)
-
Sum
sequences modulo n, JCT(A), 158, (2018), 290--314,
(with Jon Folkman and Ron Graham)
-
The drop polynomial of a weighted digraph, JCT(B), 126, (2017), 62--82,
(with Ron Graham)
-
Juggling card sequences, Journal of Combinatorics 8 (2017), 507--539,
(with Steve Butler, Jay Cummings, and Ron Graham)
-
On the discrepancy of circular sequences of reals, J. Number Theory, 164 (2016), 52--65,
(with R. L. Graham).
-
Decomposition of random graphs into complete bipartite graphs , SIAM J. Discrete Math., 30, no. 1, (2016), 296--310,
(with X. Peng).
-
Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions, OR Spectrum, 38(2), (2016), 531--540,
(with O. Braun and R. L. Graham).
-
The matrix cover polynomial,
J. Combinatorics, 7 (2016), 375--412,
(with R. L. Graham).
2011-2015
-
Edge flipping in the complete graphs, Advances in Appl. Math. 69 (2015), 46--64,
(with S. Butler, J. Cummings and R. L. Graham).
-
Single processor scheduling with time restrictions,
J. of Scheduling, 17 (2014), 399--403,
(with O. Braun and R. Graham).
-
Inversion-descent polynomials for restricted permutations,
J. of Combinatorial Theory, A, 120, (2013), 366--378,
(with Ron Graham).
-
Generalized Euler sums,
Journal of Combinatorics, 3, (2012), 299--316,
(with Ron Graham).
-
Edge flipping in graphs,
Advances in Applied Mathematics, 48 (2012) 37--63,
(with Ron Graham).
2006-2010
Back to top
-
A symmetric
Eulerian identity
,
Journal of Combinatorics, 1 (2010), 29--38,
(with Ron Graham and Don Knuth).
-
Tiling polygons with lattice triangles
,
Discrete and Computational Geometry, 44, (2010), 898--
903,
(with Steve Butler, Ron Graham and Mikl'os Laczkovich).
-
Descent
polynomials for permutations with bounded drop size
,
European J. Combinatorics, 31, (2010), 1853--1867,
(with Anders Claesson, Mark Dukes, and Ronald Graham).
-
Packing equal squares into a large square
,
JCT(A), 116, (2009), 1167--1175,
(with R. L. Graham).
-
Quasi-random graphs with
given degree sequences,
Random Structures and Algorithms, 12 (2008), 1--19,
(with R. L. Graham).
-
Primitive juggling sequences,
Amer. Math. Monthly, 115, March 2008, 185--194,
(with Ron Graham).
-
Parallelism versus memory allocation in pipelined router
forwarding engines,
Theory Comput. Systems 39 (2006), 829--849,
(with R. Graham, J. Mao and G. Varghese).
-
Universal juggling cycles,
Integers,
Combinatorial Number Theory, B.
Landman, M.B. Nathanson, J. Nesetril, R.J. Nowakowski, C. Pomerance, eds.
(2007), 121-130. Also appeared in INTEGERS 7(2) (2007), A8 (electronic) 10
pp.
(with Ron Graham).
- Oblivious and adaptive strategies for the majority and plurality problems,
Algorithmica, 48 (2007), 147--157,
(with R. Graham, Jia Mao and Andrew Yao)
-
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
- Oblivious strategies for the majority and plurality problems,
Computing and Combinatorics, Lecture Notes in Computer Science, Springer, Berlin (2005), 329--338,
(with R. Graham, Jia Mao and Andrew Yao).
The journal version appeared in Algorithmica 48 (2007), 147--157.
- Guessing secrets with inner product questions,
Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, (2002), 247--253,
long version appeared in Internet Math., 1 (2004), no. 2, 177--192,
(with R.L. Graham and Linyuan Lu).
-
Parallelism versus Memory Allocation
in Pipelined Router Forwarding Engines,
SPAA'04, Barcelona, Spain, (2004), 103--111,
(with Ronald Graham and George Varghese).
- Finding Favorites,
Electronic Colloquium on Computational Complexity, Report No. 78 (2003),
(with Ron Graham, Jia Mao and Andrew Yao).
-
Eigenvalues of random power law graphs,
Annals of Combinatorics 7 (2003), 21--33,
(with Lincoln Lu and Van Vu).
-
Sparse quasi-random graphs,
abstract,
Combinatorica 22 (2002), 217--244,
(with Ronald Graham)
-
On sparse sets hitting linear forms,
abstract,
Number Theory for the Millennium I,
(Eds. M. A. Bennett et al.), AK Peters, Natick, Massachusetts, (2002), 257--272.
(with Paul Erdös and Ronald Graham)
-
Guessing secrets,
abstract,
Electronic Journal of Combinatorics 8 (2001), R13, 25 pp,
extended
abstract appeared in
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
(Washington, DC, 2001), SIAM, Philadelphia, 723--726,
(with Ron Graham and Tom Leighton).
also, SODA'01, 723--726,
(with Ronald Graham and F. Tom Leighton).
-
Combinatorics for the East model,
abstract,
Advances in Applied Math. 27 (2001), 192--206,
(with Persi Diaconis and Ronald Graham).
-
Distance realization problems with applications to Internet tomography,
J. Computer and System Sciences 63 No. 3, (November 2001), 432--448,
(with Mark Garrett, Ronald Graham and David Shallcross).
-
Dynamic location problems with limited look-ahead,
Theoretical Computer Science 261 (2001), 213--226,
(with Ron Graham).
1996-2000
Back to top
-
Forced convex n-gons in the plane,
Discrete and Computational Geometry 19 (1998), 367--371,
(with R.L. Graham).
-
Erdos on Graphs. His Legacy of Unsolved Problems,
A. K. Peters, Wellesley, MA, 1998, xiv+142 pp.,
(with Ron Graham).
-
Stratified random walks on an n-cube,
Random Structures and Algorithms 11 (1997), 199--222,
(with R.L. Graham).
-
Random walks on generating sets of groups,
Electronic Journal of Combinatorics 4 no. 2, (1997) #R7, 14 pp,
(with R. L. Graham).
-
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
-
Pebbling a chessboard,
Amer. Math. Monthly 102 (1995), 113--123,
(with Ron Graham, John Morrison and Andrew Odlyzko).
-
On the cover polynomial of a digraph,
J. Combinatorial Theory (B) 65 (1995), 273--290,
(with R. L. Graham).
-
Routing permutations on graphs via matchings,
SIAM J. Discrete Math. 7 (1994) 513--530,
(with Noga Alon and R. L. Graham).
-
On hypergraphs having evenly distributed subhypergraphs,
Disc. Math. 111 (1993), 125--129,
(with Ron Graham).
-
Quasi-ransom
subsets of Zn,
J. Comb. Theory (A) 61 (1992), 64--86,
(with R. L. Graham).
-
Cohomological aspects of hypergraphs,
Trans. Amer. Math. Soc. 334 (1992), 365--388,
(with R. L. Graham).
-
Universal cycles for combinatorial structures,
Discrete Math. 110 (1992), 43--59,
(with P. Diaconis and R. L. Graham).
-
Maximum cuts and quasirandom graphs,
in Random Graphs, John Wiley and Sons (1992), 23--33,
(with R.L. Graham).
-
Quasi-random set systems,
J. Amer. Math. Soc. 4 (1991), 151--196,
(with R. L. Graham).
-
Quasi-random tournaments,
J. of Graph Theory 15 (1991), 173--198,
(with R.L. Graham).
1986-1990
Back to top
-
On graphs not containing prescribed induced subgraphs,
in A Tribute to Paul Erdos, Cambridge University Press (1990), 111--120,
(with R.L. Graham).
-
Quasi-random graphs,
a short
version appeared in Proc. Natl. Acad. Sci. USA, 85 (1988), 969--970,
a long
version
appeared in Combinatorica 9 (1989), 345--362,
(with R. L. Graham and R. M. Wilson).
-
Quasi-random hypergraphs,
Proc. Natl. Acad. Sci. USA 86 (1989), 8175--8177,
Long
version appeared in Random Structures
and Algorithms 1 (1990), 105--124,
(with R.L. Graham).
-
A dynamic location problem for graphs,
Combinatorica 9 (1989), 111--131,
(with R. L. Graham and M. Saks).
-
Steiner trees on a checkerboard,
Math. Magazine 62 (1989), 83--96,
(with Martin Gardner and R. L. Graham).
-
On the fractional covering number of hypergraphs,
SIAM J. on Discrete Math. 1 (1988), 45--49,
(with Z. Furedi, M. R. Garey and R. L. Graham).
-
On induced subgraphs of the cube,
J. Comb. Th. (A) 49 (1988), 180--187,
(with Z. Furedi, R.L. Graham and P. Seymour).
-
Pursuit-evasion games on graphs,
J. Graph Theory 12 (1988), no. 2, 159--167,
(with J.E. Cohen and R.L. Graham).
-
Dynamic search in graphs,
Discrete Algorithms and Complexity (1987), 351--387,
(with R. L. Graham and M. Saks).
-
Highly irregular graphs,
J. Graph Theory 11 (1987), 235--249,
(with Yousef Alavi, Gary Chartrand, Paul Erdos, R. L. Graham and Ortrud R. Oellermann).
-
Random walks arising in random number generation,
Ann. Probab. 15 (1987), no. 3, 1148--1165,
(with P. Diaconis and R.L. Graham).
-
Some intersection theorems for ordered sets
and graphs,
J. Combin. Theory Ser. (A) 43 (1986), no. 1, 23--37,
(with R.L. Graham, P. Frankl, and J.B. Shearer).
1981-1985
Back to top
-
On the addressing problem for directed graphs,
Graphs Combin. 1 (1985), no. 1, 41--50, (with R.L. Graham, and P.M. Winkler).
-
Quantitative forms of a theorem of Hilbert,
J. Combin. Theory Ser. (A) 38 (1985), no. 2, 210--216,
(with T.C. Brown, P. Erdös, and R.L. Graham).
-
On universal graphs for spanning trees,
Journal of London Math. Soc. 27 (1983), 203--211
(with R. L. Graham).
-
Edge-colored complete graphs with precisely colored subgraphs,
Combinatorica 3 (1983), no. 3-4, 315--324,
(with R.L. Graham).
-
On complete bipartite subgraphs contained in
spanning tree complements,
Studies in Pure Mathematics, (ed.-in-chief P. Erdös) Akadémiai Kiadó, Budapest, (1983)
83--90,
(with B. Bollobas and R. L. Graham).
-
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 the minimum dominating pair number of
a class of graphs,
Caribbean J. Math. 1 (1982), no. 2, 73--76,
(with R.L. Graham, E.J. Cockayne, and D.J. Miller).
-
Minimal decompositions of hypergraphs into mutually
isomorphic subhypergraphs,
J. Comb. Th. (A) 32 (1982), 241--251,
(with P. Erdös and R. L. Graham).
-
Tiling rectangles with rectangles,
Math. Mag. 55 (1982), no. 5, 286--291,
(with E. N. Gilbert, and R. L. Graham).
-
On graphs which contain all sparse graphs,
Annals of Discrete Math. 12 (1982), 21--26,
(with L. Babai, P. Erdös, R. L. Graham, and J. Spencer).
-
Minimal decomposition of all graphs
with equinumerous vertices and edges into mutually isomorphic subgraphs,
Finite and infinite sets, Vol. I, II (Eger, 1981), 171--179, Colloq. Math.
Soc. János Bolyai 37, North-Holland, Amsterdam, 1984,
(with P. Erdös and R. L. Graham).
-
Efficient realization techniques for network
flow patterns,
Bell System Tech. J. 60 (1981), no. 8, 1771--1786,
(with R. L. Graham and F. K. Hwang).
-
On irregularities of distribution of
real sequences,
Proc. Nat. Acad. Sci. U.S.A. 78 (1981), no. 7, part 1, 4001,
longer version: On irregularities of distribution,
Finite and infinite sets, Vol. I, II (Eger, 1981), 181--222, Colloq. Math. Soc. János
Bolyai, 37, North-Holland, Amsterdam, 1984,
(with R. L. Graham).
-
Recent results in graph decompositions,
Combinatorics (Swansea, 1981), pp. 103--123, London Math. Soc. Lecture Note Ser. 52,
Cambridge Univ. Press, Cambridge-New York, 1981,
(with R. L. Graham).
-
Universal caterpillars,
J. Comb. Th. (B) 31 (1981), 348--355,
(with R. L. Graham and J. Shearer).
-
On the permanents of complements of the direct
sum of identity matrices,
Adv. in Applied Math. 2 (1981), 121--137,
(with P. Diaconis, R. L. Graham, and C. L. Mallows).
-
On the bandwidths of a graph and its complement,
The Theory and Applications of Graphs (ed. G. Chartrand), John Wiley and Sons (1981), 243-253,
(with P. Z. Chinn, P. Erdös and R. L. Graham).
-
On trees containing all small trees,
The Theory of Applications of Graphs (ed. by G. Chartrand) John Wiley and
Sons, (1981) 265--272, (with R. L. Graham and D. Coppersmith).
-
Minimal decomposition of graphs into mutually
isomorphic subgraphs,
Combinatorica 1 (1981), 13--24,
(with P. Erdös and 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
-
On unimodality for linear extensions of partial
orders,
SIAM J. Alg. Disc. Methods 1 (1980), 405--410,
(with R. L. Graham and F. C. Fishburn).
-
On universal graphs,
Annals of the New York Academy of Sciences 319 (1979), 136--140,
(with R. L. Graham).
-
Minimal decompositions of two graphs into pairwise isomorphic subgraphs,
Proceedings of the 10th Southeastern Conf. on Comb., Graph Theory and Computing (1979), 3--18,
(with P. Erdos, R.L. Graham, S.M. Ulam and F.F. Yao).
-
Maximum antichains of rectangular arrays,
J. Comb. Theory 27 (1979), 397--400,
(with R. L. Graham, P. Erdös, D. J. Kleitman, D. West, and G. Purdy (G. W. Peck)).
-
On the product of the point and line covering
numbers of a graph,
Annals of the New York Academy of Sciences 319 (1979), 597--602,
(with P. Erdös and R. L. Graham).
-
The number of Baxter permutations,
J. Comb. Th. (A) 24 (1978), 382--394,
(with R. L. Graham, V. E. Hoggatt, and M. Kleiman).
-
Steiner trees for ladders,
Annals of Discrete Math. 2 (1978), 173--200,
(with R. L. Graham).
-
On graphs which contain all small trees,
J. Comb. Th. (B) 24 (1978), 14--23,
(with R. L. Graham).
-
On the set of distances determined by the union of
arithmetic progressions,
Ars Combinatoria 1 (1976), 57--76,
(with R. L. Graham).
-
On graphs which contain all small trees II,
Colloquia Mathematica Societatis János Bolyai, Keszthely, Hungary, (1976), 213--223,
(with R. L. Graham and N. Pippenger).
1973-1975
Back to top
|