Klaus-Jörn Lange
ScholarGPS® ID: 75030912272632
Affiliation History
Discipline
Computer Science
Top Specialties
Control Theory
Metrics Summary
Publication Count
61
Predicted Citations
778
Predicted h-index
15
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
Add
Delete
|
---|
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy (book chapter) In Language and Automata Theory and Applications Springer International Publishing (2018) |
A Language-Theoretical Approach to Descriptive Complexity (book chapter) In Developments in Language Theory Springer Berlin Heidelberg (2016) |
On Distinguishing NC1 and NL (journal article) Lecture Notes in Computer Science, volume 9168 (2015). |
Visibly Counter Languages and the Structure of NC1 (journal article) Lecture Notes in Computer Science, volume 9235 (2015). |
Symposium on Theoretical Aspects of Computer Science (2015) München, Germany |
On Distinguishing NC $$^1$$ and NL (book chapter) In Developments in Language Theory Springer International Publishing (2015) |
Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$ (book chapter) In Mathematical Foundations of Computer Science 2015 Springer Berlin Heidelberg (2015) |
The Boolean Formula Value Problem as Formal Language (book chapter) In Languages Alive Springer Berlin Heidelberg (2012) |
The Lower Reaches of Circuit Uniformity (book chapter) In Mathematical Foundations of Computer Science 2012 Springer Berlin Heidelberg (2012) |
Dense Completeness (book chapter) In Developments in Language Theory Springer Berlin Heidelberg (2012) |
2010 IEEE 25th Annual Conference on Computational Complexity (CCC) (2010) Cambridge, MA, USA |
Variationen über Walther von Dyck und Dyck-Sprachen (book chapter) In Informatik als Dialog zwischen Theorie und Anwendung Vieweg+Teubner (2009) |
FO[\le]-Uniformity (conference) 21st Annual IEEE Conference on Computational Complexity (CCC'06) (2006) Prague, Czech Republic |
International Journal of Foundations of Computer Science, volume 16, issue 04, pages 625-644 (2005). |
ParSeq: searching motifs with structural and biochemical properties (journal article) Bioinformatics, volume 20, issue 9, pages 1459-1461 (2004). |
Some results on majority quantifiers over words (conference) Conference on Computational Complexity (2004) |
Some results on majority quantifiers over words (conference) Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. (2004) Amherst, MA, USA |
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (book chapter) In Developments in Language Theory Springer Berlin Heidelberg (2004) |
Journal of Computer and System Sciences, volume 63, issue 2, pages 186-200 (2001). |
Reversible Space Equals Deterministic Space (journal article) Journal of Computer and System Sciences, volume 60, issue 2, pages 354-367 (2000). |