Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
ACM SIGACT News
Approximate recognition of non-regular languages by finite automata
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The Complexity of Distributions
SIAM Journal on Computing
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.89 |