Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Bias Invariance of Small Upper Spans
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A stronger Kolmogorov zero-one law for resource-bounded measure
Theoretical Computer Science - Algorithms,automata, complexity and games
Scaled dimension and nonuniform complexity
Journal of Computer and System Sciences
Computability versus exact computability of martingales
Information Processing Letters
SIGACT news complexity theory column 48
ACM SIGACT News
A Characterization of Constructive Dimension
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability versus exact computability of martingales
Information Processing Letters
Scaled dimension and nonuniform complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
| Hi-index | 0.00 |