Kamil Khadiev

Orcid: 0000-0002-5151-9908

According to our database1, Kamil Khadiev authored at least 47 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum algorithms for SCS and text assembling problems.
Quantum Inf. Comput., March, 2024

Time Efficient Implementation for Online k-server Problem on Trees.
CoRR, 2024

2023
Quantum bounds for 2D-grid and Dyck language.
Quantum Inf. Process., May, 2023

Quantum Circuit for Random Forest Prediction.
CoRR, 2023

Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems.
CoRR, 2023

2022
Two-way and one-way quantum and classical automata with advice for online minimization problems.
Theor. Comput. Sci., 2022

Exact Affine Counter Automata.
Int. J. Found. Comput. Sci., 2022

Lecture Notes on Quantum Algorithms.
CoRR, 2022

Noisy Tree Data Structures and Quantum Applications.
CoRR, 2022

The Fast Algorithm for Online k-server Problem on Trees.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Upperbounds on the probability of finding marked connected components using quantum walks.
Quantum Inf. Process., 2021

Classical and quantum algorithms for constructing text from dictionary problem.
Nat. Comput., 2021

Error-Free Affine, Unitary, and Probabilistic OBDDs.
Int. J. Found. Comput. Sci., 2021

Quantum Algorithm for the Longest Trail Problem.
CoRR, 2021

The Quantum Version of Prediction for Binary Classification Problem by Ensemble Methods.
CoRR, 2021

Quantum Algorithm for the Shortest Superstring Problem.
CoRR, 2021

Quantum Algorithm for Dyck Language with Multiple Types of Brackets.
Proceedings of the Unconventional Computation and Natural Computation, 2021

Fast Classical and Quantum Algorithms for Online k-server Problem on Trees.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Quantum request-answer game with buffer model for online algorithms. Application for The Most Frequent Keyword Problem.
Proceedings of the Joint Proceedings of the Workshops on Quantum Information Technologies and Edge Computing (QuaInT+doors 2021), 2021

2020
A Fast Algorithm for Online k-servers Problem on Trees.
CoRR, 2020

On quantum methods for machine learning problems part II: Quantum classification algorithms.
Big Data Min. Anal., 2020

On quantum methods for machine learning problems part I: Quantum tools.
Big Data Min. Anal., 2020

Quantum-over-Classical Advantage in Solving Multiplayer Games.
Proceedings of the Reachability Problems - 14th International Conference, 2020

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Quantum Query Complexity of Dyck Languages with Bounded Height.
CoRR, 2019

The Quantum Version Of Classification Decision Tree Constructing Algorithm C5.0.
CoRR, 2019

Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs.
Proceedings of the Unconventional Computation and Natural Computation, 2019

Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems.
Proceedings of the Theory and Practice of Natural Computing - 8th International Conference, 2019

Two-Way Quantum and Classical Automata with Advice for Online Minimization Problems.
Proceedings of the Formal Methods. FM 2019 International Workshops, 2019

On the Quantum and Classical Complexity of Solving Subtraction Games.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
On the Complexity of Solving Subtraction Games.
CoRR, 2018

Quantum Dynamic Programming Algorithm for DAGs. Applications for AND-OR DAG Evaluation and DAG's Diameter Search.
CoRR, 2018

Quantum Online Streaming Algorithms with Constant Number of Advice Bits.
CoRR, 2018

New Size Hierarchies for Two Way Automata.
CoRR, 2018

Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Classical and Quantum Computations with Restricted Memory.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies.
Electron. Colloquium Comput. Complex., 2017

Quantum versus Classical Online Algorithms with Advice and Logarithmic Space.
CoRR, 2017

Quantum Online Algorithms with Respect to Space Complexity.
CoRR, 2017

Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test.
CoRR, 2017

Exact Affine OBDDs.
CoRR, 2017

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

Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
On the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs.
CoRR, 2016

2015
Width Hierarchy for <i>k</i>-OBDD of Small Width.
Electron. Colloquium Comput. Complex., 2015

Width Hierarchy for k-OBDD of Small Width.
CoRR, 2015

2014
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.
Proceedings of the Descriptional Complexity of Formal Systems, 2014


  Loading...