Author Info
Name
Affiliation
Papers
ANDREAS KREBS
University of Tübingen, Germany
12
Collaborators
Citations 
PageRank 
19
3
4.15
Referers 
Referees 
References 
7
81
74
Title
Citations
PageRank
Year
Visibly Pushdown Languages and Free Profinite Algebras.00.342018
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy.00.342018
On Distinguishing NC ^1 1 and NL.00.342015
Value Automata with Filters00.342015
Visibly Counter Languages and the Structure of \mathrm NC^1.00.342015
Positive and negative proofs for circuits and branching programs00.342014
DLOGTIME Proof Systems.00.342013
Counting Paths in VPA Is Complete for #NC 110.372012
Dense completeness00.342012
Low uniform versions of NC1.10.362011
Counting Paths in VPA Is Complete for #NC110.372010
Languages with Bounded Multiparty Communication Complexity00.342006