( en | de | ru )

 

Disambiguation of "Lange, Klaus-Jörn"

Author of the publication

copydeleteadd this publication to your clipboard
On Distinguishing NC1 and NL.

, , and . DLT, volume 9168 of Lecture Notes in Computer Science, page 340-351. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Klaus-Jörn Lange

Jörn Lange

Jörn Lange

Jörn Lange

Jörn Lange

 

Other publications of authors with the same name

Computational Calculus and Hardest Languages of Automata with Abstract Storages., and . FCT, volume 529 of Lecture Notes in Computer Science, page 200-209. Springer, (1991)Are There Formal Languages Complete for SymSPACE(log n)?. Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, page 125-134. Springer, (1997)Reversible Space Equals Deterministic Space., , and . CCC, page 45-50. IEEE Computer Society, (1997)Recurrent Words and Simultaneous Growth in T0L Systems., and . Theor. Comput. Sci., (1985)Complexity Theory and Formal Languages.. IMYCS, volume 381 of Lecture Notes in Computer Science, page 19-36. Springer, (1988)An Unambiguous Class Possessing a Complete Set.. STACS, volume 1200 of Lecture Notes in Computer Science, page 339-350. Springer, (1997)Context-Free Controlled ETOL Systems.. ICALP, volume 154 of Lecture Notes in Computer Science, page 723-733. Springer, (1983)Nondeterministic Logspace Reductions.. MFCS, volume 176 of Lecture Notes in Computer Science, page 378-388. Springer, (1984)Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)., and . Inf. Process. Lett., 25 (1): 13-15 (1987)StUSPACE(log n) <= DSPACE(log²n / log log n)., and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 193-202. Springer, (1996)