The following pages link to STACS 2005 (Q5710680):
Displaying 13 items.
- Small dynamic complexity classes. An investigation into dynamic descriptive complexity (Q509761) (← links)
- Analysis of dynamic algorithms in Knuth's model (Q912599) (← links)
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis (Q1186603) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- Dynamic conjunctive queries (Q2361342) (← links)
- The dynamic descriptive complexity of \(k\)-clique (Q2407083) (← links)
- On the quantifier-free dynamic complexity of reachability (Q2514150) (← links)
- Dynamic complexity theory revisited (Q2643134) (← links)
- (Q3097171) (← links)
- Dynamic Complexity under Definable Changes (Q3174912) (← links)
- (Q3789050) (← links)
- Dynamic Complexity under Definable Changes (Q5012593) (← links)
- Static Analysis for Logic-Based Dynamic Programs (Q5351965) (← links)