Nikos Karalias
@stalence.bsky.social
postdoc at MIT CSAIL working on solving combinatorial problems with neural networks
Reposted by Nikos Karalias
Can LLMs reason about combinatorial problems?
Join DiffCoALG @neuripsconf.bsky.social 2025 — where discrete algorithms meet differentiable ML.
📅 Deadline: *extended* to Aug 31 (AOE)!
🔗 sites.google.com/view/diffcoa...
Join DiffCoALG @neuripsconf.bsky.social 2025 — where discrete algorithms meet differentiable ML.
📅 Deadline: *extended* to Aug 31 (AOE)!
🔗 sites.google.com/view/diffcoa...
DiffCoALG@NeurIPS 2025
About this Workshop
Combinatorial algorithms are fundamental across a wide range of domains, owing to their ability to model optimization and decision-making tasks under complex constraints. These alg...
sites.google.com
August 24, 2025 at 7:06 AM
Can LLMs reason about combinatorial problems?
Join DiffCoALG @neuripsconf.bsky.social 2025 — where discrete algorithms meet differentiable ML.
📅 Deadline: *extended* to Aug 31 (AOE)!
🔗 sites.google.com/view/diffcoa...
Join DiffCoALG @neuripsconf.bsky.social 2025 — where discrete algorithms meet differentiable ML.
📅 Deadline: *extended* to Aug 31 (AOE)!
🔗 sites.google.com/view/diffcoa...
Reposted by Nikos Karalias
🔥 New workshop at @neuripsconf.bsky.social!
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized.
📌 Submit by Aug 22! 🤖🧠
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized.
📌 Submit by Aug 22! 🤖🧠
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG@NeurIPS 2025
About this Workshop
Combinatorial algorithms are fundamental across a wide range of domains, owing to their ability to model optimization and decision-making tasks under complex constraints. These alg...
sites.google.com
August 12, 2025 at 2:16 PM
🔥 New workshop at @neuripsconf.bsky.social!
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized.
📌 Submit by Aug 22! 🤖🧠
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized.
📌 Submit by Aug 22! 🤖🧠
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
Reposted by Nikos Karalias
🔥 New workshop at @neuripsconf.bsky.social!
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized end-to-end.
📌 Submit by Aug 22!
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized end-to-end.
📌 Submit by Aug 22!
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG@NeurIPS 2025
About this Workshop
Combinatorial algorithms are fundamental across a wide range of domains, owing to their ability to model optimization and decision-making tasks under complex constraints. These alg...
sites.google.com
August 12, 2025 at 12:59 PM
🔥 New workshop at @neuripsconf.bsky.social!
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized end-to-end.
📌 Submit by Aug 22!
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
DiffCoALG bridges the gap between classic algorithms & differentiable learning.
Think: LLM reasoning, routing, SAT, MIP — neurally optimized end-to-end.
📌 Submit by Aug 22!
🔗 sites.google.com/view/diffcoa...
#NeurIPS2025
Reposted by Nikos Karalias
New paper: Simulating Time With Square-Root Space
people.csail.mit.edu/rrw/time-vs-...
It's still hard for me to believe it myself, but I seem to have shown that TIME[t] is contained in SPACE[sqrt{t log t}].
To appear in STOC. Comments are very welcome!
people.csail.mit.edu/rrw/time-vs-...
It's still hard for me to believe it myself, but I seem to have shown that TIME[t] is contained in SPACE[sqrt{t log t}].
To appear in STOC. Comments are very welcome!
people.csail.mit.edu
February 21, 2025 at 10:19 PM
New paper: Simulating Time With Square-Root Space
people.csail.mit.edu/rrw/time-vs-...
It's still hard for me to believe it myself, but I seem to have shown that TIME[t] is contained in SPACE[sqrt{t log t}].
To appear in STOC. Comments are very welcome!
people.csail.mit.edu/rrw/time-vs-...
It's still hard for me to believe it myself, but I seem to have shown that TIME[t] is contained in SPACE[sqrt{t log t}].
To appear in STOC. Comments are very welcome!