Nikhil Balaji, Computer Science and Engineering, IIT Delhi

0 comments

No comments yet. Start the thread.

This semester

COD891
M.Tech. Minor Projectrunning now
3 (0-0-6) credits · Slot X
unrated
COD892
M.Tech. Project Part-Irunning now
7 (0-0-14) credits · Slot X
unrated
COD893
M.Tech. Project Part-IIrunning now
14 (0-0-28) credits · Slot X
unrated
CON8001
Research Practicum in Computer Science and Engineeringrunning now
4 (0-0-8) credits · Slot X
unrated
CON801
Research Practicum in Computer Science and Engineeringrunning now
5 (1-0-8) credits · Slot X
unrated
COS7099
Independent Studyrunning now
3 (0-3-0) credits · Slot X
unrated
COS799
Independent Studyrunning now
3 (0-3-0) credits · Slot X
unrated

Earlier

Each course has its own page and discussion.

Doing a BTP, MTP, PhD, internship or RA position under Balaji, scored on five separate axes.

Filter by role

All 0

Aggregate bars appear once there are 3 reviews. None yet — if you have worked with this professor, yours would be the first.

Write a supervision reviewStart

Your role *When *

A review is close to worthless without knowing whether this was a one-semester BTP or four years of a PhD.

Mentorship5

1 · left yourself to itclosely guided · 10

Availability5

1 · weeks to get a replyresponds same day · 10

Freedom5

1 · told exactly what to dopicked my own direction · 10

Workload5

1 · lightpunishing · 10

Credit5

1 · contribution went unacknowledgedscrupulously fair on authorship · 10

These are deliberately not all “high is good”. Someone who wants heavy guidance and someone who wants total autonomy are looking for opposite ends of the Freedom axis. Answer honestly about what it was like; readers will judge fit.

Would you work with them again? *

YesNo

Anything else (optional)

One review per person per professor; you can edit it later. Posted under an anonymous handle.

No reviews yet.

Areas listed by the department

Automata TheoryQuantitative VerificationComputational Complexity..

Publications, via OpenAlex

4h-index

66Citations

28Works

2i10

Topic clusters

Complexity and Algorithms in GraphsAdvanced Graph Theory Researchsemigroups and automata theoryPolynomial and algebraic computationComputability, Logic, AI Algorithms

Most recent

Approximate Polynomial Satisfiability is in the Counting Hierarchy · arXiv (Cornell University), 2026
On the Arithmetic Complexity of Euler Tours · Lecture notes in computer science, 2026
A parametric version of the Hilbert Nullstellensatz · Society for Industrial and Applied Mathematics eBooks, 2025 · 3 citations
USSR is in P/poly · Society for Industrial and Applied Mathematics eBooks, 2024 · 1 citations
USSR is in P/poly · arXiv (Cornell University), 2023

Matched to Nikhil Balaji on OpenAlex. Author matching is by name and institution and can be wrong for common names.

Loading from OpenAlex…