Reliability, sampling, and algorithmic randomness
TAV4 Proceedings of the symposium on Testing, analysis, and verification
NP predicates computable in the weakest level of the Grzegorczyck hierarchy
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
On the expressive power of the loop language
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Journal of Combinatorial Theory Series A
Speed-Up Theorems in Type-2 Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Recursive path orderings can also be incremental
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Invariance and universality of complexity
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |