bibliographer - Heribert Vollmer

bibliographer a curated TCS bibliography

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

Nondeterministic NC1 Computation Hervé Caussinus Pierre McKenzie Denis Thérien Heribert Vollmer [github]

Counting classes and the fine structure between NC1 and L Samir Datta Meena Mahajan B.V. Raghavendra Rao Michael Thomas Heribert Vollmer [github]

A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits Anselm Haak Heribert Vollmer [github]

Descriptive complexity of P functions: A new perspective Arnaud Durand Anselm Haak Juha Kontinen Heribert Vollmer [github]

Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth Arnaud Durand Anselm Haak Heribert Vollmer [github]

Descriptive Complexity of AC^0 Functions Arnaud Durand Anselm Haak Juha Kontinen Heribert Vollmer [github]

Counting of Teams in First-Order Team Logics Anselm Haak Juha Kontinen Fabian Muller Heribert Vollmer Fan Yang [github]

Dependence Logic with a Majority Quantifier Arnaud Durand Johannes Ebbing Juha Kontinen Heribert Vollmer [github]

The Satanic Notations: Counting Classes beyond P and Other Definitional Adventures Lane A. Hemaspaandra Heribert Vollmer [github]

Finite Automata with Generalized Acceptance Criteria Timo Peichl Heribert Vollmer [github]

A Generalization of the Buchi-Elgot-Trakhtenbrot Theorem Matthias Galota Heribert Vollmer [github]

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

[show logs] [hide logs]