Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Jakobsson:1985:SRL,
author = "Matti Jakobsson",
title = "Sampling without Replacement in Linear Time",
journal = j-COMP-J,
volume = "28",
number = "4",
pages = "412--413",
month = aug,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.4.412",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:19 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/28/4/412.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_04/tiff/412.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_04/tiff/413.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Vaasa, Vaasa, Finl",
affiliationaddress = "Univ of Vaasa, Vaasa, Finl",
classcodes = "C4240 (Programming and algorithm theory); C6120 (File
organisation)",
classification = "723; 913; 922",
corpsource = "Vassa Univ., Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm; Algorithms; computer files; computer
programming; file organisation; hash table; hash
tables; linear running time; programming theory; record
files; replacement in linear time; sampling; sampling
without replacement",
treatment = "T Theoretical or Mathematical",
}