Paul W. Beame

1959

• Proof complexity and feasible arithmetics
• Lower bounds in parallel machine computation
• Random routing in constant degree networks