Travelled to:1 × Germany
1 × Spain
1 × Sweden
2 × Italy
Collaborated with:A.Gainutdinova ∅ M.Karpinski C.Moore C.Pollett
Talks about:program (4) branch (4) quantum (3) complex (3) random (2) bound (2) probabilist (1) nondetermin (1) nonuniform (1) stochast (1)
Person: Farid M. Ablayev
DBLP: Ablayev:Farid_M=
Contributed to:
2007
2005
2002199719961993Wrote 6 papers:
- LATA-2007-AblayevG #branch #complexity #quantum #simulation #source code
- Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.
- DLT-2005-AblayevG #automaton #complexity #quantum
- Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.
- ICALP-2002-AblayevMP #bound #branch #probability #quantum #source code
- Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.
- ICALP-1997-Ablayev #branch #nondeterminism #order #source code
- Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.
- ICALP-1996-AblayevK #branch #on the #power of #random #source code
- On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.
- ICALP-1993-Ablayev #bound #communication #complexity #probability
- Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.