Farid M. Ablayev

	2011
37		Farid M. Ablayev, Alexander Vasiliev: Classical and Quantum Parallelism in the Quantum Fingerprinting Method. PaCT 2011: 1-12
	2010
36		Farid M. Ablayev, Bob Coecke, Alexander Vasiliev: Proceedings CSR 2010 Workshop on High Productivity Computations HPC 2010
35		Farid M. Ablayev, Ernst W. Mayr: Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings Springer 2010
34		Farid M. Ablayev, Alexander Vasiliev: On Computational Power of Quantum Read-Once Branching Programs HPC 2010: 1-12
33		Farid M. Ablayev, Svetlana Ablayeva: A Communication Approach to the Superposition Problem. Fundam. Inform. 104(3): 185-200 (2010)
	2009
32		Farid M. Ablayev, Alexander Vasiliev: Algorithms for Quantum Branching Programs Based on Fingerprinting DCM 2009: 1-11
	2008
31		Farid M. Ablayev, Alexander Vasiliev: On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting. Electronic Colloquium on Computational Complexity (ECCC) 15(059): (2008)
30		Farid M. Ablayev, Airat Khasianov, Alexander Vasiliev: On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC) 15(085): (2008)
	2007
29		Farid M. Ablayev: Classical Simulation Complexity of Quantum Branching Programs. Algebraic Methods in Computational Complexity 2007
28		Farid M. Ablayev, Aida Gainutdinova: Classical Simulation Complexity of Quantum Branching Programs. LATA 2007: 49-56
	2005
27		Farid M. Ablayev, Aida Gainutdinova: Complexity of Quantum Uniform and Nonuniform Automata. Developments in Language Theory 2005: 78-87
26		Farid M. Ablayev: The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. SAGA 2005: 190-201
25		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
24		Farid M. Ablayev, Aida Gainutdinova: Classical Simulation Complexity of Quantum Machines. FCT 2003: 296-302
23		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)
	2002
22		Farid M. Ablayev, Cristopher Moore, Chris Pollett: Quantum and Stochastic Branching Programs of Bounded Width. ICALP 2002: 343-354
21		Chris Pollett, Farid M. Ablayev, Cristopher Moore: Quantum and Stochastic Programs of Bounded Width Electronic Colloquium on Computational Complexity (ECCC)(013): (2002)
	2001
20		Farid M. Ablayev, Svetlana Ablayeva: A Discrete Approximation and Communication Complexity Approach to the Superposition Problem. FCT 2001: 47-58
19		Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski: On Computational Power of Quantum Branching Programs. FCT 2001: 59-70
18		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)
	2000
17		Farid M. Ablayev: On Complexity of Regular (1, +k)-Branching Programs. ICALP Satellite Workshops 2000: 229-240
16		Farid M. Ablayev, Aida Gainutdinova: On the Lower Bounds for One-Way Quantum Automata. MFCS 2000: 132-140
	1999
15		Farid M. Ablayev: On Complexity of Regular (1,+k)-Branching Programs Electronic Colloquium on Computational Complexity (ECCC)(44): (1999)
	1998
14		Farid M. Ablayev, Marek Karpinski: A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 5(11): (1998)
13		Farid M. Ablayev, Marek Karpinski: On the Power of Randomized Ordered Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 5(4): (1998)
12		Farid M. Ablayev, Svetlana Ablayeva: A Discrete Approximation and Communication Complexity Approach to the Superposition Problem Electronic Colloquium on Computational Complexity (ECCC) 5(50): (1998)
	1997
11		Farid M. Ablayev: Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. ICALP 1997: 195-202
10		Farid M. Ablayev: Randomization and nondeterminsm are incomparable for ordered read-once branching programs Electronic Colloquium on Computational Complexity (ECCC) 4(21): (1997)
	1996
9		Farid M. Ablayev, Marek Karpinski: On the Power of Randomized Branching Programs. ICALP 1996: 348-356
8		Farid M. Ablayev: Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity. Theor. Comput. Sci. 157(2): 139-159 (1996)
	1995
7		Farid M. Ablayev, Marek Karpinski: On the Power of Randomized Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 2(54): (1995)
	1994
6		Farid M. Ablayev: Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach. LFCS 1994: 1-7
	1993
5		Farid M. Ablayev: Lower Bounds for One-way Probabilistic Communication Complexity. ICALP 1993: 241-252
	1989
4		Farid M. Ablayev: On Comparing Probabilistic and Deterministic Automata Complexity of Languages. MFCS 1989: 599-605
	1988
3		Farid M. Ablayev: Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability. MFCS 1988: 154-161
	1987
2		Farid M. Ablayev: Possibilities of Probabilistic on-line Counting Machines. FCT 1987: 1-4
	1986
1		Farid M. Ablayev, Rusins Freivalds: Why Sometimes Probabilistic Algorithms Can Be More Effective. MFCS 1986: 1-14

Coauthor Index

1	Svetlana Ablayeva	[12] [20] [33]
2	Bob Coecke	[36]
3	Rusins Freivalds	[1]
4	Aida Gainutdinova	[16] [19] [24] [25] [27] [28]
5	Marek Karpinski	[7] [9] [13] [14] [18] [19] [23] [25]
6	Airat Khasianov	[30]
7	Ernst W. Mayr	[35]
8	Cristopher Moore	[21] [22] [25]
9	Rustam Mubarakzjanov	[18]
10	Chris Pollett (Christopher Pollett)	[21] [22] [25]
11	Alexander Vasiliev	[30] [31] [32] [34] [36] [37]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page