Reports and Publications

• D. Bera, Tharrmashastha S.A.P.V. Quantum Query-Space Lower Bounds Using Branching Programs (pre-print)
• D. Bera, Tharrmashastha S.A.P.V. Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks published in ICTCS 2024

• D. Bera, S. Chatterjee. Efficient Quantum Agnostic Improper Learning of Decision Trees published in AISTATS 2024 (pre-print)
• D. Bera, S. Chatterjee. Efficient Quantum Agnostic Improper Learning of Decision Trees presented as poster in QIP 2024
• D. Bera, Tharrmashastha SAPV. A Generalized Quantum Branching Program published in FSTTCS 2023 (pre-print)
• S. Chatterjee, R. Bhatia, P.S. Chani, D. Bera. Quantum Boosting using Domain-Partitioning Hypotheses published in Quantum Machine Intelligence (QMI). Earlier versions:
  • D. Bera, S. Chatterjee. Quantum Boosting using Domain-Partitioning Hypotheses presented as poster in QIP 2022 and was presented in QTML 2022 (pre-print)

• D. Bera, R. Pratap, B. D. Verma. Dimensionality Reduction for Categorical Data published in IEEE Transactions on Knowledge and Data Engineering (TKDE) (pre-print)
• B. D. Verma, R. Pratap, D. Bera. Efficient Binary Embedding of Categorical Data using BinSketch published in ECML/PKDD 2022 journal track (pre-print)
• S. Dawar, D. Bera, V. Goyal. SMIM framework to generalize high-utility itemset mining published in ADMA 2021 (pre-print, poster)
• D. Bera, R. Pratap, B. D. Verma, B. Sen, T. Chakraborty. QUINT: Node embedding using network hashing published by IEEE Transactions on Knowledge and Data Engineering (TKDE) (pre-print)
• D. Bera, Tharrmashastha S.A.P.V. Space efficient quantum algorithms for mode, min-entropy and k-distinctness (pre-print)
• D. Bera, Tharrmashastha S.A.P.V. Quantum and Randomised Algorithms for Non-linearity Estimation published in ACM Transactions on Quantum Computing (TQC) (pre-print)

• S. Chatterjee, D. Bera. Applying the Quantum Alternating Operator Ansatz to the Graph Matching problem published in AQIS 2020 (video, pre-print)
• B.L.K. Jolly, L. Jain, D. Bera, T. Chakraborty. Unsupervised Anomaly Detection in Journal-Level Citation Networks published in JCDL 2020
• D. Bera. Maximal Labeled-Cliques for Structural-Functional Communities published in Complex Networks 2020 (pre-print)

• A. Sharma, G. Bagler, D. Bera. Supervised learning of protein thermal stability using sequence mining and distribution statistics of network centrality (pre-print)
• R. Pratap, D. Bera, K. Revanuru. Efficient Sketching Algorithm for Sparse Binary Data published in ICDM 2019 (draft)
• D. Bera, Tharrmashastha P.V. Error reduction of Quantum Algorithms published in Physical Review A (pre-print)
• D. Bera, S. Maitra, D. Roy, P. Stǎnicǎ. Testing Nonlinearity: Limitation of the BLR Testing and Further Results (Extended Abstract) published in The Eleventh International Workshop on Coding and Cryptography (WCC2019)
• D.Bera, S. Maitra, SAPV Tharrmashastha. Efficient Quantum Algorithms related to Autocorrelation Spectrum published in Indocrypt 2019 (pre-print, presentation)

• A. Saxena, D. Bera, V. Goyal. Modeling Location Obfuscation for Continuous Query published in Journal of Information Security and Applications, vol 44, 130--143 (limited duration direct link), (tech-report)
• D. Bera, F. Esposito, M. Pendyala. Maximal Labelled-Clique and Click-Biclique Problems for Networked Community Detection published in IEEE GLOBECOM 2018 (slides)
• D. Bera. Amplitude Amplification for Operator Identification and Randomized Classes (pre-print) in COCOON 2018    (slides)

