The geometry of fractal sets
Acta Informatica
Category and measure in complexity classes
SIAM Journal on Computing
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
The complexity and effectiveness of prediction algorithms
Journal of Complexity
Proceedings of the 30th IEEE symposium on Foundations of computer science
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing
Completeness and weak completeness under polynomial-size circuits
Information and Computation
Cook versus Karp-Levin: separating completeness notions if NP is not small
Theoretical Computer Science
Genericity and measure for exponential time
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
The quantitative structure of exponential time
Complexity theory retrospective II
Journal of Computer and System Sciences
The zero-one law holds for BPP
Theoretical Computer Science
Twelve problems in resource-bounded measure
Current trends in theoretical computer science
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Theoretical Computer Science
Why Computational Complexity Requires Stricter Martingales
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Resource Bounded Measure of P/poly
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Dimension in Complexity Classes
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Hausdorff Dimension in Exponential Time
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Note: fractal dimension and logarithmic loss unpredictability
Theoretical Computer Science
Dimension in Complexity Classes
SIAM Journal on Computing
The dimensions of individual strings and sequences
Information and Computation
Theoretical Computer Science
Effective fractal dimension: foundations and applications
Effective fractal dimension: foundations and applications
Dimension, Entropy Rates, and Compression
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Scaled dimension and nonuniform complexity
Journal of Computer and System Sciences
Small Spans in Scaled Dimension
SIAM Journal on Computing
Pseudorandomness for Approximate Counting and Sampling
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Journal of Computer and System Sciences - Special issue on COLT 2002
Resource-bounded strong dimension versus resource-bounded category
Information Processing Letters
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
Theory of Computing Systems
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Generic density and small span theorem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
High-confidence predictions under adversarial uncertainty
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
High-confidence predictions under adversarial uncertainty
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
| Hi-index | 0.00 |
Here is a real gift to the field from David Johnson: After a thirteen year intermission, David is restarting his NP-completeness column. His column will now appear about twice yearly in ACM Transactions on Algorithms. Welcome back David, and thanks! And for those for whom a diet of two per year wont do, meals past can be found at http://www.research.att.com/~dsj/columns.html.