Andreas Krebs - Citegraph

Author Info

Name	Affiliation	Papers
ANDREAS KREBS	Univ Tubingen, Wilhelm Schickard Inst, D-72076 Tubingen, Germany	23
Collaborators	Citations	PageRank
28	21	8.20
Referers	Referees	References
35	224	159

Search Limit

100224

Publications (23 rows)

Collaborators (28 rows)

Referers (35 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Diminishable Parameterized Problems And Strict Polynomial Kernelization	0	0.34	2020
Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership.	0	0.34	2019
Team Semantics for the Specification and Verification of Hyperproperties.	2	0.37	2018
Difference hierarchies and duality with an application to formal languages	0	0.34	2018
Wreath Products of Distributive Forest Algebras.	0	0.34	2018
Diminishable Parameterized Problems and Strict Polynomial Kernelization.	0	0.34	2018
An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation.	1	0.37	2018
A Unified Method for Placing Problems in Polylogarithmic Depth.	0	0.34	2017
Better Complexity Bounds for Cost Register Automata.	0	0.34	2017
Stone duality for languages and complexity.	0	0.34	2017
Stone Duality and the Substitution Principle.	1	0.40	2017
Problems on Finite Automata and the Exponential Time Hypothesis.	2	0.38	2017
Better Complexity Bounds for Cost Register Machines.	0	0.34	2017
Ultrafilters on words for a fragment of logic.	3	0.38	2016
Two-variable Logic with a Between Predicate.	0	0.34	2016
Using Duality in Circuit Complexity.	1	0.35	2016
Relating two width measures for resolution proofs.	0	0.34	2016
Two-variable Logic with a Between Relation.	2	0.40	2016
EF plus EX Forest Algebras	0	0.34	2015
A Team Based Variant of CTL	4	0.40	2015
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth	4	0.41	2015
The model checking fingerprints of CTL operators.	0	0.34	2015
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy	1	0.35	2013