|
Search the dblp DataBase
Rustam Mubarakzjanov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans-Ulrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. [Citation Graph (0, 0)][DBLP] FSTTCS, 2001, pp:171-182 [Conf]
- Rustam Mubarakzjanov
Probabilistic OBDDs: on Bound of Width versus Bound of Error [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:85, pp:- [Journal]
- Rustam Mubarakzjanov
Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:37, pp:- [Journal]
- Farid M. Ablayev, Marek Karpinski, Rustam Mubarakzjanov
On BPP versus NPcoNP for ordered read-once branching programs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:264, n:1, pp:127-137 [Journal]
Search in 0.001secs, Finished in 0.001secs
|