• D. Bera. Detection and diagnosis of single faults in quantum circuits in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 37(3), 587‐600, 2017 (preprint version)
• Preliminary version in D. Bera, S. Maitra, S. Roychowdhuri, S. Chakraborty. Diagnosis of single faults in quantum circuits. arXiv:1512.05051, (latest version along with downloadable code and data files)
• S. Dawar, V. Goyal, D. Bera. A hybrid framework for mining high-utility itemsets in a sparse transaction database in Applied Intelligence 10(3):809-827, 2017
• M. Chaitanya, Debarshi Dutta, K. Kothapalli, D. Bera. Applications of Graph Ear Decomposition to Efficient Heterogeneous Shortest Path/Cycle Problems in 19th Workshop on Advances in Parallel and Distributed Computational Models, 2017 IPDPS (2017)
  • Journal version: D. Dutta, M. Chaitanya, K. Kothapalli and D. Bera. Applications of Ear Decomposition to Efficient Heterogeneous Algorithms for Shortest Path/Cycle Problems in International Journal of Networking and Computing, 8(1), 73‐92, 2018.

• C. Pachorkar, M. Chaitanya, K. Kothapalli, D. Bera. Efficient Parallel Ear Decomposition of Graphs with Application to Betweenness-Centrality in HiPC 2016 (best paper award) (pre-print)
• J. Leeka, S. Bedathur, D. Bera, M. Atre. Quark-X: An Efficient Top-K Processing Framework for RDF Quad Stores in CIKM 2016
• D. Bera. Two-sided Quantum Amplitude Amplification and Exact-Error Algorithms in arXiv:1605.01828 [cs.CC] (pre-print)
• Preliminary version in D. Bera. Applications of Quantum Amplitude Amplification in ECCC Tech Report TR14-151 (revised April 2016)
• D.Bera, R. Pratap. Frequent-Itemset Mining using Locality-Sensitive Hashing in Proceedings of COCOON 2016 (preprint)
• A. Saxena, V. Goyal, D. Bera. Mintra: Mining anonymized trajectories with annotations in Proceedings of IDEAS 2016

• K. Newaz, K. Sriram, D. Bera. Identification of Major Signaling Pathways in Prion Disease Progression Using Network Analysis in PLoS ONE 10(12): e0144389 2015
• D. Bera. A Different Deutsch-Jozsa in Quantum Information Processing 14(6), 1777-1785, 2015 (pdf)
• P. Sahu, P. Aggarwal, V. Goyal, D. Bera. Finding RkNN Set in Directed Graphs in Proceedings of ICDCIT 2015

• A. Saxena, V. Goyal, D. Bera. Efficient Enforcement of Privacy for Moving Object Trajectories in Proceedings of ICISS 2013
• A. Saxena, M. Pundir, V. Goyal, D. Bera. Preserving Location Privacy for Continuous Queries on Known Route in Proceedings of ICISS 2011
• F. Esposito, I. Matta, D. Bera, P. Michiardi. On the impact of seed scheduling in peer-to-peer networks in Computer Networks 55(15), 3303-3317, 2011
• D. Bera. A lower bound method for quantum circuits Information Processing Letters, 111(15), 723-726, 2011
• Preliminary version in D. Bera. A New Lower Bound Technique for Quantum Circuits without Ancillae BUCS Tech Report 2008-015

• D. Bera. Quantum Circuits: Power and Limitations Ph.D. Dissertation, 2009
• Monograph Quantum Circuit Complexity: Low Depth Quantum Circuits: Power and Limitations
• D. Bera, S. Homer. On Finding Sensitivity of Quantum and Classical Gates BUCS Tech Report 2009-019, 2009
• D.Bera, S. Fenner, F. Green, S. Homer. Efficient universal quantum circuits in Quantum Information and Computation, 10(1&2), 0016-0027, 2010
• Preliminary version in D.Bera, S. Fenner, F. Green, S. Homer. Efficient universal quantum circuits COCOON 2009, ECCC Tech Report TR08-078
• D.Bera, F. Green, S. Homer. Small depth quantum circuits ACM SIGACT News article, 38(2), June 2007

Loading talks...