| 2001 |
|---|
| 6 | EE | Jürgen Forster,
Matthias Krause,
Satyanarayana V. Lokam,
Rustam Mubarakzjanov,
Niels Schmitt,
Hans-Ulrich Simon:
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
FSTTCS 2001: 171-182 |
| 5 | EE | Rustam Mubarakzjanov:
Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable
Electronic Colloquium on Computational Complexity (ECCC) 8(37): (2001) |
| 4 | EE | Farid M. Ablayev,
Marek Karpinski,
Rustam Mubarakzjanov:
On BPP versus NPcoNP for ordered read-once branching programs.
Theor. Comput. Sci. 264(1): 127-137 (2001) |
| 2000 |
|---|
| 3 | EE | Rustam Mubarakzjanov:
Probabilistic OBDDs: on Bound of Width versus Bound of Error
Electronic Colloquium on Computational Complexity (ECCC) 7(85): (2000) |
| 2 | | Rustam Mubarakzjanov:
Lower Bounds for Randomized Branching Programs with a Big OBDD Part
Universität Trier, Mathematik/Informatik, Forschungsbericht 00-13: (2000) |
| 1999 |
|---|
| 1 | EE | Marek Karpinski,
Rustam Mubarakzjanov:
A Note on Las Vegas OBDDs
Electronic Colloquium on Computational Complexity (ECCC) 6(9): (1999) |
