Kurt Mehlhorn Books, Systems, Publications - Max-Planck-Institut für ...
Kurt Mehlhorn Books, Systems, Publications - Max-Planck-Institut für ...
Kurt Mehlhorn Books, Systems, Publications - Max-Planck-Institut für ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
[9] P. Deussen and K. <strong>Mehlhorn</strong>. Van Wijngarden Grammars and Space Complexity Class<br />
EXSPACE. Acta Informatica, 8(2):193–199, 1977.<br />
[8] K. <strong>Mehlhorn</strong>. An Improved Lower Bound on the Formula Complexity of Context-Free<br />
Recognition. EIK, 12(11/12):523–524, 1976.<br />
[7] K. <strong>Mehlhorn</strong>. Polynomial and Abstract Subrecursive Classes. Journal of Computer and<br />
System Sciences, 12:147–178, 1976.<br />
[6] K. <strong>Mehlhorn</strong> and Z. Galil. Monotone Switching Circuits and Boolean Matrix Product.<br />
Computing, 16:99–111, 1976.<br />
[5] K. <strong>Mehlhorn</strong>. Bracket Languages are Recognizable in Logarithmic Space. Information<br />
Processing Letters, 5(6):168–170, 1976.<br />
[4] H. Alt and K. <strong>Mehlhorn</strong>. Lower Bounds on the Space Complexity of Context-Free Recognition.<br />
In Proceedings of the 3rd International Colloquium on Automata, Languages and<br />
Progr amming (ICALP’76), pages 338–354. Edinburgh University Press, 1976.<br />
[3] K. <strong>Mehlhorn</strong>. Nearly Optimal Binary Search Trees. Acta Informatica, 5:287–295, 1975.<br />
[2] K. <strong>Mehlhorn</strong>. The ‘Almost All’ Theory of Subrecursive Degrees is Decidable. In Proceedings<br />
of the 2nd International Colloquium of Automata, Languages and Programming<br />
(ICALP’74), volume 14 of Lecture Notes in Computer Science, pages 317–325. Springer,<br />
1974.<br />
[1] K. <strong>Mehlhorn</strong>. On the Size of Sets of Computable Functions. In Proceedings of the 14th<br />
IEEE Symposium on Automata and Switching Theory, pages 190–196, 1973.<br />
19
Change language