The following pages link to (Q4003357):
Displaying 13 items.
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Algorithmics for beginners. For students, teachers and pupils of the subjects of mathematics and informatics (Q380957) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- Optimal multi-file read policies for optical discs (Q2366283) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization (Q2908546) (← links)
- (Q3384890) (← links)
- (Q3642961) (← links)
- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism (Q4686646) (← links)
- (Q5028481) (← links)
- Domain modelling: a foundation for software development (Q6535830) (← links)