Rajendra Kumar
@Kumar__Rajendra
Followers
126
Following
237
Media
1
Statuses
54
Assistant Professor of Computer Science at IIT Delhi. Lattices and Post-Quantum Cryptography.
India
Joined December 2017
RT @cseiitd: Interested in learning about fundamental and cutting-edge research on data privacy? . Check out the summer school and workshop….
0
2
0
RT @cseiitd: Job Alert 📩.Interested in exploring post-quantum cryptography? .Join Prof. Rajendra Kumar (@Kumar__Rajendra) and Prof. Vireshw….
0
2
0
RT @cseiitd: CSE IITD is now officially on X! 🎓 Follow us for updates on research, events, faculty achievements, and academic opportunities….
0
5
0
RT @karthikcs_: Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for g….
0
9
0
RT @huckbennett: I'm looking to hire one or two Ph.D. students for Fall '24 to work on problems related to lattices, error-correcting codes….
0
13
0
Super excited to share that our paper on "Why we couldn't prove SETH hardness of the Closest Vector  Problem for even norms" has been accepted to FOCS'23. Joint work with @diveshaggarwal . Refer to @huckbennett 's tweet for an insightful description of this result.
@diveshaggarwal and @Kumar__Rajendra just posted a new paper that I'm very excited about: It addresses a problem that my coauthors and I spent 5 years working on without success: showing fine-grained hardness of SVP and CVP in the l_2 norm under SETH. 1/4.
0
3
23
Excited to announce that I am on the academic job market this year. Please reach out with opportunities! . My research focuses on the foundations of Post-Quantum Cryptography. For more details, check out: (RTs are appreciated).
0
6
16
Really excited about our new paper on the Lattice Problems Beyond Polynomial Time. Check out this excellent thread by @NoahSD .
Super excited about this new paper (with MANY awesome co-authors): Lattice Problems Beyond Polynomial Time . We revisit four foundational results in the complexity of lattice problems and show how to generalize them, well, beyond polynomial time.
0
1
12
RT @cstheory: Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem! https://t.co….
0
1
0
RT @NIST: As we prepare for the possible assault of a future quantum computer, NIST has chosen the first group of tools for our post-quantu….
0
311
0
RT @sigact: Congratulations to.Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan,.winners of the 2022 Gödel prize. .
0
84
0
RT @huckbennett: A thread on the Integer Programming Problem (IP), based on notes for my class: Highlights of not….
0
6
0
RT @NobelPrize: What is the meaning of life? . Hear 2021 chemistry laureate Benjamin List answer the question we all are trying to find an….
0
189
0
RT @ArindamPhysics: Delighted to announce the establishment of a Quantum Research Park at @iiscbangalore seed funded by the #Karnataka Inno….
0
44
0
RT @diptarka1989: Are you going to graduate soon / looking for postdoc opportunities? Are you interested in big data algorithms, streaming,….
0
4
0
RT @ashleyruba: So you're going to do a PhD! Yay! Here's my best advice:. 1) Don't work nights/weekends unless you have a hard deadline. Wo….
0
5K
0
RT @orangebook_: Retrospectively, the happiest moments of your life aren’t when you have everything you want. It’s when you are striving f….
0
379
0