The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rustam Mubarakzjanov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002