Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules
S. Gupta, P. Jain, S. Saurabh, N. Talmon
Algorithmica (accepted)
(preliminary version appeared in IJCAI 2021)
Parameterized Approximation Algorithms for MAX-SAT with Cardinality Constraint and Maximum Coverage
P. Jain, L. Kanesh, F. Panolan, S. Saha, A. Sahu, S. Saurabh, A. Upasana
SODA 2023
More Effort Towards Multiagent Knapsack
S. Gupta, P. Jain, S. Seetharaman
SOFSEM 2023
Preserving Consistency for Liquid Knapsack Voting
P. Jain, K. Sornat, N. Talmon
EUMAS 2022
Gehrlein Stable Committee with Multimodal Preferences
S. Gupta, P. Jain, D. Lokshtanov, S. Roy, and S. Saurabh
SAGT 2022
Scatter search for the minimum leaf spanning tree problem
Y.S. Kardam, K. Srivastava, P. Jain, R. Marti
Computers & Operations Research
On The Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers.
Tapas Chatterjee, Ayantika Laha, Somitra Kr Sanadhya
IEEE Transactions on Information Theory. Link.
Implementing Grover Oracle for Lightweight Block Ciphers under Depth Constraints
Subodh Bijwe, Amit Kumar Chauhan, Somitra Kr Sanadhya
ACISP 2022
FbHash-E: A time and memory efficient version of FbHash similarity hashing algorithm
Monika Singh, Anviksha Khunteta, Mohona Ghosh, Donghoon Chang, Somitra Kr Sanadhya
Forensic Science International: Digital Investigation
Design and Analysis of FPGA-Based PUFs with Enhanced Performance for Hardware-Oriented Security
N. Nalla Anandakumar, Mohammad S. Hashmi, Somitra Kr Sanadhya
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Field Programmable Gate Array based Elliptic Curve Menezes-Qu-Vanstone key agreement protocol realization using Physical Unclonable Function and true random number generator primitives
N. Nalla Anandakumar, Mohammad S. Hashmi, Somitra Kr Sanadhya
IET Circuits, Devices & Systems
Finding Geometric Representations of Apex Graphs is NP-Hard
D. Chakraborty, K. Gajjar
Conference and Workshops on Algorithms and Computation (WALCOM), 2022 (paper)
Invited to special issue of Theoretical Computer Science (TCS)
Reconfiguring Shortest Paths in Graphs
K. Gajjar, A. Jha, M. Kumar, A. Lahiri
Conference on Association for the Advancement of Artificial Intelligence (AAAI), 2022 (paper)
Gerrymandering on graphs: Computational complexity and parameterized algorithms
S. Gupta, P. Jain, F. Panolan, S. Roy, and S. Saurabh
SAGT 2021
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
S. Gunda, P. Jain, D. Lokshtanov, S. Saurabh, P. Tale
ACM Transactions on Computation Theory
(preliminary version appeared in APPROX 2020)
Participatory Budgeting with Project Groups
P. Jain, K. Sornat, N. Talmon, M. Zehavi
IJCAI 2021
Quantum free-start collision attacks on double block length hashing with round-reduced AES-256
A. K. Chauhan, A. Kumar, and S. Sanadhya
IACR Transactions on Symmetric Cryptology (ToSC), Vol. 2021, Issue 1.
The Parameterized Complexity of Walk-and-Hit Problems
L. Kanesh, P. Jain, S. K. Roy, S. Saurabh, and R. Sharma
CIAC 2021
Partition Aggregation for Participatory Budgeting
L. Bulteau, P. Jain, and N. Talmon
AAMAS 2021.
Preserving Consistency for Knapsack Voting (Extended Abstract)
P. Jain, K. Sornat, and N. Talmon
AAMAS 2021.
Parameterized complexity of d-hitting set with Quotas
S. Gupta, P. Jain, A. Petety, and S. Singh
SOFSEM 2021.
Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256
Amit Kumar Chauhan, Abhishek Kumar, Somitra Kr Sanadhya
IACR Transactions on Symmetric Cryptology (ToSC)
Generalized Parametric Path Problems
K. Gajjar, G. Varma, P. Chatterjee, J. Radhakrishnan
Uncertainty in Artificial Intelligence (UAI), 2021 (paper)
Selected for long talk at UAI
The Space Complexity of Sum Labelling
H. Fernau, K. Gajjar
Symposium on Fundamentals of Computation Theory (FCT), 2021 (paper)
Approximating the Center Ranking Under Ulam
D. Chakraborty, K. Gajjar, A. Jha
Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2021 (paper)
On the (Parameterized) Complexity of Almost Stable Marriage
S. Gupta, P. Jain, S. Roy, S. Saurabh, M. Zehavi
FSTTCS 2020.
Counting Active S-boxes is not enough
O. Dunkelman, A. Kumar, E. Lambooij, S. K. Sanadhya
INDOCRYPT 2020.
Quantum Resource Estimates of Grover’s Key Search on ARIA.
A. Kumar Chauhan, S. K. Sanadhya
SPACE 2020.
Efficient and Lightweight FPGA-based Hybrid PUFs with Improved Performance.
N. Anandakumar, M. Hashmi, S. K. Sanadhya
Microprocessors and Microsystems. Vol. 77. Elsevier.
Design, Implementation And Analysis of Hardware-based Security Primitives.
N. Anandakumar, S. K. Sanadhya , M. Hashmi.
2020 IFIP/IEEE 28th International Conference on Very Large Scale Integration (VLSI-SOC 2020)