6 papers
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
Gregory Morse
Classical lower bounds show that multiplying two degree-three polynomials over requires nine scalar products in bilinear or quadratic models. They do not settle unres…
Emulation-Completeness of Programming Languages
Gregory Morse, Tamás Kozsik
We study when a programming language can emulate programs written in that same language without delegating the guest program back to the host evaluator or compiler. We call this pr…
Erlang Binary and Source Code Obfuscation
Gregory Morse, Tamás Kozsik
This paper studies obfuscation techniques for Erlang programs at the source, abstract syntax tree, BEAM assembly, and BEAM bytecode levels. We focus on transformations that complic…
Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
Gregory Morse, Tamás Kozsik
Loop nesting forests (LNFs) are a fundamental abstraction for reasoning about control-flow structure, enabling applications such as compiler optimizations, program analysis, and do…
Tamper-Proofing with Self-Modifying Code
Gregory Morse, Tamás Kozsik
Classical computability theory tells us that self-modifying code (SMC) on a deterministic universal Turing machine can be simulated by non-SMC code on the same model. That abstract…
Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
Gregory Morse, Tamás Kozsik
We study the problem of maintaining a breadth-first spanning tree and the induced BFS ordering in a directed graph under edge updates. While semi-dynamic algorithms are known, main…