A Bibliography of Publications on Hashing Algorithms - Index of files in

More documents

Recommendations

Info

REFERENCES 170 URL http://www3.oup.co. uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 358.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 359.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 360.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 361.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 362.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 363.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 364.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 365.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 366.tif; http://www3.oup. co.uk/computer_journal/hdb/ Volume_25/Issue_03/tiff/ 367.tif. Discusses the dynamic hashing scheme used by ASDAS, under development at Strathclyde University. Fraenkel:1994:EMD [FRS94] Aviezri S. Fraenkel, Edward M. Reingold, and Prashant Saxena. Efficient management <strong>of</strong> dynamic tables. Information Processing Letters, 50(1):25–30, April 8, 1994. CODEN IF- PLAT. ISSN 0020-0190 (print), [FS82] [FS08] [FS09] 1872-6119 (electronic). Flajolet:1982:BPA P. Flajolet and J.-M. Steyaert. A branching process arising in dynamic hashing, trie searching and polynomial factorization. In Nielsen and Schmidt [NS82], pages 239–251. ISBN 0- 387-11576-5. LCCN QA267.A1 L43 no.140. Fortnow:2008:IIC Lance Fortnow and Rahul Santhanam. Infeasibility <strong>of</strong> instance compression and succinct PCPs for NP. In ACM [ACM08b], pages 133– 142. ISBN 1-60558-047-3. LCCN QA76.6 .A152 2008. Fiat:2009:AEA Amos Fiat and Peter Sanders, editors. Algorithms, ESA 2009: 17th annual European symposium, Copenhagen, Denmark, September 7–9: proceedings, volume 5757 <strong>of</strong> Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany / Heidelberg, Germany / London, UK / etc., 2009. CODEN LNCSD9. ISBN 3-642-04127- 2. ISSN 0302-9743 (print), 1611-3349 (electronic). LCCN QA76.9.A43 E83 2009. URL http://www.loc.gov/catdir/ enhancements/fy1208/2009933188- d.html; http://www.springerlink. com/content/978-3-642-04127- 3/.
REFERENCES 171 [FT12] [Für88] [FVS12] Fouque:2012:IHB Pierre-Alain Fouque and Mehdi Tibouchi. Indifferentiable hashing to Barreto–Naehrig curves. Lecture Notes in CS, 7533:1–17, 2012. CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349 (electronic). URL http:// link.springer.com/chapter/ 10.1007/978-3-642-33481-8_ 1/. Fuerer:1988:UHV M. Fürer. Universal hashing in VLSI. In Reif [Rei88], pages 312–318. ISBN 0-387-96818- 0. LCCN TK7874 .A338 1988. Lecture notes in computer science # 319. Fusco:2012:RTC Francesco Fusco, Michail Vlachos, and Marc Ph. Stoecklin. Real-time creation <strong>of</strong> bitmap indexes on streaming network data. VLDB Journal: Very Large Data Bases, 21 (3):287–307, June 2012. CO- DEN VLDBFR. ISSN 1066- 8888 (print), 0949-877X (electronic). Friedman:1976:GCH [FW76] Daniel P. Friedman and David S. Wise. Garbage collecting a heap which includes a scatter table. Information Processing Letters, 5(6):161–164, December ??, 1976. CODEN IFPLAT. ISSN 0020-0190 (print), 1872- 6119 (electronic). See erratum [FW77]. Friedman:1977:EGC [FW77] Daniel P. Friedman and David S. Wise. Erratum: “Garbage Collecting a Heap Which Includes a Scatter Table”. Information Processing Letters, 6 (2):72, April ??, 1977. CO- DEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 (electronic). See [FW76]. [FW09] [FZ87] Feldh<strong>of</strong>er:2009:HIS Martin Feldh<strong>of</strong>er and Johannes Wolkerstorfer. Hardware implementation <strong>of</strong> symmetric algorithms for RFID security. In Paris Kitsos and Yan Zhang, editors, RFID Security: Techniques, Protocols and Systemon-Chip Design, pages 373– 415. Springer-Verlag, Berlin, Germany / Heidelberg, Germany / London, UK / etc., 2009. ISBN 0-387-76481-X (e-book), 0-387-76480-1 (hardcover). LCCN TK6553 .R45 2008eb. URL http://www. springerlink.com/content/ q1160h1036371331/. Folk:1987:FSC Michael J. Folk and Bill Zoellick. File Structures: a Conceptual Toolkit. Addison-Wesley, Reading, MA, USA, 1987. ISBN 0-201-12003-8. xxi + 538 pp. LCCN QA76.9.F5 F651 1987. US$32.95. Computing Reviews: “A surprisingly thorough discussion <strong>of</strong> hashing algorithms, collision resolution, and the use and performance <strong>of</strong>
Page 1 and 2:
A Bibliography <st
Page 3 and 4:
3 Rue93, SZ93, Yua92]. ’93 [Ano93
Page 5 and 6:
5 FC87a, FPV98, FMM09, FMM11, GK12,
Page 7 and 8:
7 Auxiliary [DL12]. Availability [E
Page 9 and 10:
9 [DB12, KM92, XBH06, BCR10, HL05,
Page 11 and 12:
11 Combinational [MJT + 02]. Combin
Page 13 and 14:
13 Kum89a, Moh90, Moh93, SDK91, Ano
Page 15 and 16:
15 [KM07]. De-amortized [ANS09]. De
Page 17 and 18:
17 [CV83a, PY88]. Easier [Bor81, Eu
Page 19 and 20:
19 BS94a, BGV96, BT12b, CH12, CS85a
Page 21 and 22:
21 BPZ07, BHT98, BH86, Bur78, Can97
Page 23 and 24:
23 Bur08, CCF04, CP91c, Can97, CRdP
Page 25 and 26:
25 BGH12, BH91, BK84, BR97, BM97, B
Page 27 and 28:
27 Histogram [Gra93b, MNY81, PCK95,
Page 29 and 30:
29 Internal [GL82, GL88, LC88, Wil5
Page 31 and 32:
31 Tan83, Win90a, XNS + 13, YWH09,
Page 33 and 34:
33 Mass [Col93]. Massachusetts [BV8
Page 35 and 36:
35 [ACM02, Lev95, CCC89]. Morpholog
Page 37 and 38:
37 Hej89, ISK + 93, KG95, KM92, LDM
Page 39 and 40:
39 [Tai79]. Part [ANS97, Bor81, ISO
Page 41 and 42:
41 Practicality [TT82]. Practice [R
Page 43 and 44:
43 Dam87, HR04, NTY12, Oka88]. Publ
Page 45 and 46:
45 [Eck74a]. Results [ANS09, Bur83c
Page 47 and 48:
47 [BSNP96c, Gon95, Li95]. Selected
Page 49 and 50:
49 Some [Bay73a, CV85, Gib90, Gri74
Page 51 and 52:
51 Supertree [GB10]. Supplement [SC
Page 53 and 54:
53 [ACM02]. Thiry-Fourth [ACM02]. T
Page 55 and 56:
55 MH00, Moh90, Moh93, MJT + 02, Mu
Page 57 and 58:
REFERENCES 57 Zero [Dam93, OVY94b,
Page 59 and 60:
REFERENCES 59 [ABKU99] 10.1007/978-
Page 61 and 62:
REFERENCES 61 Systems: 29-31 March
Page 63 and 64:
REFERENCES 63 [ACM91b] [ACM91c] [AC
Page 65 and 66:
REFERENCES 65 ???? LCCN QA75.5 .A22
Page 67 and 68:
REFERENCES 67 UK / etc., 2008. ISBN
Page 69 and 70:
REFERENCES 69 [AG10] ence Departmen
Page 71 and 72:
REFERENCES 71 [AI08] 459-468. ISBN
Page 73 and 74:
REFERENCES 73 0362-1340 (print), 15
Page 75 and 76:
REFERENCES 75 [Ano93c] [Ano93d] [An
Page 77 and 78:
REFERENCES 77 Atkinson:1999:PTF [AO
Page 79 and 80:
REFERENCES 79 [Ask05] Michael Mitze
Page 81 and 82:
REFERENCES 81 Babb:1979:IRD [Bab79]
Page 83 and 84:
REFERENCES 83 [Bay73b] co.uk/comput
Page 85 and 86:
REFERENCES 85 [BC90] [BC06] MacDona
Page 87 and 88:
REFERENCES 87 August 1984. CODEN CM
Page 89 and 90:
REFERENCES 89 [BDS88] [BDS09] Assch
Page 91 and 92:
REFERENCES 91 [BFR87] [BG80] [BG82]
Page 93 and 94:
REFERENCES 93 [BH85] [BH86] [BH90]
Page 95 and 96:
REFERENCES 95 [BJ93] [BJ07] 2007, L
Page 97 and 98:
REFERENCES 97 ence, Georgia Institu
Page 99 and 100:
REFERENCES 99 Journal on Computing,
Page 101 and 102:
REFERENCES 101 CS, 6917:507-522, 20
Page 103 and 104:
REFERENCES 103 flow records to comp
Page 105 and 106:
REFERENCES 105 Bryant:1984:EHL [Bry
Page 107 and 108:
REFERENCES 107 [BT94b] Knowledge an
Page 109 and 110:
REFERENCES 109 [Bur83b] NBITAB. ISS
Page 111 and 112:
REFERENCES 111 [CadHS00] [CAGM07] 4
Page 113 and 114:
REFERENCES 113 [CCL91] Journal, 34(
Page 115 and 116:
REFERENCES 115 [Cer88] Applied Math
Page 117 and 118:
REFERENCES 117 [Cha85] Chang:1985:S
Page 119 and 120: REFERENCES 119 for generating minim
Page 121 and 122: REFERENCES 121 7055 (print), 1467-8
Page 123 and 124: REFERENCES 123 [CL95] [CL05] [CL09]
Page 125 and 126: REFERENCES 125 [CLS12] [CLW98] Chen
Page 127 and 128: REFERENCES 127 ISBN 0-7803-1893-5,
Page 129 and 130: REFERENCES 129 [CP91c] [CP95a] [CP9
Page 131 and 132: REFERENCES 131 [CS85c] [CS86] Chine
Page 133 and 134: REFERENCES 133 ceedings — Annual
Page 135 and 136: REFERENCES 135 GPUs. Concurrency an
Page 137 and 138: REFERENCES 137 tive hashing can sim
Page 139 and 140: REFERENCES 139 [DD11] [DDF + 07] de
Page 141 and 142: REFERENCES 141 [DG93] [DG94] [DG96]
Page 143 and 144: REFERENCES 143 service/series/0558/
Page 145 and 146: REFERENCES 145 [DJS80] [DJSN09] on
Page 147 and 148: REFERENCES 147 DeWitt:1984:ITMd [DK
Page 149 and 150: REFERENCES 149 Ducournau:2009:EAO [
Page 151 and 152: REFERENCES 151 of
Page 153 and 154: REFERENCES 153 port STAN-CS-75-511,
Page 155 and 156: REFERENCES 155 [DY08] pages 377-397
Page 157 and 158: REFERENCES 157 Ellis:1988:CEH [Ell8
Page 159 and 160: REFERENCES 159 Faloutsos:1986:MHU [
Page 161 and 162: REFERENCES 161 [Fel87] plications.
Page 163 and 164: REFERENCES 163 [FHMU85] munications
Page 165 and 166: REFERENCES 165 [Fla83b] [FLF11] Fla
Page 167 and 168: REFERENCES 167 A hardware platform
Page 169: REFERENCES 169 DEN CACMA2. ISSN 000
Page 173 and 174: REFERENCES 173 tive closure <strong
Page 175 and 176: REFERENCES 175 [GH07] [GHJ + 93] La
Page 177 and 178: REFERENCES 177 asp?genre=article&is
Page 179 and 180: REFERENCES 179 [GL06] [GLC08] [GLG
Page 181 and 182: REFERENCES 181 244-253. ISBN 0-8979
Page 183 and 184: REFERENCES 183 [GP08] [GPA97] Sprin
Page 185 and 186: REFERENCES 185 [Gre95] [GRF11] [Gri
Page 187 and 188: REFERENCES 187 [GSW98] [GT63] schat
Page 189 and 190: REFERENCES 189 mance of</st
Page 191 and 192: REFERENCES 191 Practice and Experie
Page 193 and 194: REFERENCES 193 [HDCM11] Hanna:2011:
Page 195 and 196: REFERENCES 195 [HHR + 10] Haitner:2
Page 197 and 198: REFERENCES 197 [HKLS12] ing high ac
Page 199 and 200: REFERENCES 199 [HM93] Havas:1993:GT
Page 201 and 202: REFERENCES 201 [HP78] [HPC02] [HR93
Page 203 and 204: REFERENCES 203 [HSMB91] [HSPZ08] [H
Page 205 and 206: REFERENCES 205 [HW08] He:2008:FED Z
Page 207 and 208: REFERENCES 207 [ICD93] 6138-0 (micr
Page 209 and 210: REFERENCES 209 ence, October 30-Nov
Page 211 and 212: REFERENCES 211 [IEE01] 1999. IEEE C
Page 213 and 214: REFERENCES 213 [IKO05] [IKOS08] [IL
Page 215 and 216: REFERENCES 215 Makinouchi, Mika Miy
Page 217 and 218: REFERENCES 217 [Jan08] [JBJ94] Jans
Page 219 and 220: REFERENCES 219 [JLH08] [JMH02] [JO8
Page 221 and 222:
REFERENCES 221 [Jun87] [Jv86] [JXY0
Page 223 and 224:
REFERENCES 223 function search with
Page 225 and 226:
REFERENCES 225 http://www.sciencedi
Page 227 and 228:
REFERENCES 227 [KKC12] [KKL + 09] ;
Page 229 and 230:
REFERENCES 229 and random trees: di
Page 231 and 232:
REFERENCES 231 Kakarountas:2006:HSF
Page 233 and 234:
REFERENCES 233 20, 2010. 20 pp. URL
Page 235 and 236:
REFERENCES 235 [KP92] and Computer
Page 237 and 238:
REFERENCES 237 Krawczyk:1994:LBH [K
Page 239 and 240:
REFERENCES 239 [KS88c] 8186-4827-9
Page 241 and 242:
REFERENCES 241 cient implementation
Page 243 and 244:
REFERENCES 243 [KVK12] [KW94] ISSN
Page 245 and 246:
REFERENCES 245 (3):347-352, August
Page 247 and 248:
REFERENCES 247 Lewis:1988:HDS [LC88
Page 249 and 250:
REFERENCES 249 [Lev95] [LS89], page
Page 251 and 252:
REFERENCES 251 [Lie81] Lien:1981:AI
Page 253 and 254:
REFERENCES 253 Litwin:19xx:LHN [Lit
Page 255 and 256:
REFERENCES 255 [LL13] [LLC89] [LLG1
Page 257 and 258:
REFERENCES 257 [LMP + 08] [LMR02] v
Page 259 and 260:
REFERENCES 259 [LÖON01] volume 730
Page 261 and 262:
REFERENCES 261 Trie hashing with co
Page 263 and 264:
REFERENCES 263 [LT12] in CS, 5912:3
Page 265 and 266:
REFERENCES 265 Liu:2013:IRQ [LYJ +
Page 267 and 268:
REFERENCES 267 [Mar75] [Mar77] ing.
Page 269 and 270:
REFERENCES 269 Volume_20/Issue_02/t
Page 271 and 272:
REFERENCES 271 Mergenthaler:1972:HC
Page 273 and 274:
REFERENCES 273 Mironov:2001:HFM [Mi
Page 275 and 276:
REFERENCES 275 Martin:1994:PHB [MLD
Page 277 and 278:
REFERENCES 277 [Moh90] [Moh93] Japa
Page 279 and 280:
REFERENCES 279 Mendel:2007:CTH Mend
Page 281 and 282:
REFERENCES 281 [MTB00] springerlink
Page 283 and 284:
REFERENCES 283 [MvT08] [MW95] [MW09
Page 285 and 286:
REFERENCES 285 [GQ95], pages 356-36
Page 287 and 288:
REFERENCES 287 Nakayama:1988:HPJ on
Page 289 and 290:
REFERENCES 289 [NT01] [NTW09] Naor:
Page 291 and 292:
REFERENCES 291 [OL91] [OL92] [Oll89
Page 293 and 294:
REFERENCES 293 [OT89] Omiecinski:19
Page 295 and 296:
REFERENCES 295 CODEN LNCSD9. ISSN 0
Page 297 and 298:
REFERENCES 297 [PBDD95] Pepper:1995
Page 299 and 300:
REFERENCES 299 130-146, April 1957.
Page 301 and 302:
REFERENCES 301 [PGV93g] [PGV94] cou
Page 303 and 304:
REFERENCES 303 ing. Lecture Notes i
Page 305 and 306:
REFERENCES 305 Preneel:1997:MHF [Pr
Page 307 and 308:
REFERENCES 307 SEO. ISSN 1045-9219
Page 309 and 310:
REFERENCES 309 [QG89] May 2, 2002.
Page 311 and 312:
REFERENCES 311 Reviews: “This sho
Page 313 and 314:
REFERENCES 313 [RH92] [RH95] [RHM09
Page 315 and 316:
REFERENCES 315 tion using composite
Page 317 and 318:
REFERENCES 317 JOCREQ. ISSN 0933-27
Page 319 and 320:
REFERENCES 319 asp?genre=issue&issn
Page 321 and 322:
REFERENCES 321 [RT87a] ing, pages 5
Page 323 and 324:
REFERENCES 323 [RZ97] QA76.9.D3I558
Page 325 and 326:
REFERENCES 325 [Sas11] Codes, and C
Page 327 and 328:
REFERENCES 327 Scheuermann:1982:PSI
Page 329 and 330:
REFERENCES 329 Schneider:1989:PEFa
Page 331 and 332:
REFERENCES 331 [Sed83b] [Sed88] [Se
Page 333 and 334:
REFERENCES 333 [She78] tion. ACM Jo
Page 335 and 336:
REFERENCES 335 /judy.sourceforge.ne
Page 337 and 338:
REFERENCES 337 link/service/series/
Page 339 and 340:
REFERENCES 339 [SPB88] Spector:1988
Page 341 and 342:
REFERENCES 341 [SS90b] [SS92] Schmi
Page 343 and 344:
REFERENCES 343 [Sta99] Stallings:19
Page 345 and 346:
REFERENCES 345 [Sun91] Sundar:1991:
Page 347 and 348:
REFERENCES 347 1266, December 2008.
Page 349 and 350:
REFERENCES 349 DEN ???? ISSN 0163-5
Page 351 and 352:
REFERENCES 351 [TKT + 89] minimal p
Page 353 and 354:
REFERENCES 353 Thom:1986:SAD Trembl
Page 355 and 356:
REFERENCES 355 [TTY93] Tian:1993:NH
Page 357 and 358:
REFERENCES 357 [Ull70] 0362-1340 (p
Page 359 and 360:
REFERENCES 359 Vaudenay:2006:ACE [V
Page 361 and 362:
REFERENCES 361 ISBN 0-89791-408-2.
Page 363 and 364:
REFERENCES 363 [vM39] Very Large Da
Page 365 and 366:
REFERENCES 365 [WB90] 0362-5915 (pr
Page 367 and 368:
REFERENCES 367 Weiss:2012:MSH Weide
Page 369 and 370:
REFERENCES 369 Willard:1985:NDS [Wi
Page 371 and 372:
REFERENCES 371 [WL12] [WLLG08] [WM9
Page 373 and 374:
REFERENCES 373 Wang:1994:SDP [WPKK9
Page 375 and 376:
REFERENCES 375 [Wu84] [Wu85] system
Page 377 and 378:
REFERENCES 377 on FPGA. Lecture Not
Page 379 and 380:
REFERENCES 379 [YD84] [YD85] [YD86a
Page 381 and 382:
REFERENCES 381 [YNKM89] [YNW + 09]
Page 383 and 384:
REFERENCES 383 Yung:2002:ACC [Yun02
Page 385 and 386:
REFERENCES 385 Zeller:1990:AHJ [ZG9
Page 387 and 388:
REFERENCES 387 [ZLL + 07] [ZLY + 12
Page 389:
REFERENCES 389 Zhao:1983:PMC [ZZ83]
show all

A Bibliography of Publications on Hashing Algorithms - Index of files in

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?