ACM SIGACT News
Partial Information and Special Case Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Towards a Cardinality Theorem for Finite Automata
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
One query reducibilities between partial information classes
Theoretical Computer Science - Mathematical foundations of computer science 2004
Combining self-reducibility and partial information algorithms
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.04 |