Farid M. Ablayev

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Marek Karpinski

> Home > Persons > Farid M. Ablayev

Publications

2005
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/AblayevGKMP05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/AblayevGKMP05
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett:
On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2): 145-162 (2005)
2003
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/AblayevK03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/AblayevK03
Farid M. Ablayev, Marek Karpinski:
A lower bound for integer multiplication on randomized ordered read-once branching programs. Inf. Comput. 186(1): 78-89 (2003)
2001
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AblayevKM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AblayevKM01
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)
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/fct/AblayevGK01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/AblayevGK01
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski:
On Computational Power of Quantum Branching Programs. FCT 2001: 59-70
1998
[i5]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR98-004
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR98-004
Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Ordered Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998)
[i4]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR98-011
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR98-011
Farid M. Ablayev, Marek Karpinski:
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR98 (1998)
1996
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AblayevK96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AblayevK96
Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Branching Programs. ICALP 1996: 348-356
1995
[i1]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/ECCC-TR95-054
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR95-054
Farid M. Ablayev, Marek Karpinski:
On the Power of Randomized Branching Programs. Electron. Colloquium Comput. Complex. TR95 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.