Debajyoti Bera

Bhisham Dev Verma

IEEE Trans. Knowl. Data Eng., April, 2023

QUINT: Node Embedding Using Network Hashing.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., March, 2023

A Generalized Quantum Branching Program.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Bhisham Dev Verma

Data Min. Knowl. Discov., 2022

Efficient Quantum Agnostic Improper Learning of Decision Trees.

[BibT_eX]

[DOI]

Sagnik Chatterjee

CoRR, 2022

Few Quantum Algorithms on Amplitude Distribution.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Quantum Algorithms for Cryptographically Significant Boolean Functions - An IBMQ Experience

[BibT_eX]

[DOI]

Springer Briefs in Computer Science, Springer, ISBN: 978-981-16-3060-6, 2021

Quantum Boosting using Domain-Partitioning Hypotheses.

[BibT_eX]

[DOI]

Sagnik Chatterjee

CoRR, 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Quantum and Randomised Algorithms for Non-linearity Estimation.

[BibT_eX]

[DOI]

CoRR, 2021

SMIM Framework to Generalize High-Utility Itemset Mining.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021

2020

Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem.

[BibT_eX]

[DOI]

Sagnik Chatterjee

CoRR, 2020

Unsupervised Anomaly Detection in Journal-Level Citation Networks.

[BibT_eX]

[DOI]

Baani Leen Kaur Jolly

Lavina Jain

Tanmoy Chakraborty

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.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Modeling location obfuscation for continuous query.

[BibT_eX]

[DOI]

Anuj Shanker Saxena

J. Inf. Secur. Appl., 2019

Mining Top-k Trajectory-Patterns from Anonymized Data.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Error reduction of quantum algorithms.

[BibT_eX]

[DOI]

Tharrmashastha P. V

CoRR, 2019

Efficient Quantum Algorithms Related to Autocorrelation Spectrum.

[BibT_eX]

[DOI]

Subhamoy Maitra

Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

Efficient Sketching Algorithm for Sparse Binary Data.

[BibT_eX]

[DOI]

Karthik Revanuru

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018

Detection and Diagnosis of Single Faults in Quantum Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2018

Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2018

High-utility itemset mining for subadditive monotone utility functions.

[BibT_eX]

[DOI]

CoRR, 2018

Quantum Algorithms for Autocorrelation Spectrum.

[BibT_eX]

[DOI]

Subhamoy Maitra

CoRR, 2018

Maximal Labelled-Clique and Click-Biclique Problems for Networked Community Detection.

[BibT_eX]

[DOI]

Flavio Esposito

Meghan Pendyala

Proceedings of the IEEE Global Communications Conference, 2018

Amplitude Amplification for Operator Identification and Randomized Classes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

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

[BibT_eX]

[DOI]

Jyoti Leeka

Srikanta Bedathur

Sriram Lakshminarasimhan

CoRR, 2017

A hybrid framework for mining high-utility itemsets in a sparse transaction database.

[BibT_eX]

[DOI]

Appl. Intell., 2017

2016

Two-sided Quantum Amplitude Amplification and Exact-Error Algorithms.

[BibT_eX]

[DOI]

CoRR, 2016

Mintra: Mining anonymized trajectories with annotations.

[BibT_eX]

[DOI]

Anuj Shanker Saxena

Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Conference on High Performance Computing, 2016

Frequent-Itemset Mining Using Locality-Sensitive Hashing.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

<i>Quark-X</i>: An Efficient Top-K Processing Framework for RDF Quad Stores.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015

A different Deutsch-Jozsa.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2015

Efficient Reverse k Nearest Neighbor evaluation for hierarchical index.

[BibT_eX]

[DOI]

CoRR, 2015

Finding RkNN Set in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2015

2014

Quantum One-Sided Exact Error Algorithms.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

2013

Efficient Enforcement of Privacy for Moving Object Trajectories.

[BibT_eX]

[DOI]

Anuj Shanker Saxena

Proceedings of the Information Systems Security - 9th International Conference, 2013

2011

A lower bound method for quantum circuits.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

On the impact of seed scheduling in peer-to-peer networks.

[BibT_eX]

[DOI]

Comput. Networks, 2011

Preserving Location Privacy for Continuous Queries on Known Route.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

2010

Efficient universal quantum circuits.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2010

2008

Universal Quantum Circuits.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

2007

Small depth quantum circuits.

[BibT_eX]

[DOI]