Pages that link to "Item:Q2233448"
From MaRDI portal
The following pages link to Types for complexity of parallel computation in pi-calculus (Q2233448):
Displaying 9 items.
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
- (Q4436023) (← links)
- Type-Based Complexity Analysis for Fork Processes (Q4910427) (← links)
- Resource Usage Analysis for the Pi-Calculus (Q5310663) (← links)
- Constant time parallel computations in \(\lambda\)-calculus (Q5958783) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- Analysing parallel complexity of term rewriting (Q6160759) (← links)
- Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination (Q6488159) (← links)
- On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)