The following pages link to (Q3992743):
Displaying 21 items.
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
- Deadlock avoidance with a modified banker's algorithm (Q1091127) (← links)
- A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
- FUN: a dynamic method for scheduling problems (Q1388821) (← links)
- A temporal logic for real-time partial ordering with named transactions (Q1391307) (← links)
- Data structures and algorithms for tilings I (Q1401377) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- A contracting model for flexible distributed scheduling (Q1815836) (← links)
- Asymptotic analysis of an optimized quicksort algorithm. (Q1853184) (← links)
- Code aware resource management (Q2248054) (← links)
- Deadlock analysis in networks of communicating processes (Q2638755) (← links)
- Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
- Probabilistic analysis of some distributed algorithms (Q3358236) (← links)
- Une approche quantitative de l'exclusion mutuelle (Q3738552) (← links)
- High level synthesis of synchronous parallel controllers (Q4633158) (← links)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
- A temporal logic for real-time partial-ordering with named transactions (Q5096355) (← links)
- ESFLIB: A library to compute the element-free Galerkin shape functions (Q5928405) (← links)
- The stack-size of tries: A combinatorial study (Q5958316) (← links)
