Himanshu Shukla

202020212022202320241 3 4 2

Public access

1 article

0 articles

available

not available

Based on funding mandates

satyadev nandakumarIndian Institute of Technology, KanpurVerified email at cse.iitk.ac.in
Diptarka ChakrabortySchool of Computing, National University of SingaporeVerified email at comp.nus.edu.sg
Amit KuberIndian Institute of Technology, KanpurVerified email at iitk.ac.in

Himanshu Shukla

Max Planck Institute for Computer Science

Verified email at mpi-inf.mpg.de - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
How many zeros of a random sparse polynomial are real? G Jindal, A Pandey, H Shukla, C Zisopoulos Proceedings of the 45th International Symposium on Symbolic and Algebraic …, 2020	7	2020
On resource-bounded versions of val Lambalgen's theorem D Chakraborty, S Nandakumar, H Shukla TAMC 2017, 2017	4	2017
Definable combinatorics with dense linear orders. H Shukla, A Jain, A Kuber https://arxiv.org/abs/1807.06097, 2018		2018
A CANTOR-ZASSENHAUS TYPE ALGORITHM FOR POLYNOMIAL FACTORING OVER FINITE FIELDS H SHUKLA
GNERALISED FORM OF BURGESS’LEMMA 2 AND EASIER PROOF OF DETERMINISTIC BOUND ON POLYNOMIAL FACTORING A OJHA, H SHUKLA

The system can't perform the operation now. Try again later.

Articles 1–5

Citations per year