A note on unscrambling address lines

doi:10.1016/S0020-0190(02)00392-7

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Lu, CC	en_US
dc.contributor.author	Tsai, SC	en_US
dc.date.accessioned	2014-12-08T15:41:18Z	-
dc.date.available	2014-12-08T15:41:18Z	-
dc.date.issued	2003-02-28	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0020-0190(02)00392-7	en_US
dc.identifier.uri	http://hdl.handle.net/11536/28084	-
dc.description.abstract	A writer stores some data in memory accessible via address lines. If an adversary permutes the address lines after the writer leaves the message, then how can a reader find the permutation? This is the so-called unscrambling address lines problem of Broder et al. [SODA'99, 1999, pp. 870-871]. By a divide-and-conquer approach, we give a very simple algorithm to recover the permutation. Our method is much easier to understand than Broder et al.'s previous ad hoc solution. (C) 2002 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	divide-and-conquer	en_US
dc.subject	permutation	en_US
dc.subject	field programmable gate array (FPGA)	en_US
dc.subject	algorithms	en_US
dc.title	A note on unscrambling address lines	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0020-0190(02)00392-7	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	85	en_US
dc.citation.issue	4	en_US
dc.citation.spage	185	en_US
dc.citation.epage	189	en_US
dc.contributor.department	資訊科學與工程研究所	zh_TW
dc.contributor.department	Institute of Computer Science and Engineering	en_US
dc.identifier.wosnumber	WOS:000180655400003	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文

文件中的檔案：

000180655400003.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。