Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Bell:1984:DDP, author = "David A. Bell", title = "Difficult Data Placement Problems", journal = j-COMP-J, volume = "27", number = "4", pages = "315--320", month = nov, year = "1984", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/27.4.315", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", MRclass = "68P15 (68Q25)", MRnumber = "785 079", bibdate = "Tue Dec 4 14:48:17 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/27/4.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/", URL = "http://comjnl.oxfordjournals.org/content/27/4/315.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/315.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/316.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/317.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/318.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/319.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/320.tif", acknowledgement = ack-nhfb, affiliation = "Ulster Polytechnic, Sch of Computer Science, Newtownabbey, North Irel", affiliationaddress = "Ulster Polytechnic, Sch of Computer Science, Newtownabbey, North Irel", classcodes = "C4250 (Database theory); C6160 (Database management systems (DBMS))", classification = "723", corpsource = "Sch. of Comput. Sci., Ulster Polytech., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computational complexity; computer programming --- Algorithms; data placement; database management systems; database systems; database theory; deterministic algorithm; heuristic algorithms; NP-completeness", treatment = "P Practical", }