The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Farid M. Ablayev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Farid M. Ablayev, Aida Gainutdinova
    Complexity of Quantum Uniform and Nonuniform Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:78-87 [Conf]
  2. Farid M. Ablayev
    Possibilities of Probabilistic on-line Counting Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:1-4 [Conf]
  3. Farid M. Ablayev, Svetlana Ablayeva
    A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:47-58 [Conf]
  4. Farid M. Ablayev, Aida Gainutdinova
    Classical Simulation Complexity of Quantum Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:296-302 [Conf]
  5. Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski
    On Computational Power of Quantum Branching Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:59-70 [Conf]
  6. Farid M. Ablayev
    On Complexity of Regular (1, +k)-Branching Programs. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:229-240 [Conf]
  7. Farid M. Ablayev
    Lower Bounds for One-way Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:241-252 [Conf]
  8. Farid M. Ablayev
    Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:195-202 [Conf]
  9. Farid M. Ablayev, Marek Karpinski
    On the Power of Randomized Branching Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:348-356 [Conf]
  10. Farid M. Ablayev, Cristopher Moore, Chris Pollett
    Quantum and Stochastic Branching Programs of Bounded Width. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:343-354 [Conf]
  11. Farid M. Ablayev
    Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:1-7 [Conf]
  12. Farid M. Ablayev, Rusins Freivalds
    Why Sometimes Probabilistic Algorithms Can Be More Effective. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:1-14 [Conf]
  13. Farid M. Ablayev
    Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:154-161 [Conf]
  14. Farid M. Ablayev
    On Comparing Probabilistic and Deterministic Automata Complexity of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:599-605 [Conf]
  15. Farid M. Ablayev, Aida Gainutdinova
    On the Lower Bounds for One-Way Quantum Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:132-140 [Conf]
  16. Farid M. Ablayev
    The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. [Citation Graph (0, 0)][DBLP]
    SAGA, 2005, pp:190-201 [Conf]
  17. Chris Pollett, Farid M. Ablayev, Cristopher Moore
    Quantum and Stochastic Programs of Bounded Width [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:013, pp:- [Journal]
  18. Farid M. Ablayev
    Randomization and nondeterminsm are incomparable for ordered read-once branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:21, pp:- [Journal]
  19. Farid M. Ablayev, Svetlana Ablayeva
    A Discrete Approximation and Communication Complexity Approach to the Superposition Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:50, pp:- [Journal]
  20. Farid M. Ablayev
    On Complexity of Regular (1,+k)-Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:44, pp:- [Journal]
  21. Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Christopher Pollett
    On the computational power of probabilistic and quantum branching program. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:2, pp:145-162 [Journal]
  22. Farid M. Ablayev, Marek Karpinski
    A lower bound for integer multiplication on randomized ordered read-once branching programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:1, pp:78-89 [Journal]
  23. Farid M. Ablayev
    Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:2, pp:139-159 [Journal]
  24. 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]

  25. Classical Simulation Complexity of Quantum Branching Programs. [Citation Graph (, )][DBLP]


  26. Algorithms for Quantum Branching Programs Based on Fingerprinting [Citation Graph (, )][DBLP]


  27. On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. [Citation Graph (, )][DBLP]


  28. On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002