The following pages link to Stefan D. Bruda (Q202145):
Displaying 11 items.
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542) (← links)
- On limits on the computational power of data-accumulating algorithms (Q1007605) (← links)
- (Q1348694) (redirect page) (← links)
- Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems (Q1348695) (← links)
- The characterization of data-accumulating algorithms (Q1969438) (← links)
- Improved balance in multiplayer online battle arena games (Q2061288) (← links)
- COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS (Q3569286) (← links)
- Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space (Q4598924) (← links)
- Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts (Q4686650) (← links)
- A case study in real-time parallel computation: Correcting algorithms (Q5943111) (← links)
- Improving a solution's quality through parallel processing (Q5945692) (← links)