bibliographer - Prateek Karandikar

bibliographer a curated TCS bibliography

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

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering Jean Goubault-Larrecq Simon Halfon Prateek Karandikar K. Narayan Kumar Philippe Schnoebelen [github]

The height of piecewise-testable languages and the complexity of the logic of subwords Prateek Karandikar Philippe Schnoebelen [github]

Decidability in the Logic of Subsequences and Supersequences Prateek Karandikar Philippe Schnoebelen [github]

On Reachability for Unidirectional Channel Systems Extended with Regular Tests Petr Jančar Prateek Karandikar Philippe Schnoebelen [github]

Generalized Post Embedding Problems Prateek Karandikar Philippe Schnoebelen [github]

Unidirectional channel systems can be tested Petr Jančar Prateek Karandikar Philippe Schnoebelen [github]

Cutting Through Regular Post Embedding Problems Prateek Karandikar Philippe Schnoebelen [github]

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

[show logs] [hide logs]