Farid M. Ablayev

Marat Ablayev

Kamil Khadiev

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Lower Bound and Hierarchies for Quantum Ordered Read-k-times Branching Programs.

[BibT_eX]

[DOI]

Kamil Khadiev

Aliya Khadieva

CoRR, 2017

2016

Quantum Fingerprinting and Quantum Hashing. Computational and Cryptographical Aspects.

[BibT_eX]

[DOI]

Balt. J. Mod. Comput., 2016

2014

Quantum Hashing via Classical ε-universal Hashing Constructions.

[BibT_eX]

[DOI]

Marat Ablayev

CoRR, 2014

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas.

[BibT_eX]

[DOI]

Marat Ablayev

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Computing Boolean Functions via Quantum Hashing.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

Algorithms for Quantum Branching Programs Based on Fingerprinting.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2013

2011

Classical and Quantum Parallelism in the Quantum Fingerprinting Method.

[BibT_eX]

[DOI]

Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

2010

A Communication Approach to the Superposition Problem.

[BibT_eX]

[DOI]

Svetlana Ablayeva

Fundam. Informaticae, 2010

On Computational Power of Quantum Read-Once Branching Programs

[BibT_eX]

[DOI]

Proceedings of the Proceedings CSR 2010 Workshop on High Productivity Computations, 2010

2008

On the Computation of Boolean Functions by Quantum Branching Programs via Fingerprinting.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions.

[BibT_eX]

[DOI]

Airat Khasianov

Electron. Colloquium Comput. Complex., 2008

2007

Classical Simulation Complexity of Quantum Branching Programs.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Classical Simulation Complexity of Quantum Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

2005

On the computational power of probabilistic and quantum branching program.

[BibT_eX]

[DOI]

Inf. Comput., 2005

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

Complexity of Quantum Uniform and Nonuniform Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2003

A lower bound for integer multiplication on randomized ordered read-once branching programs.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Classical Simulation Complexity of Quantum Machines.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Quantum and Stochastic Programs of Bounded Width

[BibT_eX]

[DOI]

Chris Pollett

Cristopher Moore

Electron. Colloquium Comput. Complex., 2002

Quantum and Stochastic Branching Programs of Bounded Width.

[BibT_eX]

[DOI]

Cristopher Moore

Chris Pollett

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

On BPP versus NPcoNP for ordered read-once branching programs.

[BibT_eX]

[DOI]

Rustam Mubarakzjanov

Theor. Comput. Sci., 2001

On Computational Power of Quantum Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.

[BibT_eX]

[DOI]

Svetlana Ablayeva

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

On the Lower Bounds for One-Way Quantum Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On Complexity of Regular (1, +k)-Branching Programs.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1998

A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

On the Power of Randomized Ordered Branching Programs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

1997

Randomization and nondeterminsm are incomparable for ordered read-once branching programs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1997

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On the Power of Randomized Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1994

Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Lower Bounds for One-way Probabilistic Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1989

On Comparing Probabilistic and Deterministic Automata Complexity of Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Probabilistic Automata Complexity of Languages Depends on Language Structure and Error Probability.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

Possibilities of Probabilistic on-line Counting Machines.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1987

1986

Why Sometimes Probabilistic Algorithms Can Be More Effective.

[BibT_eX]

[DOI]