The following pages link to Daniel P. Bovet (Q1106216):
Displaying 17 items.
- Inclusion relationships among permutation problems (Q1106217) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- On the regularity of languages on a binary alphabet generated by copying systems (Q1205714) (← links)
- (Q1257336) (redirect page) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- Minimum-delay schedules in layered networks (Q1812948) (← links)
- Complexity classes and sparse oracles (Q1894447) (← links)
- Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks (Q3334062) (← links)
- DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING (Q3358213) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- (Q4293543) (← links)
- Optimal centralized algorithms for store-and-forward deadlock avoidance (Q4419809) (← links)
- (Q5585812) (← links)
- On Static Memory Allocation in Computer Systems (Q5590449) (← links)
- A Dynamic Memory Allocation Algorithm (Q5594219) (← links)
- Legality and Other Properties of Graph Models of Computations (Q5603627) (← links)
- Parallel approximation of optimization problems (Q6560202) (← links)
