Thomas Stanley

According to our database, Thomas Stanley authored at least 6 papers between 2019 and 2025.

Collaborative distances:

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

2025

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges.

Alex Crane, Thomas Stanley, Blair D. Sullivan, Nate Veldt

CoRR, February, 2025

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees.

Nate Veldt, Thomas Stanley, Benjamin W. Priest, Trevor Steil, Keita Iwabuchi, T. S. Jayram, Geoffrey Sanders

CoRR, February, 2025

2022

Using permutation rational functions to obtain permutation arrays with large hamming distance.

Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough

Des. Codes Cryptogr., 2022

Computation of Cycle Bases in Surface Embedded Graphs.

Kyle Fox, Thomas Stanley

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions.

Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019

Equivalence Relations for Computing Permutation Polynomials.

Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong

CoRR, 2019