Some Remarks Concerning the Complexity of Sorting and Searching in an Orthogonal Memory
Schneider HJ (1984)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 1984
Publisher: Trauner
City/Town: Linz, Austria
Pages Range: 327-334
Conference Proceedings Title: Proceedings of the 10th International Workshop on Graphtheoretic Concepts in Computer Science (WG'84)
Event location: Berlin
Authors with CRIS profile
How to cite
APA:
Schneider, H.J. (1984). Some Remarks Concerning the Complexity of Sorting and Searching in an Orthogonal Memory. In Pape, U. (Eds.), Proceedings of the 10th International Workshop on Graphtheoretic Concepts in Computer Science (WG'84) (pp. 327-334). Berlin, DE: Linz, Austria: Trauner.
MLA:
Schneider, Hans Jürgen. "Some Remarks Concerning the Complexity of Sorting and Searching in an Orthogonal Memory." Proceedings of the 10th International Workshop on Graphtheoretic Concepts in Computer Science (WG '84), Berlin Ed. Pape, U., Linz, Austria: Trauner, 1984. 327-334.
BibTeX: Download