Works in progress, please contribute.

The linked PDF files are of somewhat recent versions, though I upload them manually so I cannot guarantee that they are current.

• Complexity of equivalence relations
  • https://github.com/jfinkels/equivalence
• Complexity of parsing closed formulas
  • https://github.com/jfinkels/parseable
• Exploration of modern models of realistic parallel random access machines
  • https://github.com/jfinkels/parallel
• NC approximation schemes
  • https://github.com/jfinkels/ncapproximation
• Clearer proof of APX completeness
  • https://github.com/jfinkels/apxcompleteness
• Probabilistically checkable proofs with NC verifiers
  • https://github.com/jfinkels/ncpcp
• Computing the size of the minimum generating set of a group
  • https://github.com/jfinkels/mingroupgen
• Stallings' folding algorithm is P-complete
  • https://github.com/jfinkels/stallings
• More precise proof of completeness under MPTAS reductions
  • https://github.com/jfinkels/mptas

My works will always be licensed under a Creative Commons Attribution-ShareAlike license.