|
back to staff
about the uni
about Kazan
about Tatarstan
|
Contact:
Professor Dr. Farid Ablayev
Department of Theoretical Cybernetics
Kazan State University
420008 Kazan
Russia
Email: ablayev@ksu.ru
Research:
I am interested in computational complexity, in particular in comparing
the complexity of classical (randomized, nondeterministic and deterministic) and quantum
computational models.
Publications:
Papers available on line:
- F. Ablayev, C. Moore, and
C. Pollett, Quantum and Stochastic Branching Progrmas of Finite width,
Manuskript, 2001, accpeted by the Program Committee of the ICALP'2002,
Malaga. To be published in Lecture Notes in Computer Science by Springer-Verlag
in 2002. Availiable also at
http://www.eccc.uni-trier.de
- F. Ablayev and S.
Ablayeva, A Discrete Approximation and Communication Complexity Approach to
the Superposition Problem in the Proceedings of the International
Conference "Foundation of Computation Theory" (FCT'2001), Riga, Lecture Notes in
Computer Science, Springer-Verlag 2001, 49-58.
- F. Ablayev, A.
Gainutdinova, and M. Karpinski, On Computational Power of Quantum Branching
Programs, in the Proceedings of the International Conference
"Foundation of Computation Theory" (FCT'2001), Riga, Lecture Notes in Computer
Science, Springer-Verlag 2001, 59-70.
- F. Ablayev and A.
Gainutdinova, On the Lower Bounds for One-Way Quantum Automata, in
Proceedings of the 25th International Symposium, Mathematical Foundations of
Computer Science (MFCS 2000), Bratislava, 2000, Springer-Verlag, 132-140.
- F. Ablayev, On
Complexity of Regular (1,+k)-Branching Programs in Proceedings of the
Satellite Workshops of the ICALP'2000, Geneva, 2000, 229-240.
- F. Ablayev, On the
power of quantum and probabilistic computations, 2000
- F.Ablayev and
M.Karpinski, A lower bound for integer multiplication on randomized
read-once branching programs, Electronic Colloquium on Computational
Complexity, TR98-011, (1998),also available at
http://www.eccc.uni-trier.de/eccc/
- F. Ablayev and M. Karpinski, On the power of randomized
ordered branching programs. Extension of the result of ICALP'96 paper for
the case of pure Boolean functions. Available also at Electronic Colloquium on
Computational Complexity, TR98-004, (1998),
http://www.eccc.uni-trier.de/eccc/
-
F. Ablayev, Randomization and nondeterminism are
incomparable for ordered read-once branching programs,
in Proceedings of the ICALP'97, Lecture Notes
in Computer Science, Springer-Verlag , 1256, (1997), 195-202.
Listing of my other publications (books, thesises, papers,
technical reports)
Employment: Chair Professor of the Department of Theoretical
Cybernetics of Kazan State University,
Chair of the department of informatik of Institute
of Mechanics and Mathematics of Kazan State University.
Links:
Click
here
to see
my Web page in Russian (maintained by Kazan university officials).
Use the Cyrillic KOI8-r font from the Netscape View (Options) Encoding menue.
[go top]
|
|
