Random Permutations in Computational Complexity.
John M. Hitchcock, Adewale Sekoni, and Hadi Shafei. International Symposium on Mathematical Foundations of Computer Science (MFCS), 2025, to appear.
Counting Martingales for Measure and Dimension in Complexity
Classes.
John M. Hitchcock, Adewale Sekoni, and Hadi Shafei. Computational Complexity Conference (CCC), 2025, to appear.
Unions of Disjoint NP-Complete Sets.
Christian Glaßer, John M. Hitchcock, A. Pavan, and Stephen Travers. ACM Transactions on Computation Theory, 2014.
Learning Reductions to Sparse Sets.
Harry Buhrman, Lance Fortnow, John M. Hitchcock, and Bruno Loff. International Symposium on Mathematical Foundations of Computer Science (MFCS),
2013.