BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Hungary
1 × Portugal
1 × Spain
1 × Switzerland
2 × Canada
2 × Czech Republic
2 × France
2 × Italy
3 × Germany
3 × United Kingdom
Collaborated with:
N.Creignou M.Thomas A.Meier M.Bauland P.McKenzie T.Schwentick D.Thérien J.Kontinen P.Lohmann M.Galota T.Peichl H.Schnoor O.Beyersdorff J.Müller P.Chapdelaine M.Hermann R.V.Book K.W.Wagner J.Schmidt E.Böhler E.Hemaspaandra S.Reith A.D.0001 A.Haak S.Müller T.Schneider I.Schnoor R.Ktari F.Olive
Talks about:
complex (10) logic (6) general (5) parameter (3) default (3) conjunct (2) automata (2) approach (2) theorem (2) satisfi (2)

Person: Heribert Vollmer

DBLP DBLP: Vollmer:Heribert

Contributed to:

CSL 20152015
LATA 20152015
LATA 20122012
SAT 20122012
CSL 20102010
SAT 20102010
SAT 20092009
CSL 20082008
FoSSaCS 20072007
SAT 20042004
SAT 20042005
DLT 20032003
CSL 20022002
CSL 20012001
DLT 20012001
ICALP 20002000
ICALP 19991999
ICALP 19961996
CSL 19901990
CSL 20162016

Wrote 20 papers:

CSL-2015-KontinenMSV #semantics #theorem
A Van Benthem Theorem for Modal Team Semantics (JK, JSM, HS, HV), pp. 277–291.
LATA-2015-CreignouKMMOV #problem
Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.
LATA-2012-MeierSTV #complexity #logic #on the
On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
SAT-2012-CreignouV #complexity #problem #satisfiability
Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.
CSL-2010-LohmannV #complexity #dependence #logic
Complexity Results for Modal Dependence Logic (PL, HV), pp. 411–425.
SAT-2010-BeyersdorffMMTV #complexity #logic #proving
Proof Complexity of Propositional Default Logic (OB, AM, SM, MT, HV), pp. 30–43.
SAT-2009-BeyersdorffMTV #complexity #logic #reasoning
The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.
Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.
FoSSaCS-2007-BaulandSSSV #complexity #linear #logic #satisfiability
The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.
SAT-2004-BaulandCCHV #algebra #approach #complexity #query
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.
SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.
DLT-2003-Vollmer #complexity
Complexity Theory Made Easy (HV), pp. 95–110.
CSL-2002-BohlerHRV #constraints #equivalence #morphism
Equivalence and Isomorphism for Boolean Constraint Satisfaction (EB, EH, SR, HV), pp. 412–426.
CSL-2001-GalotaV #automaton #theorem
A Generalization of the Büchi-Elgot-Trakhtenbrot Theorem (MG, HV), pp. 355–368.
DLT-2001-SchwentickTV #automaton
Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.
The Many Faces of a Translation (PM, TS, DT, HV), pp. 890–901.
ICALP-1999-PeichlV #automaton #finite
Finite Automata with Generalized Acceptance Criteria (TP, HV), pp. 605–614.
ICALP-1996-BookVW #on the #probability #quantifier
On Type-2 Probabilistic Quantifiers (RVB, HV, KWW), pp. 369–380.
CSL-1990-Vollmer #revisited
The Gap-Language-Technique Revisited (HV), pp. 389–399.
CSL-2016-0001HKV #complexity
Descriptive Complexity of #AC0 Functions (AD0, AH, JK, HV), p. 16.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.