Klaus-Jörn Lange

76 papers A* 3A 9B 16C 6Journal 29Unranked 12

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Some New NC J. Autom. Lang. Comb. Klaus-Jörn Lange
2018	C	`conf`	Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. LATA Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf
2018	J	`jnl`	Visibly Pushdown Languages and Free Profinite Algebras. CoRR Silke Czarnetzki, Andreas Krebs, Klaus-Jörn Lange
2016	C	`conf`	A Language-Theoretical Approach to Descriptive Complexity. DLT Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange
2015	C	`conf`	On Distinguishing NC DLT Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
2015	A	`conf`	Visibly Counter Languages and Constant Depth Circuits. STACS Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
2015	—	`conf`	Visibly Counter Languages and the Structure of NC MFCS (2) Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
2014	J	`jnl`	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Theory Comput. Eric Allender, Klaus-Jörn Lange
2014	J	`jnl`	Visibly Counter Languages and Constant Depth Circuits. Electron. Colloquium Comput. Complex. Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
2012	C	`conf`	Dense Completeness. Developments in Language Theory Andreas Krebs, Klaus-Jörn Lange
2012	—	`conf`	The Boolean Formula Value Problem as Formal Language. Languages Alive Klaus-Jörn Lange
2012	B	`conf`	The Lower Reaches of Circuit Uniformity. MFCS Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie
2011	J	`jnl`	Low uniform versions of NC1. Electron. Colloquium Comput. Complex. Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie
2010	J	`jnl`	A Note on the P-completeness of Deterministic One-way Stack Language. J. Univers. Comput. Sci. Klaus-Jörn Lange
2010	A	`conf`	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. CCC Eric Allender, Klaus-Jörn Lange
2010	J	`jnl`	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electron. Colloquium Comput. Complex. Eric Allender, Klaus-Jörn Lange
2007	J	`jnl`	Characterizing TC Theory Comput. Syst. Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid
2006	A	`conf`	FO[<]-Uniformity. CCC Christoph Behle, Klaus-Jörn Lange
2005	A	`conf`	Characterizing TC STACS Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid
2005	J	`jnl`	The dot-depth and the polynomial hierarchies correspond on the delta levels. Int. J. Found. Comput. Sci. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
2004	A	`conf`	Some Results on Majority Quantifiers over Words. CCC Klaus-Jörn Lange
2004	C	`conf`	The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. Developments in Language Theory Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
2001	J	`jnl`	On the Complexity of Some Problems on Groups Input as Multiplication Tables. J. Comput. Syst. Sci. David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
2000	J	`jnl`	Data Independence of Read, Write, and Control Structures in PRAM Computations. J. Comput. Syst. Sci. Klaus-Jörn Lange, Rolf Niedermeier
2000	A	`conf`	On the Complexity of Some Problems on Groups Input as Multiplication Tables. CCC David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
2000	J	`jnl`	Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
1998	B	`conf`	On the Complexity of Free Monoid Morphisms. ISAAC Klaus-Jörn Lange, Pierre McKenzie
1998	J	`jnl`	RUSPACE(log Theory Comput. Syst. Eric Allender, Klaus-Jörn Lange
1997	A	`conf`	An Unambiguous Class Possessing a Complete Set. STACS Klaus-Jörn Lange
1997	—	`conf`	Are There Formal Languages Complete for SymSPACE(log n)? Foundations of Computer Science: Potential - Theory - Cognition Klaus-Jörn Lange
1997	—	`conf`	On the Complexity of Iterated Insertions. New Trends in Formal Languages Markus Holzer, Klaus-Jörn Lange
1997	B	`conf`	On the Distributed Realization of Parallel Algorithms. SOFSEM Klaus-Jörn Lange
1997	A	`conf`	Reversible Space Equals Deterministic Space. CCC Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
1996	—	`conf`	Advocating Ownership. FSTTCS Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
1996	J	`jnl`	Complexity and Structure in Formal Language Theory. Fundam. Informaticae Klaus-Jörn Lange
1996	—	`conf`	Set Automata. DMTCS Klaus-Jörn Lange, Klaus Reinhardt
1996	B	`conf`	StUSPACE(log n) <= DSPACE(log²n / log log n). ISAAC Eric Allender, Klaus-Jörn Lange
1996	J	`jnl`	StUSPACE(log n) is Contained in DSPACE((log Electron. Colloquium Comput. Complex. Eric Allender, Klaus-Jörn Lange
1995	J	`jnl`	The Complexity of Reconfiguring Network Models Inf. Comput. Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster
1994	B	`conf`	Empty Alternation. MFCS Klaus-Jörn Lange, Klaus Reinhardt
1994	—	`conf`	Unambiguous Polynomial Hierarchies and Exponential Size. SCT Klaus-Jörn Lange, Peter Rossmanith
1993	—	`conf`	Complexity and Structure in Formal Language Theory. SCT Klaus-Jörn Lange
1993	—	`conf`	Data-Independences of Parallel Random Access Machines. FSTTCS Klaus-Jörn Lange, Rolf Niedermeier
1993	C	`conf`	Deterministic OL Languages are of Very Low Complexity: DOL is in AC Developments in Language Theory Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
1993	B	`conf`	On the Complexities of Linear LL(1) and LR(1) Grammars. FCT Markus Holzer, Klaus-Jörn Lange
1993	J	`jnl`	Unambiguity of Circuits. Theor. Comput. Sci. Klaus-Jörn Lange
1992	B	`conf`	Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS Carsten Damm, Markus Holzer, Klaus-Jörn Lange
1992	B	`conf`	Parallel Recognition and Ranking of Context-Free Languages. MFCS Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
1992	B	`conf`	The Emptiness Problem for Intersections of Regular Languages. MFCS Klaus-Jörn Lange, Peter Rossmanith
1991	B	`conf`	Computational Calculus and Hardest Languages of Automata with Abstract Storages. FCT Jürgen Dassow, Klaus-Jörn Lange
1991	—	`conf`	On the Design of Parallel Programs for Machines with Distributed Memory. EDMCC Dominik Gomm, Michael Heckner, Klaus-Jörn Lange, Gerhard Riedle
1991	B	`conf`	Unambiguity and Fewness for Logarithmic Space. FCT Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
1990	B	`conf`	Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS Klaus-Jörn Lange, Peter Rossmanith
1990	J	`jnl`	Two results on unambiguous circuits Forschungsberichte, TU Munich Klaus-Jörn Lange, Peter Rossmanith
1990	—	`conf`	Unambiguity of Circuits. SCT Klaus-Jörn Lange
1989	J	`jnl`	The Logarithmic Alternation Hierarchy Collapses: A∑ Inf. Comput. Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange
1988	—	`conf`	Complexity Theory and Formal Languages. IMYCS Klaus-Jörn Lange
1988	J	`jnl`	Decompositions of Nondeterministic Reductions. Theor. Comput. Sci. Klaus-Jörn Lange
1987	J	`jnl`	A further link between formal languages and complexity theory. Bull. EATCS Klaus-Jörn Lange, Michael Schudy
1987	B	`conf`	Dyck FCT Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen
1987	J	`jnl`	Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). Inf. Process. Lett. Bernd Kirsig, Klaus-Jörn Lange
1987	J	`jnl`	String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discret. Appl. Math. Klaus-Jörn Lange, Emo Welzl
1987	A*	`conf`	The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. ICALP Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig
1986	A*	`conf`	Decompositions of Nondeterministic Reductions (Extended Abstract). ICALP Klaus-Jörn Lange
1986	B	`conf`	Two Characterizations of the Logarithmic Alternation Hierarchy. MFCS Klaus-Jörn Lange
1985	J	`jnl`	A note on the closure of EDL-languages under erasing homomorphisms. Bull. EATCS Klaus-Jörn Lange
1985	J	`jnl`	Addendum to "A note on the closure of EOL languages under erasing homomorphismus". Bull. EATCS Klaus-Jörn Lange
1985	A	`conf`	Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. STACS Wilfried Brauer, Klaus-Jörn Lange
1985	J	`jnl`	Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. Klaus-Jörn Lange, Emo Welzl
1985	B	`conf`	String grammars with disconnecting. FCT Klaus-Jörn Lange, Emo Welzl
1984	J	`jnl`	DTOL Systems and Catenativity. J. Inf. Process. Cybern. Klaus-Jörn Lange
1984	B	`conf`	Nondeterministic Logspace Reductions. MFCS Klaus-Jörn Lange
1983	A*	`conf`	Context-Free Controlled ETOL Systems. ICALP Klaus-Jörn Lange
1982	J	`jnl`	A Three-Restricted Normal Form Theorem for ET0L Languages. Inf. Process. Lett. Takashi Yokomori, Derick Wood, Klaus-Jörn Lange
1982	—	`—`	Kontextfrei kontrollierte ETOL-Systeme. Klaus-Jörn Lange
1980	J	`jnl`	Equivalence of Adult Languages and Extensions for DTOL Systems Inf. Control. Klaus-Jörn Lange