Joseph Swernofsky

According to our database, Joseph Swernofsky authored at least 5 papers between 2015 and 2026.

Collaborative distances:

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

2026

Hardness and fixed parameter tractability for pinwheel scheduling problems.

Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky

Theor. Comput. Sci., 2026

2020

d-Galvin Families.

Johan Håstad, Guillaume Lagarde, Joseph Swernofsky

Electron. J. Comb., 2020

Trade-Offs Between Size and Degree in Polynomial Calculus.

Guillaume Lagarde, Jakob Nordström, Dmitry Sokolov, Joseph Swernofsky

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2018

Tensor Rank is Hard to Approximate.

Joseph Swernofsky

Proceedings of the Approximation, 2018

2015

On the Complexity of Intersecting Regular, Context-Free, and Tree Languages.

Joseph Swernofsky, Michael Wehar

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015