Rustam Mubarakzjanov

According to our database1, Rustam Mubarakzjanov authored at least 6 papers between 1999 and 2001.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2001
On BPP versus NPcoNP for ordered read-once branching programs.
Theor. Comput. Sci., 2001

Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable
Electronic Colloquium on Computational Complexity (ECCC), 2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000
Lower Bounds for Randomized Branching Programs with a Big OBDD Part
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2000

Probabilistic OBDDs: on Bound of Width versus Bound of Error.
Electronic Colloquium on Computational Complexity (ECCC), 2000

1999
A Note on Las Vegas OBDDs
Electronic Colloquium on Computational Complexity (ECCC), 1999


  Loading...