Rustam Mubarakzjanov

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

On BPP versus NPcoNP for ordered read-once branching programs.

Farid M. Ablayev, Marek Karpinski, Rustam Mubarakzjanov

Theor. Comput. Sci., 2001

Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable

Rustam Mubarakzjanov

Electron. Colloquium Comput. Complex., 2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon

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

Rustam Mubarakzjanov

Universität Trier, Mathematik/Informatik, Forschungsbericht, 2000

Probabilistic OBDDs: on Bound of Width versus Bound of Error.

Rustam Mubarakzjanov

Electron. Colloquium Comput. Complex., 2000

1999

A Note on Las Vegas OBDDs

Marek Karpinski, Rustam Mubarakzjanov

Electron. Colloquium Comput. Complex., 1999