標題: A note on unscrambling address lines
作者: Lu, CC
Tsai, SC
資訊科學與工程研究所
Institute of Computer Science and Engineering
關鍵字: divide-and-conquer;permutation;field programmable gate array (FPGA);algorithms
公開日期: 28-Feb-2003
摘要: 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.
URI: http://dx.doi.org/10.1016/S0020-0190(02)00392-7
http://hdl.handle.net/11536/28084
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(02)00392-7
期刊: INFORMATION PROCESSING LETTERS
Volume: 85
Issue: 4
起始頁: 185
結束頁: 189
Appears in Collections:Articles


Files in This Item:

  1. 000180655400003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.