ACM Home Page
Please provide us with feedback. Feedback
A List Insertion Sort for Keys With Arbitrary Key Distribution
Full text PdfPdf (604 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 ,  Issue 2  (June 1976) table of contents
Pages: 143 - 153  
Year of Publication: 1976
ISSN:0098-3500
Author
Wolfgang Janko  Institut für Statistik und Mathematik, Hochschule fur Welthandel, Franz-Klein-Gasse 1, A-1190, Wien, Austria
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 26,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355681.355685
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BOOTHROYD, J. Shellsort, Algorithm 201. Comm. ACM 6, 8 (Aug. 1963), 445.
 
2
jANXO, W. Das Aufsuchen von Tabellenelementen bei verketteter Speicherung mittels statistischer Methoden. Angew. Inform. (March 1973), 114-122.
 
3
 
4
5
 
6
WILKS, S. S. Mathematical Statistics. Wiley, New York, 1963.



Peer to Peer - Readers of this Article have also read: