bibliographer - Neil Immerman

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Multi-Structural Games and Beyond Marco Carmosino Ronald Fagin Neil Immerman Phokion Kolaitis Jonathan Lenchner Rik Sengupta [github]

On the Number of Quantifiers Needed to Define Boolean Functions Marco Carmosino Ronald Fagin Neil Immerman Phokion Kolaitis Jonathan Lenchner Rik Sengupta [github]

What Juris Hartmanis taught me about Reductions Neil Immerman [github]

On uniformity within NC1 David A. Mix Barrington Neil Immerman Howard Straubing [github]

Languages that Capture Complexity Classes Neil. Immerman [github]

Languages Which Capture Complexity Classes Neil Immerman [github]

On the Unusual Effectiveness of Logic in Computer Science Joseph Y. Halpern Robert Harper Neil Immerman Phokion G. Kolaitis Moshe Y. Vardi Victor Vianu [github]

Describing Graphs: A First-Order Approach to Graph Canonization Neil Immerman Eric Lander [github]

Dyn-FO: A Parallel, Dynamic Complexity Class Sushant Patnaik Neil Immerman [github]

An optimal lower bound on the number of variables for graph identification Jin-Yi Cai Martin Fürer Neil Immerman [github]

First-order expressibility of languages with neutral letters or: The Crane Beach conjecture David A. Mix Barrington Neil Immerman Clemens Lautemann Nicole Schweikardt Denis Thérien [github]

Relational queries computable in polynomial time Neil Immerman [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]