Jeffrey M. Vanderkam

According to our database, Jeffrey M. Vanderkam authored at least 6 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Efficient Unbiased Sparsification.

Leighton Barnes, Timothy Chow, Emma Cohen, Keith Frankston, Benjamin Howard, Fred Kochman, Daniel Scheinerman, Jeffrey M. Vanderkam

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Ideal solutions in the Prouhet-Tarry-Escott problem.

Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman, Jeffrey M. Vanderkam

Math. Comput., 2023

2001

A Characterization of Bent Functions in Terms of Strongly Regular Graphs.

Anna Bernasconi, Bruno Codenotti, Jeffrey M. Vanderkam

IEEE Trans. Computers, 2001

1999

Counting Nilpotent Pairs in Finite Groups.

Jason E. Fulman, Michael D. Galloy, Gary J. Sherman, Jeffrey M. Vanderkam

Ars Comb., 1999

1996

Path-sequential labellings of cycles.

Jeffrey M. Vanderkam

Discret. Math., 1996

Bounds on squares of two-sets.

Daniel C. Slilaty, Jeffrey M. Vanderkam

Ars Comb., 1996