Debajyoti Bera

Orcid: 0000-0002-1626-7514

According to our database1, Debajyoti Bera authored at least 48 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum Query-Space Lower Bounds Using Branching Programs.
CoRR, 2024

Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Efficient Quantum Agnostic Improper Learning of Decision Trees.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Quantum boosting using domain-partitioning hypotheses.
Quantum Mach. Intell., December, 2023

Dimensionality Reduction for Categorical Data.
IEEE Trans. Knowl. Data Eng., April, 2023

QUINT: Node Embedding Using Network Hashing.
IEEE Trans. Knowl. Data Eng., March, 2023

A Generalized Quantum Branching Program.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Efficient binary embedding of categorical data using BinSketch.
Data Min. Knowl. Discov., 2022

Efficient Quantum Agnostic Improper Learning of Decision Trees.
CoRR, 2022

Few Quantum Algorithms on Amplitude Distribution.
CoRR, 2022

2021
Quantum Algorithms for Cryptographically Significant Boolean Functions - An IBMQ Experience
Springer Briefs in Computer Science, Springer, ISBN: 978-981-16-3060-6, 2021

Quantum Boosting using Domain-Partitioning Hypotheses.
CoRR, 2021

Space efficient quantum algorithms for mode, min-entropy and k-distinctness.
CoRR, 2021

Quantum and Randomised Algorithms for Non-linearity Estimation.
CoRR, 2021

SMIM Framework to Generalize High-Utility Itemset Mining.
Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021

2020
Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem.
CoRR, 2020

Unsupervised Anomaly Detection in Journal-Level Citation Networks.
Proceedings of the JCDL '20: Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020, 2020

Maximal Labeled-Cliques for Structural-Functional Communities.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Modeling location obfuscation for continuous query.
J. Inf. Secur. Appl., 2019

Mining Top-k Trajectory-Patterns from Anonymized Data.
CoRR, 2019

A one-phase tree-based algorithm for mining high-utility itemsets from a transaction database.
CoRR, 2019

Error reduction of quantum algorithms.
CoRR, 2019

Efficient Quantum Algorithms Related to Autocorrelation Spectrum.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Efficient Sketching Algorithm for Sparse Binary Data.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018
Detection and Diagnosis of Single Faults in Quantum Circuits.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems.
Int. J. Netw. Comput., 2018

High-utility itemset mining for subadditive monotone utility functions.
CoRR, 2018

Quantum Algorithms for Autocorrelation Spectrum.
CoRR, 2018

Maximal Labelled-Clique and Click-Biclique Problems for Networked Community Detection.
Proceedings of the IEEE Global Communications Conference, 2018

Amplitude Amplification for Operator Identification and Randomized Classes.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
STREAK: An Efficient Engine for Processing Top-k SPARQL Queries with Spatial Filters.
CoRR, 2017

A hybrid framework for mining high-utility itemsets in a sparse transaction database.
Appl. Intell., 2017

2016
Two-sided Quantum Amplitude Amplification and Exact-Error Algorithms.
CoRR, 2016

Mintra: Mining anonymized trajectories with annotations.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality.
Proceedings of the 23rd IEEE International Conference on High Performance Computing, 2016

Frequent-Itemset Mining Using Locality-Sensitive Hashing.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

<i>Quark-X</i>: An Efficient Top-K Processing Framework for RDF Quad Stores.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
A different Deutsch-Jozsa.
Quantum Inf. Process., 2015

Efficient Reverse k Nearest Neighbor evaluation for hierarchical index.
CoRR, 2015

Finding RkNN Set in Directed Graphs.
Proceedings of the Distributed Computing and Internet Technology, 2015

2014
Quantum One-Sided Exact Error Algorithms.
Electron. Colloquium Comput. Complex., 2014

2013
Efficient Enforcement of Privacy for Moving Object Trajectories.
Proceedings of the Information Systems Security - 9th International Conference, 2013

2011
A lower bound method for quantum circuits.
Inf. Process. Lett., 2011

On the impact of seed scheduling in peer-to-peer networks.
Comput. Networks, 2011

Preserving Location Privacy for Continuous Queries on Known Route.
Proceedings of the Information Systems Security - 7th International Conference, 2011

2010
Efficient universal quantum circuits.
Quantum Inf. Comput., 2010

2008
Universal Quantum Circuits.
Electron. Colloquium Comput. Complex., 2008

2007
Small depth quantum circuits.
SIGACT News, 2007


  Loading...