A Bibliography of Publications on Hashing Algorithms

Home , AES instruction set, Samson Abramsky

Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 24 August 2021 Version 2.344

Title word cross-reference [BRM+09, BS91b, BS91a, CM01, Gir87, Ven86, WS93, War14, Coh97, Coh98, LHC05, QG89, QG90]. O(1) [FKS84]. O(log log n) #2 [Cer85]. [MN90]. O(log W ) [LS07b]. O(N) [HG77, MN90]. pn [Ack74]. π [FFGL10]. q 1 [PPS21]. 10 [GLM+10]. 11 [SY11]. 2 [OWZ14]. SL2 [MT16]. Z/p [Mue04]. + [EAA 16, GG92, HD72]. 2n [QG89, QG90]. + 3 [CBA94, Fly92, GG92, GK94, LMJC07, -approximate [SWQ 14]. -ary LDY+16, SYW+20, WSSO12]. 5/8 [Sch11]. [CC91, CLC92, Gui78, RRS07]. -Bit $62m [Nic17]. 64 [LK16]. ∗ [LNS93]. + [QG89, QG90, LK16, LK11]. -Body MT [WS93, War14]. -codes [Bie95]. -dimension [Omi88, Omi89a]. [HRB13]. 2 [AK98, QJ97]. A [Lyo83]. A∗ [MD97]. A2 [LHC05]. -dimensional [Yuv75]. + + -Functions [OOB12]. -gram [Bie95]. α [ABC 16]. b [LK11]. B [TB91]. + c [SWQ+14]. d [FPS17, PRM16]. f [LG78]. [Coh98, Ven86]. -Grams [Coh97, BRM 09]. 2 -Hash [BS91b, BS91a]. -Independence GL2(Fpn )[TNS20].H [DRS12]. H2A [CBB05]. K [Yuv75, APV07, CL85, CC91, [PT16, PT10a]. -mer [HC14, PNPC20]. CLC92, DKRT15, Die96, EFMRK+20, -min-wise [FPS17]. -Nearest [CL85]. + -partitions [DKRT15]. -Pipeline [PRM16]. FPS17, Gui78, HC14, LLG 17, PT10a, + PT16, PNPC20, RRS07, SS90b]. L [OOB12]. -probe [SS90b]. -Round [GLM 10, SY11]. + -tree [Omi89a, Lyo83]. -trees [CM01]. Lp [CJ19, HFF 17]. SL2(F2n ) [SGGB00]. N

1 2

-verarbeitung [Nie75]. -wise [Die96]. [ACM97a, ACM97b, ANS97]. 1998 [ACM98, GSW98, Kar98]. 1999 [AOV+99]. 0 [BCJ15, ITP14, NSS+06, WYY05d]. ’07 19th [ACM91b, Kui92, RRR99, Wie99, [ACM07]. ’08 [ACM08b]. vL94, ABB93]. 1st [CCC89, Coh94].

1 2 [BH86, GT63, KMV10, LS15, ST86, SK05]. [AMSM+09, AAE+14, BCJ15, Con17, DR06, 2000 [Shm00, ZC12]. 2001 JRPK07, KKRJ07, KRJ09b, KJS17, Nat95, [ACM01, AAC+01]. 2002 [ACM02]. 2003 SKP15, WYY05a, WYY05b, WYY05c]. ’10 [ACM03a, ACM03b, Deb03]. 2004 [ACM04]. [Ano10]. 100 [BLC12]. 100-Gb [BLC12]. 2005 [ACM05, ANS05]. 2006 [ABM06]. 100-Gb/s [BLC12]. 10118-3 [ISO04]. 10th 2007 [ACM07]. 2008 [ACM08b, LL08]. [Ano93a, DSZ07a, DSZ07b, DJRZ06, IEE94a, 2009 [Mat09]. 2010 [Ano10]. 2011 Fre90]. 11th [PV85, Shm00]. 128 [Van10, LCK11]. 20th [LP16, MNS12, WFLY04]. 128-bit [MIO89]. [AH03, Bel00, EF12, WGM88, BJZ94]. 12th [BJZ94, Bri92, Bri93, DJNR09, LC06]. 21-January [USE91]. 21./22 [Lut88]. 21st 13th [DJNR09, Sti93, Sti94c, Vid90]. 14th [ACM91b, IEE80b, JY14]. 22nd [AAC+01, Bir07]. 15th [AiNOW11, Yun02]. 23rd [IEE82]. 24th [BIP92, BJZ94, Cop95a, Cop95b, IEE74]. [??69, ABB93, Fra04]. 24th-27th [ABB93]. 160 [BDP97, PBD97]. 16th 25/1989 [AW89]. 256 [HM08, MSDS90]. 17th [AKY13, CMP07, MAK+12, PPS21, Sch11]. [FS09, IEE76, IEE05, MS05, Pat90, Ano10]. 25th [Sho05, Vau06]. 26th [IEE85a]. 27th 18 [Sar80]. 180 [Nat95]. 180-1 [ABB93]. 28-July [Rei88]. 29-March [Ano95b, Nat95]. 180-4 [Dan13]. 18th [IEE88a]. 29/Sept [BD88]. 29th [IEE88c]. [Deb03, Yua92]. 1969 [AFI69]. 1974 2HOT [War14]. 2k [USE00b]. 2nd [Ros74]. 1975 [ACM83a, ACM94a, ABM06, HL91, ICD86, [ACM75c, ACM75b, ACM75a, Ker75]. 1976 Sch82a, KI94, Yu92]. [ACM76]. 1977 [ACM77b, Gil77, TWW77]. 1978 [Win78, Yao78]. 1979 [ACM79, Ng79]. 3 1980 [dBvL80]. 1981 [Bai81, Mo92b]. 1982 [ABM+12, jCPB+12, NIS15, Sed93, Ruc15]. [LFP82, VLD82, IEE82, NS82, Sch82a]. 30-May [ACM84b]. 30th [IEE89]. 1983 [Ano83, ST83b]. 1984 31-November [ST83b]. 320 [MJ08]. [ACM84b, ACM84a, DSS84]. 1985 [PV85]. 320-bit [MJ08]. 32nd [CIM+05, IEE91b]. 1985/11th [PV85]. 1986 33rd [ACM01, IEE92b]. 34th [ACJT07]. [ACM86b, CGO86, Fis87, Oxb86]. 1987 35th [ADG+08, Gol94]. 360 [Dit76]. 36th [DT87]. 1988 [ACM88b, BD88, WGM88]. [AMSM+09]. 37th [AGK+10]. 39th 1989 [ACM07]. 3rd [J´aj90, LS89, Rei88, TWW77, [IJW89, ACM89c, MK89, PK89, RK89]. Wol93a, Wol93b, ACM91c]. 1990 [ACM90, J´aj90, USE90, Vid90, WPY90]. 40th [ACM08b, IEE99]. 42-step [AKY13]. 1990’s [Rie89]. 1991 45 [Pro94]. 47th [IEE06]. 48th [IEE07]. [ACM91d, ACM91e, IEE91a, lWSS91]. 1992 4th [IJW89, BW92, Far93, HKNW07, [BIP92, Sto92]. 1993 [BJ93, IEE93]. JBJ94, Lom93, PSN95, USE00a]. 1993/sponsored [HB93]. 1994 [SW94b]. 1996 [ACM96]. 1997 5 [PW94]. 5-Independent [TZ12]. 512 3

[GLM+10]. 51st [IEE10]. 52nd [IEE11b]. KR86a, KM88b, LK84, Lit84, LL86, LMR02, 54th [IEE13]. 5G [Cho21]. 5th MY79, Mul72, Ols69, Pet57, SD85, SDKR87, [BRW93, Boy95a, Boy95b]. SHRD09, Tra63, VB00, XHZ+19, YL04, And88, Bay73b, BCGS16, CS93a, FPSS05, 68110a [Sar80]. HB89b, KFG15, Lar88b, Lin63, MBK00, Mil95, ML95, RT89, TKT+89, ZO13]. ’76 [Jen76]. ’79 [Ng79]. 7th access-pattern-driven [ZO13]. Accessed [ARA94, Bar83, CHK06, USE00b, Win78]. [Ols69]. Accesses [Pan05]. Accessing [Cha88, Ore83, FK89]. accommodation 80f [Sar80]. ’83 [Ano83, CRS83a]. ’84 [HO72]. Accountable [XHZ+19]. [ACM84a]. ’85 [IEE85b]. ’86 [AA86]. ’87 Accumulated [Nyb96]. accumulating [CP87, CP88]. ’88 [ACM88a]. ’89 [ACM89a, [ZHW01]. Accumulators BV89, BF89, Bra90, QV89, QV90, CP91c]. [CHKO08, PTT16, CHKO12]. Accuracy [YWH09, HKL07]. Accurate [LCL+20, 9-13 [ACJT07]. ’90 [AFK90, A+90, PCV94, SL16, YGS+19, NTW09, TYSK10]. Dam90a, Dam91, IEE90, MV91c, SP90]. ’91 Achieve [LLL+16]. achieved [Con17]. [ACM91a, Dav91, Fei91, HL91, IEE91a, Achieving [Lar88b, Lyo85]. ACM IRM93, ACM91c]. ’92 [ACM94d, ??69, ACM75c, ACM75b, [Bri92, Bri93, BW92, FNY92, IEE92a, ACM75a, ACM76, ACM77b, LFP82, KLT92, Rue93, SZ93, Yua92]. ’93 ACM82, ACM83b, ACM84b, ACM85b, [Ano93c, BRW93, BJ93, Hel94, IEE93, ACM85a, ACM86b, ACM86a, ACM87, Lom93, Sti93, Sti94c, vL94]. 93k [Pro94]. ACM88a, ACM88b, ACM89b, ACM89a, ’94 [ACM94b, De 95, JBJ94, PSN95, ACM89c, SDA90, ACM90, ACM91c, SW94b, SW94a]. ’95 ACM91d, ACM91a, SDA91, ACM91e, [Cop95b, GQ95, IEE95, Lev95, QG95]. 959 ACM96, ACM97a, ACM97b, ACM98, [ACZ16].´ ’96 [Lak96]. ’99 [Wie99]. 9th ACM01, ACM02, ACM03a, ACM04, ACM05, [DJRZ06, ST83a, IEE88d]. ACM07, ACM08a, ACM08b, ACM11, ACM12, Ano92, BIP92, BJ93, CLM89, A. [Pro94]. Aarhus FMA02, GMJ90, Van10, HF13, IEE02, [Dam90a, Dam91, NS82]. ability [DLM07]. Jen76, Kar98, LL08, Mat09, Nav85, Rie89, abolishing [DSS10]. Abstract [DP08, ACM77a, Shm00, SW94b, Sto92, YR87, EjKMP80, Lum73, MW95, SW87, THS97]. ACM81, ACM91b, BV89, Lie81]. Abstraction [CL83, DL06, Hil88, LPSW03]. ACM-SIAM [ACM94d, SDA90, SDA91, abstraction-safe [LPSW03]. Academic ACM97a, ACM05, ACM08a, Kar98]. [Cer85]. ACCEL [HKL04]. ACM-SIGMOD [Nav85, Lie81, ACM81]. ACCEL-RATE [HKL04]. accelerate across [HWZP18, SF88]. Action [BFR87]. [GK12b]. Accelerated activation [SZO+20]. Active [Kri89, MW09, MWC12]. Accelerating [GHJ+93, EVF06]. Actor [TCP+17]. Ad [HAK+16, TT82, BLY20]. Acceleration [DPH08, JLH08, Cha12]. Ad-Hoc [JLH08]. [FAFK21, JMH02]. Accelerator Ada [BCS89, ST86, Tro06, Wol84]. [FM91, TLLL09]. Access AdaBoost [LLZ10]. Adaptable [NHS84]. [Ast80, BDPSNG97, BM76, CF89a, Cla77, adaptation [DOP+14]. Adapted [RJK79]. Dum56, FNPS79, Fal85b, F+03, FP89b, Adaptive FKS84, GG74, HB89a, HB92, KR86b, [Ahn86, Ahn87, BK90, CBB05, CS02, Gri98, 4

HT88, IGA05, KR91, KL08, LBJ02, OL91, Albuquerque [ACM75c, ACM75a, IEE91a]. OL92, ST93, TC04, ZG90a, Zel91, GZ99, Algebra [Bra84b, KTMO83b, KTMo83c, HAK+16, LYJ+13, LMLC14, TB91]. EBD91, FP89a]. Algebraic Adaptive-Hash [OL91, OL92]. add [FJ13]. [ACM94b, EjKMP80, Jen76, Lak96, Lev95, add-rotate-xor [FJ13]. Addendum Mar71, Ng79, WX01, vdHvH12, BF08, GS89, [CV85]. addition [FJ13]. Additional LS06, Pon87, Coh94, AAGG16]. Algebras [LY72]. Additive [MBBS12]. Address [CT96]. Algol [FR69]. Algol-Based [FR69]. [HP63, Jai89, Jai92a, Jai92b, Jaixx, LYD71, Algorithm Lum73, PK87, SR63, Tam85, TK85, Wil96, [ANS97, ANS05, AKS78, ABH+73, LY72, MLP07, MPL09, RW07]. AEMR09, BH90, BI87, Bou12, Boy98, Addressable [Hin20, RSK17, Koh80, BB07]. CS85a, jCPB+12, CdM89, CW09, CT12, Addressed [SVCC01]. Addressing Coh98, CHM92a, CHM92b, CM93, Dev93, [Bay74, Bra84a, Bra86, Buc63, Fab74, Fel87, DCM18, FL73, FFPV84, FCHD88, FCHD89, Gon77, Gon80, JC88a, Joh61, Kno71, Kno88, FCH92, Fro81, Get01, Han90, HCKW90, KR79, KRJ+80, Lit80, Litxxa, LH03b, HR96, HW08, HG77, HC13, Jen97, JRPK07, LH03a, Mot84, MC86, Pet57, RJK79, SS62, KMM+06, KKRJ07, Leb87, LLDZ18, LLL11, SD76, Som99, Tra63, CKW93, Lin63, NK16, LLW10, MXL+12, Man12, MHB90, MV01, TT81, Wan05, van73]. Adelaide [Bar83]. MH00, NP91, OG94a, OOB17, OL91, Omi91, Adjusting [Pag85, Wog89]. OL92, Pap94, PCY95, Pes96, Pit87, PVM97, Administration [Fis87]. Adressing Reg82, SS01, Sol93, Spe92, Sta99, TRN86, [Bra85]. Advanced TTY93, Toy93, TSP+11, WG00, WWZ09, [Ano93d, CE95, HDCM11, Hsi83]. WZJS10, WS93, WVT90, Wil97, Wil71, Advances [Buc82, AFK90, Bel00, Bra90, WDYT91, WYT93, WL12, ZG90a, ZJM94b, Bri92, Bri93, CRS83a, CP87, CP88, Cop95a, ZPS90, ZPS93a, AS89, AT18, AGJA06, Cop95b, Dam90a, Dam91, Dav91, De 95, ATAKS07, CLS95, CLW98, DHKP97, FH79, Fei91, Fra04, GQ95, Hel94, IRM93, JBJ94, FHC89, FKI+21, Gai82, GBY90, HLL18b, LC06, MV91c, PSN95, QV89, QV90, QG95, HL94, ISO97, ISHY88, JWM+18, Kim99, Rue93, SP90, SZ93, Sho05, Sti93, Sti94c, LEHN02, MMC01, MKSiA98, OT89]. Vau06, Wie99, Yun02]. Advantage algorithm [PCV94, PL21, Pri95, SB95, [WSSO12]. Adversaries [LN93]. Advisor SM94, Sil02b, Ste18, WM93, War14, Wie86, [Cer85]. Aegean [Rei88, Rei88]. YCJ12, ZJM94a, ZJM94c, ZPS93b, ACZ16,´ Aeronautical [KCF84]. Aeronautics Sta94, TKI99]. Algorithmen [Fis87]. Aerospace [Fis87, IEE94b]. AES [Meh77, Meh86, Wir75, Wir83, Zel91]. [ABO+17, BOY11, BOS11,¨ GK08, Rog19a, Algorithmics [Mat93]. Algorithms Sas11, JNPP14]. AES-like [JNPP14]. [ACM94d, ACM91c, ACM97a, ACM05, aﬀects [HL05]. Again [DRS12]. Against ACM08a, ANS97, AHU83, AOAAK20, AI06, [DL17, ASBdS16, JL14, JG95, MSP12, Ano95a, iA91, iA94, AT90, AT93, AT91, Sho00b]. Age [Cro98]. Agent BS97, Bur76b, CFP19, CV86, CRR18, CT96, [BSH12,ˇ DF01]. Aggregation DG85a, DG85b, Dev86, DS97, FM96, FW09, [BJL16, PT10b]. Agreement FM85, GRBCC19, Ger86a, Ger86b, Gon84, [GB10, YLSZ19]. agrometeorological GBY91, GI77, Gra88, Gra89, GC95, GK81, [WM93]. Ahead [Moh90, Moh93]. AID GK82, Gui76a, Gui76b, GG80, GSB94, Har88, [Dos78b]. Airport [ICD88, ICD90]. Akron HS78, HL91, KR81, LLLC17, LS89, Lom93, [Fis87]. al. [SPLHCB14]. Alaska [IEE01]. LTS90, LH03b, Mac95, MF92, MLD94, 5

MLxx, Mat09, MS88a, MO92a, OG94b, CL85, CC87, Cha88, CLNY06, CN08, CV83a, OL89, PS93, Pip94, PV19, Pre97a, PB85, CV84, Che84a, Che84b, CV85, CK94, CS93b, QG89, QG90, Reg85, Riv74b, RNR13, Sam76, CDW+19, DR11, FC87a, FPV98, FMM09, SD89c, SD89a, Sed83b, Sed88, Sed90, Sed92, FMM11, GRBCC19, GK12a, GL73, GBY90, Sed93, SD76, SG88, SK98, Shm00, TR02, GK81, GK82, GLG+02, GS76, Gui76a, TY91, Vit81b, VC85, Wal88, WFHC92, Gui76b, GS78, Gui78, Gur73, HMNB07, Wie87b, Wir86, XCCK09, Yen91, ZG90b, Hac93, Has72, Kut10, Lar80a, Lar80c, Lar82b, AI08, BMS+17, BMQ98, Cra85, DG96]. Lar83, Lar84, Lar85c, LCK11, Lev00, Lew82, algorithms [DJRZ06, DJNR09, DC94, LWWQ08, LPP91, LPP92, LM93c, Lum73, EVF06, FJ13, GK05, Gui76c, HK95, MK11, MCW78, MMMT09, MY80, Men82, HKNW07, JDW+19, JMH02, Kan90, Kar98, MP12, Mol90a, Mol90b, NM02a, NCFK11, KP92, Kha95, MPL09, Mol90a, Mol90b, NAK+15, Omi91, Pit87, PVM94, PV19, MMSY94, NM02b, PBGV89, QM98, Rei88, Pre93, PB85, RM88, Ram88b, Ram89a, RLM87, RG89, Riv74a, SD89d, Sch91a, Reg85, Reg88, Riv74b, SS62, Sch79b, Sed83a, SG72, Vit82a, Vit01, SDA90, SYW+20, SB93, SA97, Vek85, VP96, VP98, SDA91, A+90, AiNOW11, CT10, DSZ07a, Vit80b, Vit80c, Vit83, VC87, WB90, Yao80]. DSZ07b, EF12, FS09, FBY92, HM08]. Analysis [de 69, Ati20, BGKZ12, BZZ12, Algorithmus [BI87]. Alignment CK89, DS09a, DM03, DK12, GLC08, GM77, [BFMP11, BRM+09, LPT12]. Alignments Gui76c, KZ19, LLA15, LM88, MJ08, MS13, [BDD+10]. All-in-one [SV18]. MSV87, PS08, Pro94, QM98, RAD15, SS90a, All-or-Nothing [SRY99]. Alley SLC+07, Sed83a, SGK09, WL07, ZBB+06]. [Boy98, Get01, Jen97, Pes96, Wil97]. Analyti [Pro94]. Analytical Allocating [CC91, TC93]. Allocation [Bat81, DOP+14, WTN07]. Analytics [CC87, CLC92, Du86, MJBD11, Nak21, [LMD+12, WZY+18]. analyze [FJ13]. YCRY93, vdP72, vdP73, DW05, DW07, Analyzer [CRdPHF12]. Analyzing LCRY93, OOK+10, van73]. [Kue82b, PVM97]. anchor Allocation-Based [Nak21]. Allocations [FKI+21, SZO+20]. Anchorage [IEE01]. [ABKU99, PG95]. Allowable [Blo70]. AnchorHash [MVB+21]. Anderen Almost [BKST18, BM99, CKB83b, DW03, [DS84a]. Anf¨anger [Sch76]. Angeles YSEL09, CKB83a, Duc08, IIL17]. [ACM82, BD88, ICD86, ICD87, ICD88, Almost-Minimum [BM99]. ICD90]. Ann [ACM81, Bai81, Bor81, Lie81]. Almost-Universal [BKST18]. Alpha annotated [Pon87]. Announcement [WM19]. Alternative [DLH09, KS12, Nat92]. Announcing [EMM07, HBL+10, IH95, SD89b, LS15]. [SBK+17]. Annual [ACM75c, ACM75a, Alternatives [GD87]. am [CE95, LC95]. ACM76, ACM77b, ACM84b, ACM84a, American [CHK06]. Among ACM85a, ACM86b, ACM88b, ACM89c, [CC91, GP08, KW94]. amortize [KM07]. SDA90, ACM90, ACM91c, ACM91d, SDA91, amortized [ANS09]. Ampliﬁcation ACM91e, ACM97a, ACM01, ACM02, [BBR88]. Amsterdam ACM05, ACM07, ACM08a, ACM08b, AH03, [AW89, CP87, CP88]. Analogue Ano93d, Ano10, BV89, BIP92, Bri92, Bri93, [Cai84, DSGKS20]. Analyses [CS87]. Cop95a, Cop95b, EF12, Fra04, Gol94, IEE74, Analysis IEE76, IEE80b, IEE82, IEE88c, IEE89, [AP93, Ano95c, AD11, AM07, BYSP98, CTC90, IEE91b, IEE92b, IEE99, IEE06, BRS02, BRSS10, BM89, BM90a, BF08, CF92, IEE07, IEE10, IEE11b, IEE13, Kna89, 6

Mat09, ACM77a, Shm00, Sho05, Sti93, SWQ+14]. Approximately [DT14, Ind01]. Sti94c, USE00a, YR87, Yun02, ACM94d, Approximating [ASW87, Pob86]. ACM91a, ACM96, ACM97b, ACM98, Bel00, Approximation DT87, FS09, HM08, IEE85a, IEE92a, IEE95, [DJRZ06, AGJA06, DJRZ06, DJNR09]. IEE01, Kar98, Rie89, Wie99]. Approximative [MYS12]. APRICOD anonymization [RW07]. Anonymous [ZO13]. April [ACM75b, ACM81, ACM84b, [CZLC12a, ZJ09]. Anti [NT01]. Ano83, Ano94, CP87, CP88, Col93, Dav91, Anti-persistence [NT01]. Antonio ICD91, ICD93, IEE01, Joy03, Lie81, QV89, [ACM91b]. Anwendungen [Lut88]. Any QV90, SM12, USE90, WGM88]. AquaHash [LP15, HR07, Lev89]. Anzahl [Dos78a]. [Rog19a]. arbitrary [GHK+12]. Arbor Application [BKMP09, Cer81, CKB83b, [ACM81, Bai81, Bor81, Lie81]. Arbres Cha88, CP87, CP88, Dam90a, Dam91, [Kar82]. Architecting [LLL+16]. Dav91, FFGOG07, GK76, HP63, Hel94, Architectural [GSL17]. Architecture IRM93, Jou04, KTMo83a, KCB81, LC06, [BCH87, HCJC06, Hsi83, Jou85, KP81, Lit77b, LLW10, Ngu06, Pip79, QV89, QV90, KCR11, KTMo83a, MK11, WG94, XBH06, QG95, Rog95, Rog99, Rue93, Sas11, Sch01b, ZHB06, ABO+17, BOY11, HLH13, LMP+08, SZ93, SvEB84, Web72, WC94, Yao91, vW94, MBK00, RG89]. Architecture-conscious AT90, CKB83a, CO82a, De 95, GQ95, [ZHB06]. Architectures Kan90, QJ97, SRRL98, Zob70a, Zob70b]. [ACM91c, BRW93, DR92, Kie85, LC20, Applications MKAA17, MKASJ18, RNT90, Bis12, [AT93, BKST18, BG07, Bur81, CZLC12a, BMQ98, GK05, HDCM11, adHMR93, CZLC12b, CK15, CJ19, DR06, Deb03, DK02, LLA15, NW07, PJM88, PJBM90, Rei88]. DK15, DadH92, DR09, Fel50, FM85, HK12b, archival [QD02]. Area IEE80a, IEE95, KMM+06, Kna89, Lev89, [DD15, ABO+17, BOY11, Lar84]. LDY+16, LK93, MK11, PPS21, Pon87, Area-Efficient [DD15]. areas [JY14]. RP91, Rey14, RNT90, Ter87, TZ12, TS76, ARES [IH83]. Argon2 [BDK16]. Argon2i TS84, Val15, Vau06, Wee12, WC79, WVT90, [AB17]. Arguments [Yao83, ABM+12]. YZ00, AG10, ARA94, BZL+15, BDK16, ARIES [Moh90, Moh93]. ARIES/LHS DFMR15, HKNW07, KKP92, KZ19, LLC89, [Moh90, Moh93]. ARIRANG [HKKK10]. LK11, LG78, MJ08, MV91a, NY89b, NY89a, Arising [FS82]. ARITH [IEE05, MS05]. NN90, NW07, PW08, PSN95, RRS07, Shi17, ARITH-17 [IEE05, MS05]. Arithmetic SS16, Sie89, ZYWM20, Ano92]. Applied [Die96, Ers58a, GSC01, HSK88, IEE05, [CS93b, GNP05]. Applying MS05, ISO97]. Arizona [Gol92]. Arlington [Cer87, Cer88, CHY93, CLYY95, CHY97]. [ACM94d]. Arrangement [Riv76, Riv78]. Approach [BH93, CCH09, CK12, DL79, Arrangements [Yao85a, Yao95, Wee88]. DC94, JV16, LT09, LQH18, MY80, RH95, Array [Cob94, He87, YLB90, SV15b]. Sch79a, SR89, SK98, Tsa96, ZO93, BJ07, Arrays [BGS96, CP91a, Gra94a, LPWW06, BCCL10, DAC+13, GS89, JHL+15, NW07, RS77, Ros77, CP91b, CLS18, RS75, Tay89]. PGV93e, PGV94, QZD+18, QD02, TKI99]. Art APPROX [DJRZ06, DJNR09]. [Knu73, Knu75, Pre97b, Ruc15, PGV93c]. Approximate [AEP18, AI06, CCH09, Artificial [Kak93, ARA94, LLC89, BCR04]. CLP17, DP08, DHL+94, DHL+02, Hac93, ary [CC91, CLC92, Gui76c, Gui78, RRS07]. HC14, MW09, RSK17, AI08, DC94, HFZ+15, ASCII [HF91]. ASI [Ano95c]. LZ06, LCH+14, LWWK20, MBKS07, Rön07, ASIACRYPT [IRM93, LC06, PSN95]. 7

ASIC [MKAA17]. ask [Gre95]. Aspects CGO86, Cop95a, Cop95b, DSS84, DSZ07a, [AH03, SS89a]. Assembly [ASW07]. DSZ07b, DJRZ06, DJNR09, Fra04, Gil77, Assessment [THY+18, DMP09]. GSW98, HB93, IEE95, Jen76, JY14, MK89, Assignment [LL92, Wil71]. Assignments MSDS90, PV85, PK89, RK89, Ros74, Rov90, [Yao91]. Assisted [Wil96]. Associated Sho05, Sti93, Sti94c, WPY90, Wie99, [Sar10, FDL86, SB95]. Association lWSS91, Yua92, Yun02]. AUSCRYPT [CL05, CT12, DT87, PCY95, TGGF10, [SP90, SZ93]. Austin HC02, HC07]. Associative [ACM87, ACM88a, ARA94, Nav85, USE00b]. [Bur76a, Bur77, DW83a, DD15, Dos78b, Australia FM91, FR69, HNS84, KHW91a, KR79, [Bar83, SP90, SZ93, DG96, MSDS90, PSN95]. Ouk83, Riv74b, WB87, dW83b, HDCM11, Australian [Bar83]. Austria KHW91b, Koe72, YIAS89]. Assoziativer [Kui92, ICD93]. Auswahl [Pet83, Dos78a]. [GN80, Koe72]. Assumptions Authenticate [Yas07]. Authenticated [Chr84, Dam93, Dam94, Sim98]. [KV09, PTT16, Sar10, YLSZ19, BSNP96b, Astronomical [Gui89]. Asymmetric GL06]. Authentication [CLP17, BR94, CFN18]. Asymptotic [Abi12, Alb21, AS96, BCK96a, BCK96b, [CLS18, IK92, Ati20, Pro94, WL07]. BKST18, BAN89, CJP12, DCM18, EPR99, Asynchronous [KFG15, PAKR93]. FIP02a, GI12, GBL94, HMNB07, Atlanta [ACM83a, ACM83b, USE00a]. HCPLSB12, JRPK07, JK11, KKRJ07, Atlantic [Fre90, GMJ90, IEE84]. ATM MRW89, NR12, PGV93f, QJ97, RWSN07, [SMS91]. Atom [LC12]. Atomic [LMR02]. Rog95, Rog99, Sho96, TW07, Tsu92a, WC81, Attack [CJP12, CMP07, JLH08, KK06, WDP+12, WS03, YY07, ACP10, CBB05, Pey15, PGV90a, Sho00b, WW09, WFW+12, CJP15, HL12, Kra94, Kra95, KCL03, Ku04, ZF06, Ano09b, BSU12, CJP15, JG95, KCC05, LLH02, LKY04, LW04, MS09, PGV93a, PGV93b, SXL16]. Attacking OCDG11, SPLHCB14, Sta99, Sti91, Sti94b, [CP95b]. Attacks SV06, Tsa08, Tsu92b, YRY04]. [AB17, ABD+16, BDG+20, BPBBLP12, Authenticity [Sch01b, ADF12]. Auto Bih08, BKMP09, CY06, DK07, DDS14, [EFMRK+20, Lit77a]. Auto-structuration DL17, HKKK10, HRS16, JL14, KNR10, [Lit77a]. Auto-tuned [EFMRK+20]. KLP98, KVK12, LK94, KKMS10, LLJ15, Automata MRST10, MNS12, Saa12, SY11, Sas11, [ACM82, IEE74, LP04, LK93, MMC01, WYY05d, ZWW+12, BSU12, ITP14, KL95, AGK+10, ADG+08, AMSM+09, ACJT07, KHK10, LS07a, MSP12, WYY05a, WS13]. dBvL80, CIM+05, Kui92, NS82, Pat90]. Attribute Automated [DGM89, ZZ83, Cer85]. [CS83b, CS87, GK94, GK95, HYH93, KG95, Automatic [GT80, Zam80, SB07]. RSSD90, RL74, ZZM17, ASW87, HR93]. Automation [IEE11a]. Automaton Attribute-Based [ZZM17]. attributes [DGV93, LLL11, MZI98, TLLL07, TLLL09]. [HM03]. Auction [SKM01]. Audio automaton-matching [TLLL09]. [MV01, YTJ06]. Audit [SK99, Ano93a]. Automorphism [PWY+13]. autonomous Auditing [LRY+15, DMB19, GB17]. [SZO+20]. AutoPlacer [PRRR15]. Aufteilungs [vM39]. Aufteilungs- [vM39]. Auxiliary [DL12, FXWW17]. Availability Aug [BD88]. Augmented [ZLC+18]. [Eng94, ADF12, DFMR15]. Average August [ACM79, LFP82, ABB93, AW89, [Bra84a, Bra85, Bra86, Gon77, Kut10, Reg81, A+90, Bel00, Bri92, Bri93, BW92, CRS83a, TW91, MT16, THS97]. average-case 8

[Mic02]. avoid [Pat94]. Aware Gri98, GK08, GH07, HMNB07, Hal12, [CJKK19, HNKO20, JLL+20, MZL+19, HDCM09, HHL10, HNKO20, HW08, PG17, BB07, HFZ+15, HFF+17, NDMR08]. HWZP18, HCPLSB12, HLC10, H¨ul13, awareness [Li10]. Awesome [Knu19]. HRS16, HBG+17, HM19, JXY07, JTOT09, AWO C [Rei88]. JK11, KSSS86, KM09, KV09, KL87, KKRJ07, KJC11, KMV10, KTMO83b, B [BD84, FK89, Omi88, Omi89a]. B-Trees KW12, KP96, KP97, KR79, KRJ+80, KK85, [BD84, FK89]. Back [DSSW90a, DSSW90b]. Kum89a, KKT91, LM93a, LYY+18, Backoﬀ [SHRD09]. Backtracking LYX+19, LW88, LMC07, LMJC07, LLDZ18, [WKBA07, YD85]. Backward LLZ10, LLL09, LHC05]. Based [LLLC17, [CPP08, LLL11]. Backyard [ANS10]. LRY+15, LXL+19, LG78, LTS90, LCM+20, Balance [IK92]. Balanced MLD94, MKF+16, MCF17, MP12, Mil85, [AG10, ABKU99, DW05, DW07, Lep98, MKAA17, NIS15, NCFK11, Nak21, NNA12, LB07, Oto86, Oto88b, PB80, WZ12, FP82, NXB13, OL89, OSR10, PFM+09, PTT16, TLLL18]. Balancing PCY95, PHG12, PRZ99, PSZ18, Pre97a, [HC13, KJC11, Nak21, Omi91, RRS12, RK91, RGNMPM12, RTK12, Rey14, RWSN07, Top92, TP95, ZJM94a, ZJM94b, ZJM94c, RNR13, RL74, RK91, SD85, SDKR87, DSD95, SX08, WL07, WTN09, XCCK09]. Sch01b, Sch79b, Sch81, SBS16, SYW+20, Balatonfured [Rue93]. Balloon SC90b, SC90a, SC90c, SK98, Sho96, SKC07, [AB17, BCGS16]. Balls SSS05, SVCC01, Sun15, TWZW11, TGGF10, [CRSW11, CRSW13]. Bally [IEE84]. TZ12, TY91, TP15, TK07, US09, WWZ09, Baltimore [ACM90, FNY92, IEE02]. Band WSSO12, XBH06, XHZ+19, YNW+09, [Meh86, Sol93]. Band-Join [Sol93]. Bands YSW+11, WL12, YY07, YTJ06, YD86a, [KCF84]. bandwidth [AS09]. BANG ZJ09, ZWH17, ZZM17, ZQSH12, ZLC+12, [THS97]. Banked [vdBGLGL+16]. Banska vMG12, Adi88, AY14, ASM17, ACP10, [Rov90]. Barbara [Bel00, Bri92, Bri93, AAGG16, BSNP96b, BLC12, BLY20, CRS83a, Cop95a, Cop95b, Fra04, Sho05, BCR04, BC06, BDS09, Bur83a, Cha12, Sti93, Sti94c, Wie99, Yun02]. Barcelona CML+13, CCHK08, CJP12, CJP15, CLW98, [DJRZ06, CTC90, LSC91]. Barreto [FT12]. CJ86, DG85a, DS09a, DHW08, GB17, GL06, barrier [MPST16]. Base GLC08, GZ99, HLL18b, HLL18a]. based [BCH87, CRdPHF12, Chr84, EE86, FM85, [HAK+16, HCJC06, HC11, HLMW93, Gho77, Gho86, ISK+93, McC79, YBQZ17, HXMW94, HW88, HL03, JFDF09, JL14, Zam80, Mar75, Mar77, WLLG08]. Based JBWK11, JG95, KI94, KRJ09a, KST99, [AK98, Abi12, Alb21, AP08, Aum09, AS16, Kor08, Kra94, KCL03, Ku04, KCC05, Bal96, BG92, Ben98, BDM+12, BHH+15, KSC11, KSC12, LM93b, LDM92, LWG11, BRS02, BCS09, BRSS10, BI12, Buc82, LND08, LACJ18, LLJ15, LSZ+21, LMPW15, Bur83b, Bur83c, But17, CCF04, CFP19, MSZ+20, MS09, Mei95, MZI98, MS13, CS83b, Cha84b, CS87, CW91, CdM89, MHT+13, Mul92, MFES04, MJ14, NADY20, CdM90, CW09, CTZD11, CZLC12a, NS16a, OT89, PCK95, Par18, PPB16, PL21, CZLC12b, CZLC14, CT12, CDW+19, PW06, PBGV89, PGV91, PGV93e, PGV94, CadHS00, DGV93, Dae95, DK09, DG85b, QZD+18, RP95, SPLHCB14, SN19, SV94b, DL17, DF01, DR11, DB12, EK93, Fab74, SV95, SE21, SGK09, SX08, SRRL98, Sim98, FL04, FR69, FRB11, FH69, FFGOG07, SA17, SZO+20, TKH20, TWL+18, Tsa08, GGY+19, GRBCC19, GO07, GI12, GSC01, TD93, UIY10, UHT95, VD05, Wil14, WY02, 9

XLZC14, YCJ12, YSL05, YL97, YZ16, [CLP17, DGGL16, DHT+19, Du86, Fro82, YD86b, ZYWM20, ZDI+15, FH96, TLLL18]. GRZ93, HSPZ08, LQH18, TYZO15, de 69, basée [LG78]. Bases [ABB93, VLD82, FP82, LMSF89, LMPW15]. AW89, AAC +01, BD88, BDS88, BJZ94, Binary-Relational [Fro82]. Binning CGO86, CKN18, DSS84, Gon83, Hil78b, [PKSB18]. Bins Hil78a, Ker75, LT80, LSC91, MSDS90, PV85, [CRSW11, CRSW13, DW05, DW07]. ST83a, ST83b, Yua92, Yao78, LT80]. Basics biological [BW89]. Biometric [Dre17a]. Basis [BT12a, MW95, CHL07]. [FFGOG07, MS12, SP21, YY07, SK20]. Batch [Lyo79]. Batched [Piw85, SG76b]. biometrics [AGBR19]. Biomolecular Bay [Ano10]. Bayesian [ZLY+13]. biomolecule [FDL86]. [CSSP15, OGAB14, PKSB18, RH95, SP12]. Biomolecules [BRM+09]. Bipartite BC [ACM05, LL08]. BDDs [MJT+02]. Be [Kut06]. birth [Ste18]. birthday [Yao81, CP91c, GMW90, Sch91a, Sim98]. [MPST16, MSP12, SXL16]. Bit Beach [PDI91, RNT90]. Bearbeitung [Blu95, Kil01, QG89, QG90, SP91, ASM17, [Koe72]. Beaverton [ODB89]. Beginner BK07a, ISO97, LK16, LK11, MJ08, MIO89, [She17]. Behavior [Lev00, Sav90, TTY93]. TKI99, MKL21]. bit-level [TKI99]. Beijing [Ano93c, Yan10]. Beitrag [BI87]. bit-parallelism [ASM17]. Bitcoin [Nic17]. Belgium Bitmap [EVF06, FVS12]. Bits [BW92, QV89, QV90, Vid90, PGV93c]. Bell [Kil01, Nae95]. Bitstate [IJK13]. BitVault [Lam70]. belt [BDPV06]. belt-and-mill [ZLL+07]. Bitvectors [BMRV02]. Black [BDPV06]. Bemerkung [Eck74a]. [JLH08, Rja12, SV94b, SV95]. Black-Box Benchmarked [MKAA17]. Benefits [BRS02, Rja12]. Black-Hole [JLH08]. [Bur79]. Bergen [Ytr06]. Berkeley BLAKE [AMPH14, VNP10]. Blind [FL04]. [ACM86b, DJNR09, IEE06, IEE13]. Berlin Block [BRS02, Chu90, CV08, KP96, KLP98, [AH03, Yao78]. beschränktes [Wen92]. LM93a, LK94, Men12, Pre97a, QG89, QG90, Besetzungswahrscheinlichkeiten [vM39]. SDMS12, SDMS15, YLZ20, Zhe90, GLC08, BESM [Ers58b]. better [Mit17]. Between HLMW93, HXMW94, ISO97, KL95, Lai92, [Bra84a, Bra86, KCF84, PNPC20, Bra85, LM93b, Men17, PW06, PGV93e, PGV94, CCL91, GHW07, LC13, Omi89a, Sar11]. RP95, Roe95, YL97]. Block-Cipher-Based Bewertung [Hil82]. beyond [BRS02, GLC08]. Blockchain [BLC12, LJW+17]. BF-Based [WL12]. Bi [Dre17a, HM19, LSZ+21, YLZ20, ZXL19]. [MZL+19]. Bi-Index [MZL+19]. bias Blockchain-Based [HM19, LSZ+21]. [NN90]. Biased [JCK+18, TSY98]. Blockcipher [AP08, BCS09, BRSS10, bibliography [Pon87, Sab94]. Bicliques HKY12, LLJ15, PBGV89]. [LLW10]. Bid [SKM01]. Bidirectional Blockcipher-Based [AP08, BCS09, LLJ15]. [Cle84]. Big [ADOAH19, LRY+15, PSSC17, Blockciphers [RS08, PGV91]. blocking WZY+18, YGS+19, LL13, SA17]. [PBBO12]. Bloom [DKT06, HKL07, BigDecimal [Sun02]. Bijective HKLS12, HXLX13, LYW+18, MK11, PSS09, [Oka88, SS15]. Billion Ram89b, RKK14, RK15]. BLS [BP18]. [LLL+16, STS+13, ZBB+06]. BNCOD [Oxb86]. Boas [Wil00]. Boca Billion-Requests-Per-Second [LLL+16]. [HB93]. Body billion-vertex [ZBB+06]. BiloKey [WS93, JWM+18, Lia95, War14]. [MZL+19]. Bin [WLWZ19]. Binaries Bonaventure [ICD86]. bond [ZBB+06]. [ASWD18]. Binary Bonsai [DCW91]. Bookshelf [Cro98]. 10

Boolean [AN96, ACZ16].´ booting [LC95]. C/C [Pla98]. CA [ACM03a, ACM08a, Bordeaux [AGK+10]. Boston [ACM84a]. ACM11, DJNR09, IEE13, Joy03, Cop95a]. bottleneck [MBK00]. Boulder [ACM77b]. Cache Bound [Ari94, SG16, Sun91, Sun93, vT14]. [Ask05, CGLC20, PWYZ10, PWYZ14, Pro18, boundaries [SS15]. Boundary [KSSS86]. PSS09, SBS16, SKC07, YNW+09, YT16, Bounded [DS84a, LL86, Lom83, Lom88, ZH18, AZ10, BFCJ+12, CCHK08, HSMB91, MN90, GHK+12, RM88, TB91]. KSC11, KSC12, MZK12, QM98, WLC20]. bounded-depth [GHK+12]. Bounds Cache- [PSS09]. Cache-Conscious [BGS96, Cha94, CV08, DKM+94, GadHW96, [Ask05]. Cache-Oblivious Gon77, KM86, KM88a, KVK12, MNP08, [PWYZ14, PWYZ10]. Cache-Optimized OWZ14, Woe01, Woe05, Yao83, BvT13, [ZH18]. cache-partitioned [MZK12]. DKM+88, DKM+91, GHK+12, Rad92]. Box Cache-tries [Pro18]. Caches [BRS02, Rja12, SV94b, BZZ12, SV95]. [SBS16, SVCC01]. Caching braids [LMP+08]. Branch [LBJ02]. [DB12, KM92, Rey14, WBWV16, XBH06, Branches [DGGL16]. Branching [FS82]. BCR10, Cha12, HL05, KLL+97, KSB+99, breaking [DK94, MPST16]. Brent [FL73]. She06, WZ12, WY00, WY02, ZO13]. CAD Bridging [ACM04]. Brief [DLH09, KS12]. [KI94, Bar97]. CAD-based [KI94]. Cake Brighton [Dav91]. Brisbane [CHSC18]. California [DG96, MSDS90]. British [ACM82, ACM86b, ACM07, Ano10, Bel00, [ACM08b, Oxb86]. Broad [PACT09]. Bri92, Bri93, CRS83a, Cop95b, Fra04, ICD86, Broad-Phase [PACT09]. Broadband ICD87, ICD88, ICD90, IEE11b, Kar98, [SMS91]. Broadcast Shm00, Sho05, Sti93, Sti94c, Sto92, USE90, [YSW+11, GBL94, SNW06]. Broadcasting Wie99, Yun02, Col93, IEE88a, IEE06]. [KCF84, OCDG11]. Broken [CP91c]. California/Special [ACM82]. Call Broker [TGL+97]. browser [NM02b]. [HLC10]. Cambridge [ACM86a, BV89, Brussels [Vid90]. Brute Gol96, JBJ94, Kil05, And94]. CAMELOT [CJP12, LS07a, CJP15]. Brute-force [SPB88]. Camera [BH93]. CAMsure [CJP12, CJP15]. BST [AZ10]. BTB [RSK17]. Can [CP91c, Dam93, Pal92, [LBJ02]. Bubble [Wri83]. Bucket Sim98, Dam94, GMW90, Sch91a]. Canada [CS82, Dev86, Joh97, Kab87, KNT89, KO90, [ACM02, ACM05, ACM08b, AFK90, DSZ07a, Lyo85, QCH+81, Rog95, Rog99, Tam81, DSZ07b, JY14, LL08, Lev95, Yua92]. TYZO15, Tra63, YD86b]. Bucketing Canadian [CCC89]. candidates [ABM+12]. [Pal92]. Buckets Canonical [DNV81]. canonicalizing [Hac93, JV16, VP96, VP98, KHK12]. Buﬀer [FGFK10]. Canterbury [Oxb86]. [LBJ02]. Building [AOD19,¨ BC06, HKL07, Capabilities [RS12, Tra63]. Capability Mit17, PV95, RMB11, WHS+07, PvO95]. [Fab74, Wan84]. Capability-Based [Fab74]. Built [Win84, DTM+18]. built-in Capacity [KK85, Tan83, HO72]. Cape [DTM+18]. Burden [Oak98]. burst [AZ10]. [IEE05, MS05]. cardinalities [GGR04]. Bushy [CHY93]. Business [Bra88, Luh58]. Cardinality Bystrica [Rov90]. bytecodes [SUH86]. [BHIMM12, GLLL17, HM03, NTW09]. Byzantine [HGR07]. Cards [Ku04]. Carlo [BF83, Rey14]. Carolina [ACM91c]. Carry C [Pla98, USE90, ACZ16,´ Blu95, Eug90, [GK08, FJ13, LK16]. Carry-Less GBY91, Pro89, Sed90, Sed92, Sou92, Tay89]. [GK08, LK16]. carry-truncated [FJ13]. 11

Carter [Sar80]. Cartesian [Du86]. Characteristics Cascade [KZ84, RTK12]. Cascaded [Bay74, DR06, SDT75, DLH+79, RP95]. [Jou04]. Cascading [Wan14]. Case Characterization [ANS09, ANS10, AR17, DMV04, DS09c, [BR14, CPP08, Lyo83, van94]. Ell85b, F+03, FKS84, HBL+10, Kut10, Characterizing [LH03a, RTK12, VZ12]. Lar82a, YLB90, BGG94, FPSS05, Lar81, checker [Wie86]. Checking Mic02, MT16, SKD15]. case/average [CKN18, Hea72, IJK13, AD08, Wil96]. [Mic02]. cash [Bac01]. Casino [IEE84]. Checkpoint [LACJ18]. Cassandra [EH17]. Catalonia [LSC91]. Checkpoint-Restart [LACJ18]. Catalunya [CTC90]. Categorization Checkpointing [FRB11]. checks [SB07]. [MBBS12]. Categorized [LLG+17]. checksums [GKKT10]. Chemical Cathedral [IEE88a]. Cauchy [TI12]. [WKO78, ZBB+06]. Chennai [RRR99]. Causal [SDZ21]. Caution [Mul91]. Cayley Chicago [ACM88b, ABM06, BL88, IEE82, [GM18, Zém94]. CBC [BBKN01, BBKN12]. Lom93, IEE80a]. Chile [BJZ94, CHK06]. CCA [CZLC14]. CCA-Secure [CZLC14]. China [Ano83, HL91, IEE11a, LC06, Yan10]. Cell [Mil99, Pag01, SZO+20, Sun93]. Cells Chinese [CS85b, YkWY83]. Chinesizing [JCK+18, WH83]. Cellular [Zou85]. Chip [MJBD11, Mot84, YNW+09]. [DGV93, MZI98]. Center Chisel [HCJC06]. Cho [SPLHCB14]. [ACM91b, CGLC20, Fis87, IEE90, Rie89]. Choices [FP10, DKRT16, KM08]. Centers [SWTX18]. Centric Choosing [KLSY07]. chopMD [CN08]. [LT12, SPSP16, WBWV16, XHZ+19, AK09]. Chord [KLSY07]. Chosen [CS02, Sho00b]. century [ACM91b]. Certain [Chr84, van94]. Churn [LMSM09, LMSM12, WTN07]. Certificate [MFES04]. Certificates [LK07]. Churn-Resilient [LMSM09, LMSM12]. Chain [EAA+16, JLH08, LAKW07, LHC05, Cichelli [BF83, Cic80a, GS89, JO80]. CICS SKM01, YZ00, YSEL09, Bay73b, Par18]. [Bra88]. CIKM [FNY92]. Cincinnati Chained [Bay73a, HNS84]. Chaining [BD08]. CIoT [ZZLZ18]. Cipher [BBP88, Cha94, CPP08, DDMM05, GSC01, [And91, BRS02, Dae95, cLmL07, NCFK11, Joh61, Kue82b, MJBD11, Rag93, VC85, QG89, QG90, WSSO12, GLC08, HL03, CBB05, Kno84, KdlT89, KFG15, Lar84, ISO97, RS14, YL97]. Cipher-Based PW06, TT81, TT86, TLLL18, Kue82a, [NCFK11]. Ciphers Kue82b]. Chains [BBKN01, BBKN12, Fil02, KP96, LM93a, [BT12a, FL04, Jan08, Ngu06, YKLH10, Pre97a, Roe94, SDMS12, SDMS15, Zhe90, ZQSH12, HL94, JFDF09, SN19]. challenge DS09a, HLMW93, HXMW94, Lai92, LM93b, [GJM02]. challenges [BVF12, GJM02]. PGV93e, PGV94, RP95, Roe95]. Challenging [MSP12]. Chameleon Ciphertext [CS02, Sho00b]. Circuit [BR14, GZX14, PWY+13, LWG11, CTZD11, [NRW90, Ste82]. Circuitry [Cai84]. Moh11, Zha07]. Champion [KI94]. Change Circuits [DLT98, MD05, GHK+12, Mil98]. [DHK+15]. changeable [HYLT99]. circulant [AN20]. Cirencester Changes [Dan13]. Changing [Boy95b, Boy95a, Far93]. City [VLD82, [Lit78, Litxxb]. Channel Fre90, GMJ90, IEE84, IEE99, JBWK11]. [GO07, RWSN07, MS09]. channels Class [CMW83, DadH90, DS09c, MCW78, [SNW06, Wu05]. chaos [McN03]. Chaotic AAGG16, DM11, Eug90, SN19]. Classes [PPS21, Sch01a, YY07]. CHAP [HDCM09]. [ACZ16,´ CW77a, CW77b, CW79, KW12, Character [Dav73, YkWY83, Sab94]. Mul91, Sie04, WC79, van94, Bie95, DS09b, 12

Sar80, Sie89]. Classification [GCMG15, KP96, KP97, KGJØ18, LQH18, SVCC01, HSPZ08, McK89a, PT11b, SY08, And93, TW07, BJKS93, BJKS94, Bou95, Fal86, CKKK09, IG94, LS07b, McK89b, XLZC14]. Fal88, FM89, GHK +12, Gob75, IG94, Kri89, classifications [LZ06]. Classifier Mil98, Sti91, Sti94b, vT14, Far93, Bie95]. [GK95, KG95]. Clause [CJ86, Llo81]. Claw codification [FDL86]. Coding [BHT98, BHT97]. Claw-Free [Blo70, Boo74, Bur77, Bur78, Bur79, CJ86, [BHT98, BHT97]. Client [DR92, TC04]. DA12, Dav73, Dos78a, FH69, Gon77, HP63, Client-Server [DR92]. client-side [TC04]. HJ75, HG77, Kam74, Lit77b, Mar64, Mar71, Climbing [CL95]. Clocked [LN93]. clone Pip79, SD85, SDKR87, Sta73, Web72, [Kos14, LG13]. closed [SS89a, SS90a]. Boy95a, Boy95b, Bur76a, Coh94, DVS+14, Closest [Val15, DHKP97, TYSK10]. Far93, LG78, Riv74a, Sab94, SDR83b, closest-pair [DHKP97]. Closing [PNPC20]. Sch79b, MKL21, Ytr06, HJ75]. Coefficient Closure [CdM89, CdM90, GC90]. cloth [KKN12]. coherency [FWG18]. Coherent [TWL+18, TWL+18]. Cloud [GLHL11]. Coin [CLP13]. Coins [HNKO20, HWZP18, LRY+15, Mir17, [HR04, Ros12]. Collaboration [JXY07]. Nak21, DMB19, GB17, HLL18b, SZO+20]. Collaborative [ADOAH19, WY00]. cloud-RANs [SZO+20]. Cluster Collecting [FW76, FW77]. Collection [SKC07, KSC11, KSC12, TC04]. Clustered [AG93, LXL+19, TR02, UIY10]. [Rot89]. Clustering [AII89, Bel70, Bel72, Collections [BBD+82, BBD+86, LRY78, Bel83, BBS90, CdM89, CdM90, Gui75, LRY80, DTM+18, SV15b]. College [Jáj90]. Gui78, KBG18, Mac95, MNY81, PKSB18, collide [GNP05]. Collision SPSP16, AOD19,¨ Gui76c, NH74, SX08]. [Ask05, BG93, BR97, BM97, BK12, BKMP09, Clustering/hashing [AII89]. Clusters CHKO08, CJC+09, Dam87, HM96, HHL10, [TY03]. Clutter [MBBS12]. CLV [CF89a]. HCJC06, IKO05, IT93, IH95, KKT91, MS09, CM [PW94]. CM-5 [PW94]. CMAC MNS12, Men12, Mit12, MOI90, MOI91, [CG92]. CNF [BHIMM12]. CNN MC86, NSS+06, Pey15, PACT09, PBGV89, [SYW+20]. Co [ZWCL10, HLH13]. PGV90b, PGV91, Rus92, Rus93, Rus95, Co-hashing [ZWCL10]. co-processing Sam81, SY11, SHRD09, SHF+17, Vau92, [HLH13]. Coalesced Vau93, WYY05a, WYY05d, XNS+13, YB95, [CV83b, CV84, Che84a, Che84b, CV85, ZBB+06, vW94, AKY13, BGG93, BF08, CV86, Jan08, MS88b, Pal92, Pit87, Vit81a, CHKO12, Con17, Gib91, ITP14, KdlT89, Vit82b, Vit83, VC87, CV83a, PY88, Vit80a]. Men17, MT16, PGV93g, Sar11, SKP15, Coalescing SBK+17, TWL+18, Van92, WS13]. [Vit80b, Vit80c, Kno84, SSU+13]. Collision-Free coalescing-lowering [SSU+13]. Coast [BM97, HM96, Rus92, Rus93, Rus95, [SZ93]. COBOL [Bra88, Zou85]. Cod SHRD09, BG93, HCJC06, PBGV89, Vau92, [IEE05, MS05]. Codasyl [Gra86]. Code Vau93, ZBB+06, BGG93, Van92]. [BK70, Bel70, Bel72, Bel83, BMB68, CLD82, Collision-Mitigation [SHF+17]. Chu90, DC81, DL80, Eck74a, FIP02a, Collision-Resistant Gon81, KKRJ07, Lam70, LBJ02, Mau83, [BR97, BK12, CHKO08, IKO05, CHKO12]. Mit73, SV15a, Sun15, CD84a, CLS95, Cli95, Collisionful Mau68, Mer72, MF82]. Coded [Bay73c]. [BPSN97, Gon95, Li95, BSNP96b, BSNP96c]. codering [Lit77a]. Codes [BKST18, BGS96, Collisions [Ano95a, BI87, BT94a, BT94b, Bie97, CLP17, Fal85a, Har97, Irbxx, JP07, CY06, DBGV93, GIS05, GL73, HR04, IP08, 13

IP11, LCL+20, Pat95, VNP10, WFLY04, Comparing [MRL+19]. Comparison WYY05b, WYY05c, DV07, Gon95, Li95, [CHS+18, EK93, GG80, Jai89, Jai92a, Jai92b, Pat94, RVPV02, Sim98]. Colloquium Jaixx, LG78, LH03b, QCH+81, RLH91, [AGK+10, dBvL80, Kui92, NS82, Pat90, SDK91, Tro95, KK96, RLH90, TT86]. ADG+08, AMSM+09, ACJT07, CIM+05]. comparisons [FDL86, R¨on07]. Colony [ACM83a, ACM83b]. Colorado COMPCON [IEE88a]. compensated [ACM77b, ACM79, ACM85a]. Colored [ZRL+08]. Competition [Ros12]. coloring [HK83]. Columbia [Bur08, Bou12, jCPB+12, TSP+11]. [ACM08b]. column [DLM07]. ComBack compilation [HF13, SF88]. compile [WKBA07]. Combination [MP90]. compile-time [MP90]. Compiler [Qui83, TYZO15, US09]. Combinational [ACM79, Dit76, Wil96, Sag85b]. [MJT+02]. Combinatorial Compilerbau [Wal74]. Compiling [DM81]. [BK07b, DD11, DT75, KP94, Sti94a, van94, Complete [SDW14, Die90, GvR08, Rad92]. DJRZ06, DJNR09, HKLS12, MN99, Sed83a]. completely [Con17]. Completion Combinatorics [Wil85b]. Combined [ZWH17]. Complex [KHK15, ZC77]. Combiner [HS08]. [KM92, Mar64, MW95, Sch90b, SD90b, Combiners SD90a, War86, WS76, TD93]. [BDG+20, FL08, FLP08, FLP14, Mit12]. Complexities [GK76]. Complexity Combining [Adi88, Dam93, GHK91a, GHK91b, CTC90, [AGBR19, GSC01, TW07, NM02b]. Come KVK12, LLW10, Mai83, Mai92, MNT90, [PM89]. Command [CBA94, Gai82]. Mor83a, NRW90, SS88a, VV86, YSEL09, Comment [Ban77, FL73, Lam70, Pro94]. Ati20, BSU12, CKM14, MNT93, Mil99, Comments [AA79b, AA79a, BMB68, Pag01, SS90b, Sun93]. Component CTZD11, Piw85, TY91, Gib90]. [BFMP11, Cha88, MW09, SY08, SA97, Commitment [HM96, HR07]. US09, SGK09]. component-based [SGK09]. Commitments [ACP09, LP15, Wee07]. Components [de 69]. Composed Committee [IEE84]. Common [HGH+12, YkWY83]. Composite [DM90, GPGO16, ESRI14]. [Oto85a, RL89]. composites [GPGO16]. Commonwealth [Rie89]. Communication Composition [Sho00a]. Compositions [Alb21, KM88b, Ano93c, HO72, KK96]. [SS16]. Compound [MH00]. Communications [IJW89, GZX14, Sch01a, comprehensive [NM02b]. Compress ACM94a, IEE92a, IEE01]. communities [BBD09a, LT09]. Compressed [GO15, [ACM04]. Community [RMB11]. GLB21, JL14, Zuk21, BLC12, Ind13, Mil95]. Commutative [CLS12]. Compact [Cle84, Compressing [WMB94, WMB99, MP16]. CD84b, DCW91, DHT+19, KRJ09b, Kul84, Compression [BC08, CW91, HKY12, LYX+19, Oto88b, QP16, vdVL12, JCC00]. LJF19, Lis07, LG78, RT87a, GLM+10, compactage [LG78]. Compacte [Kar82]. SMS91, SM08, SM12, AGJA06, BD82, Compaction CKW93, FS08, GSS01, Li10, Sab94]. [HC87, Rag93, WKBA07, SD95]. compactly compression-oriented [CKW93]. [VNC07]. comparaison [LG78]. COMPSAC [IEE80a, IEE95, Kna89]. Comparative Comput [Sar80]. Computability [ACM82]. [Cra85, DTS75, GLG+02, Hil78b, Hil78a]. Computation [ACM94b, AiNOW11, Chi91, Comparator [Bur84, Bur82]. compare Chi94, DJRZ06, IEE11a, J´aj90, Jen76, [BVF12]. compare-by-hash [BVF12]. Lak96, Lev95, Ng79, RK91, Tam85, ZO93, 14

ZLC+12, vdHvH12, Fis87, MYS12, Ano93d]. [AR16, CLP13, Cha88, CHS+18, CHSC18, Computational [CCC89, Cer83, LYW+18, Ell83, HYH89, HYH93, HY86, HTY90, MNT90, Sab94, Wil00, de 69, Dam94, Kum90, MSD16, MSD19, MSSWP90, Omi88, GvR08, IKOS08, MNT93, Sch82b]. Omi89a, PBBO12, SDW14, SG88, CCL91, computations [FHL+19, GK12b]. MMC01, MRL+19, Pro18, TMW10]. Compute [Bra84a, Bra85, Bra86, Tro92]. Condensation [CT96]. Condensers Computed [TT81, TT86]. Computer [ATS19]. Conditionally [ACP09]. [IJW89, ACM91b, AFI63, AFI69, AH03, Conditions [IKO05, IH95, Rus92, Rus93, iA91, iA94, Bar83, BCH87, Bor81, DS97, Rus95, BDPV14]. Conference Ell82, Gol94, GT63, HS78, IEE76, IEE80b, [ACM81, ACM85a, ACM91b, PDI91, IEE80a, IEE82, IEE84, IEE85a, IEE88c, ACM94c, ACM04, AFI69, ABB93, AFK90, IEE88a, IEE88b, IEE89, IEE91b, IEE92b, VLD82, Ano89, AW89, AAC+01, AOV+99, IEE95, IEE99, IEE05, IEE06, IEE07, IEE10, AA86, Bai81, BD88, Bar83, BDS88, BV89, IEE11b, IEE13, Jai89, Jai92a, Jai92b, Jaixx, BIP92, Bel00, BJZ94, BRW93, BL88, Bor81, Jou85, KCF84, KO90, Kna89, Knu73, Knu74, Boy95a, Bri92, Bri93, BJ93, CCC89, CGO86, Knu75, Kon10, Leb87, LC86b, LC95, LL83, CLM89, Cop95b, DSS84, Far93, FNY92, Mar75, Mar77, MS05, RRR99, RJK79, Rie89, FMA02, Fra04, Fre90, GMJ90, Gol92, Rov90, Ruc15, SK99, Wal88, Wil85b, Win78, GSW98, HB93, IEE80a, IEE85b, ICD86, ZZ83, ACM94c, Ano93c, Don91, Er86, ICD87, IEE88a, IEE88d, ICD88, IEE88b, FP89a, GK05, GBL94, HCF95, IEE92a, CTC90, ICD90, ICD91, ICD93, IEE94c, IEE01, MLP07, Mo92b, OT89, RG89, IEE95, IEE02, IEE11a, IRM93, JBJ94, TWW77, vL94, ACM94a, Ano93a, PGV93c]. Jou85, JY14, Joy03, Ker75, Kna89, KLT92, Computer-Recognized [RJK79]. LC06, Las87, LCK11, Lie81, LS89, LT80, Computers [FHMU85, MK93, PSR90, LSC91, Lom93, MK89, MSDS90, Mo92b, Rad83, SB93, RFB97, Deb03]. Computing Nav85, Oxb86, PV85, PK89, QG95, RRR99, [ACM75c, ACM75a, ACM76, ACM77b, Rie89, RK89, RNT90, Sch82a, ST83a, ST83b, ACM84b, ACM85a, ACM86b, ACM88b, SP90, Sho05, SW94b, SC77, Sti93, Sti94c, ACM89c, ACM90, ACM91e, ACM96, Sto92, SM08, SM12, USE91]. Conference ACM97b, ACM98, ACM01, ACM02, [USE00a, USE00b, Vau06, Vid90, WPY90, ACM03a, ACM04, ACM07, ACM08b, lWSS91, Yan10, Yao78, Yua92, Yun02, ACM11, ACM12, Bai81, DT87, IEE94c, ACM94a, ARA94, Ano83, Ano93a, Ano93c, KKRJ07, KLT92, LCK11, Ram87, Rei88, Boy95b, CE95, Cop95a, DG96, DT87, Deb03, Tro95, AFK90, GHK+12, GB17, GC90, HF13, IEE92a, IEE94a, IEE94b, IEE01, LVD +11, MN99, Pri95, Bai81, GT80, Rie89, Kil05, PSN95, SW94a, TWW77, USE90, ACM77a, WGM88]. Concatenated Wie99, ??69, ACM75c, ACM76, ACM77b, [CD84a, DC81, HS08]. concatenation LFP82, ACM91d, AFI63, YR87]. [BJKS93, BJKS94]. Concept Confidence [DGD02]. Configurable [Kie85, Lum73, Ter87, Ano09b]. Concepts [vdBGLGL+16]. configurations [CL09a]. [KTMO83b, vL94]. Conceptual [FZ87]. Confinement [NS16b]. Confirmation Concise [PT12b]. Concomitant [MWC12]. [MOI90, MOI91]. Congress [Gil77, Ros74]. Concrete [GKP89, GKP94]. Concurrency Conjecture [KPS92]. Conjunctive [Stu85]. [Ell85a, Ell87, Ell88, FK89, GG74, HSM95, Connected [OL89, TY91, OT89]. Kum89b, Kum89a, LSV89, Moh90, Moh93, Connection OA89, SDK91, GT16, MTB00]. Concurrent [And88, BM90b, Mic02, KK96, RH92]. 15

Connections [LK07]. Conscious Convention [ACM91b, Rie89]. Conversion [Ask05, ZHB06]. consed [BJM14]. [Omi88, Omi89a, Sab94]. Converting consequences [Woe06a]. Consideration [MV91a]. convolution [OS14]. [CJP12, CJP15]. Considerations Convolutional [DHT+19, WWG+18]. Cool [SM02, Wri83, PW06]. consing [AG93]. [EMM07]. cooperation [JFDF09]. Consistency [LWZ+18, SDZ21]. Cooperative [XBH06]. Copenhagen Consistent [KLL+97, MVB+21, Nak21, [BIP92, FS09]. Copies Sun15, KSB+99, LDK12, WL07]. consonant [RSSD89b, RSSD90, RSSD92, CWC10]. [Wan05]. Constant [ANS10, BM99, F+03, coprocessor [TLLL07]. Copy LP15, Mul85, PP08, PPR09, Sie04, DW05, [LH20, MHT+13, YCJ12]. Coq [BJM14]. DW07, FPSS05, GMW90, IKOS08, MV91a, Core [Kil01, SvEB84, AKN12, BATO13,¨ OP03, PPR07, Pro18]. Constant-Round CZL12, KKL+09, Nae95]. cores [BMS+17]. [LP15]. Constant-Time [Sie04, Pro18]. Corfu [Rei88]. Corporation [Fis87]. Corps constrained [RAL07]. Constraints [RMB11]. Correct [SS88b, CE95, CE95]. [BHIMM12, NNA12, Ati20]. Construct Correcting [BGS96, Har97, FM89, [CDMP05, Han17, SGY11]. Constructing GHK+12, Mil98, MF82]. Correction [CS85a, Cha86b, CFYT94, FFPV84, FCH92, [Bur84, KR79, RJK79, Ven84, Zam80]. HM12, Lis07, RS08, SS80, YD85, SL88]. correctness [AR21, MMC01]. Correlation Construction [TGGF10]. Correlations [Val15]. [ACM79, AN96, BCK96b, BBKN01, Correspondence [PH73]. Corresponding EFMRK+20, Eld84, IT93, KR01, Kut10, [AOAAK20]. Corrigendum [AA79b]. PV92, SP91, SSaS01,ˇ Sar10, Sch01a, BGKZ12, Corruption [DD11, DJSN09]. BDPV08, CML+13, CL09b, Woe06a]. Corruption-Localizing [DJSN09]. Constructions [AHV98, BBKN12, BRS02, cosmological [War14]. Cost Bla00, DA12, Jou04, SG16, WX01, GPV08, [BM97, BBS90, CJP12, FCHD88, FCHD89, LS06, MvT08, NN90, VZ12, WC07]. GI12, HMNB07, Kut10, LYW+18, Lyo83, constructive [CLS18]. Container [Hej89]. PF88, CZ14, CJP15, VBW94]. Containers [Ben98, LACJ18]. cost/performance [VBW94]. Costs containment [KZ19]. Content [HR96]. could [PES+12]. Counter [GH07, Hin20, Koh80, MHT+13, RSK17, [GRBCC19, LMP+08, MKASJ18, NS16b, WDP+12, YTJ06, MJ14, TLLL09, XCCK09, Bac02]. Counter-Terrorism [GRBCC19]. ZO13, BB07]. Content-Addressable Countermeasure [LAKW07, MMMT09]. [Hin20, RSK17, Koh80, BB07]. Counters [WLWZ19]. Counting Content-Based [YTJ06, MHT+13, MJ14]. [Fla83b, FM85, McK89a, WVT90, DLM07, Contention [CadHS00, DG93, DG94]. EVF06, McK89b, RKK14]. coupled Continuous [HLH13]. course [PGV93c]. Couvrants [Coh98, PAPV08, GGR04, NW07]. [Kar82]. Coverage [IJK13]. covering continuous-discrete [NW07]. Control [CLS18, Rad92]. CoveringLSH [Pag18]. [BDPSNG97, CBA94, CL83, HLC10, JXY07, CPHASH [MZK12]. CPHR [WBWV16]. Kum89a, Moh90, Moh93, SDK91, XHZ+19, CPU [HLH13, QXL+20]. CPU-FPGA Ano93a, Ano93c, FK89, GJR79, HO72, [QXL+20]. CPUs [KKL+09]. CR [LACJ18]. Kum89b, MTB00, YL04]. Controlled Cracking [GAS+16]. CRAY [DS97]. [LRLW89, LRLH91, Mul81, WY02, CBA94]. creating [Sag85b]. creation [FVS12]. Controlling [LK07]. convened [Ano83]. Credential [YLSZ19]. credit [JFDF09]. 16 credit-based [JFDF09]. Crete [ACM01]. Cop95b, Dam91, De 95, GQ95, Joy03, Criss [GRZ93]. Criss-Cross [GRZ93]. PSN95, QV90, QG95, Sho05, Wie99, Yun02]. Criteria [Adi88, AII89]. Criterion [Sun15]. Cryptosystem [Jun87, KKT91]. critical [NM10]. Cross [CJN20, GRZ93, Cryptosystems [Oka88, Wee11]. CS2 LWZ +18, MLHK17, WB90, QZD+18]. [NM02b]. CT [Joy03]. CT-RSA [Joy03]. Cross-Media [LWZ+18]. Cross-Modal Cube [OL89, TY91, OT89]. [MLHK17, CJN20]. cross-platform cube-connected [OT89]. CubeHash [QZD+18]. Cryptanalysis [Aum09, BS91a, [AD11, BP09, BKMP09, KKMS10]. Cuckoo Bih08, BCJ15, BHT98, BP09, DGV93, [ANS09, ANS10, ADW12, ADW14, Dae95, GO07, GIMS11, HPC02, JNPP14, BHKN13, BHKN19, DM03, DS09c, DMR11, Knu92, LP16, LKY04, MR07, Mon19, FPS13, FMM09, FMM11, KMW08, KMW10, NXB13, GLM+10, SPLHCB14, SV94b, Kut10, Mit09, NSW08, PR01, PR04, Pag06, Wag00, WSSO12, WYW14, AP11, BS91b, PRM16, PS12, SHF+17, TK07, DS09b, BS91c, BHT97, CV05, RP95, SV95]. KM07, Kut06, DK12]. Cumulative Cryptanalytic [CJMS19]. CRYPTO [LPWW06]. CUPID [KS89a]. Curve [Bel00, Bra90, Bri92, Bri93, CRS83a, [ANS05, MSTA17, OOB12, TK17]. Curves Cop95b, Fei91, Fra04, MV91c, Sho05, Sti93, [BGH12, FT12, She17, WX01, BGH+13, Sti94c, Wie99, Yun02, Hil05, CP91c]. BP18, CDS20, FSV09, FFS+13, Far14, Crypto’91 [DBGV93]. Cryptoanalysis GZ99, LS06]. Cyber [LSZ+21]. [HSIR02]. Cryptographer [Joy03]. Cyber-physical [LSZ+21]. Cycle Cryptographic [MJBD11]. Cyclic [DH84]. Cycling [Saa12]. [ARH+18, BDPSNG97, BCR04, BDP11, cyphers [Far93]. Czechoslovakia [Rov90]. BDP97, Bur06, jCPB+12, CLG09, CP87, CP88, DA12, DC98b, Dam90a, Dam91, D [CBA94, EAA+16, Fly92, GG92, GK94, DDF+07, Dav91, DY90, DY91, GO07, Hel94, LMJC07, LDY+16, PPS21, SYW+20, MKAA17, PTT16, Pre93, PGV93d, Pre94b, WSSO12]. D-Based [WSSO12]. d’Acces PBD97, Pre99, Pre94c, QV89, QV90, QG95, [Lit77b, Kar82, Lit77a]. d’Adressage RRS06, Rja12, RS08, Rue93, SS01, Sch91b, [Lit79a]. Dallas [ACM98, IEE95, USE91]. Sch93a, SZ93, SGY11, Sti06, TSP+11, Vau06, Damg˚ard AY14, ABO+17, BNN+10, BD92, BOY11, [DGV93, Pat95, CDMP05, Gib90, Mir01]. CP13, De 95, ESRI14, GPV08, GS94, GQ95, Dana [Ano10]. Darmstadt [TWW77]. IN89, KR19, KTDB20, Mic02, NY89b, Darstellung [Koe72]. Dartmouth NY89a, RAL07, Sch93b, Sch93c, YZ16]. [Ano93d]. Dash [LHWL20]. Data Cryptographically [PGV92, Aam03]. [ACM81, ACM82, ABB93, AHU83, ABM06, Cryptography [ANS97, ANS05, ACZ16,´ ADOAH19, AHS92, VLD82, Ano85a, Ano89, AG18, BD08, DK02, DK15, IKOS08, She17, AW89, AAC +01, ANT85, ADF12, BC08, Wol93b, Ytr06, BGG94, BBD09b, Far93, BD88, BDS88, BJL16, BCH87, BJZ94, GNP05, JY14, KL15, Kil05, PGV93c, BFR87, BL88, Boy98, BJM14, BJ93, CLS12, Wol93a, Boy95a, Boy95b, DG96]. CGLC20, CJC+09, Chr84, CGO86, CLM89, Cryptology DA12, DSS84, DT87, DSZ07a, DSZ07b, [Bri92, Bri93, CRS83a, CP87, Dam90a, DP08, Dre17b, EjKMP80, Eld84, Ell83, Dav91, Fei91, Fra04, Hel94, IRM93, LC06, Ell85b, Ell82, Fel88, FM85, Flo77, FB87, MV91c, QV89, Rue93, SP90, SZ93, Sti93, FBY92, FMA02, GMJ90, Gho77, Gho86, Sti94c, Vau06, Bel00, Bra90, CP88, Cop95a, GCMG15, Gol92, Gon83, Gon84, GBY91, 17

Gre21, Gri74, Har71b, Har73, HWZP18, Van10, Han90, HCKW90, He87, Hsi83, Hel91, Hil78b, Hil78a, HZ86, Hil88, HS84, HF13, IH83, KGJG12, Kie85, Kim80, KL87, IEE85b, ICD86, ICD87, ICD88, ICD90, KTMo83a, KO90, Kue84b, Kum89a, LC86a, ICD91, ICD93, IH83, IABV15, JL14, Ker75, LL08, Llo81, Ouk83, SD89b, Sch90b, SD90b, KP81, KS12, Kru84, KHH89, LC20, Lie81, SD90a, Sha86, She91, SDK91, Sto88, Tan83, LT85, LRY78, LRY80, Lit89, Lit84, LL87, Toy86, Ull82, WVT90, Wie83, Wie87a, LS89, LRY+15, LT80, LSC91, Lom93, LG78, Yam85, YNKM89, ZJM94b, AS89, AKN12, LMR02, MLHK17, Mar75]. Data DKO+84d, EH17, EBD91, FNY92, GC90, [Mar77, McC79, MSDS90, MEK+14, Nav85, HF91, ISH+91, JBJ94, MBK00, PS08, NR12, PSSC17, PRRR15, PV85, PW94, SSW94, SK88, SE89, SP89, TL93, Vak85, RNR13, Rou09, RK91, Sar10, Sch01a, WC94, ZJM94a, ZJM94c, ODB89, BF89, SDW14, ST83a, ST83b, SW86, SW94b, KKP92]. Databases Ste82, Sto92, SM08, SM12, SW87, SWTX18, [AS82, AOV+99, Bal96, Bal05, BDPSNG97, TKH20, Tan83, TC93, TY03, TA81, TA86, BG80, Bat81, BG82, BS94a, CCH09, Chu90, TGGF10, TS85, TGL+97, Top92, Toy86, Chu91, DDF+07, DT91a, DT91b, FM91, TS76, TS84, VL87, Wal88, WPKK94, FHCD92a, GY91, Gra92, Gra93c, GC95, WZY+18, WS76, WH83, Win90a, Wir86, GSW98, Heu87, HCY97, Kaw15, KR91, WDYT91, WYT93, Wu85, YDT83, YSW+11, LOY00, LDM92, LOON01,¨ Oxb86, RZ90, YGS+19, YLB90, Yua92, Zam80, ZLLD18, RNT90, Sch82a, SPW90, SW91, TRN86, ZO93, AK09, BR75, BZZ12, BVF12, Toy93, ZHW21, AOD19,¨ AP92, BW89, BCGS16, BGG12, BPT10, BMLLC+19, FHCD92b, HC07, ISO97, KR88, MSZ+20, CXLK19, CLW98, CRS83b, Col93, CH09, MIGA18, SB95, SB97, SI09, ZLC+18]. DMB19, FP89a, FVS12, GB17, Ged14, Dataﬂow GP08, HC11, HF91, HSMB91, HF13, IGA05, [DGG+86, Ger86a, Ger86b, Gra94c]. IL90, JDW+19, Kak83, Kan91, Kan93, Datalog [GST90]. Datasets KRJ09a, Koe72, LNS96, MSK96, MV08, [OGAB14, WZY+18, BZL+15, HAKM15, NT01, NM02b, OS88, PL21, SLC+07, SB07]. LRU14, Mil95]. datastructure [B¨ut86]. data [She06, Shi17, SE89, SW94a, SA17, Dateiorganisation [Nie75, Wie89]. TKT+89, VL97, Vit01, WM93, WTZ+13, Dateistrukturen [Fri86]. Datenbanken Wil78, Wil85a, Yao78, YLC+09, Yu92, [Lut88, Nee79, Stu82, Wie89]. YG10, ZKR08, ZLL+07, ACM75b, GJM02, Datenbankmaschine [Pet83]. ICD87, IEE94a, MO92a, Vit01]. Data-base Datenbanksystemen [Kue83, Kue84a]. [Mar75, Mar77]. data-centric [AK09]. Datenorganisationen [Oll89]. data-driven [TKT+89]. data-independent Datenstrukturen [DF77, LS85, Meh86, [BCGS16]. data-intensive [Shi17]. Nol82b, Oll89, Wir75, Wir83, OK80, Koe72]. Data-Parallel [LC20]. Data-stream Datenverarbeitung [Lut88]. Dawning [Tan83]. Data-structures [Har73]. [Cro98]. Dayton [IEE94b]. DB2 [BFG+95]. Data/Knowledge [BCH87]. databanks DBJ [ZJM94a, ZJM94b, ZJM94c]. DBMS [FDL86]. Database [Gra86, KR86b, KR86a, KP81]. DC [ACM82, ACM83a, ACM83b, ACM85b, [ACM84b, BJ93, Fis87]. DCC ACM86a, ACM88a, ACM89b, ACM89a, [SM08, SM12]. DCT [TLZL16, TCY+20]. AA86, Bab79, BG92, DCW91, DKO+84b, DDH [Dev93]. de-amortize [KM07]. DKO+84c, DKO84a, DGG+86, DGS+90b, De-amortized [ANS09]. De-duplication DGS+90a, DNV81, DT91b, GD87, GHJ+93, [BC08]. Dealing [Bre91, Vit01]. death 18

[For09]. Deauville [BF89]. December Ull70, VC87, Wie83, Wie87a, XNS+13, [PDI91, And94, AiNOW11, Boy95a, Boy95b, YNKM89, AR21, Bur82, CE95, CKB81, Far93, HL91, IEE88b, LC06, RRR99, SZ93, CKB83a, CCL91, CZ14, Dam94, DMB19, Yan10]. Decentralized [HNKO20, LB07]. Lai92, MSZ+20, MAK+12, Mol90a, Mol90b, Decision [Eng94, CKKW00, QP16]. OVY94a, PGV93g]. Designing [GM91, decision-trees [QP16]. Declustering Lin96, Mor83a, Zhe90, DC94, MPL09]. [FM89]. Decomposition [NS16a, Spe92]. Designs [Bat82, BR14, Bur75b, CC88a]. Decompositions [GO15]. Decoupled Desirable [LCL+20]. Destaging [NKT88]. [RKLC+11]. Decoy [MIGA18]. decryption Detect [WLWZ19]. Detecting [GBL94]. Dedicated [GAS+16, OTKH11, CWC10, MF82]. [HKY12, ISO97, ISO04, NM02a, Pre94a]. Detection [ADOAH19, CH12, CJC+09, deduction [PL21]. Deductive Kue84b, LQZH14, LLDZ18, LH20, LCL+20, [Llo81, TRN86, SSW94]. Deduplication MKAA17, MKASJ18, PACT09, TWZW11, [PL21, ZHZ+19, BVF12]. Deep TP15, Zam80, ZC77, FNP09, FES09, [CLYY92, CLYY95, CDW+19, DHT+19, GDGK20, Kos14, LG13, MHT+13, NADY20, SHZ+20, ZZLZ18, WWG+18]. defective PL21, YCJ12, ZLY+13]. determination [Hui90]. Deferred [Gri77, Vek85]. Defined [Kri89]. Determine [ZF06]. Determining [YD84]. definition [FNY92]. Definitions [Bee83, Mar71]. Deterministic [DCW91]. del [ACM82]. Delay [NDMR08]. [HMP01, MNS07, TLLL07, BK07a, FFS+13, Deletion HXLX13, Mil98, Ruˇz08]. Deutsche [BN85]. [AHS92, CV86, GG80, IG77, KV91, MV88, Develop [TC93]. Development TW91, VV86, Vit81b, Vit82a, MSV87]. [BV89, BIP92, CN07, Hil88, McI82, SSS05, Deletions [CF92, Knu77, PV19, KHK12]. Vid90, Web72, YR87]. Developments denial [Bac02]. Denmark [Ano95a, KR19, Lar85a]. Devices [BIP92, Dam90a, Dam91, FS09, NS82]. [KHK15, Sam81, YY07, Cho21]. DFG density [KD92]. Denver [MO92a]. DHA [AKY13]. DHA-256 [ACM79, ACM85a]. Dependencies [CS83a]. [AKY13]. DHT Dependency [SGK09]. Dependent [HNKO20, RCF11, SX08, UPV11]. [DTS75, Sch01a, SDT75, NMS+08]. depth DHT-Based [HNKO20]. DHTs [CQW08]. [GHK+12]. Derandomization [AN96]. Diagonal [PVM94]. diagonalization Derived [HB89a, HB92, HB89b]. Descent [Lia95]. Diamond [YGS+19]. diced [Nic17]. [DM81]. Description [FC87a]. Descriptor Dichotomy [HW08]. Dicing [Kon10]. [FLF11]. Descriptors dictionaries [DMPP06, DW05, DW07, [BRM+09, MBBS12, RLT83, SD85, Wu84]. GJM02, HMP01, MSK96, MN90, Mil98, Design [Adi88, AS82, AR16, Bat80, RRS07, Ruˇz08, Wen92]. dictionariis BMQ98, Bur84, CKB83b, CS83a, CS85c, [DMPP06]. Dictionary [CS82, DA93, CS85b, CS86, CCJ91, Che84a, Che84b, Dod82, Dos78b, McK89a, Rad83, Die90, CCHK08, DGV93, Dae95, Dam90b, Dam93, DHW08, McK89b, Rön07, Sun91, Sun93]. DLT98, DY90, DY91, DHK+15, DNV81, Diego [ACM03a, ACM07, Ano10, Sto92]. DS09a, Dev93, DM90, Die07, DT91b, EE86, Differences [Gri98]. Different GDA10, GSI+82, GT93, Gro86, Jag91, JP07, [LH03b, BW89, Jan05, KS88a]. KTMO83b, Kru84, LT09, LCLX19, LLA15, Differentiability [DRS12]. Differential OVY94b, PS93, PGV90b, Pre93, Pre94a, [AS82, BS91b, BS91a, BS91c, CH94, Dae95, QM98, QXL+20, Rad83, RLM87, SD89b, KKMS10, MMMT09, AGJA06, ITP14, 19

RP95]. diﬃculty [SKD15, SL88]. Diﬀusion Distinguishers [LJF19, SY11, AP11]. [SDMS12, SDMS15]. Digest [IEE88a]. Distinguishing [HSR+01]. Distortion Digital [ANS05, BDS09, Cai84, Cip93, [CKPT19]. distribute [Die90]. Distributed Fox91, GK12a, GT63, LM95, Mek83, Oka88, [PDI91, APV07, Ano10, BMS+17, CCF04, Oto85a, PW93, PGV93f, Reg81, Rou09, DPH08, Dev93, EFMRK+20, Ell83, Ell85b, Rul93, Ano09a, Ano13]. Digram [Wil79]. GGY+19, GYW+19, GSB94, adH93, HC13, DIMACS [GJM02]. Dimension HLC10, IK92, JXY07, KLadH93, KLM96, [CT96, LHC05]. Dimensional LK07, LMSM09, LC96, LB07, LACJ18, [AEP18, HYH89, KSSS86, Leb87, LOY00, LMR02, ML86, MS02, MPP14, MT11, Mey93, MNY81, Ngu06, ML15, RAD15, SWQ+14, MK12, NTW09, PRRR15, PAPV08, PF85, TYSK10, XMLC11, Yuv75]. Dimensioning RHM09, RMB11, SPW90, SW91, SDK91, [BP97]. Dimensions SM02, SPB88, Spe92, SWTX18, TT10, TP95, [AI06, GIM99, YWH09, AI08]. Direct TCP+17, VBW94, Wil03, YLZ20, BVF12, [DS84b, Kno84, RB91, VC85, Bay73b, BPT10, CCY91, DL06, DAC+13, HKW05, KdlT89, Mad80, TT81]. direct-access ISO97, KKP+17, KLL+97, Kha95, Kou93, [Bay73b]. Direct-chaining [Kno84]. LMSM12, LVD+11, LNS93, LNS96, MLP07, Directories [YY01]. Directory MPL09, MA15, SP89, WZ12, WTN07, [Gri74, KS88b, KS88c, Oto84, Oto88a, WTN09, XLZC14, ZGG05, ZLL+07, ZO13]. PADHY93, AP93, Pro94, THS97]. Dirty Distributing [CDH19, KW94]. [MZD+18]. Disc [CC87, CLC92, CF89b]. Distribution [AT93, BBS90, CM01, DTS75, Discovery [LKI10, PKW09, ZO13]. EAA+16, JCK+18, LMC07, PK87, RR92, discredits [Ano09b]. Discrete Sch01b, SDT75, WZY+18, AT90, GBL94, [ACM94d, SDA90, SDA91, ACM97a, ACM05, Vio05, XCCK09]. ACM08a, Gib91, Kar98, Li15, MLHK17, Distribution-Dependent [DTS75, SDT75]. Mat09, SSL+18, Shm00, vW94, NW07]. Distribution-Independent [DTS75]. Discretionary [BDPSNG97]. Discretized Distributions [RNR13]. Discriminant [SY08]. [KS86, KS87a, KS87b, KS89b, RTK12]. discrimination [CP95a]. Discriminative Distributive [NP91]. Disturbance [OSR10, HXLX13]. Discs [CF89a, CF89b]. [WLWZ19]. Dither [AP08]. DITTO [SB07]. discussed [Gre95]. Discussion [BBR88]. Diverses [LG78]. Divisible [FL04]. DISH [SKC07]. disjoint [AAB+92]. Disk Division [Eck74a, GL73, Gra88, Gra89]. [BGF88, Cha88, Du86, Gra94a, ML95, TC93, DLIN [CK12]. DM [KL95]. Do WB03, Kor08, Wil14]. disk-based [Bur06, HSR+01, HR04]. Document [Kor08, Wil14]. Disk-tape [ML95]. Disks [ANT85, DGM89, LR96a, Wil79, KRML09]. [CC91, Vit85, CCL91]. Disorder Documentation [DM90]. Documents [LL86, Lom88, RM88, TB91]. Displace [WWZ09, WMB94, WMB99, ZWCL10, [BBD09a, Pag99]. Displacement WLLG08]. Domain [BR06, Cor00, Cor02, [Pet13, FWG18]. Displacements DOP05, KK12, KK18, LT12, LLG12, PG95, [Jan08, Jan05, Vio05]. display [Sab94]. RS12, SGY11, SPSP16, ZNPM16]. Donald displaying [Koe72]. Dissemination [Ruc15]. Donnees [Kar82, LG78]. Don’t [RHM09, RCF11]. Distance [BFCJ+12, YT16, BCR10]. Dortmund [Bra84a, Bra85, Bra86, LH20, NNA12, [Lut88]. Double Zha19a, LP04, MYS12, ZDI+15]. Distances [Boo72, Bur05, CdM90, GS76, GS78, KLP98, [Bal96]. Distinguisher [Sch11]. LK94, LM93c, MB03, Men12, OOB17, Pal92, 20

Tho13, Yao85a, KL95, LM88, LLJ15, Men17, [NNA12, TK88]. editing [Koe72]. Edition Mol90a, Mol90b]. Double-Linked [Pal92]. [BFG+95]. Editor [BMB68, Fox91]. Down [LRY+15, PT11b, ZLC+12]. DPA Editors [RW97]. Education [LC86b]. [LRY+15]. Draft [MCF17]. DRAM Effect [KNT89, Mac95, Mai92]. Effective [CJKK19, KHK15, WLWZ19]. [FCHD88, FCHD89, HW08, PCY95, DRAMCache [PG17]. drive [BC06]. WDYT91, MA15]. effects [QM98]. Driven [Gra93b, Ven86, TKT+89, ZO13]. Efficiency [DB12, Leb87, PVCQ08, Ull72, DSS [Ano09a, Ano13]. Dual AR21, KST99, PT10b, WLC20]. Efficient [CDW+19, MNS12, Wee12, BR75, MJ08]. [AD08, ASWD18, ASBdS16, ASW07, Ast80, Dual-Stream [MNS12]. Dublin [ABB93]. AEMR09, ADW12, ADW14, BR14, BCS09, Dumping [Fro81]. d’une [LG78]. BOS11,¨ BPZ07, CFP19, CKB85, CLS12, Duplicate [LKI10, LQZH14, MD97, TW91]. DDF+07, DD15, DGM89, FES09, F+03, Duplicates [Bre91]. duplication FRS94, GGY+19, GM79, Gon83, GRZ93, [BC08, PL21]. durch [Hil82]. DWT Gri77, HT01, HM12, HDCM09, HHL10, [THY+18]. Dynamic HLC10, IN89, JDW+19, JD12, KU88, KR81, [AL86, AHS92, BGDW95, CS91, CR89, KLadH93, KLM96, KKRJ07, KJC11, KS12, CBA94, DGGL16, Dev93, DKM+88, KS86, KS87a, KS87b, KS89b, Kue84b, DadH90, DKM+91, DKM+94, ED88, HGH+12, LW88, LCLX19, LWG11, LXL+19, FNPS79, FHL+19, FS82, GT93, adH90, LH20, MZD+18, MSW19, MP16, MJBD11, Kaw85, Kie85, KNT89, Kou93, KS86, KS87a, MEK+14, MH00, MO92a, MKASJ18, KS87b, KSC11, KSC12, Lar78, Lar88a, MJT+02, Mul85, NN90, OOK+10, Pag99, Lar88b, LC88, LRY+15, LHWL21, MSW19, PAKR93, PAPV08, Pan05, PL21, Qui83, MS12, MS02, Mul84a, Mul84b, Mul85, RT81, RFB97, Rém92, Ros06, Ros07, Sac86, NKT88, OG94a, Ore83, Oto85b, Ouk83, SDMS15, Sch91b, Sch93a, SL16, SGY11, OS83a, OS83b, PLKS07, PG95, RZ90, RT89, SS88b, SvEB84, SPSP16, SKM01, TY03, RL82, RSSD89a, Reg81, Rob86, Ros21, TYZO15, TYSK10, TW07, TS85, TGL+97, Sch79b, Sch81, SSS05, TT10, Vek85, Wan14, Tsa08, VL87, Vit85, WYY05d, WWZ09, YD84, YLSZ19, YBQZ17, YD86a, YD86b, Woe06b, XHZ+19, YSW+11, YBQZ18]. ZRT91, ZJM94a, ZJM94b, ZJM94c, ZO93, Efficient [YGC+12, BLP+14, BZL+15, CS93a, DTM+18, DMPP06, DHW08, FRS94, BT93, CML+13, CZ14, CLW98, DS09a, FF90, Fro81, HKLS12, HR93, KD92, Lev89, FNP09, FPSS05, Gai82, HKL04, HCJC06, Lin96, Mil98, YG10, SKC07]. Dynamically adHMR93, IIL17, KU86, Lin96, LCH+14, [Lit78, Litxxb]. dynamicis [DMPP06]. LLA15, MSZ+20, MSK96, NADY20, Dynamiques [Kar82]. Dynamischen NTW09, OCDG11, PCK95, PBBO12, [DS84a]. Dynamischer [Hil82]. PSS09, RCF11, SSW94, Sch93b, Sch93c, SX08, Shi17, SV15a, UHT95, VL97, Wie86, E-HASH [HGH+12]. early WTN09, XLZC14, ZWT+14, SV18]. [CV83a, CKKW00, PY88]. early-insertion Efficiently [AP08, Kim99]. Effiziente [CV83a, PY88]. Easier [Bor81, Eug90]. [Meh77, Meh86]. eigenvalue [JWM+18]. Easily [CMW83]. Eat [CHSC18]. ECDSA Eight [Van10]. Eighteenth [ANS05]. ECHO [BOY11, Sch11]. [ACM86b, ACM91d, ACM91a]. Eighth ECHO-256 [Sch11]. EDBT [JBJ94]. Edge [ACM76, ACM89b, ACM89a, ACM97a, [XHZ+19, QZD+18]. Edge-Based VLD82, ACM96, Gol92]. Einfuehrung [XHZ+19]. Edinburgh [AOV+99]. Edit [Nol82b]. Einschrittcompilers [Dit76]. 21

Elastic [Hac93]. Elections [EH12]. [KCR11]. entire [FDL86, Nic17]. entity Electronic [Cip93]. electronics [IEE94b]. [ZLC+18]. Entropy elements [IG94]. elephant [WLC20]. [Ari94, ATS19, HHR+10, KM88b, NRW90, Eleventh [ACM87, IEE92a]. ELFs CKKK09, MV08]. Entry [YLB90]. [Zha19b]. Eliminate [BT94a, BT94b]. Environment [DGM89, MLD94, MLxx, Eliminating [Bel70, Bel72, Bel83, NH74]. MS88a, RS92, RL74, SD89c, SD89a, SSS05, elision [NM10]. Elliptic ZG90b, Kha95, QZD+18, SD89d, TMB02]. [BGH12, Gri98, MSTA17, OOB12, She17, Environments [ZG90a, GDA10, RCF11]. BGH+13, FSV09, FFS+13, TK17, ANS05]. EOS [BP94]. EPGAs [YTHC97]. Equality Embedded [SVCC01, vMG12, Hui90, [TD93, WC81, AD08, GRF11, ZCZQ19]. TLLL07, TLLL09, UIY10]. Embedding equalization [PCK95, UHT95]. Equations [CLP17]. Embeddings [AEP18]. EMD [Aum09]. Equijoin [SW91]. Equiprobable [BR06]. Emde [Wil00]. Emergence [Fox91]. [PB80]. Equivalence [Mar71, de 69]. Empirical [DMP09]. Employing [Per73]. eraserTM [AAGG16]. Erasure [KGJØ18]. Emulated [EK93]. Emulations Ergife [IEE88d]. Erlang [TCP+17]. [Kel93, Kel96]. en-route [YG10]. Enabled Erratum [FW77]. Error [Alb21, BZZ12]. Enabling [GYW+19, [BGS96, Har97, Kue84b, Mil98, MKASJ18, HDCM09, LCLX19, SMZ18, TT10, SLC+07]. RJK79, WLWZ19, FM89, GHK+12, Rön07]. Encapsulation [HM12]. Enciphering Error-Correcting [BGS96, GHK+12]. [MKASJ18]. Encipherment [BM76]. Error-Correction [RJK79]. Errors Encoding [Blo70, Zam80, MF82]. ErsatzPasswords [Ano95c, KP94, Wil79, CVR14, RRS07]. [GAS+16]. ESA [EF12, FS09, HM08]. Encodings [BHIMM12]. Encrypted ESAT [PGV93c]. essays [BC39]. [GYW+19, HWZP18, Kaw15]. Encryption Establishment [DL12]. estimate [Rön07]. [AG18, CS02, DC98a, Kal93, NTY12, PPS21, estimated [Nic17]. Estimating PRZ99, Sar10, ZZM17, ZHZ+19, And94, [Leb87, MBKS07]. Estimation BR94, Bir07, Gol96, GBL94, Sab94, ZCZQ19]. [GLLL17, IJK13, TGGF10, TZ12, HKL04, Energy LNS11, LDK12, NTW09]. estimators [AS16, KYS05, HGH+12, YSW+11, CZ14]. [HYKS08]. eTCR [HKKK13, RWSN07]. Energy-Efficient [HGH+12]. Ethernet [KCR11]. Etude [Mek83, LG78]. Energy-Harvesting [AS16]. Engine Euclidean [SWQ+14]. Euler [Cha84b]. [YNKM89, BC06, NM02b, PES+12, SSW94]. EUROCRYPT [CP87, CP88, Dam90a, Engineer [Jac92]. Engineering Dam91, Dav91, De 95, GQ95, Hel94, QV89, [Gol92, Got83, ICD86, ICD87, ICD88, QV90, QG95, Rue93, Vau06]. Europe ICD90, ICD91, ICD93, Lew82, Wal88, [BRW93]. European [EF12, FS09, HM08]. ARA94, Ano93c, IEE94a, Yu92, Ano89]. EUROSAM [Ng79]. Evaluating England [ACM94b, Pat90]. English [HAKM15, MPP14, RS92]. Evaluation [CS82, Dit76, Wan05]. Enhance [Adi88, BGDW95, CRSW11, CRSW13, [Lit84, CZ14]. Enhanced Chr84, Fla81, Fla83a, Gra93b, Gra93c, [RS12, ZHW21, LG96]. Enhancement Gri77, HNS84, KTN92, LCLX19, LLL09, [HMNB07, SK20]. Enhancements [Gra93a]. MXL+12, ML86, MLxx, MS88a, NMX19, enhancing [AGBR19]. EnRUPT [IP11]. Pag99, SD89c, SD89a, SC90b, SC90a, SC90c, ensemble [ZNPM16]. Ensure [Sch01a]. Stu85, TNKT92, Web72, Woo89, YNKM89, Enterprise [Rei03, FES09]. Enterprises CHS+18, GDA10, HCW+21, RLM87, SD89d, 22

TMB02]. Eve [AAE+14]. Even [RS12]. Extendible [Bosxx, Tho00]. Event [BK84, Bry84, Chu91, Chu92, DT91a, [McK89a, McK89b, ZLY+13]. Every [Kil01]. DT91b, Ell83, Ell88, FNPS79, Fla81, Fla83a, Everything [KTN92, MLD94, TNKT92]. Hac93, HSM95, HYH89, HY86, KR86b, evolution [PGV93c]. Evolutionary KR86a, Kum89a, LOON01,¨ Men82, MH00, [DLT98]. Exact Oto84, Oto86, Oto88a, RLH91, RS77, [Cor00, Ram88a, Vio05, Lia95]. Examining Tam81, Tam82, Yao80, Hua85, Kum89b, [Wil00]. Example [FHMU85]. Exceed MKSiA98, RLH90, RS75, Wee88]. [Pal92]. Except [OWZ14]. Exchange Extending [KV09, BSNP96b, GL06, LW04]. Exclusive [CMP07, JBJ94, SS01, WKBA07]. [DLN+18]. executable [NADY20]. Extensible [BG92, Gra94c, Hel89, Kum90, Execution R´em92, KR88, SS06, BP94]. Extension [CLYY92, CHY93, CHY97, Cra85, GHJ+93, [BR06, CDW+19, Lit77a, LLG12, PSZ18, GM98, Hea72, HCY94, HCY97, KL87, SGY11, WH83, Bak09, SFA+19]. PAKR93, SS88b, Wu85, GMP95]. Extensions [CSSP15, Heu87]. External exhaustive [KJS17]. Exhibit [AS89, AGMT11, GL82, GL88, Gra94a, [Gui75, Gui78, Gui76c]. existence GT63, JP08, LR85, LRY78, LRY80, Vit01, [WC07, Woe06a]. Existing [LYD71, LY72]. Woe06b, RT89, RB91]. External-Memory Expandable [Kno71]. Expander [CLG09]. [AGMT11]. Extractable Expanders [BK07b, Tho13]. expanding [ACP09, CZLC12b, CZLC14, Wee11]. [FNY92]. Expansible [CL95]. Expansion Extracting [HZ86]. Extraction [FC87b, [AVZ11,´ Gri77, Mai92]. Expansions KKN12, LLDZ18, LDY+16, ZLY+12]. [Lar80b, Lar80c, Lar82b, Lar82c, Lar82d, Extremely [Sie04]. Larxx, RSSD89a]. expansive [LS96]. Expectation [GM91]. Expected FA [CKW09]. Face [KGJG12]. [Gon81, Lar81, Lar82a]. Experimental Fachgesprach [Lut88]. Facility [ANS09, HCW+21, JHL+15]. Experiments [VL87, FF90, VL97]. Factor [CFP19]. [KL96, Wil79]. expert [ARA94]. Explicit Factoring [CTZD11]. Factorization [ADW12, ADW14, Bla00, CL83, LS06, [FS82]. Failure [Ano95a]. Fairfax MvT08, WX01, GJR79]. exploit [AZ10]. [ACM94a, WGM88]. Fake exploitation [MAK+12]. Exploiting [Ano96, LAKW07]. Fall [AFI69]. Fallen [Bre91, CKKW00, GHW07, HL12, MSS96, [HCPLSB12]. Falls [AFK90]. False MV08, HAK+16]. Exploration [Pag18, CVR14]. Families [ADW12, [CH94, PSSC17]. Explore [SP21]. ADW14, BW98, Bla00, CRSW11, CRSW13, Exploring [LVD+11]. Exponent [Ano95a]. FK84, HHL10, SG16, WX01, AG10, BJ07, Exponential BvT13, BJKS93, BJKS94, CRS83b, CL09a, [DS84a, HJ96, Lom83, LH04, SHA97]. CL09b, CLS18, CDH19, FH15, GW94, LS06, Exponentiation [Kak83]. Exposure LC13, MvT08, WC07, Woe06a, vT14]. [CTZD11]. Expression Family [BDM+12, BKST18, FLS+10, GK08, [BBP88, CKW09, Gri77, GGR04]. Ind01, IT93, MWCH92, MWHC96, SK05, Expressions [Hol87, Mar71]. Extendable ACP10, AMP12, BDPV12, FPS17, KRT07, [NIS15]. Extendable-Output [NIS15]. Sar13, SRRL98]. Fast Extended [DP08, HBG+17, Ter87, [AKS78, AP92, AB12, BH91, BRM+09, YNKM89, YD84, YTHC97]. Extenders BS97, BS94b, BS94a, BGV96, BT12b, CH12, 23

CS85a, CCW+17, CWC10, CD84b, CRR18, FFT-Hashing [SV94a, Sch91b]. FGS CS82, CKN18, DC98a, Dit91, EFMRK+20, [KM09]. Fichier [Lit77a]. Fields EPR99, FNPS79, FFGL09, FKI+21, GM91, [AU79, HJ96, WX01, LS06]. Fifteenth GM94, GM98, GC95, GK94, GK95, GO15, [AW89]. Fifth Gui89, HK95, HKLS12, HW08, HXLX13, [ACM86a, ACM03a, Bai81, Mo92b, Oxb86, KG95, Kel96, KP97, KLP98, KR79, KR01, ACM94d, AOV+99, GJM02, CTC90, Mo92b]. KRML09, LQZH14, LM95, LK14, LR99, Fifty [Kon10]. File LZ06, Lit91, LL87, LCL+20, Mad80, MSD19, [BGF88, Bat80, Bat82, BCH87, Buc63, NR12, Nyb96, OS14, PPS21, Pea90, Pea91, Bur75b, CS83b, CF89a, CE70, DS84b, PQ98, PQ99, PKSB18, PV95, Rey14, Rog95, DGM89, DT91a, DT91b, FC87a, FZ87, Rog99, Rog19a, Rog19b, SG76a, Sav90, GGY+19, GIS05, GG74, Gro86, HP63, Sav91, SMZ18, ST86, She78, SY08, Sho96, Har88, KK85, KS88b, KS88c, Lar82c, Tho13, Tho17, Ven84, WH83, Yan05, Lar82d, LK84, Lar85c, LI80, Lit80, Litxxa, YBQZ17, YBQZ18, YKLH10, AB96, BS94c, Lom88, Lum73, MF92, McI63, Mil85, MK93, CXLK19, CCA+12, DC94, FFGL10, HF91, NHS84, Ols69, Omi88, Ore83, PSR90, RL89, KKL+09, KHH89, MSD16, MPL09, Mer90a, RSSD89b, RSSD90, RSSD92, Reg85, RL74, MZI98, MPST16, PvO95, Sag85b, SP12]. Sal88, SS62, Sch79b, Sch81, SWTX18, Tha88, fast [Sie89, SV15b, TKH20, Tho00, TLLL09, Wie83, Wie87a, Wri83, WB03, YD86a, WWG+18, YTHC97, YZ16, ZO13, ZHC+13, vdP72, vdP73, BY89, BR75, Bra88, CC88a, And94, Bir07, Gol96]. Faster DAC+13, FES09, Inc81, Kou93, Omi89a, [ASM17, CRSW11, CRSW13, FCH92, LK16, RM88, SG72, VBW94, YD86b, van73]. Files McC79, Bosxx, HKL04, LS15, Sna87]. Fault [AS82, ANT85, BM76, BH85, Bra84a, Bra86, [AAB+92, DSSW90a, DSSW90b, MKAA17, CC87, CS87, CC91, CLC92, CL95, Cla77, HGR07]. Fault-tolerant CS93b, Du86, FNPS79, Fel87, Gri74, HB89a, [DSSW90b, HGR07]. Faulty [JCK+18]. HB92, Lar81, Lar82a, Lar85a, LR96a, FCD [ISO97]. FCSRs [BDM+12]. Fe LCML94, Lit79b, LYD71, MY79, Mil85, [Gol94]. Feal [BS91b, BS91a]. feasibility Oto85a, Piw85, RSSD89a, Reg82, Rot89, [CKM14]. Feature [LMC07, NS16a, Som99, SG76b, TK88, ZRT91, Bra85, CS93a, TWZW11, Fly92, MHT+13]. CCL91, Con17, HB89b, LNS93, LY72, Feature-Based [TWZW11]. Features NADY20, ORX90, Omi89a, RB91, TC83]. [DHT+19, LLDZ18, MS12, MBBS12, PKW09, Filing [FC87a, DH84]. filling [GZ99]. SSaS01,ˇ THY+18, Tsa96, Tsa94, ZLY+13]. Filter [CCH09, Kaw15, MK11, LZ06, Feb [Bar83]. February [AH03, Ano10, RKK14, RK15]. Filtered [Ahn93]. filtering Gol96, Gol92, IEE84, ICD86, ICD87, [KRML09, MK12, RCF11, YG10]. Filters IEE88a, ICD88, ICD90, IEE94a, KI94, Kil05, [CHY93, CHY97, Kie85, LYW+18, Ram89b, Rie89, USE00b, Wol93a, Wol93b, Yu92]. DKT06, HKL07, HKLS12, HXLX13, ISO97, Federal [Dan13]. fehlerbehandlung PSS09]. Final [MO92a]. Financial [ANS05]. [Kue84a]. fehlererkennung [Kue83]. Find [Hol13, Lan06, Pat94]. Finding Feistel [SY11]. Fencing [TYZO15]. few [CBK83, Cer85, CBK85, Cer87, Cer88, [CDH19]. FFT [BGG93, BG93, DBGV93, Coh98, CH09, CM93, DR06, FCHD88, Sch91b, Sch93a, Sch93b, Sch93c, SV94a, FCHD89, HK86, HG77, HR04, KH84, SH92, Van92, Vau92, Vau93]. FFT-Hash SH94, Sim98, Val15, WYY05b, WYY05c, [DBGV93, Sch93b, Sch93c, Sch93a, Van92]. Yuv75, FHC89, MI84]. fine [KLSV12]. FFT-Hash-II [Vau93, Vau92]. fine-grained [KLSV12]. Fingerprint 24

[JTOT09, LMC07, LMJC07, ZHW21, SK20]. IEE10, IEE11b, IEE13, LT85, Rov90, Win78, Fingerprinting [Rou09]. Finite HKNW07, LS89, Lom93, RRR99]. Four [Gri98, HJ96, Ram88a, WX01, FH15, [Gra88, Gra89, SD89c, SD89a, HM03, SD89d]. KHK12, LS06, LK93]. FIPS Fourier [Ind13, BH93]. Fourteenth [BD88]. [Dan13, Ano93b, Ano95b, NIS93, Nat95]. Fourth [ACM85b, ACM02, IEE80a, ICD88, Firewalls [Kal01]. First [ACM89c, SDA90, KLT92, Las87, Yao78, GSW98]. PDI91, BBD09b, FNY92, adHMR93, PM89, FowlerNollVo [VFN91]. FoXtrot [MK12]. Con17, DLM07, Fis87, SBK+17]. first-order FP [PHG12]. FPGA [DLM07]. Fisher [SY08]. FishStore [AOAAK20, DLT98, KMM+06, MXL+12, [CXLK19]. Fit [Cip93]. Fitted [ZWT+14]. MAK+12, QXL+20, TP15, TK07, WZJS10]. Fixed [GB10, RS08]. Fixed-Key [RS08]. FPGA-Based [TK07]. FPGAs Fixed-Parameter [GB10]. FL [DD15, MMMT09, SK05]. Fractal [ACM91a, HB93]. flash [BFCJ+12]. [Ano95c, YSEL09]. fractals [HCF95]. FlashTrie [BLC12]. FLATS [GSI+82]. Fragmentation [Sac86]. frameproof Flexible [QXL+20, SR89, SPB88, ZLC+20, [vT14]. Framework [BJL16, BKMP09, ZHW19, BCCL10]. Flexible-resizing DGV93, FFGL09, GST90, KBG18, XHZ+19, [ZHW19]. Flight [Fis87]. floor [Sch82b]. EH17, FFGL10, GL06, PCK95, UHT95]. Florence [IEE92a, ST83a, ST83b]. Florida Framingham [Ker75]. France [ACM91d, IEE88b, RNT90, PDI91, Kna89]. [AGK+10, BF89, Jou85, LS89, Ng79, QG95, Flow [NS16b, SL16, FWG18, HKL04, GQ95, vdHvH12]. Francisco LDK12, LMP+08, YGS+19]. flow-level [ACM75b, ACM08a, DT87, IEE88a, Joy03, [LDK12]. flows [EVF06]. fly [BK88]. FM Kar98, Shm00, USE90]. Frankfurt [CE95]. [KCF84]. FOCS [IEE06, IEE07]. FODO Fredman [KM86]. Fredman-Komlos [LS89, Lom93]. fonction [LG78]. [KM86]. Free [AR16, BM97, BB07, BHT98, Fontainebleu [PDI91]. Fo otprints CLNY06, CTZD11, Dam87, HM96, HZ86, [KSSS86, HW88]. forbidden [CL09a]. force KKT91, LFD17, MOI90, MOI91, Ram89b, [CJP12, CJP15, LS07a]. Forensic Rus92, Rus93, Rus95, SHRD09, ZLLD18, [BFMP11, DR11, PS08]. Forensics AR21, BGKZ12, BGG93, BG93, BHT97, [DA12, JL14, Rou09, SK99, ZHW21]. Forest Gib91, Gob75, HCJC06, MJ14, NK16, [LCM+20, KP92]. Forest-Based [LCM+20]. PBGV89, Pro18, SS15, Van92, Vau92, Forgery [CY06]. fork [ALS10, CMP07]. Vau93, ZBB+06, ZL12, SS06]. Free-Form FORK-256 [CMP07]. fork-join [ALS10]. [HZ86]. Free-text [Ram89b, Gob75]. Form [Aum09, HZ86]. Formalization Freestart [SKP15]. French [Coh94]. [MMC01]. Formats [GIS05]. Formatted French-Israeli [Coh94]. Frequency [LYD71, LY72]. Formula [GK76, Ram97]. [Lyo78a, TS85, CJP12, CJP15]. Frequent Forrealization [FM96]. Forth [Gre95]. [OTKH11, CH09, BMLLC+19]. Frequently FORTRAN [FDL86, JC88b]. Forward [She78]. fridge [WLC20]. Friendly [CPP08]. Forwarding [YBQZ17, YBQZ18, [ZH18, BP18]. frontends [Sag85b]. BB07, HDCM11, TKH20]. FOSS Frontiers [Jáj90, Fis87]. FSE [Bir07]. [ASWD18]. FOSSIL [ASWD18]. FSpH [ZWT+14]. Fugue [AP11]. foundation [SXLL08]. Foundations Fujiyoshida [IRM93]. Full [Ano85a, BCFW09, Gol94, IEE76, IEE80b, [AC74, Bur75a, CMP07, Cor00, Day70, IEE82, IEE85a, IEE85b, IEE88c, IEE89, DOP05, KK12, KK18, LP16, LT12, LLL+16, IEE91b, IEE92b, IEE99, IEE06, IEE07, MZD+18, Mue04, GLM+10, San76, 25

WYY05b, WYY05c, YSW+11, ZKR08, CS86, Cha86b, CS87, CLNY06, CLG09, NH74, RCF11, SKP15, QXL+20]. CK15, Chi91, Chi94, Cic80a, Cic80b, CE70, Full-Stack [LLL+16]. Full-Text Coh97, CH94, CHM92a, CHM92b, CM93, [YSW+11, RCF11]. Function DGV93, Dam87, Dam90b, DDF+07, DK07, [Abi12, AVZ11,´ Aum09, AMPH14, BPSN97, DY90, DY91, DTS75, DadH90, DGMP92, BF83, BDM+12, BS94b, BS94a, BKST18, Die07, DGKK12, EK93, EPR99, Fil02, FL08, BRS02, Bla95, BKL+11, BDP97, CP91c, FLP08, FLP14, FFGL09, FCHD88, FCHD89, Cer81, CKB83b, CN08, Cob94, CBA94, FCDH90, FCDH91, FCH92, FHCD92a, CMP07, CO82b, CDMP05, DBGV93, FK84, GO07, Get01, Gir87, GHK91a]. DGV93, Dae95, DC98b, DLT98, Dat88, Functions DL80, FLS+10, GIS05, Gei95, Gei96, GSC01, [GHK91b, GLG+02, GK08, HHR+10, Hal12, GIMS11, HPC02, Har97, Hol13, HLC10, HM12, HJ96, HKY12, HS08, HK12b, HR04, JP07, Kal01, KRJ09b, KCB81, Kra82, Ind01, IT93, JO80, Jae81, Jen97, Jou04, Kul84, KKT91, LJF19, LWWQ08, LP15, JD12, KH84, KK06, Kil01, Kno75, KP96, Lis07, LI80, LG78, MR07, MRST10, MNS12, KLP98, KVK12, LM93a, LK94, LT09, LM95, MIO89, NS16a, Oto84, PV92, PPS21, Lis07, LH03a, LLG12, Mai92, MWCH92, PHL01, PHG12, PBD97, GLM+10, RB01, MCW78, Mar64, Meh82, MP12, Mer90b, Sch11, Sch90a, Sch91b, SGY11, Sta06a, Mir01, MRW89, Mit02, MOI90, MOI91, TC93, TTY93, WW09, WSSO12, Win83, Moh11, Mul91, NIS15, NM02a, NCFK11, Win84, Wol84, WFW+12, YD84, Yan05, NP99, NR12, NAK+15, OOB12, Otk91, WL12, ZWW+12, AKY13, ACP10, AB96, Pag99, PWY+13, PB80, PQ98, PQ99, AMP15, ABO+17, AP11, BGKZ12, BNN+10, PW93, PGV90a, PGV90b, PGV92, Pre93, BDPV06, BDPV12, BOY11, BS94c, BW89, PGV93d, PGV93f, Pre94a, PV95, Pre97a, CKB83a, CK89, Con17, DK94]. function Pre97b, Pre99, Pre94c, QG89, QG90, RP91, [DF89, DMB19, FP82, GM18, Gib91, HR07, RR08, RWSN07, Rja12, Roe94, RS08, Rul93, Han17, HL03, ITP14, KTDB20, LW04, SP91, Sag84, Sag85a, SDMS12, SDMS15, Lia95, LWG11, MJ08, Mer90a, MZI98, San76, SS01, SS88a, Sch91a, SRY99, Sho00a, Mit17, Mon19, NSW09, Pat94, Pat95, PL21, Sho00b, Sie04, SvEB84, SDT75]. Functions PVCQ08, QJ97, RS14, SB14, SS92, Sch82b, [Spr77, Sti06, TNS20, Tv83, Tro92, Tro95, SRRL98, SHA97, SXL16, Tsa08, VNP10, Ull70, Ull72, WFLY04, Wee12, WC79, WC81, VFN91, WS13, WYW14, YL97, YZ16]. WKO78, YD85, Zem91, Zha07, Zhe90, function-based [PL21]. Functional ZMI91, vW94, van94, vdBGLGL+16, AY14, [LFP82, GMP95, SV18, ZKR08, Jou85]. AAB+92, ADM+99, AG10, And93, AMP12, Functions AAGG16, Ati20, BSNP96b, BSNP96c, BD92, [AHV98, AFK83, AFK84, AN96, ASWD18, BCR04, BDPV07, BDP11, BJKS93, BJKS94, ACZ16,´ AA79b, AA79a, And91, ABD+16, BDK16, BSU12, BCGS16, Bra09, BHT97, Ano95a, AEMR09, AR17, AM07, AP08, BM01, CMR98, CDS20, CFN18, CKB81, BSNP96a, BDPSNG97, BCK96a, BCK96b, CCHK08, DS09a, DW03, ESRI14, FPS17, BR14, BBD+82, BBD+86, BGS96, Bih08, FFGL10, FHC89, FHCD92b, GKKT10, BCS09, BRSS10, BCFW09, BK12, Bol79, Ged14, GW94, GPGO16, Gon95, GLC08, BPZ07, BHT98, BH86, Bur78, BDMD19, GK12b, HK86, HC11, HLMW93, HXMW94, Can97, CW77a, CW77b, CW79, CMW83, HKKK13, HSK88, HYLT99, HL12, Hug85, CBK83, Cer85, CKB85, CBK85, Cer87, ISO97, ISO04, JCC00, JG95, KST99, KL95, Cer88, CS83a, CS83b, CS85c, CS85b, CS85a, KRT07, KHK10, Kra95, Kri89, LS07a, 26

LM93b, LLH02, LKY04, Li95, Li10, LC13, Generic MS09, Mei95, Mic02, MV08, MS13, MSP12, [BDG+20, DL17, DOP05, MP12, Sar10]. MT16, Mul92, Nae95, NY89b]. functions Genetic [FFGOG07, HSIR02, CV05]. [NY89a, OS14, OS10, PW08, PW06, Pob86, Genomic [CCH09]. genus [CDS20]. PGV93a, PGV91, PGV93b, PGV93e, genus-2 [CDS20]. Geo PGV93g, Pre94b, PGV94, PvO95, RB91, [SDZ21, TYZO15, ZWH17]. Geo-Fencing RFB97, RZ97, RP95, Roe95, Sar80, SS90b, [TYZO15]. Geo-Replicated [SDZ21]. ST85, SH92, SH94, SL88, SS16, Sie89, Sim98, Geo-Tagged [ZWH17]. Geographic SV06, TZ94a, Tsu92a, Tsu92b, VD05, [RRS12]. geohash [MKL21, BSH12].ˇ XCCK09, YL04, YRY04, Z´em94, ZW05, Geometric ZBB+06, ZDI+15, RRS06]. [Bar97, BG92, Bie97, BM90b, CO82a, GPA97, functions-based [HC11]. Fundamental HB89c, HB94, KGJG12, LW88, LMC07, [LYD71, LY72]. Fundamentals LMJC07, LH20, MV02, PW94, RH92, RH95, [HS78, HS84]. Further RW97, SA97, Tsa94, Tsa96, WPKK94, [Lit85, Sar15, Ano09b, DM03]. Fusion War86, WR97, BJKS93, BJKS94, GG92, [Wil00]. Future [SP21]. Fuzzy JBWK11, LG96, MN99, MMG10, WC94]. [HWZP18, LMC07, LMJC07, LII92, HC14]. geometries [FH15]. Geometry [CCC89, MPP14, Wil00]. Georgia G2 [BP18]. Gallery [BFR87]. Galois [USE00a, ACM83a, ACM83b]. Geospatial [HJ96]. game [Zob70a, Zob70b]. Gamma [MPP14]. German [Zel91, BJMM94a, BI87, [DGS+90b, DGS+90a, GD87, DGG+86]. Eck74a, HJ75, Koe72, Sta73, Wen92, vM39]. Gap [ATS19, PNPC20]. Garbage Germany [AH03, BRW93, HM08, [AG93, FW76, FW77, UIY10]. gates adHMR93, Yao78, CE95]. Gestion [Lit77b]. [GHK+12]. Gb/s [BLC12]. GBDD Get [Eug90]. GHASH [Saa12]. GI [YTHC97]. GCM [Saa12]. geeks [McN03]. [Lut88, TWW77]. GI-Fachgesprach Gen2 [LYDA19]. Gene [TGGF10]. [Lut88]. Gigabytes [WMB94, WMB99]. General [Chi91, Chi94, DR06, ISO97, Girths [Zem91]. Give [AT93, AT90]. LW88, LQH18, LHC05, Lum73, MSD19, Global MSD16, Sch91a, Sim98]. general-purpose [CLP13, Cli95, DL79, LPSW03, MD97]. [Sch91a]. Generalised Globally [HSW88]. GLUON [BDM+12]. [CC87, KKW99, LPWW06]. Generalized gMig [MZD+18]. GNU [Wil14]. Go [HB94, KVK12, LI80, SK88, Sev74, KHK10]. [Bur06]. Goddard [Fis87]. Goes [Cip93]. generalizing [AMP12]. Generate Gold [SZ93]. gone [Nic17]. Gong [HSR+01]. Generated [LMC07]. [BPSN97]. Good [Bur92, Hol13, JP07, Generating [Bla95, CT96, CHM92a, Lom88, Mit02, ADM+97, Kou93]. CHM92b, Get01, Jae81, Sag84, Con17, FP82, Goodyear [Fis87]. GORDION [EE86]. GRF11, MFK+06]. Generation gossiping [GHW07]. GOST [GRZ93, LL92, MS12, She91, SSS05, Wan14, [LJF19, WYW14]. GPERF [Sch90a, SS92]. BK07a, BDK16, BK88, CCA+12, CT10, GPU [ASA+09, FRB11, HLH13, LC20, KKP92, Mo92b]. Generator [Ano86, BK12, LLA15, MZD+18, TWL+18]. GPU-based Cai84, Gui89, Sag85a, Sch90a, ZF06, Aam03, [TWL+18]. GPUs [CZL12, vdBGLGL+16]. CLS95, HC11, SS92, TSY98, VZ12]. GRAB [Les88]. GRACE Generators [KTMO83b, KTMo83c, KNT89, KTN92]. [MWCH92, NAK+15, SP91, BK07a, CP13]. Graduate [Ano93d]. Grained 27

[PAKR93, KLSV12]. Gram [Ven86, Coh98]. Hachage [Lit79a, Mek83]. hackers [Nic17]. Grams [BRM+09, Coh97]. granular HAIFA [DL17]. Halifax [DSZ07a, DSZ07b]. [CLS12]. Graph Hamiltonicity [CKN18]. Hamming [Ari94, BMQ98, EFMRK+20, Gre21, Hal12, [Bal96, Bal05]. HANA [SFA+19]. HM93, JBWK11, KM88b, MD97, MBBS12, Handbook [Gon84, GBY91]. handle NRW90, TI12, YkWY83, BPT10, CML+13, [Eug90]. Handling CLL+14, FHL+19, FKI+21, Kor08, Mol90a, [BI87, DNSS92, Lar85b, QCH+81, Sam81, Mol90b, SZO+20, WLLG08, vL94]. Sch79a, Wil59, WB03, ZO93, TWL+18]. Graph-Based [Hal12, JBWK11]. Handwriting [MS12]. Handwritten Graph-Entropy [Ari94]. [FLF11]. Hans [Ste18]. Haphazard [CS87]. graph-structured [BPT10, WLLG08]. happened [Her07]. Hard [Hol13, Kil01, Graph-theoretic [vL94]. Graphic BDK16, BCGS16, GPV08, LSZ+21, Nae95]. [LLLC17]. Graphics [Leb87, RKLC+11]. Hardness [BHKN13, BHKN19]. Graphischen [Lut88]. Graphs Hardness-Preserving [BHKN19]. [CLG09, HMWC94, KPS92, Knu98, Zem91, Hardware [ABM06, ARH+18, Bab79, AD08, AAB+92, AS07, DW03, FGFK10, BPBBLP12, Bur81, Bur84, CHSC18, HK83, Kut06, LL13, SN19, Z´em94]. Gray DW83a, FAFK21, FW09, GD87, GLG+02, [CLD82, Fal85a, DL80, Fal86, Fal88]. HDCM09, IG77, MXL+12, RP91, TK85, Greece [ACM01, AMSM+09, Rei88]. dW83b, ABO+17, BOY11, Bis12, Bur82, Greedy [WTZ+13, AGJA06]. Greenbelt CE95, DS09a, FNP09, ISH+91, JMH02, [Fis87]. Grenoble [vdHvH12]. GREYC KM07, KM10, MZI98, RFB97, RAL07]. [AGBR19]. GREYC-Hashing [AGBR19]. Hardware-Based [HDCM09]. Grid hardware-constrained [RAL07]. [Gri98, KS88b, KS88c, Leb87, NHS84, Reg85]. harmonious [HK83]. HaRP [PT11b]. Grindahl [KRT07, Pey15]. grosser Harrison [Boo73]. Harvesting [AS16]. [Dos78a]. Grøstl HAS-V [PHL01]. Hash [ANS97, Abi12, [ABO+17, ITP14, MRST10, WFW+12]. Ack74, Adi88, AHV98, AFK83, AFK84, Grøstl-0 [ITP14]. Group [ACM82, Alb21, APV07, AOAAK20, AN96, AVZ11,´ AK74, DT87, DD11, KKW99, LND08, Mue04, ABD+16, Ano93b, Ano95a, Ano95b, Ano95d, TZ94a, YLZ20, SE21, YLC+09]. Ano02, Ano08, Ano12, AG93, AR16, Ari68, Group-based [LND08]. Group-by Ask05, AEMR09, AR17, AM07, AP08, [KKW99, YLC+09]. Group-theoretic Aum09, AHMNP12, AHMNP13, AMPH14, [TZ94a]. grouped [DLN+18]. grouping ADW12, ADW14, AS16, Bac01, BSNP96a, [BLY20]. Groups BPSN97, BDG+20, BDPSNG97, BM87, [HM12, LLW10, PWY+13, Reg82, CFYT94]. BVF12, Bat75, BFMP11, BLY20, BRM+09, growing [KW94, MSZ+20]. Growth Bay73c, Bay73a, Bee99, BBD09a, BK70, [Oto88a, Rey14]. Guangdong [IEE11a]. Bel70, Bel72, BF83, Bel83, BD84, BCK96a, guaranteed [RT89]. Guaranteeing [LK84]. BCK96b, BBKN01, BR06, BBKN12, BR14, Guarantees [HC13]. Guess [ZF06]. BPBBLP12, Ben98, BDM+12, BHH+15, Guess-and-Determine [ZF06]. guest BMB68, BS94b, BS94a, BKST18, BS91b, [DLM07, Fox91, RW97]. Guide BS91a, Bih08, BRS02, BCS09, BRSS10, [AS82, SD76, She17]. guided [SSU+13]. BW98, Bla00, BM89, BM90a, Blo70, Bob75, BKL+11, BI87, BCFW09, BK12, Boo74, h [Gra94b, SYW+20]. H-CNN [SYW+20]. BDP97, BPZ07, BT12a, Bou12, Bra84a, 28

Bra85, Bra86, BJM14, BHT98]. Hash JO80, Jen97, JRPK07, JLH08, JL14, JXY07, [BW89, Bre91, BDS09, Bur77, Bur78, Bur79, Jou04, JD12, JK11, JP07, KG95, KMM+06, Bur06, Bur08, BDMD19, But17, CCF04, KK12, KK18, Kal01, Kam74, KHK12, CP91c, Can97, CLP13, CRdPHF12, CW77a, KHK15, KH84, KM09, KR91, KK06, CW77b, CW79, CMW83, CDS20, CRSW11, KKW99, Kil01, KKRJ07, KRJ09b, KJC11, CRSW13, Cer81, CKB83b, CBK83, Cer85, KKC12, KMV10, KTMo83a, KTMO83b, CKB85, CBK85, Cer87, Cer88, CS91, KNT89, KO90, KTN92, KW12, Kno71, CBB05, CLNY06, CN08, CCH09, Cha12, KdlT89, KP96, KLP98, KR79, KRJ+80, jCPB+12, CLG09, CK12, CdM89, CdM90, KK85, KVK12, KCB81, Kra82, Kue82b, CCY91, CLYY92, CHY93, CLYY95, CHY97, Kue84b, Kul84, KKT91, LFD17, LK07, CZLC12a, CLS12, CZLC12b, CZLC14, LM93a, LM93b, LK94, LYY+18, LYX+19, CHSC18, CN07, Chi91, Chi94, CJP12, Lam70, Lan06, LT12, Lar81, Lar82a, Lar85a, Cic80a, Cic80b, Cip93, Cle84, CD84b, Lar88a, LAKW07, LMJC07, LKI10, Cob94, CBA94, Coh98, CRR18, CS82, CY06, LMSM09, LT09, LM95, Lev00, LJF19, CMP07, CS93b, Cor00, Cor02, CDMP05, LLL09, LOON01,¨ LHC05, LWWQ08, CS02, CHM92a, CHM92b, CM93, DSGKS20, LYDA19, Lip02, Lis07, Lit89, Lit77a, Lit77b, DBGV93, DGV93, Dae95, DK09, Dam87, LC96, LRY+15, LCL+20]. Hash Dam90b, DDF+07, Dan13, Dav73, DG93, [LR96b, LL85, LB07, LACJ18, LTS90, DG94, DK07, DY90, DY91, DG85a, DG85b, LHWL21, LH03a, LLG12, LMR02, Lyo85, DHK+15, Dev99, DAC+13, DadH90, MXL+12, MD05, MSD19, Mai92, MSTA17, DGMP92, Die07, DS09c]. Hash MWCH92, MS12, MS02, MPP14, MT11, [DCM18, DL17, DOP05, DRS12, DF01, MCW78, Mar64, Mar71, MLD94, ML75, DC81, Dos78a, DMB19, DB12, DJS80, Mau83, McC79, MKF+16, MCF17, McK89a, DHJS83, DGKK12, Eck74a, Eck74b, Meh82, Mei95, MR07, MRST10, MNS12, EAA+16, EK93, EMM07, EH12, EPR99, MVB+21, MP12, Mer72, Mer90b, Mil85, FIP93, FIP02b, FAFK21, FL04, FLS+10, Mir01, MRW89, Mit12, MW95, Mit02, FLF11, FRB11, FFPV84, Fil02, FL08, MIO89, MOI90, MOI91, Moh11, Mot84, FLP08, FLP14, FFGL09, FB87, F+03, MKAA17, MKASJ18, Mue04, MJT+02, FCHD88, FCHD89, FCDH90, FCDH91, Mul91, Mul92, MC86, Nat92, NIS93, Nat95, FCH92, FHCD92a, FK84, GRBCC19, GK05, NIS15, NM02a, NCFK11, NKT88, NNA12, GO07, GK12a, GIS05, Gei95, Gei96, GHR99, NS16a, NP99, NSW09, Ngu06, NTY12, NR12, Ger86a, Ger86b, Get01, Gir87, GI12, GSC01, NXB13, NY85, NAK+15, OL91, Omi88, GHK91a, GHK91b, Gon77, Gon81, GLS91, OL89, Omi91, OL92, Ore83, Oto86, Pag99, Gra93a, Gra93b, Gra94a, GLS94, GBC98, Pag85, PAPV08, PWY+13, PCL93a, PV92, Gra99, GIMS11, Gre21, GLG+02, GK94, PPS21, PFM+09, PTT16, PCY95, PHL01, GK95, GLB21, GK08, HMNB07, HHR+10, PLKS07, PV07, PHG12, PBDD95, PG95]. HP78, Hal12, HPC02, HM12, HDCM09, Hash [PRK98, PRZ99, PW93, Pip94, Pla98, Har97, HHL10, HCJC06, HW08, HC11, PGV90a, PGV90b, PGV92, Pre93, PGV93d, Hel91, HJ96, HCPLSB12, HJ75, HG77, PGV93e, PGV93f, Pre94a, PGV94, PV95, Hil82, HS08, HK12b, Hol13, HKKK10, PBD97, Pre97a, Pre97b, Pre99, Pre94c, Hop68b, HD72, HCY94]. Hash Pro89, QG89, QG90, Ram88a, RRS06, RR08, [HCY97, HR04, HC13, HLC10, H¨ul13, GLM+10, RRS12, RJK79, Rey14, RWSN07, HRS16, HBG+17, ISO04, IK92, IG77, IG94, RS12, RG89, RB01, RHM09, Riv76, Riv78, IP08, Ind01, Irbxx, IABV15, IT93, IL90, Rja12, RNR13, Roe94, RS08, RMB11, Ros06, 29

Ros07, Ros21, Rot89, RK91, Rul93, SP91, HSK88, HKW05, HYLT99, HL12, HL03, Sag85a, SDMS12, SDMS15, SD78, Sam81, HCW+21, HXLX13, ISO97, ITP14, JFDF09, SS01, Sch11, SS80, SS88a, Sch90a, Sch91a, JHL+15, JCC00, JG95, KKP+17, Kha95, Sch91b, Sch93a, SV94b, Sch79b, SBS16, KST99, KL95, KRT07, KTDB20, KHK10, SG16, SGY11, SW91, SX08, SRY99, SK98, Kra95, Kri89, KCL03, Ku04, KCC05, LS07a, Sho00a, Sho00b, Sie04, SM02, SK05, LLH02, LKY04, LW04, LL13, LMSM12, SvEB84, Sol93, Som99, SPSP16, Spe92, LPSW03, Li95, LVD+11, LWG11, LS06]. Sta94, Sta06a, Sti06, SKM01, Szy82, Szy85, hash TT10, TR02, TY91, TNS20, Top92, TP95, [LC13, LCRY93, LG78, LEHN02, LLJ15, Toy93, Tso15, TNKT92, Tsu92a]. Hash MSZ+20, Mad80, MTB00, MMC01, MSD16, [TSP+11, Van92, Vau92, Vau93, VB00, MvT08, MS09, MJ08, Mau68, McK89b, WX01, WFLY04, WLLG08, WW09, WZJS10, MRL+19, Mer90a, MZK12, Mic02, MZI98, WSSO12, WBWV16, Web72, Wee11, WC79, MV08, Mit17, Mon19, MA15, MPST16, WC81, WKBA07, Win83, Win84, WKO78, MF82, MS13, MSP12, MMSY94, MT16, Woe06b, WDYT91, WYT93, Wol84, Wu05, MFES04, Nae95, NADY20, NY89b, NY89a, WFW+12, XNS+13, XBH06, YNW+09, NK16, NTW09, ORX90, OS14, Omi89a, Yam85, YD84, YD85, Yan05, YSW+11, YT16, OT89, OS10, PCL93b, PCK95, Par18, Pat94, Yao95, YSL05, WL12, YLB90, Yen91, YZ00, Pat95, PCV94, PPB16, PL21, PVCQ08, YCRY93, YY07, YY01, YLZ20, YSEL09, PW06, PGV93a, PGV91, PGV93b, PGV93g, YKLH10, ZG90a, ZG90b, Zel91, Zem91, Pre94b, PvO95, Pro18, PSS09, QP16, QJ97, Zém94, Zha07, ZLY+12, ZZM17, ZJM94a, Ram87, RP95, Riv74a, RS14, Roe95, Rön07, ZJM94b, ZJM94c, ZQSH12, Zhe90, ZMI91, SB95, SB97, SPLHCB14, SB14, Sar13, SN19, ZO93, ZLC+12, ZWW+12, Zuk21, ZHZ+19, Sar80, SS90b, SS92, SV95, ST85, SH94, vW94, van94, vdBGLGL+16, vdVL12, AY14, SE21, SS06, SRRL98, Sie89, Sim98, SHA97, AAB+92, ATAKS07, AKY13, ACP10, SP89, SV15a, SV15b, SV18, SD95, SXL16, ADM+99, AG10, And93, AB96, AMP12, SV06, TKH20, TC04, TZ94a, TMW10]. AMP15, AAGG16, AN20, AR21, AZ10, hash [Tsa08, Tsu92b, TMB02, UHT95, ABO+17, Ati20, AP11, BGKZ12, BSNP96b, VD05, VNP10, VFN91, Wag00, WM93, BSNP96c, Bak09, BATO13,¨ BLC12, WS13, WYW14, Wie86, Wil03, Wil14, BLP+14, BNN+10, BJ07, BD92, BvT13, Woe06a, Wog89, WY02, WTN07, WTN09, BCR04, BFCJ+12, BDPV06, BOY11]. hash XCCK09, XLZC14, YTHC97, YL04, YL97, [BJKS93, BJKS94, Bie95, BS94c, BSU12, YRY04, YZ16, Yu18, ZCZQ19, ZGG05, BCGS16, Bra09, BHT97, BM01, BGG12, ZBB+06, ZLY+13, ZYWM20, ZHW01, vT14, Bur76a, CMR98, CVR14, CFN18, CKB81, HGH+12, BJMM94b, BJMM94a, DBGV93, CKB83a, CK89, CD84a, CAGM07, CHS+18, FIP02a, HJ75, KKL+09, Sta73, TLLL18, CCHK08, CJP15, CM01, CLW98, CL09a, WC07, WWZ09, ZW05, Sch93b, Sch93c]. CL09b, CLS18, CDH19, Con17, DK94, DF89, hash- [PSS09]. Hash-and-Sign DS09a, DW03, DS09b, ESRI14, FXWW17, [CK12, GHR99, PV07]. hash-array [SV15b]. FPS17, FJ13, FFGL10, FPSS05, FHC89, Hash-base [WLLG08]. Hash-Based FHCD92b, Fro81, FH15, GB17, GKKT10, [AS16, BHH+15, But17, CdM89, CdM90, GM18, Gib91, GS94, Gob75, GPGO16, DK09, DG85b, DL17, DF01, FRB11, Gon95, GLC08, GM79, GK12b, HK86, GRBCC19, GI12, HCPLSB12, Hül13, Han17, HLL18b, HLL18a, HAK+16, HLH13, HRS16, HBG+17, JK11, KM09, KJC11, HC14, HLMW93, HXMW94, HKKK13, KMV10, KK85, LLL09, LTS90, MLD94, 30

MKF+16, MCF17, MKAA17, NXB13, OL89, Hashiguchi [LP04]. Hashimoto [SSaS01].ˇ PFM+09, PCY95, PRZ99, RNR13, RK91, Hashing SBS16, TY91, YSW+11, YY07, Adi88, [ACP09, AK98, Ahn86, Ahn87, Ahn93, BDS09, CJP12, DG85a, HCJC06, SX08, AKS78, AAE+14, Alb21, Ald87, Ald88, YSL05, BLC12, BLY20, CJP15, CLW98, AHS92, AB17, AP93, AA79b, AA79a, AI06, HAK+16, KCL03, Ku04, KCC05, MSZ+20, ASBdS16, ATT98, ANS09, ANS10, Ari94, Mul92, OT89, PCK95, PPB16, SPLHCB14, ABH+73, AT93, ASW07, Ast80, AS96, AC74, SE21, UHT95, TLLL18]. Hash-Bucket Atk75, ADW12, ADW14, BYSP98, Bal96, [CS82]. Hash-CBC [BBKN01, BBKN12]. Bal05, BH90, BP97, Bar97, BG93, BGH12, Hash-chaining [CBB05]. BH91, BK84, BR97, BM97, BHIMM12, Hash-code-techniken [Mer72]. BJMM94b, BBD+82, BBD+86, BHKN13, Hash-Coded [Bay73c]. Hash-codering BHKN19, Bie97, Bin96, Bla95, BG07, Bol79, [Lit77a]. Hash-Coding BOS11,¨ BGV96, BM90b, BI12, BK07b, BT90, [Bur77, Dos78a, HJ75, Lit77b, Mar64, BT94a, Bra84b, BT94b, BK90, BT12b, BH86, Sch79b, Bur76a, LG78, Riv74a, HJ75]. Bry84, BP18, Bur92, Bur76b, Bur81, Bur84, Hash-consed [BJM14]. Hash-consing BC90, CP91a, CHKO08, CH12, CLM85, [AG93]. Hash-Counter-Hash [MKASJ18]. Cel86, CLM86, CF92, CSSP15, CLD82, Hash-Function [BF83, BRS02, ACP10]. CS83a, CS83b, Cha84b, Cha84c, CS85c, Hash-Functions CS85b, CS85a, Cha85, CS86, CL86, Cha86a, [Gir87, QG89, QG90, ISO97, ISO04]. Cha86b, CC87, CS87, CC88b, CCJ91, CW91]. Hash-Join [Gra99, NNA12, GK05, RG89]. Hashing Hash-Join-Algorithmen [Zel91]. [CC91, CLC92, CL95, CL05, CLC06, CV83b, Hash-Joins [LR96b]. Hash-Jpoin [Omi91]. CV84, Che84a, Che84b, CV86, CW09, Hash-Key [MW95]. Hash-Lookup [CN07]. CTZD11, CJN20, CZ17, CKPT19, Chi93, Hash-Only [EH12]. Hash-Partitioned CT12, CJC+09, CJKK19, CK94, Chu91, [Ger86a, NKT88, SW91, Ger86b]. Chu92, CV08, CKW09, CE70, Coh97, CO82b, Hash-Routing [WBWV16, SPSP16]. CHK85, CH94, CG79, DA12, CDW+19, Hash-Search [WWZ09]. Hash-semijoin CadHS00, DW83a, DC98a, DKRT15, Dam93, [CCY91]. Hash-Sequential [Lit89, IL90]. DLT98, DPH08, Dat88, DD11, vdSDW74b, Hash-Speicherung [BJMM94b, BJMM94a]. DS84a, DGD02, DTS75, DL79, Dev93, Hash-Structured [CS93b]. Hash-Tabellen DMV04, DJSN09, DadH90, DadH92, [BI87]. Hash-Tables [LMSM09, LMSM12]. DKM+94, Die96, DH01, DS09c, DMR11, Hash-tree [BLY20]. hash-tries [SV18]. DY08, Dit91, Dod82, DHL+94, DHL+02, hash-values [GS94]. Hash-verfahren DLH09, DSSW90a, DR11, Dre17b, Dre17c, [Hil82]. Hash/Table [DAC+13]. DL80, DT91a, DT91b, DT75, Dun89a, HAShCache [PG17]. Hashcash [Bac02]. Dun89b, EFMRK+20, Ell83, Ell85a, Ell87, Hashcodingverfahren [Sta73]. Hashed Ell88, ED88, FNPS79, Fal85a, FM96, Far14, [GJR79, GG74, HYKS08, KS12, LI80, MF92, Fel87, FNSS92, FGFK10, Fla81, FS82, Fla83a, Mul72, SVCC01, VL87, VL97, WS93, WM19, FPV98, Flo87, FPS13, FT12, FFGOG07, And88, GMW90, HSMB91, Ken73, War14]. FMM09, FMM11, F¨ur88, GSS01, GL73]. Hashedcubes [PSSC17]. Hashes Hashing [BC08, Saa12, Sch01b, Sch01a, Wan14, [GM91, GM94, GadHW96, GM98, GIM99, GvR08, GP08, GNP05]. hashfunctions Gon80, GL82, GL88, GRZ93, GK76, GI77, [PBGV89]. HashGraph [Gre21]. GT80, Gra86, GPY94b, Gre95, Gri77, Gri79, 31

GT93, GPA97, Gui75, GS76, Gui76a, Gui76b, Qui83, RT87a, Ram88b, RL89, RP91, RR92, GS78, Gui78, GG80, GH07, GZX14, Gur73, Ram92, RL82, RLT83, RSD84, RSD85, HB89a, HB92, Hac93, HSPZ08, HT01, HR14, RSSD89a, RSSD89b, RSSD90, RSSD92, HM96, HK12a, Ham02, Har71a, HCF95, Ram97, RGNMPM12, RLH91, Reg81, Reg82, Hea82, Hea72, HB89c, HB94, adH90, adH93, Reg88, RRS12, RH92, RH95, RW97, Rob86, Hel89, HST08, HNS84, HSM95, HKY12, Rog95, Rog99, Rog19a, Rog19b, RS75, RS77, HYH89, HYH93, Hol87, HC87, HT88, HY86, Ros77, Rou09, RT87b, Rus92, Rus93, Rus95, HTY90, HSW88, IJK13, IKO05, IH95, Jac92, SDR83a, SNBC98, SnC05]. Hashing Jae81, Jag91, Jai89, Jai92a, Jai92b, Jaixx, [Sag84, SY11, Sas11, SG76a, Sav90, Sav91, Jan08, JV16, JP08, JTOT09, Joh97, JCK+18, Sch79a, SD90b, SD90a, Sch91b, Sch93a, Kab87, KBG18, KU88, KKN12, KV09, Sch81, SMZ18, SY91, SR89, SPW90, KGJG12, Kaw85, Kaw15, Kel93, KR86b, SYW+20, SB93, SSL+18, SHZ+20, SY08, KR86a, KV91, KMW08, KMW10, KZ84, Sho96, SR01, SSS05, SDT75, Spr77, SHRD09, Kno75, KP97, Knu19, KM86, Kon10, KM88a, SGGB00, Sti94a, Stu85, Sun15, SHF+17, KP94, Kri84, KS86, KS87a, KS87b, KS88b]. SA97, Tam81, Tam82, TK88, TC93, TL95, Hashing [KS89b, KR01, Kum89a, Kum90, TWZW11, TYZO15, THY+18, TCY+20, Kut10, LW88, Lar78, Lar80a, Lar80b, Lar80c, TI12, TW07, TK85, TZ12, TTY93, TZ94b, Lar82b, Lar82c, Lar82d, Lar83, LR85, Lar85b, Tv83, Tor84, TK07, Tro92, Tro95, Tsa96, Lar85c, Lar88b, Larxx, Leb87, LMC07, US09, Ull70, Ull72, VV84, VV86, Vek85, LK14, Lep98, LC20, LC88, cLmL07, Li15, VP96, VP98, Vit80b, Vit80c, Vit81b, Vit81a, LCLX19, LCML94, Lia95, LLZ10, LLL11, Vit82b, Vit83, VC87, WG00, WPKK94, LLLC17, LRY78, LRY80, LN93, Lit91, LI80, War86, WFHC92, Wee07, Wee12, WPS+12, Lit78, Lit79b, Lit80, Lit81, Lit85, LZL88, WSZ+16, WFT12, WP10, WDP+12, WS03, LSV89, LRLW89, LRLH91, Litxxa, Litxxb, Wil96, Wil00, Wil79, Wil71, Win90b, Win90a, LC12, LZ16, LWZ+18, LH20, Lom83, LPP91, Woe01, WR97, WZ93, Wu84, YDT83, LPP92, LM93c, LH03b, LSZ+21, Lyo78a, YWH09, Yao80, Yao85a, Yao85b, Yao91, Lyo83, MLHK17, Mac95, MD97, MSW19, Yas07, YB95, YTJ06, YBQZ18, YGC+12]. MWHC96, Man12, MK11, MNT90, MB03, Hashing [YD86a, ZZLZ21, ZPS90, ZPS93a, MBBS12, MV88, MV90, MV91b, MW09, ZHW21, ZLC+20, ZH18, ZHW19, dW83b, MHB90, MSSWP90, Men82, Men12, Mey93, vdSdW74a, vMG12, AT18, ASM17, ASA+09, MV01, MV02, Mit73, Mit09, MH00, Moh90, ADM+97, AI08, AII89, AT90, BGG93, BL89, Moh93, MNP08, MWC12, Mul84a, Mul81, BGH+13, BBPV11, BD82, BGG94, Mul84b, Mul85, MS88b, Nak21, NSW08, BDPV14, BDK16, BMQ98, BCGS16, Boo72, NRW90, NI83, Nyb96, OWZ14, OTKH11]. Bosxx, BT89, BCCL10, Bur05, Bur82, Hashing [OG94a, OG94b, OOB12, OOB17, BMLLC+19, CP91b, CP95a, CHKO12, OVY94b, Otk91, Oto84, Oto85a, Oto88b, CS93a, CW93, CJMS19, CP95b, CV83a, Oto88a, OT91, OSR10, Ouk83, OS83a, CCL91, CHL07, CLL+14, CWC10, CKKK09, OA89, OS83b, PR01, Pag06, PP08, CZL12, CR89, CP13, CO82a, CHM97, PWYZ14, Pag18, Pal92, Pan05, PB80, Cze98, Dam94, DM03, DOP+14, DKM+88, Pap94, PV07, PT12a, PH73, Pea90, Pea91, DKM+91, DHW08, DS09b, D+92, DLH13, Per73, Pes96, Pet13, PNPC20, PS93, PQ98, DSSW90b, DK12, DLN+18, Duc08, DM11, PQ99, PKW09, Pip79, Pit87, PM89, PVM94, EH17, EBD91, Fal86, FWG18, FSV09, PVM97, PV19, PT11b, PRM16, PKSB18, FFS+13, FNSS88, FKI+21, GLHL11, GG92, PS12, PACT09, PF85, PADHY93, PW94, GDGK20, Gib90, GW94, GM77, GLJ11, 32

GS89, GRF11, GPY94a, GZ99, Gui76c, [HGH+12]. Head [ACM91c]. Heap Gup89, HB89b, HDCM11, HKL07, HR93, [FW76, FW77]. Heaps [CCA+12]. Heavy HM93, HMWC94, HL05, HC02, Hua85]. [TP15, Ind13]. Hebrew [Sch82a]. Hecke hashing [CT96]. Hedge [Sho00b]. Height [HFZ+15, HFF+17, Hui90, IMRV97, Ind13, [Dev99, Reg81, THS97]. Heights [Jen76]. IIL17, Jan05, JWM+18, JBWK11, Kan90, Heinz [adHMR93]. Held [Jáj90, Fis87]. KYS05, KLL+97, KSB+99, KU86, KL96, Help [PVM97]. Helper [ALS10]. Herding KR88, KK96, Kim99, KM07, KM08, KM10, [KK06, BSU12]. Here [Bur06]. Hershey KR19, Kos14, KD92, Kou93, Kra94, KR06, [ACM76]. Hersonissos [ACM01]. hesitate Kum89b, Kut06, KSC11, KSC12, LG96, [Gre95]. Hessian [Far14]. Heterogeneity Lar84, LNS11, LH06, LK16, Lev89, LK11, [PG17, WB03]. Heterogeneity-Aware LOZ12, Lin96, LS96, LNS93, LYJ+13, [PG17]. Heterogeneous [HNKO20, PG17, LMLC14, LLA15, LWXS18, LHWL20, LM88, WSZ+16, GDA10, Kha95, SX08, SV18]. LH04, LMPW15, LJW+17, ML15, MIGA18, Heuristics [Omi89b]. Hidden [Leb87]. MI84, ML94, MNT93, MLP07, MPL09, Hide [Can97]. Hiding MV91a, MC89, MMG10, MP16, Men17, [MMMT09, MV01, Wee07, HR07]. Mil95, Mil98, MYS12, MKSiA98, Mol90a, Hierarchical [FWG18, PACT09, TK88, Mol90b, MSV87, Nil94, NMX19, OP03, VL87, GP08, VL97]. Hierarchy OVY94a, OS88, Pag01, PR04, PWYZ10, [Wil71, YL04]. High [ACM04, AS09, PJM88, PJBM90, PCM15, PT11a, PT13, AEP18, AI06, ASBdS16, CT96, DGG+86, PY88, Pon87, Pro94, QM98, QZD+18, DadH92, DS97, Flo87, GIM99, HSM95, Ram89a, RT89, RB91, RFB97, RZ97, IEE94c, KMM+06, KMV10, LCK11, LPT12, RLH90, RAD15, SK20, Sab94, Sar11, SP12]. McK89a, McK89b, OT91, PSR90, RSSD90, hashing [SS89a, SS90a, Sch93b, Sch93c, RW07, Rön07, She91, TK88, Tho13, TP15, ST93, SH92, SL88, SS16, Sil02b, Sna87, MKL21, WZJS10, XLZC14, YNKM89, Sta99, Ste18, Sti91, Sti94b, SZO+20, Sun91, YWH09, ZHW19, AI08, BCCL10, EVF06, STS+13, TLZL16, TB91, Tho00, Tho17, HKL07, Inc81, MV91a, MAK+12, MA15, TK17, TKI99, Tsa94, TLLL07, TD93, Vak85, RFB97, SLC+07, Shi17, Sie89, SWQ+14, Vio05, Vit80a, Vit82a, Wan05, WL07, Wee88, SXLL08, TYSK10, TLLL07, XMLC11]. Woe05, WC94, WY00, WWG+18, XMLC11, High-bandwidth [AS09]. YCJ12, Zha19a, ZWCL10, ZL12, ZWT+14, High-Dimensional [AEP18, TYSK10]. ZPS93b, ZZLZ18, ZHC+13, Zob70a, Zob70b, High-error [Rön07]. High-Performance ZHB06, AGBR19, BJMM94a, JMH02, [DS97, Flo87, IEE94c, She91, MKL21, KS88c, SV94a, SKC07, SA17, CV85]. ZHW19, Shi17]. High-Speed Hashing-Based [Alb21, LMC07]. [KMM+06, KMV10, McK89a, YNKM89, HashMap [Oak98]. Hashnet [Fah80]. McK89b, RW07, EVF06, SLC+07, SXLL08, Hashtabellen [Kue82a, Kue82b]. TLLL07, XMLC11]. High-Throughput Hashtable [Oak98, Bee83]. Hashtag [LPT12, XLZC14, MAK+12]. HighEnd [RTK12, KGJØ18]. Hashverfahrens [LVD+11]. Higher [HKKK13, DH84]. [Dos78a]. HashXor [Cho21]. Haskell higher-order [DH84]. Highly [MRL+19]. H AVA L [BCS09, KHW91a, Mat93, PAKR93, [WFLY04, ZPS90, ZPS93a, ZPS93b]. KHW91b, ZLL+07]. Highly-Associative H AVA L- 1 2 8 [WFLY04]. Hawaii [KHW91a, KHW91b]. Highly-Efficient [Deb03, SC77]. HCC [Har97]. HDDs [BCS09]. Hill [IEE88a]. Hilton [ACM91c, 33

PDI91, ICD88, ICD90, IEE90, IEE01]. [ADG+08]. ICICTA [IEE11a]. Icon Histogram [GG86b, GT93]. iconic [WC94]. ID [ZJ09]. [Gra93b, MNY81, PCK95, UHT95]. ID-Based [ZJ09]. Idea Histogram-Driven [Gra93b]. History [Gra94b, HL03, WPS+12]. Ideal [Lis07]. [BG07, MNS07, NSW08, Reg82, NT01]. identical [Lia95]. Identification History-Independent [MV01, ST86, CJP12, CJP15, GS94, IG94, [BG07, MNS07, NSW08]. Hitter [TP15]. LWG11, WWG +18]. Identifier hitters [Ind13]. HMAC [FIP02a, BCK96b, [BSH12,ˇ Sev74]. Identifiers [DB12, Wil59]. CY06, DRS12, MAK+12, RR08, Sta99]. Identifying [ASWD18]. Identity Hmap [YTHC97]. Hoc [CZLC12a, CZLC12b, CZLC14, KM92, [DPH08, JLH08, Cha12]. Hole [JLH08]. LYX+19, Cho21, ZYWM20]. Holistic [LCM+20]. Holographic [BGF88]. Identity-Based [CZLC12a, CZLC12b, Homepage [GCMG15]. Homomorphic CZLC14, LYX+19, ZYWM20]. IEC [ISO04]. [CFN18, KKN12, CZL12, MT16]. Honolulu IEEE [ACM04, Col93, IEE80a, IEE88a, [Deb03]. Hood IEE92a, IEE01, IEE05, IEE06, IEE07, IEE10, [CLM85, Cel86, CLM86, DMV04, PV19]. IEE11b, IEE13, MS05, Yan10, IEE84]. Hop [RHM09, MA15]. Hopscotch [HST08]. IEEE/ACM [ACM04]. IFIP hostile [LC95]. hot [KLL+97]. Hotel [Gil77, Ros74]. Igniting [ACM03b]. II [ACM75b, ACM82, ACM83a, ACM83b, [BS91c, Sch93a, Sch93b, Sch93c, Van92, ACM85a, ACM87, ICD86, ICD87, IEE88a, Vau92, Vau93]. III [Nol82b, OK80, Sed83a]. IEE88d, IEE01, Kna89, Nav85]. Hotspot Illinois [ACM88b, ABM06, BL88, Lom93]. [JLL+20]. Hotspot-Aware [JLL+20]. im [DS84a, Wal74]. IMA [Boy95b]. Image Hough [HB89c, HB94]. House [IEE80a]. [Alb21, Ano95c, BFMP11, BS94a, BI12, Houston [IEE76, IEE94a]. Houthalen DCM18, DHT+19, DR11, GPA97, GH07, [QV89, QV90]. Hover [EH12]. HTM HW08, LKI10, LQZH14, Li15, LOON01,¨ [CCW+17]. HTML [UCFL08]. HTTP LC12, LYJ+13, LH20, MV02, OSR10, [DB12]. Human [Bor81, TCW+13]. RGNMPM12, SB97, TWZW11, THY+18, humanities [Bai81]. Hungary [Rue93]. US09, WP10, WDP+12, ZWH17, ZZLZ21, Hwang [KCL03]. Hyatt [Kna89]. Hybrid HC11, LMLC14, Mit12, SB95, TCW+13, [BM89, BM90a, CBB05, Gra93a, Gra93b, TLZL16]. image-keyword [LMLC14]. Gra94a, JLL+20, KNT89, HGH+12, LLL11, Images [FLF11, MNY81, PKW09, RT81, Sch79a, TYZO15, PCV94, TT81]. SSaS01,ˇ WMB94, WMB99, GG92, LMLC14]. Hybrid-Hash [BM89, BM90a]. Hypercube Imaging [FHMU85]. Imai [OL91, OL92]. hyperelliptic [FFS+13]. [PGV93a, PGV90a, PGV93b]. imbalance hypergraph [KKP+17]. Hypergraphs [WZ12]. immutable [SV15b]. Impact [FP10, HMWC94, Rad92]. hyperspace [GD87]. imperative [NMS+08]. Imperfect [DOP+14]. hypersphere [LWWK20]. [Ven84]. Implement [CL83]. Implementation I-cloth [TWL+18]. I/O [MMC01, Vit85]. [BCS89, BS94b, BGDW95, Dat88, DF89, IB [CZLC14]. IBE [Zha07]. IBM DKO+84b, DKO+84c, DKO84a, DKO+84d, [Dit76, Dit76, MS02]. IBM/360 Dee82, Dev93, Dit76, DT75, EE86, [Dit76, Dit76]. ICALP [AGK+10, ADG+08, EjKMP80, FW09, GG86b, GT93, Gro86, AMSM+09, ACJT07, CIM+05]. ICCI Har71a, Hek89, ISK+93, JD12, Kah92, [AFK90, KLT92]. ICDT [AA86]. Iceland KMM+06, KU88, KM92, KR86b, KR86a, 34

KKRJ07, KRJ09b, KTN92, LK84, Lit79b, Independence [KW12, PPR09, PT16, LPP92, NM02a, PRM16, SDR83a, She91, Tho13, DT14, PPR07, PT10a]. SK05, Ste82, TGL+97, TNKT92, VL87, Independent [BG07, CCJ91, DGD02, BDP+12, BS94c, BW92, DS09a, DHW08, DTS75, Die96, Ind01, MNS07, NSW08, DM11, EBD91, GN80, GJM02, Inc81, IIL17, TZ12, BCGS16, FPS17, Han17, NT01]. KU86, KKL+09, McD77, MZI98, MFES04, Independently [AU79]. Index Tai79, MKL21, Dit76]. Implementations [BM89, BM90a, Buc82, Bur83b, Bur83c, [GLG+02, Vit82b, WPKK94, WZJS10, DS84a, GPY94b, LC86a, Lom83, MZL+19, DMP09, RAL07]. Implemented OL89, Oto85b, Qui83, TY91, Wil79, ZHW19, [CMW83, MRL+19]. Bur83a, Fro81, GPY94a, HM03, KZ19, Implementierungstechniken [Nee79]. LCH+14, McD77, SWQ+14]. Index-Based Implementing [Bab79, Blu95, BJM14, [OL89, TY91]. indexable [RRS07]. GHJ+93, Gra86, Jun87, KHW91a, KHW91b, Indexed [Chu91, Chu92, KHT89, Mul72, Lin96, Llo81, LB07, VL97]. Implications GB17, SN19, Tay89, WM93, TKI99]. [Chr84, CHS+18, RAD15]. Implicit indexed-hash [WM93]. [OS88, Kor08]. Impossibility Indexed-Sequential [Mul72]. Indexes [BCS09, HM12]. Improve [LBJ02, BM01]. [Les88, Omi89b, Pip94, FVS12, HCW+21]. Improved [Ari94, BvT13, BMB68, Bih08, Indexing [CJ86, Dum56, KGJG12, Li15, Bre91, CN08, DDS14, DL17, FB87, HSM95, Llo81, Per73, SE89, Tor84, Wil79, WMB94, HW88, JNPP14, KM86, Kut10, LW04, WMB99, YWH09, CXLK19, CWC10, Fly92, LJF19, KKMS10, LH04, Mau83, Mic02, LG96, MSZ+20, MIGA18, MMG10]. India Mul72, NSS+06, Nak21, PS12, Rad92, RP95, [RRR99]. Indiana [Van10]. Indianapolis SS80, SD95, TK17, UIY10, WM19, GM77, [Van10]. Indicator [YD84]. indicators Mau68, War14, ZW05]. Improvement [Er86]. Indices [LR99, Val87]. [CH94, Fel87, LCM+20, RGNMPM12]. Indifferentiability [CN08, LLG12, Improvements [CTZD11, Lev00, Nam86]. MPST16, BGKZ12, BDPV08, GLC08]. Improving [ATAKS07, AVZ11,´ BDS88, Indifferentiable CHY93, CHY97, CAGM07, Cla77, DB12, [BGH12, CLNY06, FFS+13, FT12, BGH+13]. GCMG15, JHL+15, KZ19, MS12, RT87b, Indirect [Bal96, DGGL16, Joh61]. Sch82a, TCP+17, YWH09, ZGG05]. Impure Indirectly [Ols69]. Individual [Dee82]. In-Bucket [TYZO15]. [Jan05, Jan08, Vio05]. Induced [de 69]. In-Memory [CCW+17, JLL+20, MZL+19, industrial [PGV93c, ARA94]. Industry QXL+20, ZHW01, WLC20]. In-Network [ANS05]. Infeasibility [FS08]. Infinite [WBWV16]. Inaccessible [HHR+10]. [GHK91a, GHK91b, LII92, Bra09]. infinity Inadequacy [GY91]. Includes [Hil05]. Influence [RTK12]. INFOCOM [FW76, FW77]. Including [DGV93, KL95]. [IEE01, IEE92a]. Inform [Pro94]. informal Incoming [LK07]. Incompatibilities [CK89]. Informatics [CHK06]. Informatik [KCF84]. Incorporating [CBA94]. [Nol82a, Nol82b, OK80]. Information Increased [PRM16, MSP12]. Increment [PDI91, BV89, BIP92, Can97, Cha84a, [Ban77, Luc72, RKK14]. Incremental Dan13, DSSW90a, Ell82, FC87b, FH69, [BGG94, CT12, FRB11, GSC01, ISHY88, FCDH90, FCDH91, GPY94b, ISO97, ISO04, PW06, TWL+18, UIY10]. Incrementality KLT92, KM86, KM88a, LC06, LXL+19, [BM97]. incrementalization [SB07]. MV01, MNS07, PGV93f, SKC07, SPSP16, Indeed [Yas07]. Indentify [KCF84]. SC77, Sta06b, Sun15, Vid90, WBWV16, 35

XHZ+19, Yan10, YR87, YBQZ17, AFK90, [ACM82, DT87, OSR10]. interesting DSSW90b, GPY94a, KSC11, KSC12, SG72, [VNC07]. Interface [Vit85, WGM88, Bor81]. SXLL08, FNY92, FBY92, Gil77, Ros74]. Interfaces [DCW91]. interleaved [RH90]. Information-Based Internal [GL82, GL88, ITP14, LC88, Wil59]. [SKC07, KSC11, KSC12]. International Information-Centric [SPSP16, WBWV16]. [ACM81, IJW89, PDI91, ACM94b, ACM11, Information-Theoretic [Sun15, SXLL08]. ACM12, AGK+10, ABB93, ABM06, AFK90, Informix [Ger95]. Infrastructure ARA94, VLD82, Ano89, Ano93c, AW89, [MJ14, Nak21]. Infrastructure-free [MJ14]. AAC+01, A+90, AiNOW11, AOV+99, AA86, ingestion [CXLK19]. Ingres [Sne92]. Bai81, BD88, BDS88, BV89, BIP92, Bel00, inheritance [DMP09]. Inhibiting BBD09b, BJZ94, BRW93, BL88, BF89, [GAS+16]. Initial [vdP72]. Initiative Bri92, Bri93, BW92, BD08, BJ93, CGO86, [MO92a]. Injection [NCFK11]. Inner CLM89, Cop95b, DG96, DSS84, DSZ07a, [PWY+13]. Innesbrook [IEE88b]. DSZ07b, DJRZ06, DJNR09, FNY92, FMA02, Innovation [ACM03b]. Innovative Fra04, Fre90, GMJ90, Gol92, GSW98, HB93, [OG94b]. Input [AB12, Sab94]. Insecurity HL91, IEE80a, IEE84, IEE85b, ICD87, [DOP05]. insensitive [CyWM91]. inserting IEE88a, IEE88d, ICD88, IEE88b, ICD90, [Gup89]. Insertion ICD91, ICD93, IEE94a, IEE95, IRM93, [FPS13, PS12, CV83a, Jan05, Kou93, PY88]. JBJ94, JY14, Ker75, Kna89, KLT92, Kui92, inside-out [AP11]. Insight LC06, Lak96, Las87, LCK11, Lev95, Lie81, [CQW08, IEE02]. Installation [LAKW07]. LS89, LT80, LSC91, Lom93, MK89, instance [FS08]. instantaneously [DV07]. MSDS90, Mo92b, Nav85, Ng79, Pat90, Instantiated [RR08]. Institute [Ano93d]. PSN95, PV85, PK89, QG95, RK89, RNT90, Instruction [BOS11,¨ SS83]. ST83a, ST83b, SP90, Sho05, SW94b]. instrumentation [Ano83]. Integer [Ano86, International [SW94a, SC77, Sti93, Sti94c, Die96, MV90, MV91b, Woe01, Woe05]. Sto92, Vau06, Vid90, WPY90, lWSS91, integers [BCS89, Han17]. Integral Yan10, Yao78, Ytr06, YR87, Yu92, Yua92, [LJF19, Rog19b]. Integrated Yun02, vL94, vdHvH12, ADG+08, [DGKK12, PG17, NM02b]. integrating AMSM+09, ACJT07, Bir07, CIM+05, [ATAKS07]. Integrative [LLDZ18]. Cop95a, Deb03, Gol96, HKNW07, HF13, Integrity [CLS12, Sch01b, Sch01a, Wil96]. Wie99, ICD86, IEE11a, Sch82a]. Internet Intel [JHL+15]. Intellectual [ATAKS07, Ano95d, HLC10, MCF17, [DGKK12, IEE88a]. Intelligence McN03, She06, SXLL08, ZNPM16]. [Kak93, Luh58, ARA94, LLC89]. Intelligent Internet-Draft [MCF17]. Internet-scale [IEE11a, LJW+17]. intensify [HL12]. [ZNPM16]. Interpolation [Buc82, Bur83a, intensive [Shi17]. inter [Kos14]. Bur83b, Bur83c, Wu84, FWG18]. inter-system [Kos14]. Interacting Interpolation-Based [LLW10]. Interaction [ZLY+12, Bor81]. [Buc82, Bur83b, Bur83c, Bur83a]. Interactive interpretation [Fly92, GvR08]. [CBK83, Cer85, CBK85, Dam93, Dam94, Interpreter [CBA94, Gai82]. Dos78b, GK94, GK95, HR14, KG95, MS09, interprocessor [KK96]. Interrogating OVY94a, OVY94b, Rad83, Wee07, RWSN07, [HLC10]. Interrogating-Call [HLC10]. RW73, TCW+13, TWL+18, MS09]. Intersection [PSZ18]. Interval Interconnection [Fah80]. Interest [GY91, Lip02, BL89]. Intractable 36

[IT93, IH95]. Intrinsics [Rog19a]. [Adi88, AT91, BM89, BM90a, CS83a, Introduction CHY97, DG85a, DG85b, FP89b, Gra93a, [AG18, Cob94, DK02, DK15, Fel50, Fox91, Gra93b, Gra94a, Gra94b, Gra99, HR96, Har85, Hua82, KL15, RW97, TS76, TS84]. KR91, KKW99, KL87, KNT89, KHT89, Invariance [SvEB84]. Invariant KO90, KTN92, LR99, LDM92, LTS90, [HSPZ08, LH20, NS16a, Fly92, SB07]. MLD94, MLxx, MS88a, NKT88, NNA12, Inverse [CPP08, HCF95]. Inversion NP91, OL91, OL89, Omi89b, OL92, PAPV08, [DK07]. inversions [Pat95]. Inverted PG95, Pip94, RK91, SD89c, SD89a, SD90b, [Les88, HC02, McD77]. IoT SD90a, Sha86, SM87, Sol93, Spe92, TR02, [Alb21, Cho21, HLL18b, NADY20]. TY91, Top92, TP95, Toy93, TNKT92, Val87, IoT-Enabled [Alb21]. IP WYT93, YNW+09, Yam85, ZG90a, ZG90b, [BLC12, BM01, HDCM09, IGA05, JL14, Zel91, ZJM94a, ZJM94b, ZJM94c, ZO93, MPL09, RW07, SXLL08]. IPSec [KMM+06]. ALS10, BMS+17, CAGM07, CyWM91, IPv4 [PT12b]. IPv6 [PT12b]. Ireland GK05, ISO97, Kha95, KKL+09, LNS11, [ABB93]. iris [MMG10]. Irreversible LEHN02, MMSY94, Mul92, OT89, PCK95, [ANS97]. ISA [HL91]. ISAAC [AiNOW11]. PCV94, RLM87, RG89, SD89d, SM94, SA17, ISCA [Deb03]. Island [Rei88, IEE07]. SP89, TL93, UHT95, WL07, NNA12]. ISO/IEC [ISO04]. isogenies [CDS20]. Joining [NP91]. Joins [CLYY92, CLYY95, Isolated [MMMT09]. Israel DG93, DG94, DNSS92, GBC98, Gra86, [Sch82a, BDS88]. Israeli [Coh94]. ISSAC HCY94, HCY97, LR99, LR96b, NNA12, [ACM94b, Lak96, Lev95, vdHvH12]. Issued PCL93a, SC90b, SC90a, SC90c, WDYT91, [LG78]. Issues YCRY93, AKN12, BATO13,¨ BLP+14, [MP90, LMSF89, LG78, Yu92]. Italian HLH13, JHL+15, LCRY93, ML95, PCL93b]. [FFPV84]. Italy [AAC+01, AA86, ST83a, Joint [IJW89, AFI63, AFI69, MO92a, ST83b, Ano94, De 95, IEE88d, IEE92a]. IEE92a, IEE01, ZC12]. Jose [ACM11]. Item [WYD+18]. items [Bay73b, CH09]. JPEG [ZC12]. JPEG-2000 [ZC12]. Jpoin Itemsets [BMLLC+19]. Iterated [Jou04, [Omi91]. Juan [IEE91b]. Judy [Sil02a]. KVK12, HLMW93, HXMW94, KHK10]. July [IJW89, ACM91c, ACM94b, ACM01, iterations [OS10]. Iterative AGK+10, ADG+08, AMSM+09, Ano95c, [MV02, PNPC20, SXL16]. IV ACJT07, dBvL80, CIM+05, Coh94, DG96, [Far93, Sil02a]. IWDM [BF89]. CTC90, Kui92, Lak96, Lev95, NS82, Oxb86, Pat90, Rei88, vdHvH12]. June J [Sar80]. January [ACM91d, ACM91a, [ACM84a, ACM03a, ACM07, ACM11, ACM97a, ACM05, ACM08a, Kar98, Mat09, ABM06, BDS88, BV89, BIP92, BRW93, SP90, Shm00, USE91]. Japan [IJW89, BL88, BF89, FMA02, Fre90, Van10, HF13, A+90, AiNOW11, CGO86, Got83, IEE85b, IEE05, LL08, LS89, MS05, Ng79, Rei88, IRM93, Mo92b, IEE85b, ICD91, LT85]. Java Sch82a, Sto92, Vau06, vL94]. Just [Yas07]. [Sun02, CHL07, LBJ02, NM10, OOK+10, JVM [SV15b]. SB07, SSS05, Tym96]. JEqualityGen [GRF11]. JERIM [MJ08]. JERIM-320 k-ary [Gui76c]. Karlsruhe [HM08]. Karp [MJ08]. Jersey [Fre90, IEE84]. [GBY90]. Karp-Rabin [GBY90]. Jersey/sponsored [IEE84]. Jerusalem Katapayadi [Ram97]. Katholieke [BDS88, Sch82a]. Johnson [SG16]. [BBD09b]. KD [KHT89]. KD-Tree Johnson-type [SG16]. Join [KHT89]. KDL [PSR90]. KDL-RAM 37

[PSR90]. Keccak [BDPV09, BDPV12, [BI87]. Kolmogorov [CG92, Sch01b]. DDS14, LLA15, MS13, BDP+12]. KEM Komlos [KM86]. KPS [SN19]. KV [CZLC14]. Kent [Oxb86]. Kerkyra [Rei88]. [LCLX19, QXL+20]. KY [Rie89]. Kyoto Kernel [CSSP15, Lev00, ZLY+12]. Key [CGO86, Got83, IEE85b, LT85]. [ANS97, ANS05, iA91, BD82, Bol79, Boo74, CS83b, CC87, CS87, CC91, CLC92, L [Sar80]. Label [LQH18]. labeling CTZD11, CY06, CG79, CS02, Dam87, DL12, [TCW+13, YSL05]. Lam [Wag00]. Dos78a, EAA+16, GG86a, Gri79, GG80, LaMansion [Nav85]. lamp [McN03]. GYW+19, HB89b, HB89a, HM12, IG77, Landau [SV06]. Landmark [NNA12]. JLL+20, Joh97, KM09, KV09, KR86b, Landmark-Join [NNA12]. Landsat KR86a, LYX+19, LAKW07, LLL+16, [MNY81]. langage [LG78]. Language LCML94, Lin63, LCM+20, LYD71, Lum73, [Cer81, CKB83b, Dit76, FR69, GHJ+93, MZL+19, Men12, MW95, NTY12, PRRR15, GT63, GG86b, Har85, ISK+93, KCB81, QXL+20, RSSD89b, RSSD92, Rob86, RS08, LG78, Wil59, BW92, CP95a, CKB83a, SY11, SR63, SSS05, SDZ21, Sta99, YLSZ19, Lev89, YIAS89, YMI89]. Languages Yao95, Yub82, ZQSH12, And88, BSNP96b, [ACM91d, dBvL80, BRW93, CL83, Cra85, CCL91, GL06, GBL94, LW04, LND08, LY72, IEE84, Jou85, Kui92, NS82, Pat90, ACM91a, ML94, Men17, NM02b, Oka88, SD85, Sar11, AGK+10, ADG+08, AMSM+09, ACJT07, SN19, Shi17, WLC20, ZCZQ19]. CIM+05, DTM+18, DLH+79, DL06, GMP95, Key-Exposure [CTZD11]. key-node GJR79, Inc81]. LAPI [MS02]. Laplacian [SN19]. Key-Recovery [CY06]. [ZWCL10]. Large Key-Sequential [HB89a, HB89b]. [ABB93, VLD82, AW89, AAC+01, AOV+99, Key-to-Address BD88, BH85, BCH87, BJZ94, BI12, CKB85, [LYD71, Lum73, SR63, LY72]. Key-Value CML+13, CGO86, Chu90, Coh98, DSS84, [PRRR15, Shi17]. Keyed DS09c, Dos78a, DT91a, DT91b, FM91, Fel87, [Ano95a, BSNP96a, KKRJ07, Gon95, Li95, FHCD92a, FHMU85, GGY+19, GLLL17, SV06, FIP02a]. Keyed-Hash Gra92, Gra93c, Gri74, GSW98, HB89a, [KKRJ07, FIP02a]. Keying [BCK96a]. HB92, Hil78b, Hil78a, Ker75, KCR11, keypoints [MMG10]. Keys [Gon80, Gur73, KRRH84, KK85, Kos14, LM95, Li15, LT80, JC88a, Joh61, KR01, LMJC07, LL87, LSC91, LYD71, MSDS90, MEK+14, Oto85a, PB80, Riv76, Riv78, SD78, She78, MWC12, OGAB14, PAKR93, PV85, ST83a, Yao85a, CFN18, FP82, GMW90, Wan05]. ST83b, Sha86, SHF+17, SXLL08, Tan83, Keyword Win90a, XNS+13, YWH09, Yua92, YGC+12, [HWZP18, WWZ09, LMLC14, ZLC+18]. Zam80, Zem91, ZZLZ21, ZHW21, BZL+15, Keywords [Coh98]. Khafre [BS91c]. BT89, CFYT94, FWG18, FES09, FHCD92b, Kinetic [Rey14]. Kingdom GC95, HB89b, LK93, LY72, MSK96, Shi17, [JBJ94, ACM94b]. KLIPA [GT63]. TBC+05, Yao78, YMI89, Zha19a]. Knapsack [CP91c, JG95, Pat94]. Large-Grained [PAKR93]. Large-Scale Knowledge [GGY+19, GLLL17, Li15, MEK+14, [BDS88, BCH87, CLP13, CRdPHF12, Dam93, SHF+17, YGC+12, ZZLZ21, CML+13, ISK+93, OVY94b, Dam94, FNY92, OVY94a]. Kos14, SXLL08, FES09, Shi17, Zha19a]. Known [SY11]. Known-Key [SY11]. Last [PM89, KR19]. Knoxville [IEE94c]. Knuth [DM90, Ruc15]. Last-Come-First-Served [PM89]. Kobe [ICD91]. Kollisionsstrategien Latency [QXL+20, Sam81, SL16, WY00, 38

KLSV12, LDK12, ZGG05]. [Wil14]. libhashckpt [FRB11]. Library Latency-sensitive [WY00]. later [Roe95]. [ACZ16,´ Bee99, Sou92]. Life [BCR04]. light Latin [CHK06, DMPP06, CHK06]. Lattices [ARH+18]. Lightweight [KV09, LYY+18, LYX+19, GPV08]. lava [AHMNP12, AHMNP13, BDM+12, BKL+11, [McN03]. laws [AK09]. Layer [YSEL09]. HKY12, Cho21]. like [JNPP14, RS14]. Layered [Man12, ZC12]. Layers Limited [GL82, GL88, SS90a, Wen92]. [SDMS12, SDMS15]. Lazy limitedness [LP04]. Limits [AHS92, BJMM94b, BJMM94a, CF92, [KST99, MMSY94, BVF12]. Line Hug85, KV91, MV88, VV86, MSV87]. [AS82, Bry84, FFGOG07, HO72, IABV15, LCCR [Cer85]. LCFS [PVM97]. Leakage Leb87, SS83, Tsa96, BBKN12, HHL10, [NTY12, ZZM17]. Leakage-Resilience KRRH84, RW73, Tsa94]. Line-Oriented [NTY12]. Leakage-Resilient [ZZM17]. [Bry84]. Line-Rate [IABV15]. line/Oﬀ lean [SV15b]. Learn [McC79]. Learning [HHL10]. Linear [GK94, GK95, KG95, KKC12, KRJ+80, [Ald88, ADM+99, ATT98, Ano95a, AD11, LQH18, LLZ10, Val15, Wan84, BC06, BYSP98, Ban77, BK70, BGS96, BW98, SZO+20]. Least [OG94b]. Lecture [Dev86]. CFP19, Cle84, CL09a, CM93, Dae95, Ell85a, LEDA [MN99]. Lee [KCL03]. Leftover Ell87, FPV98, HB89a, HB92, HH85, HYH93, [DSGKS20]. Leistungsanalyse HTY90, HSW88, Jak85, JV16, Kno88, Knu19, [Kue82a, Kue82b]. Leitmotiv [Kah92]. Knu98, Kor08, KD92, Lar80b, Lar80c, Lar82b, Lemma [DSGKS20]. Lemmas [GK76]. Lar82c, Lar82d, Lar85b, Lar85c, Lar88b, Lemmatized [DS84b]. Length Larxx, KKMS10, Lit79b, Lit80, Litxxa, Luc72, [Dit91, Gon81, KLP98, LK94, Lit91, MF92, Lyo78a, MSSWP90, MY80, Moh90, Moh93, Men12, Mit73, PHL01, Pea90, Pea91, Sav90, Mul81, Omi88, OGAB14, OT91, OS83a, Sav91, ZPS90, ZPS93a, GS94, KL95, LLJ15, OA89, OS83b, PPR07, PPR09, PT16, Pet13, Men17, ZPS93b]. Lengths PK87, PVM97, RSD84, RSD85, RSSD89a, [Bra84a, Bra85, Bra86]. Less RS92, RLH91, Reg82, Rob86, RT87b, [DH01, GK08, KHK12, LK16]. Lett [Pro94]. SDR83a, SPW90, TW91, TZ12, Toy93, VP96, Letter [BMB68, CS85c, CS85b, Cha85, VP98, WVT90, YD86a, Ald87, ADM+97, CL86, Cha86a, CW91, CO82b, JC88a, TL95, BJ07, Bou95, HB89b, HCF95, Jan05, LNS93, Tro95, Wan05]. Letter-Oriented [CS85c, MTB00, MMC01, ML94, Omi89a, OP03, Cha86a, JC88a, TL95, CL86, CW91, Wan05]. OS88, PT10a, RLH90, Sar13, SS16]. linear Leuven [BBD09b, BW92, PGV93c]. Level [TMB02, Vio05, ZL12]. Linear-density [CJC+09, ZHW19, BGG12, DAC+13, HL94, [KD92]. Linear-Time [WVT90, Kor08]. Inc81, LDK12, MTB00, SDR83b, TKI99]. Linearizability [SDW14]. Linearization level-set [BGG12]. Levelled [LRY+15]. [BKMP09]. Linearizing [Oto88a]. Lingo leverage [IEE88a]. leverage/COMPCON [McC79]. Linguistics [Cer83]. link [BR75]. [IEE88a]. Lexical [CRdPHF12, ISHY88]. Linked [Fel87, Pal92, ZLLD18, ZKR08]. lexically [FF90]. lexicographic Linking [Bob75]. Linkless [CJC+09]. links [BMLLC+19]. Lexicon [EVF06]. Linux [USE00a, Lev00, LACJ18]. [CKB81, CKB83b, CKB83a]. Lexicons Lisbon [CIM+05]. Lisp [CKB85]. LFSR [DS09a, Kra94]. [LFP82, Hek89, Nam86, FH96, GSI+82]. LFSR-based [Kra94]. LH [LNS93]. LH* Lisp-Based [FH96]. List [McI82, Ter87]. [LNS96]. LHlf [ZL12]. LHS Lists [BH86, HK87, LLC89, Lyo79, MY79, [Moh90, Moh93]. Li [KCL03]. libdbh Kno84, ST85, SS06]. literate [Sab94]. little 39

[DMPP06, PES+12]. Live [MZD+18]. Louisiana [ACM91e, ACM97a]. Louisville Ljubljana [EF12]. LLE [TLZL16]. Load [Rie89]. Low [HC13, IK92, KJC11, LRLW89, LRLH91, [GI12, HMNB07, HGR07, Les88, LYW+18, Omi91, RRS12, RK91, Top92, TP95, WL07, PSSC17, QXL+20, TBC+05, ABO+17, KL08, SX08, TLLL18, WZ12, WTN09, BOY11, CZ14, HM03, MA15]. low-area XCCK09]. load-balanced [TLLL18]. [ABO+17, BOY11]. Low-Cost Load-balancing [WL07, XCCK09]. [GI12, HMNB07]. Low-overhead [HGR07]. Loading [vdP72]. Local [MD97, MNY81, Lower [DKM+94, GadHW96, Gon77, MJT+02, PKW09, RT81, SY08, BGG12]. MNP08, OWZ14, Yao83, DKM+88, Locality [BT12b, CSSP15, CKPT19, Chi91, DKM+91, Sun91, Sun93]. lowering Chi93, Chi94, EFMRK+20, HNKO20, [SSU+13]. LR [HC87]. LSH IMRV97, KBG18, Kaw15, MZL+19, MNP08, [AT18, AOD19,¨ CKM14, CK15, LCH+14, OWZ14, OTKH11, Pag18, ZHW21, AT18, LJW+17, ZNPM16]. LSH-Preserving GDGK20, HAK+16, HFZ+15, HFF+17, [CK15]. Lucifer [BS91c]. Luhn [Ste18]. LNS11, LWXS18, LJW+17, QZD+18, SP12, Luxembourg [Bir07]. LXCloud [LACJ18]. STS+13, SA17]. Locality-Aware LXCloud-CR [LACJ18]. Lymphocytic [HNKO20, MZL+19]. Locality-Preserving [SSaS01].ˇ Lyra2 [ASBdS16]. [Chi91, Chi93, Chi94, IMRV97]. Locality-Sensitive [BT12b, OWZ14, Pag18, M [Sar80]. MA [ACM84a, Ker75, Kil05, ZHW21, EFMRK+20, HFZ+15, HFF+17, CP91b, ACM86a, CP91a]. MAC QZD+18, STS+13, SA17]. Localizing [HLL18a, PV95, PvO95, Pre97a, SRRL98, [DD11, DJSN09]. Locally [KS88a, Oto88b]. SRY99, Eug90]. Machine Locating [WL12]. Location [And88, CCJ91, DGG+86, DGS+90b, [CCF04, TY03, ZWH17]. Location-Based DGS+90a, GD87, GSI+82, Hsi83, KLadH93, [ZWH17]. Lock [AR16, NM10, ZLLD18, KLM96, KTMo83a, KTMO83b, KTMo83c, AR21, NK16, Pro18, ZL12, SS06]. Tan83, EBD91, Vak85, BM90b, KK96, RH92]. Lock-Free [AR16, ZLLD18, AR21, NK16, Machine-Independent [CCJ91]. Pro18, ZL12, SS06]. locks [ALS10]. Lofthus Machinery [DT87]. Machines [Hel94]. log [FHC89]. logarithm [Gib91]. [BF89, adH93, Mey93, SD89b, Sch90b, Logarithms [vW94]. Logging SD90b, SD90a, TR02, CHS+18]. MACs [Moh90, Moh93]. Logic [DL17, GO07, PV95, PvO95, Pre97b, Saa12]. [AR16, BM87, BAN89, Cra85, IEE84, Las87, Made [Cic80b, PV07]. Madison [FMA02]. dKC94, BW92, DLM07, YIAS89]. Logical Magic [Hin20, Zha19b]. Magnetic [Wri83]. [CPP08]. Logs [SK99]. LOKI MAHT [CRdPHF12]. Main [AP93, CE95, [BS91c, Knu92]. London [Ano93a]. Long CRdPHF12, DKO+84b, DKO+84c, DKO84a, [Mit12]. Longest [DKT06, Gon81, PT12b]. KR91, KL87, KK85, Kum89a, LC86a, Look [CP91b, Sna87, AY14, CP91a]. SPW90, Sha86, TP95, ZHZ+19, AKN12, look-up [AY14]. Lookup [CN07, HDCM09, AP92, BATO13,¨ DKO+84d, JHL+15, Pro94]. Jai89, Jai92a, Jai92b, Jaixx, Pri71, She78, Main-Memory [KR91, BATO13].¨ SWTX18, Tro06, YBQZ18, BLC12, Maintaining [Woe06b]. Maintenance HXLX13, Mad80, MSK96, MLP07, MPL09, [Buc82, Bur83b, Bur83c, Oto85b, Bur83a]. MA15, PT12b, WTZ+13, WTN07, ZGG05]. Making Lookups [Pan05, BM01, IGA05]. Loss [BR97, Cob94, Hel91, LT09, CCA+12]. [ATS19, FC87b]. Lossy [PW08, Wee12]. Malicious [AAE+14]. malleable 40

[BCFW09]. Malo [GQ95, QG95]. Malware RLT83, RSD85, RSSD90, RSSD92, YD86a, [ASWD18, LLDZ18, NADY20]. AT18, CC88a, Fal88, Hua85, RSSD89a, Management RSSD89b, Riv74a, SDR83b, YD86b]. [ACM75b, ACM81, ACM82, ABM06, BL88, Matches [Dav73, PRK98]. Matching BJ93, BC90, CGLC20, CLM89, DT87, EE86, [iA94, BH85, CFP19, CCH09, CG79, Gri79, Flo77, FMA02, GGY+19, GMJ90, Gho77, Han90, HCKW90, HW08, KSSS86, KR81, Gho86, ISK+93, JLL+20, KM09, LC86a, KPS92, LLLC17, RH92, RH95, TK07, Lie81, McC79, MKF+16, Nav85, SW94b, ASM17, CLS95, CWC10, DKT06, DC94, SC77, Sto92, ZZ83, ZQSH12, DAC+13, GBY90, HC14, HW88, ISHY88, KP92, FNY92, FRS94, HF13, SW94a, WM93]. KS89a, Kim99, MHT+13, PT12b, Sch91a, Manager [Pro89]. Managing TKT+89, TLLL07, TLLL09, XMLC11]. [WMB94, WMB99, WYT93]. MANETs Matchings [CKN18]. Materialized [Alb21, JFDF09]. Manipulation [BM89, BM90a]. materials [SE89]. math [GK76, Ng79, Pon87]. Manual [McN03]. Mathematica [Jac92]. [RWSN07, Sil02a, WG94]. Manuscript Mathematical [FLF11]. Many [BC39, LG78, LII92, NAK+15, Sed83a, [BGF88, CZL12, JWM+18, Lia95, SV18]. Hil05, GT80, Rov90, Win78]. Mathematics many-body [JWM+18, Lia95]. many-core [FH96, GKP89, GKP94, GK81, GK82, [CZL12]. Map Knu74]. mathématique [LG78]. Matrices [GRZ93, LFD17, PPS21, Som99, AR21]. [ASW07]. Matrix Maple [PVM97]. mapped [SV15b]. [AN96, Atk75, BH90, vdSDW74b, mapper [YTHC97]. Mapping vdSdW74a, BT90, CFYT94, JCC00]. [Oto84, WH83, YD85]. Mappings Matsumoto [PGV93a, PGV90a, PGV93b]. [OS83a, OS83b]. MapReduce [LMD+12]. Max-Poly [DSS17]. maxima [MI84]. maps [HC14, JBWK11, SV18]. March Maximizing [KHK15]. Maximum [AHS92, [ACM82, ACM83a, ACM83b, ACM85b, GB10, KV91, MV88, Pet13, CKKK09]. ACM86a, ACM88a, ACM89b, ACM89a, Maximums [MNY81]. maxmin [AII89]. ACM91b, AH03, Ano10, Bir07, CHK06, May [ACM75c, ACM75a, ACM76, ACM77b, Deb03, IEE88a, IEE11a, JBJ94, RNT90, ACM81, ACM84b, ACM86b, ACM88b, SM08, TWW77, Ytr06]. marching ACM89c, ACM90, ACM91e, ACM94c, [ZRL+08]. Marina [ACM82]. markerless ACM96, ACM97b, ACM98, ACM02, [JBWK11]. Markets [Mir17]. Markov ACM08b, ACM12, AFK90, ARA94, Bai81, [HL94]. Marseille [Ng79]. marshalling Bor81, BJ93, Dam90a, Dam91, DT87, De 95, [LPSW03]. Maryland FIP93, GMJ90, GQ95, Hel94, IEE85b, [ACM90, FNY92, Jáj90]. Marz [Lut88]. IEE94b, IEE94c, KLT92, Lie81, LT85, Mass [Col93]. Massachusetts Nav85, PGV93c, QG95, Rue93, SW94b, [BV89, IEE05, MS05]. Massive SW94a, Vau06]. McGill [CCC89]. MD [SMZ18, HAKM15, LRU14, Vit01, XCCK09]. [Fis87, IEE02, PvO95]. MD-x [PvO95]. Massively [AKN12, Jáj90, MK93, RH92, MD4 [Ano95a, WFLY04]. MD5 YLB90, Yen91, CZL12, Fis87]. [Ano09b, For09, WFLY04, WZJS10]. MD6 Massively-Parallel [MK93]. Master [BKMP09]. MDC [LS15]. MDC-2 [LS15]. [LYX+19]. Match MDS [TW07]. MDx [PV95, SRRL98]. [AU79, Bur75b, Bur76b, Bur76c, Bur78, MDx-family [SRRL98]. MDx-MAC Bur79, CLD82, Chu90, Jag91, Mor83a, [PV95]. Me [Lan06]. Mean 41

[Bra84a, Bra85, Bra86]. Means [Bab79]. [DG93, DG94]. Memory-Efficient measure [Bac02]. Measurement [NS16b, [YBQZ18, BLP+14, Shi17, XLZC14]. SL16, YGS+19, LMP+08, RW07, ACM94c]. Memory-hard [LSZ+21, BDK16]. mer measurements [KLSV12]. Measures [HC14, PNPC20]. Merge [MY79]. Mechanism [DGD02, Kum89a, [Gra94b, Gra99, AKN12]. Merge-Join Cha12, HKL04, JFDF09, SF88]. [Gra99]. merging [SSU+13]. Merkle Mechanisms [DF01, Sev74]. Media [Bak09, CDMP05, GB17, LRY+15, Mir01, [LWZ+18, CBB05, ZO13]. MFES04]. Merkle-Damg˚ard [Mir01]. media-streaming [CBB05]. Median Mesh [CRR18]. Mesh-to-Mesh [CRR18]. [HSPZ08, She78]. Medical Message [AVZ11,´ BCK96a, BCK96b, [FHMU85, GPA97]. Meet [Sas11]. EPR99, FIP02a, HK12a, KKRJ07, MRW89, Meet-in-the-Middle [Sas11]. Meeting NCFK11, RWSN07, Rog95, Rog99, Sho96, [ACM84a]. Mega [TKT+89]. Mega-access TC83, Tsu92a, Tsu92b, WS03, Yas07, [TKT+89]. Mehods [Du86]. GK12b, Kra95, MS09, Sta99, SV06]. Mehrfachattribut [Stu82]. Metabase [KP81]. Metadata Mehrfachattribut-zugriffsverfahren [GGY+19, SWTX18, DAC+13]. MetaFlow [Stu82]. Mehrschluesselzugriff [Fri86]. [SWTX18]. Metagenomic [PKSB18, KZ19]. Membership Method [AA79b, AA79a, Ari68, Bat75, [BM99, DP08, HKLS12, Pag01]. Bel70, Bel72, Bel83, CS91, CC87, CLC92, MemGuard [CZ14]. memo [Hug85]. CPP08, CLS12, Cic80a, Dos78a, DT75, memo-functions [Hug85]. Mémoires FNPS79, HD72, JO80, Jae81, Joh61, KR86b, [Lit77b, Lit79a]. Memories KR86a, KNT89, KO90, KR79, KRJ+80, [DD15, KHW91a, MNS07, Sha86, Lam70, LK84, LPT12, LL86, LL87, Mal77, vdBGLGL+16, CCHK08, CCA+12, Hui90, MNY81, McI63, Moh90, Moh93, Mul72, KHW91b, Koh80, Lin63, RH90]. Memory NKT88, NI83, PG95, Per73, Ram92, RJK79, [AP93, ASBdS16, AGMT11, BLP+14, BC90, RT87b, SD85, Sag84, SG76a, SS62, SR63, CRdPHF12, CCW+17, CadHS00, DG93, SSS05, Spr77, SHRD09, Ven84, WKBA07, DG94, DKO+84b, DKO+84c, DKO84a, Wu85, YD85, Zou85, BGG12, HW88, Kan91, DHK+15, DadH92, Dum56, EK93, adH93, Kan93, LP04, MI84, MF82, MFK+06, NH74, HNS84, JP08, JLL+20, JCK+18, KHK15, Vit80a, WLLG08, Woe06a, Zob70a, Zob70b]. KU88, KLadH93, KLM96, KR91, KL87, Methode [Kar82]. Méthodes [Lit77b]. KK85, Kum89a, LC86a, LTS90, LHWL21, Methodologie [Lit77a]. methodologies LSZ+21, MZL+19, MLxx, Mey93, Omi91, [CE95]. Methodology [Hea82, GJM02]. PSSC17, Pan05, PG95, PS12, PGV90b, Methods [AS16, Bay74, Bla00, Bra84b, QXL+20, RSK17, Ros21, RL74, SPW90, CSSP15, CF89a, Eck74b, Fal85b, FC87a, SS88b, TR02, TP95, Vit81a, Wil71, Woe06b, Gri98, HB89a, HB92, Kab87, Lit84, Lum73, Wri83, YBQZ18, ZH18, ZHZ+19, AS09, MWHC96, ML75, MV02, Pip94, QCH+81, AKN12, AP92, BATO13,¨ BDK16, Bor84, SDKR87, SM87, TK88, CE95, CLS18, CJMS19, CZ14, DKO+84d, Don91, GLJ11, GRF11, HB89b, Lev89, Mul92, RAD15]. HDCM11, HKL04, HCW+21, JHL+15, Metric [Bal05, TWZW11]. Mexico KU86, KFG15, LHWL20, MSZ+20, MBK00, [ACM75c, ACM75a, VLD82, IEE91a, Gol94]. MSS96, PGV93g, Pro94, Shi17, SG72, MGR [BDMD19]. MHT [GB17]. Miami SV15a, TKT+89, Vit01, WLC20, XLZC14, [PDI91, RNT90]. Michigan YIAS89, ZHW01]. Memory-Contention [ACM81, Bai81, Bor81, Lie81, Lie81]. 42

Miconex [Ano83]. Micro [LHC05, ZZ83]. [Ano92]. MMIX [Ruc15]. MN [SW94a]. Micro-Computer [ZZ83]. Micro-payment Mobile [DF01, KKRJ07, KRJ09b, YY07, [LHC05]. Microarray [TGGF10]. Cho21, HKW05, QZD+18, ZC12]. Modal Microblog [CDW+19]. Microcomputer [MLHK17, WSZ+16, CJN20, ZLC+20]. [Mil85]. Micropayment [Ngu06]. Mode [PHG12, ZHZ+19, Wan05]. Model Microprocessor [CBA94, TKT+89]. [BG80, Bat81, BG82, CLP13, GadHW96, Microprocessor-controlled [CBA94]. IJK13, ISK+93, KSSS86, KCF84, LYX+19, Microprocessors [DGD02, FAFK21]. LW88, LT12, NY85, PV19, Ram88a, RH92, Microsoft [GBC98]. Mid [ACM85a]. RH95, Sev74, VC85, WYD+18, Web72, Mid-80 [ACM85a]. Middle [Sas11]. YLZ20, GvR08, GMP95, HW88, LMSF89, middleware [ZO13]. Migration MTB00, Sun91, TMB02]. Model-Based [MZD+18, HSMB91]. Milan [Ano94]. mill [KSSS86, LW88, HW88]. Modeling [BDPV06]. MIMD [RG89]. Min [DSS17, [BY89, LLW10, ACM94c, PCV94]. Ind01, LKI10, CWC10, FPS17, GP08]. Modelisation [Lit77b]. Modelle Min-Hash [LKI10]. min-hashes [GP08]. [Kue82a, Kue82b]. modelling [DOP+14]. min-hashing [CWC10]. Min-Wise [Ind01]. Models Min/Max [DSS17]. Min/Max-Poly [AT91, GHJ+93, HBL+10, Kue82b, SK88]. [DSS17]. MinHash [HWZP18, KZ19]. Modern [AG18, FAFK21, Ram97, Ros06, MinHash-Based [HWZP18]. Minimal Ros07, She17, Bis12, BMQ98, DLH+79, [BPZ07, BH86, CKB83a, CKB83b, CS83a, GK05, KL15, KKL+09]. Modes [AR17, Cha84b, Cha84c, CS85c, CS85b, Cha85, CS86, LLG12, SY11, Sas11, WPS+12, BDPV14]. CL86, Cha86b, CC88b, CT12, Cic80a, Cic80b, Modiﬁed CO82b, CHM92a, CHM92b, CM93, DH01, [HPC02, KGJG12, Kaw85, KJS17]. Modula Die07, FCDH90, FCDH91, FCH92, FHCD92a, [Fel88, SW86, SW87, BH86, ST86, Sed93]. GHK91a, GHK91b, HT01, Irbxx, JO80, Modula-2 Jae81, JD12, KH84, MWCH92, Pag99, PV92, [Fel88, SW86, SW87, BH86, ST86]. Pes96, Sag84, Sag85a, ST85, TW91, Tro92, Modula-3 [Sed93]. Modular Tro95, Win90b, Win90a, BBPV11, FHC89, [GSC01, LT09, ISO97, Mei95, Mon19]. FHCD92b, HK86, SH92, SH94, TKI99]. Module [KRJ09b]. Modulo Minimean [Yao95]. Minimization [YY01]. [CC87, CLC92, Gir87, Kak83]. Modulo- minimized [CVR14]. minimizing [CCY91]. [Gir87]. Modulus [PV92]. molecular Minimum [BM99]. Mining [IG94]. Moment [TZ12]. Monitoring [CL05, CLC06, CT12, HC02, JL14, LRU14, [SS83, SLC+07]. monotone [BBPV11]. PCY95, PKW09, SK98, YGC+12, HC07, Monte [BF83, Rey14]. Monterey [Col93]. BMLLC+19, Nic17]. Minneapolis Montgomery [WS03]. Montr´eal [SW94b, SW94a]. Minnesota [SW94b]. [ACM02, CCC89, JY14, Lev95]. Minor [Gri77]. Minus [NXB13]. Minutiae Morphological [CRdPHF12]. Moscow [JTOT09]. Minutiae-Based [JTOT09]. [Ers58b]. Most [AT93, AT90, ESRI14]. Minwise [PT16, DT14, LK11, PT10a]. Motion [CBA94, Cli95]. Motivating Misson [Ano10]. Misspelt [KR79]. [She06]. move [KM10]. Moving Mitigating [HRS16]. Mitigation [SHF+17]. [Lep98, SR01]. MPEG4 [KM09]. MPHF Mix [LT09]. Mix-Compress-Mix [LT09]. [Zou85]. MR [Pro94, Sar80]. MRD Mixed [LMLC14]. Mixing [SNBC98, SnC05]. MS [JC88b]. MS-DOS [Cai84, LMPW15]. MJH [LS15]. ML [JC88b]. MTAC [GT80]. Muenster [Dit76]. 43

Multi [AP93, BATO13,¨ BSH12,ˇ BR06, multicore [CHS+18]. multidatabase CS83b, CC87, CS87, Cha88, CHY97, CLS12, [DSD95]. Multidimensional CJC+09, Coh84, FL08, FLP08, FLP14, [Cob94, Hua85, HSW88, KS86, KS87a, GPY94a, GPY94b, HYH89, HYH93, HRS16, KS87b, KS89b, LOY00, Oto84, Oto85a, KR86b, KR86a, KL87, LOON01,¨ LRY+15, Oto86, OS83a, OA89, OS83b, Stu85, Toy93, LCM+20, MTB00, MNY81, Ngu06, WFT12, IMRV97, LS07b]. multidisk PADHY93, RSSD90, SD85, SMZ18, VB00, [CC88a]. multigrid [GZ99]. multihop WSZ+16, YNW+09, YLB90, ZJ09, ZHW21, [ADF12]. Multikey ZLC+20, AKN12, Ano83, CLL+14, HR93, [DL80, KR88, NHS84, SDKR87, VV84]. HL94, KKL+09, LJW+17, Pro94, Sar13, multilabel [CML+13, LMLC14]. SV18, TL93, Tsa08, XMLC11]. Multilevel Multi-Agent [BSH12].ˇ Multi-Attribute [BK90, DT91a, DT91b, Gri98, LZL88]. [CS83b, CS87, HYH93, RSSD90, HR93]. Multimaps [AGMT11]. multimatch Multi-core [BATO13,¨ AKN12, KKL+09]. [XLZC14]. Multimedia Multi-Dimensional [CJN20, Fox91, HLC10, ISK+93, LQH18, [HYH89, MNY81, Ngu06, XMLC11]. LZ16, RZ90, SSL+18, ZLC+20, ZHC+13]. Multi-Directory [PADHY93, AP93, Pro94]. multimodal [MHT+13]. Multi-Disc [CC87]. Multi-Disk [Cha88]. Multipermutations [SV94b, SV95]. Multi-Entry [YLB90]. Multi-granular Multiple [Abi12, AS96, BP97, Bol79, [CLS12]. multi-graph [CLL+14]. CS83b, CC87, CS87, CC91, CLC92, CLYY95, Multi-Index [GPY94b, GPY94a]. FB87, FP10, GK94, GK95, HDCM09, Multi-Join [CHY97, TL93]. Multi-Key HHL10, HWZP18, HCY94, KG95, KKC12, [KR86b, KR86a, SD85]. Multi-Level HGH+12, LCML94, LOY00, LLLC17, MK11, [CJC+09, MTB00, HL94]. multi-linear MB03, Mit02, RSSD89b, RSSD90, RSSD92, [Sar13]. multi-maps [SV18]. Multi-Modal SM87, Tra63, WB87, BM01, CCL91, DH84, [WSZ+16, ZLC+20]. multi-national DMP09, HKLS12, XCCK09]. [Ano83]. Multi-Precision [LOON01].¨ Multiple-Attribute [GK95, KG95]. multi-probe [LJW+17]. Multi-Processor Multiple-Collision [HHL10]. [KL87, YNW+09]. Multi-Property Multiple-Key [Bol79, RSSD89b, RSSD92]. [FLP14, FL08, FLP08]. multiple-set [HKLS12]. multiple-valued Multi-Property-Preserving [BR06]. [DH84]. Multiplication Multi-Proxy [ZJ09]. Multi-Replica [AN96, GK08, Woe01, Bis12, Woe05]. [LRY+15]. Multi-Sensor [ZHW21]. multiplications [LK16]. Multiprocessor multi-server [Tsa08]. Multi-Stage [DG85a, DG85b, Ger86a, Ger86b, KTN92, [LCM+20]. Multi-target [HRS16]. MLxx, Omi91, RS92, SD89b, SD89c, SD89a, Multi-Threaded [VB00]. Sch90b, SD90b, SD90a, TNKT92, ZJM94b, Multi-Threading [SMZ18]. SD89d, ZJM94a, ZJM94c]. Multi-Version [Coh84]. Multiattribute Multiprocessors [Bor84, LTS90]. [CLD82, Fal85a, Fal86, Rot89]. Multicast multiqueue [Has72]. Multiset [DPH08, TW07, ATAKS07, CBB05]. [MSTA17, CP95a]. multisets Multicollision [KHK10, KVK12]. [B¨ut86, NTW09, RRS07]. multisignature Multicollisions [Hal12, Jou04]. [Oka88]. Multispectral [DCM18]. Multicomputer [BGF88, OL91, OL92]. Multiterm [Bur84, Bur82]. multithreaded Multicomputers [OL89, TY91, HSMB91]. [GK05]. Multithreading [Cro98, MIGA18]. 44

Multiuser [ZG90a, ZG90b]. Multivariate Network [Ano10, HCJC06, HLC10, JL14, [AM07, OS10]. Multivariates [DY08]. KHK15, MK11, PLKS07, Ven86, WBWV16, Multiview [LWZ+18, SSL+18]. Munich YBQZ18, AS09, CVR14, Cho21, DFMR15, [BRW93]. M¨unster [Dit76]. MuR Die90, FVS12, KL08, RAL07, TLLL07]. [LRY+15]. MuR-DPA [LRY+15]. Mutual Networking [ACM04, LCK11, LZ16, [CJP12, GI12, CJP15, FF90, SPLHCB14]. WBWV16, WTZ+13]. Networks [CGLC20, DK09, DPH08, Jai89, Jai92a, N [Sar80, FHC89, ISO97]. n-bit [ISO97]. Jai92b, Jaixx, JLH08, Kak93, Kul84, Naehrig [FT12]. name [WTZ+13]. named LDY+16, MJBD11, PLKS07, SV94b, [WTZ+13]. Names [ABC+16, Dos78a]. SPSP16, SMS91, TGGF10, XHZ+19, Nancy [Jou85]. Nanowire [Rey14]. NASA ZQSH12, AK09, ADF12, BCCL10, Cha12, [Fis87]. Nashville [ACM94c]. National GDGK20, GBL94, LG13, LND08, MLP07, [??69, Fis87, Oxb86, Ano83, IEE94b]. PES+12, SV95, SX08, TBC+05, WHS+07, Native [SFA+19]. NATO [Ano95c]. WWG+18, YG10, ZBB+06, BB07, CT10]. Natural [Cer81, CKB83b, Har85, KCB81, neuer [BI87]. Neural [Kak93, WWG+18]. LG78, YMI89, CKB83a]. naturel [LG78]. Nevada [IEE10, AFI69]. Next NC [IEE89]. NDN [TKH20]. NDSS [DCW91, She91, CCA+12, CT10, KKP92]. [Ano10]. Near [AI06, AI08, BT89, DD15, Next-Generation LQZH14, GJM02, SB97, Yuv75]. [She91, CCA+12, KKP92]. Niagara Near-Associative [DD15]. [AFK90]. NiceHash [Nic17]. NIDS Near-Duplicate [LQZH14]. Near-Optimal [KJC11, TK07]. NIDS/NIPS [TK07]. [AI06, AI08]. Near-perfect [BT89, SB97]. Nineteenth [ACM08a, IEE95]. Ninth Nearest [AEP18, AI06, CL85, KBG18, [ACM77b, NS82, ACM77a, ACM97b, Kar98, MW09, PACT09, SY08, AI08, CW93, FH79, ICD93, ST83b]. NIPS [TK07]. NIST HFZ+15, JDW+19, LCH+14, LWWK20, [Bou12, RRS06]. Nixdorf [adHMR93]. NJ SWQ+14, TYSK10, MKL21]. [GMJ90]. NL [DSS17]. NMAC nearest-neighbor [FH79]. Nearly [CY06, RR08]. NMAC/HMAC [RR08]. [HT01, FP82, MV91a]. nearly-constant NMF [TCY+20]. NN [EFMRK+20]. No [MV91a]. Necessary [AKS78, CP91a, KR01, CP91b, GBL94, [IH95, Rus92, Rus93, Rus95]. Need [HR04]. Pro94, Sar80]. Node Negative [DDF+07, SB95]. Negatives [YLZ20, LG13, SN19, THS97, WL07]. [Pag18]. Neighbor Nodes [BGF88, RAL07]. Non [AEP18, AI06, CL85, KBG18, MW09, [BCFW09, Boo74, FNSS88, KS86, KS87b, PCM15, PACT09, SY08, AI08, CW93, FH79, LT12, LS96, RWSN07, SD78, SA97, TSY98, GJM02, HFZ+15, JDW+19, LCH+14, ZH18, AY14, Ald87, Ati20, CCA+12, LWWK20, SWQ+14, TYSK10, MKL21]. ESRI14, FP82, MSZ+20, MLP07, MP16, Neighbor-sensitive [PCM15]. PBBO12, Sar15, SXL16, Lut88]. Neighborhood non-asymptotic [Ati20]. Non-biased [DHL+94, DHL+02, D+92, SG72, ZLY+13]. [TSY98]. non-blocking [PBBO12]. neighbours [Yuv75]. Neither non-compressing [MP16]. [CP91a, CP91b]. neophytes [Gre95]. non-cryptographic [AY14, ESRI14]. Nested [HBL+10, FK89, MMC01, TMB02]. Non-expansive [LS96]. Non-interactive netﬂow [LDK12]. Netherlands [RWSN07]. non-iterative [SXL16]. [dBvL80, CP87, CP88, vL94, AW89]. Non-malleable [BCFW09]. Non-oblivious 45

[FNSS88]. Non-programmable [LT12]. [Hol87]. NV [CCA+12]. NV-Heaps non-random [FP82]. non-randomness [CCA+12]. NY [Sar15]. Non-rigid [SA97]. Non-standard [ACM12, GSW98, Mat09, IEE80b, IEE88c]. [Lut88]. Non-Uniform [KS86, KS87b, Ald87]. non-uniformly O [FHC89, MMC01, Vit85]. OBDD [MLP07]. Non-Unique [Boo74, SD78]. [Woe01, Woe05]. OBDD-Size Non-Volatile [ZH18, CCA+12, MSZ+20]. [Woe01, Woe05]. Object nonchalantly [Gre95]. Nonclustered [BDPSNG97, BP94, EE86, GK94, GK95, [Omi89b]. noncontinuous [ZO13]. Hej89, ISK+93, KG95, KM92, LDM92, nondestructive [AD08]. Nonlinear MBBS12, PKW09, PW94, SA97, TR02, [MLHK17, LC13]. Nonmalleable [LP15]. WPKK94, YWH09, WL12, DMP09, DM11, nonnumeric [JMH02]. Nonoblivious Fly92, GMP95, GG92, LG96, BM90b]. [FNSS92]. Nonstationary [WB90]. Object-Oriented [BDPSNG97, ISK+93, NonStop [Eng94]. Nonuniform LDM92, TR02, DMP09, DM11]. Objects [Ald88, KS87a, KS89b, PK87]. [Bar97, BS94b, KM92, SR01, BS94c, nonuniformly [MPL09]. Nonvolatile CCA+12, GP08, TD93]. Oblivious [ZHZ+19]. Noordwijkerhout [dBvL80]. [Cha94, GM98, HK12a, PWYZ14, SS88a, NOrec [DSS10]. Norm [Aum09, HFF+17]. CHL07, FNSS88, PWYZ10, SS90b]. Normalization [RGNMPM12]. Norway Observations [Bal96, Sti06]. obstacles [Hel94, Ytr06, Ano95c]. NoSQL [EH17]. [HM93]. obtain [Vit80a]. Occupation Nostradamus [KK06]. Notary [Cip93]. [vM39]. Occurrences [ZC77]. Occurring Notation [FGFK10]. Note [She78]. OCR [Wan84]. Oct [Bob75, CC91, Dit91, GIS05, Gei95, Gei96, [IEE80b, WS93, War14]. Oct-Tree Gur73, Lit91, Pea91, Sav91, SVCC01, Ull72, [WS93, War14]. October Yao80, Bay73b, FH79, Sar80]. Notes [ACM85a, Ano93a, Ano93c, BD08, CE95, [Dev86]. Nothing IEE74, IEE76, IEE80a, IEE85a, IEE88c, [SD89c, SD89a, SRY99, SD89d]. Nouvelle IEE89, IEE91b, IEE92b, IEE99, IEE06, [Lit79a]. Novel [DCM18, DR11, LYY+18, IEE07, IEE10, IEE11b, IEE13, Jáj90, Lom93, LYX+19, cLmL07, LCM+20, LSZ+21, Mo92b, ST83a, ST83b, USE00a]. Octree NW07, PHG12, YSW+11, YLSZ19, ZZM17, [CJC+09]. ODBF [ODB89]. odyssey ZYWM20, AR21, HLL18b, LMP+08]. [IEE01]. off [CJMS19, GW94, Sar11]. November Off-line [HHL10]. Office [DGM89, FC87a]. [ACM87, ACM94a, ACM03b, ACM04, AFI69, Offline [GAS+16]. Offs [ASBdS16, Blo70]. FNY92, Gol94, adHMR93, IEE82, IEE88d, offset [HLL18b]. OFL [GMP95]. OH IEE89, IEE90, IEE91a, IEE93, IEE02, [BD08, IEE94b]. Ohio [Fis87]. OHLCAP IRM93, LCK11, PSN95, ST83a, ST83b]. NP [HMNB07]. Old [FLF11]. Omnibus [FS08]. Nroff [Hol87]. NTRUSign [ZJ09]. [GDGK20]. On-Chip [MJBD11]. On-Line NTRUSign-Based [ZJ09]. Number [AS82, FFGOG07, SS83, BBKN12, HHL10, [Ano86, Bat75, Dos78a, Gui89, WL12, KRRH84, RW73]. On-line/Off-line Aam03, ASW87, BK07a, CP13, HC11, [HHL10]. Once [MNS07]. One Hua82, KW94, TSY98]. numbering [BCFW09, DGV93, Dit76, GK08, HHR+10, [Cli95, DM11, VNC07]. Numbers HYLT99, JLH08, HGH+12, LK84, Lar88b, [BJMM94b, BJMM94a, Coh98, HSR+01, LAKW07, LOZ12, LMD+12, LHC05, LP15, OG94a, MFK+06, OS10]. Numerals Lyo85, Mer90b, Moh11, OGAB14, PWY+13, 46

Par18, RHM09, Roe94, Rul93, SP91, Sch91a, LL92, LCML94, Lip02, MLP07, Men12, Sho00a, Tsu92a, Wee07, Win83, Win84, Men17, Mor83a, OWZ14, PP08, RR92, Yas07, YZ00, ZPS90, Zhe90, ZMI91, ZPS93a, Riv76, Riv78, Tro06, Yao85a, Yao85b, Yao95, CMR98, Gib91, HR07, HL03, IEE92a, KST99, YCRY93, YSEL09, AI08, GSS01, LCRY93]. KM10, LW04, Mer90a, MZI98, NY89b, Optimality [Bol79, CLC92, JP08]. NY89a, Roe95, Sim98, SV18, STS+13, Tsa08, optimally [Woe06a]. Optimierungsfragen Tsu92b, YL04, ZW05, ZPS93b, HMNB07]. [Wal74]. Optimistic [GT16, SDZ21]. One-access [Lar88b]. One-Hop [RHM09]. Optimistically [GLB21, Zuk21]. One-Pass [LMD+12]. One-Step [Dit76]. Optimization [AOAAK20, ODB89, AR17, One-Time BG92, Kie85, Kim80, MXL+12, Mir17, [LAKW07, Moh11, PWY+13, Par18]. MWC12, Tv83, XNS+13, YNW+09, Yub82, One-Way DJRZ06, DJNR09, Loh89, MP90]. [BCFW09, DGV93, GK08, HHR+10, JLH08, Optimized LP15, Roe94, Rul93, Sch91a, Sho00a, [ARH+18, CVR14, EPR99, MZD+18, ZH18]. Tsu92a, Wee07, Win83, Win84, YZ00, Zhe90, Optimizer [ML86]. Optimizing [DGGL16, HYLT99, LHC05, ZPS90, ZMI91, ZPS93a, DOP+14, LOY00, MBK00, PF88, SW91, CMR98, HR07, HL03, KST99, LW04, Mer90a, SV15b, WL12, TCW+13, WLC20, WTN07]. MZI98, NY89b, NY89a, Sim98, Tsa08, Optimum Tsu92b, YL04, ZW05, ZPS93b, HMNB07]. [VC85, vdP72, vdP73, van73, Vit80a]. Online OR-parallel [Cra85]. Oracle [BBKN01, Dos78b, FXWW17, Ger95, Kue83, [GHR99, LT12]. Oracles [Can97]. Order Kue84a, Mir17, SI09, TP15, PES+12]. [FCDH90, FCDH91, GG86a, HB92, HM12, Online-fehlerbehandlung [Kue84a]. HSW88, Oto88a, Ouk83, Rob86, Tam81, Online-fehlererkennung [Kue83]. Only AKY13, BMLLC+19, DH84, DLM07, [EH12, MT11, NM10]. Ontario [KLT92]. HKKK13, Pri95]. Order-Preserving Open [GG86a, Ouk83]. Ordered [AK74, CS83a, [AMP15, Bra84a, Bra85, Bra86, Fel87, Gon77, Cha84b, Cha84c, CS86, Cha86b, CC88b, Gon80, Kno71, Kno88, LH03b, LH03a, Mit09, MY79, MN90, SH92, SH94, SS06, JMH02]. MC86, SS80, NK16, NMX19, TT81, van73]. Ordering [Lyo78a, GM79, Sab94]. Ordinal Open-Addressing [Gon77, Gon80]. [ZZLZ21]. Ordinal-Preserving [ZZLZ21]. Operating [ACM87]. Operation Oregon [IEE93, ACM85b, CLM89]. [CLS12, KL87, PHG12, AS89]. Organisation [Lit77a, Wie87a]. Operationen [Nee79]. Operations Organization [ANS10, Bra84b, Ell83, Ers58a, FAFK21, [ACM75b, Ano85a, ANT85, Ast80, Buc63, Gir87, He87, HYH89, HYH93, HY86, DS84b, Gho77, Gho86, IEE85b, KK85, HTY90, Kum90, Kut10, MSSWP90, SG76a, LK84, LT85, LI80, Lit89, LS89, Lom88, Wu85, JMH02, Pro18]. Opportunistic Lom93, Mar75, Mar77, Ols69, QCH+81, [LDK12]. OPS5 [KS89a]. Optical RL89, RL74, Tha88, TS85, Wie83, Wu85, [CF89a, Vit85, CF89b, FWG18]. OPTIK BR75, Bat65, IL90, Kou93, RM88, VBW94]. [GT16]. Optimal Organizations [AU79, AI06, Bat80, Bat82, BR94, BBP88, [CF89a, Sch79b, Sch81, Toy86, YD86a]. BW98, BMRV02, CC88a, Cha84a, CHM92a, Organized [FLF11]. Organizing CHM92b, DA93, FC87b, FP89b, HR93, [HH85, Som99, TY03]. Orientability HRB13, Jag91, KK12, KK18, KP92, Kri84, [FP10]. Orientation [BH93]. Oriented 47

[BDPSNG97, Bry84, CS85c, CS85b, Cha85, Pairwise [DL12, ZLY+12]. Palace Cha86a, CO82b, DCW91, ISK+93, JC88a, [ACM75b, IEE88d]. Palm [IEE11b]. Kie85, LDM92, PV92, TL95, TR02, Tro95, Palmer [IEE80a]. PANAMA CL86, CW91, CW93, CKW93, DMP09, [DC98a, DV07, RVPV02, BDPV09, DC98b]. DM11, Wan05]. Orlando Paper [Cer85, Pro94, SV15a, ZL12]. Papers [ACM91d, ACM91a, Kna89]. Orleans [ACM75c, ACM76, ACM77b, LFP82, LC86b, [ACM91e, ACM97a, IEE74]. Orthogonal SC77, ACM79, ACM91d, Bai81, Bor81, [BGS96, LCML94, CCL91, Wil78, Wil85a]. GJM02, IEE88a, Ytr06, Bir07, FNY92, JY14]. Oscar [GDA10]. OT [PSZ18]. Othello Paradeisos [JWM+18]. Paradigm [YBQZ18]. Other [BM97, CS02]. paradox [RK15]. Parallel [PV19, Saa12, Bee83, BDK16]. OTS [Hül13]. [ACM91c, PDI91, And88, Ano93d, AEMR09, outbreak [FNP09]. outfit [Nic17]. outlier AR17, AT91, BFG+95, BH91, Bis12, BRW93, [GDGK20]. Output [Mit12, NIS15, NR12, Bor84, Bur81, CdM89, CdM90, Chi91, Chi94, PHL01, ZPS90, ZPS93a, Sab94, ZPS93b]. CT96, DNSS92, DA93, DS97, GST90, GM94, outsourced [YLC+09]. Overflow GM98, GI77, Gra94c, GZ99, GC90, HB93, [Bra84a, Bra85, Bra86, Hop68b, Lar85b, HNS84, HC07, HCY94, HCY97, IG77, Jáj90, Mul72, Mul81, NY85, Sam76, Sch79a, KU86, KU88, KR91, KJC11, KR19, KO90, Tam82, Tor84, Bay73b, CS93a, KD92, KTN92, LC20, LLLC17, LPP91, LPP92, Kou93, Ram87, YD86b]. MD97, MLD94, MV90, MV91b, Mat93, Overflow-Handling [Lar85b]. Overhead MK89, Mil85, MK93, NM02a, PAKR93, [Les88, HGR07, IKOS08, MA15]. overheads Pap94, PK89, PRM16, PSR90, PW94, [SSU+13]. Overlapping [MJT+02]. Rag93, Ram89b, RS92, RH92, RC94, RK89, Overlay [PFM+09, GDA10, TBC+05]. RNT90, RK91, SS01, SD89c, SD89a, SV94a, overlays [GHW07]. Overview SPW90, SS88b, SB93, SK98, SA17, TR02, [PGV92, Ros12, WR97, BFG+95, BDP+12]. TK85, Top92, TP95, TNKT92, WPY90, ownership [DSS10, LWG11]. Oxford WPKK94, WS93, WYT93, Woo89, Wu85, [ACM94b]. lWSS91, YLB90, Yen91, YB95, ZWH17, ZO93, dKC94, vW94, vdVL12, ALS10]. P [Lev89]. P-any [Lev89]. P2P parallel [AKN12, ASA+09, Ati20, CZL12, [HNKO20, NW07]. PA CyWM91, Cra85, Don91, FHL+19, Fis87, [ACM04, ACM89b, ACM89a, KI94]. Pache GLHL11, HK95, KP92, MV91a, MP90, [CGLC20]. Pacific [ACM75b]. Pacifica Mol90a, Mol90b, OT89, PCK95, RLM87, [ICD87]. Package [SY91]. Packed SK88, SD89d, STS+13, TL93, UHT95, [Lyo78b, DW05, DW07]. Packet War14, adHMR93, KL95]. parallel-DM [CGLC20, KMV10, MJBD11, PT11b, [KL95]. parallelism CKKK09, HDCM11, LS07b, XLZC14]. [ASM17, Ged14, MMSY94]. parallelizable Packetization [SMS91]. packing [BT90]. [MP16]. Parallelization [DTM+18]. Padded [HK87]. Padding [CLNY06]. Parallelizing [GK12b, WDYT91]. Paderborn [adHMR93]. Page Parameter [CC88b, GB10]. [GRZ93, MZD+18, YT16, BCR10, Wee88]. parameterization [SS15]. Parameterized Paged [BC90, RL74]. Pages [DMR11]. [SS89b]. Parameters [HRB13, HYLT99]. Paging [Bry84, HBL+10]. Pair parazoa [AMP12]. PARBASE [RNT90]. [GSC01, Val15, DHKP97, PW06, TYSK10]. PARBASE-90 [RNT90]. Paris pairing [BP18]. pairing-friendly [BP18]. [LS89, Coh94]. Parities [Val15]. Park 48

[IEE84, IEE89, J´aj90]. PARLE [BRW93]. Pattern-Matching [KR81]. Patterns Parser [HC87]. parsing [Tai79]. Part [BH85, CLC06, HSPZ08, OTKH11, SK98, [ANS97, Bor81, ISO97, ISO04, MBBS12, BCGS16, BCCL10, KRML09]. pauco Sed83a, ADG+08, AMSM+09, KMV10, [DMPP06]. Pay [LHC05]. Pay-Word Wil03]. Part-Graph [MBBS12]. Partial [LHC05]. payment [LHC05]. PCA [BLY20]. [AU79, Bur75b, Bur76b, Bur76c, Bur78, PCPs [FS08]. PDE [GZ99]. PDEs [Gri98]. Bur79, Can97, CLD82, Chu90, CY06, Cor02, PDF [Con17]. Pebbled [Dev99, CM01]. Jag91, Lar80b, Lar80c, Lar82b, Lar82c, Peer Lar82d, Larxx, LKI10, Mor83a, PF88, [CCF04, JXY07, KLSY07, KS12, LMSM09, RLT83, RSD85, RSSD89a, RSSD89b, PFM+09, SM02, LMSM12, WHS+07]. RSSD90, RSSD92, TGGF10, YLZ20, YD86a, Peer-To-Peer [PFM+09, CCF04, JXY07, CC88a, Fal88, Hua85, Pri95, Riv74a, KS12, LMSM09, SM02, LMSM12, WHS+07]. SDR83b, SNW06, YD86b]. Partial-Domain Peers [RMB11]. Pennsylvania [Cor02]. Partial-Match [ACM76, LFP82, ACM96, HB93, IEE92b]. [AU79, Bur75b, Bur76b, Bur78, Bur79, Pentium [BGV96, Bosxx]. Peoples Jag91, RLT83, RSSD90, RSSD92, RSSD89a, [Ano83]. peptides [MIGA18]. Per-Flow RSSD89b, Hua85, Riv74a]. [NS16b, SL16, YGS+19, HKL04, LMP+08]. Partial-Relation [PF88]. Partially Perceptual [PCL93a, PCL93b]. particles [Lia95]. [DCM18, LC12, MV01, MV02, NS16a, Partition [LKI10, LC96, WZ12]. RGNMPM12, SB14, THY+18, WDP+12]. Partitioned [Ger86a, LR96a, NKT88, Perfect [AN96, AA79b, AA79a, Ari94, SW91, Ger86b, HKL07, MZK12]. BHIMM12, BBD+82, BBD+86, BS94b, partitioner [KKP+17]. Partitioning BS94a, BW98, Bla00, Bla95, BPZ07, BT90, [Bre91, Ged14, PFM+09, SBS16, WBWV16, BT94a, BT94b, BH86, Bur92, BC90, Cer81, ZRT91, vM39, CKKK09, CKKW00, EH17, CKB83b, CBK83, Cer85, CKB85, CBK85, HAK+16, Kim99, LL13, LWWK20, PCK95, Cer87, Cer88, CLD82, CS83a, Cha84b, SKD15, UHT95, AP11]. partitions Cha84c, CS85c, CS85b, Cha85, CS86, CL86, [DKRT15]. Partly [OTKH11]. PASCAL Cha86b, CC88b, CCJ91, CW91, CL05, [Dit76, Hil88, HS84, Dit76, GBY91, Hej89, CLC06, CT12, CJC+09, CRS83b, Cic80a, Sch76, TA81, TA86]. Paso [ACM97b]. Pass Cic80b, CO82b, CHK85, CKN18, CHM92a, [LMD+12, OGAB14, YDT83]. Passbits CHM92b, CM93, CHM97, Dat88, DKM+94, [MB03, Bur05]. Passed [Gra94b]. passive DH01, Die07, DJS80, DHJS83, Duc08, [RW07]. Password [ASBdS16, GAS+16, DM11, FM96, FCHD88, FCHD89, FCDH90, JK11, KV09, LSZ+21, WG00, BSNP96b, FCDH91, FCH92, FHCD92a, FK84, FH15, BDK16, CJMS19, GL06, KJS17, KCL03, Get01, GHK91a, GHK91b, HT01, JO80, Ku04, KCC05, NMX19, Par18]. Jae81, JD12, KH84, KM86, KM88a, KCB81, Password-Based [KV09, BSNP96b, GL06]. Kra82, KP94, LR85, LH06, LLLC17, Mai92, Pastry [Her07]. Patch [BI12, BZL+15]. MWCH92, MWHC96, Meh82, NRW90, PatchTable [BZL+15]. Path Nil94, OG94a, OG94b, Pag99, PV92, PG95]. [GO15, CVR14, CHL07, VNC07]. Paths Perfect [Kul84, AAB+92, VNC07]. Patricia [KS12]. [Pes96, RL89, RP91, Ram92, Rog19b, SB95, Pattern [iA94, BT94a, BT94b, CG79, Fre90, Sag84, Sag85a, Sch90a, SvEB84, Spr77, Gri79, IEE88d, KR81, TK07, CLS95, Tro92, Tro95, WX01, Win90b, Win90a, ISHY88, Kim99, Sch91a, ZO13, YIAS89]. Wol84, YDT83, YD84, YD85, AAB+92, 49

AG10, BJ07, BBPV11, BS94c, BT89, CKB81, LWXS18, Mit17]. Pert [Kul84]. Pertaining CKB83a, CK89, CL09b, CLS18, Cze98, [Wri83]. Perugia [De 95]. Peter [Ste18]. DF89, DKM+88, DKM+91, DHW08, FHC89, Petersburg [Vau06]. Peterson [Kno88]. FHCD92b, GS89, HK86, Han17, HM93, PGV [BRS02, BRSS10]. Phase JWM+18, Lia95, LC13, MvT08, Mil95, Mil98, [DHK+15, PACT09]. PHash [Shi17]. PhD Pag01, RB91, SB97, SS92, ST85, SH92, SH94, [HF13]. Phi [JHL+15]. Philadelphia SL88, Sil02b, TKI99, XMLC11, WC07]. [ACM89b, ACM89a, ACM96]. Phoenix Perfectly [CMR98]. Performance [ACM03b]. Photomosaic [US09]. PHP [ACM04, AP93, ANS09, BM89, BM90a, [GSL17]. Phrase [JD12]. Phylogenetic Bre91, Bur83c, CL85, CC87, CS87, Chr84, [BT12b]. Physical [BG80, Bat81, BG82, CH94, DGG+86, DR92, DadH92, DS97, DT91b, DGKK12, LSZ+21]. Picture Don91, ESRI14, FC87a, Fla81, Fla83a, Flo87, [BS94b, BS94c]. pilfered [Nic17]. pipe GD87, Gra88, Gra89, Gra93a, Gra93b, Gri74, [MPST16]. Pipeline [PRM16]. Pipelined Hac93, HSMB91, HC13, IEE94c, IG77, [CLYY92, He87, HCY94, MD05, MS88a, KS89a, Kha95, KK96, KTN92, Kue82b, RS92, YCRY93, ISHY88, LCRY93, RLM87, Kum90, Lar80c, Lar81, Lar82a, Lar82b, XLZC14]. pipelines [AS09, RKLC+11]. Lar85c, LCK11, LCLX19, LLL09, LMSF89, Pipelining [CLYY95]. Pittsburgh Lit84, Lit85, Lom88, LCM+20, LYD71, [LFP82, ACM04, IEE92b]. PKC’98 Lum73, Lyo83, MXL+12, Mac95, ML86, [HPC02, HKKK10]. PKC98-Hash ML94, MY79, Mil85, Mul85, NM02a, NP99, [HKKK10]. PKE [HLL18a, Zha07]. PKI Omi91, Pal92, PB80, Pro94, Ram89b, RZ97, [YY01]. Place [Dos78a, IEE84]. Placement RSSD90, RLH90, RLH91, Roe94, Roe95, [MEK+14, PRRR15, BPT10]. Plagiarism RT87b, SD85, SD89c, SD89a, Sch79b, SC90b, [CH12]. Plains [IEE88c]. plane [AII89]. SC90a, SC90c, She91, TNKT92, TMB02, Platform Tym96, Vit83, Yen91, YB95, BMQ98, BW89, [ADOAH19, LMD+12, LLL+16, Sun02, CAGM07, CF89b, HM03, Kou93, LLA15]. TCP+17, FNP09, MN99, QZD+18, ZLL+07]. performance [LY72, MRL+19, MA15, Platforms [AS16, NMX19]. Play [But17]. RFB97, SK20, SS89a, SD89d, Shi17, Sie89, playing [Zob70a, Zob70b]. PLILP [BW92]. MKL21, VBW94, Vit80a, WL07, WTN07, PLOP [KS88b, KS88c]. PLOP-Hashing XCCK09, Yu18, ZHW19]. Performances [KS88c, KS88b]. PLS [TGGF10]. PODS [Mek83]. Performed [Wil71]. Performing [HF13, ACM88a, ACM89a]. PODS’08 [FP89b]. Period [AC74, Eck74b]. [LL08]. PODS’10 [Van10]. PODS’13 Periodicity [HG77]. Permutation [DLH09, [HF13]. Point [BL89, TK17]. Pointer HSR+01, NIS15, PHG12, Sch01a, CFYT94, [LDM92, SC90b, SC90a, SC90c, SVCC01]. DLH13, HK95, KST99, LOZ12, LMPW15]. Pointer-Based Permutation-Based [SC90b, SC90a, SC90c, LDM92]. Points [NIS15, PHG12, KST99]. Permutations [AT93, Bat80, Bat82, AII89, AT90]. Poisson [ARH+18, JNPP14, MP12, Wee07, BK88]. [Pob86, PVM94]. Poland [ACJT07, Win78]. persistence [NT01]. Persistent policies [Jan05]. Policy [GGY+19, DG96]. [HCW+21, KM92, LHWL21, Ros21, ZHW19, Politecnica [CTC90]. Polling [LXL+19]. CCA+12, LHWL20]. person [WWG+18]. Polling-Based [LXL+19]. Poly [DSS17]. Personal [Rad83]. Personalized polylog [DLM07]. Polynomial [WYD+18]. Perspective [DGMP92, FS82, Saa12, Sag85a, San76, [ACM85a, CSSP15, Ros21, Wil00, Zuk21, WSSO12, Win90b, Bis12, GPGO16, Kak83]. 50

Polynomial-Advantage [WSSO12]. Prefixes [PT11b]. Preimage Polynomials [DY08, OS10, Sar11]. PolyR [ABD+16, HKKK10, Li10, Sas11, WW09, [KR01]. Pools [Woo89]. POPL [ACM91a]. WS13, WFW+12, ZWW+12, MS13]. Popular [CLNY06, RR08]. Portable preliminary [CMR98]. preparing [Hek89, NADY20]. Portland [ACM91b]. Preprocessing [KR01]. [ACM85b, CLM89, IEE85a, IEE93]. Presence [RK91, WDYT91]. Presented Portugal [CIM+05]. positives [CVR14]. [ACM75c, ACM76, ACM77b, LFP82, Post DBGV93, ACM79, ACM91d]. preservation [BBD09b, MKAA17, SE21, BBD09b, BD08]. [DL06]. Preserve Post-Quantum [Knu77, RS12, Vit81b, Vit82a]. Preserving [BBD09b, MKAA17, SE21, BD08, BBD09b]. [ADOAH19, BR06, BJL16, BHKN13, Postal [Dos78a]. poster [ZL12]. BHKN19, CK12, CK15, Chi91, Chi93, Chi94, Postortsnamen [Dos78a]. Postprocessing DHL+94, DHL+02, FL08, FCDH90, [RJK79]. Pour [Kar82]. Power FCDH91, GG86a, GZX14, HB92, HSW88, [Dun89a, FP10, HD72, MK11, MMMT09, LQH18, Oto88a, Rob86, SHZ+20, Tam81, PT12a, PGV90b, ACP10, Ano93c, DKRT16, ZZLZ21, D+92, IMRV97, Ouk83, QZD+18, GP08, KM10, PT11a, PGV93g, Sch82b]. RW07, SG72, Zha19a]. pretty [Tho00]. powerful [Tho17]. PQCrypto [BD08]. Prevention [JLH08]. PRF [AB12]. Pracniques [Dod82]. Practical primary [ML94]. Prime [AS82, AB17, AG18, BR97, BHH+15, CHK85, [Bat75, HM12, Mue04, OG94a, WS03, Lar84]. DNSS92, DDS14, EMM07, FHCD92b, GIS05, Primes [Die96, ACP10]. Primitive GLLL17, HM96, IP11, LT09, Ram89b, ZZ83, [Kil01, Mue04]. Primitives Con17, JG95, LWXS18, Sil02b, SXLL08]. [LYDA19, MP16, RAL07]. Principal Practicality [TT82]. Practice [Cha88, MW09, SA97, US09]. Principle [KGJØ18, Mir17, Ram88b, BBPV11, RZ97, [Dam90b, FDL86, Gib90]. Principles Sta06b, Tso15, KKP92]. Practitioner [ACM82, ACM83a, ACM83b, ACM85b, [SD76]. PRAM [GM91, KLadH93, KLM96, ACM86a, ACM87, ACM88a, ACM89b, Kel93, Kel96, Lep98]. Pramanik [Pro94]. ACM89a, ACM91d, ACM91a, DK02, DK15, Pre [Mit12]. Pre-image [Mit12]. PRECI Van10, HF13, LL08, Pre94a, Ull82, Wal88, [BD82, DNV81]. precise [Ati20, DK12]. Zhe90, KKP92, Sta06b]. Print [Cip93]. Precision [LOON01].¨ Precomputation Priority [AFK83, AFK84, RT87b, GJM02]. [AS16]. Predecessor [KS12]. Predicate Privacy [ADOAH19, Ano95d, BJL16, [Han90, HCKW90, VV84]. Predicates BBR88, GZX14, ZXL19, Cho21, QZD+18]. [RS92]. Predictability [LBJ02]. Privacy-Preserving Prediction [TW07, DFMR15]. Predictive [ADOAH19, BJL16, GZX14, QZD+18]. [DCW91, RT87a]. Predictors Private [PSZ18]. Probabilistic [DGD02, NI83, TT86]. predistribution [Bla00, BK07b, Fla83b, FM85, Pit87, Sch91a, [LND08, SN19]. Preemptible Tsa96, WVT90, Yao83, CMR98, SD95]. [PCL93a, PCL93b]. Preferential [VNC07]. Probabilities prefetch [TKH20]. prefetching [CAGM07]. [Ald88, PRK98, vM39, Ald87]. Probability Prefix [CLNY06, BGKZ12, BLC12, DKT06, [Fel50, Gon80, LL83, NY85, Ram88a, ZZLZ21, PT10b, PT12b, RRS07, RW07]. MV91a, NN90, Nil94, Ram87, Sar11]. Probe prefix-compressed [BLC12]. Prefix-Free [AA79b, AA79a, Gon81, OT91, Spr77, [CLNY06]. prefix-preserving [RW07]. LJW+17, Mil99, Pag01, SS88a, SS90b, Sun93]. 51

Probes [Lyo85, Ros06, Ros07]. Probing Mat09, MK89, MV91c, MS05, Nav85, Oxb86, [Ald88, BBS90, Cle84, FPV98, JV16, Knu98, Pat90, PK89, QV89, RRR99, RK89, Rov90, Lar85b, Lyo78a, MY80, PPR09, PT16, Rue93, ACM77a, SZ93, Shm00, SW94b, Pet13, PK87, PVM97, PV19, SL16, TZ12, SC77, Sti93, Sti94c, Sto92, USE91, USE00a, VP96, VP98, Ald87, Jan05, LJW+17, USE00b, Vau06, Vid90, WPY90, lWSS91, PPR07, PT10a, Ram89a, Vio05]. Problem Yan10, Yun02, AGK+10, AFK90, ACJT07, [DSS17, DM90, GB10, HP63, Hop68b, Mit73, Bel00, BJZ94, Boy95b, Bra90, BW92, NAK+15, Val15, BC06, DHKP97, HCF95, CIM+05, CP88, Cop95b, Dam90a, Dam91, LP04, Loh89, Mon19, Sun91, Sun93]. DJRZ06, DJNR09, FS09, Gol96, HM08, problem-based [BC06]. Problems adHMR93, HKNW07, IEE11a, JBJ94, Kil05]. [DJRZ06, FHMU85, Yub82, ZO93, AMP15, proceedings [Lut88, QV90, QG95, Rei88, CP95a, CO82a, JWM+18, WZ12]. SP90, Sho05, SM08, Wie99, vL94]. Proceedings Proceedings/Ninth [ICD93]. [ACM84a, ACM88a, ACM89a, ACM91a, Proceedings/Seventh [ICD91]. ACM94b, ACM04, ACM12, Ano85a, ODB89, Proceedings/Third [ICD87]. Process AW89, Bar83, BV89, BRW93, BL88, CRS83a, [FS82, Pro94]. Processes [WB90]. CGO86, DSS84, Gil77, Got83, ICD87, CTC90, Processing [APV07, BG92, CCW+17, IEE02, Jáj90, Jou85, KLT92, Lak96, LCK11, Dan13, Eld84, GST90, Ger86a, Ger86b, Lev95, LSC91, Ros74, WGM88, YR87, Gil77, GSL17, Gra92, Gra94c, HB93, Har85, Yua92, vdHvH12, ACM81, ACM91b, ACM07, HCJC06, IABV15, KMV10, LLLC17, LC96, ACM08b, ADG+08, AMSM+09, Ano83, MK89, MS88a, Omi89b, PAPV08, Pip94, AA86, Deb03, Fis87, Van10, HL91, HF13, PK89, RK89, Sac86, Sch90b, SD90b, SD90a, IEE01, Jen76, Mo92b, SM12, USE90, Win78, Sha86, Sol93, SPB88, Spe92, Tha88, Toy86, Wol93b, ACM94d, ??69, ACM75a, ACM79, WPY90, lWSS91, YkWY83, BZZ12, Bra88, ACM82, ACM83a, ACM83b, ACM84b, CP95a, CKKW00, Ged14, GC90, HLH13, ACM85b, ACM85a, ACM86b, ACM86a, Kan91, Kan93, LLC89, RAD15, Ros74, ACM87, ACM88b, ACM89b, IJW89, Sab94, SK88, SP89, WLLG08, YMI89, Yu92]. ACM89c, SDA90, ACM90, PDI91, SDA91, Processor [Adi88, KL87, SM87, YCRY93, ACM91e, ACM96, ACM97a, ACM97b, ISH+91, LCRY93, TLLL07, YNW+09]. ACM98, ACM01, ACM02, ACM03a, ACM05, Processors [Pap94, Ros06, Ros07, Wil59, ACM08a, ACM11, AFI63, ABB93, ABM06, JHL+15, KL08, KW94, TLLL09, YIAS89]. AH03, Ano92, AAC+01, A+90, AiNOW11, Producing [DV07, RVPV02, Win83]. AOV+99, BD88, BDS88, BIP92, BF89, Bor81, Product [Du86, YGC+12, OS14]. Bri92, Bri93, BD08, BJ93, CP87, CLM89]. Productive [Bor81]. Profile [SSU+13]. Proceedings Profile-guided [SSU+13]. profiling [Col93, CHK06, Dav91, DT87, DSZ07a, [VNC07]. Program [Hil88, Kru84, Mai83, DSZ07b, EF12, Fei91, FMA02, Fra04, Fre90, Mai92, Meh82, SS80, BZZ12]. GMJ90, Gol94, GSW98, HB93, Hel94, Programmable IEE80a, IEE85b, ICD88, ICD90, IEE90, [HM12, HK12b, CFN18, LT12]. IEE91b, IEE91a, ICD91, IEE92b, IEE92a, Programmer [Cro98]. ICD93, IEE93, IEE94c, IEE95, IEE01, Programmiersprache [Dit76]. IEE05, IEE07, IEE10, IEE11b, IEE13, Programming IRM93, Joy03, Kar98, Ker75, Kna89, Kui92, [LFP82, ACM91d, dBvL80, BM87, BGS96, LC06, Las87, LL08, LT85, LS89, Lom93, Dit76, Dun89a, Ers58a, Ers58b, GG86b, 52

Har71b, Har73, IEE84, Jou85, Knu73, [CT12, MD97, HC02]. Pseudo Knu75, Kui92, LII92, Mau68, NS82, Pat90, [DW83a, FLF11, WFW+12, dW83b, Ruc15, SSS05, dKC94, ACM91a, AGK+10, MFK+06, PVCQ08, TSY98, WS13]. ADG+08, ALS10, AMSM+09, ACJT07, Pseudo-Associative [DW83a, dW83b]. BW92, CIM+05, DLH+79, Er86, Sab94, pseudo-collision [WS13]. pseudo-random TMW10, YIAS89, BW92, Las87]. Programs [MFK+06]. pseudo-randomness [AR16, Hea72, PAKR93, SS88b, Ers58b, [PVCQ08]. Pseudo-structural [FLF11]. FDL86, MP90, NMS+08]. Progress Pseudochaining [HP78]. pseudoentropy [Wol93b, Wol93a]. progressive [XMLC11]. [VZ12]. Pseudorandom [BK12, NAK+15, Progressively [DVS+14]. Project OS10, SP91, Aam03, CP13, VZ12]. PUB [DGS+90b, DGS+90a, Tro92, NM02b]. [Nat95, FIP93, NIS93]. Public Projecting [AT93, AT90]. Projection [ANS97, ANS05, BBR88, CLP13, Cip93, [Bur78, SPW90, AS89]. Projective CS02, Dam87, HR04, LYX+19, LRY+15, [ACP09, HK12a, KV09, Wee12, FH15]. NTY12, ZCZQ19, CFN18, LW17, Oka88]. PROLOG [CJ86, Bor84, Coh84]. Proof Public-Coin [CLP13]. Public-Key [Ano09b, CZLC12a, CZLC14, Cor02, [CS02, NTY12, Oka88]. Publication LYY+18, LYX+19, LT12, SDW14, ZZM17, [Nat92]. publish [MJ14]. DLM07, HLL18a, ZCZQ19, ZYWM20]. publish/subscribe [MJ14]. Puerto proofing [CHL07]. Proofs [IEE91b]. purely [SV18]. Purpose [CZLC12b, CS02, KK12, KK18, NTY12, [Chi91, Chi94, Sch91a]. Put [WLC20]. WG00, Wee11, Li10]. Propagation putting [Col93]. pyramid [MHT+13]. [DSSW90a, CML+13, DSSW90b]. Properties [Bal05, Bol79, CS83b, CLC92, QC [JY14]. Quadratic Lit85, RS12, TS85, WS76, ZMI91, GW94]. [Ack74, AC74, Bat75, Bel70, Bel72, Bel83, Property [BR06, DGKK12, FLP14, Rja12, BI87, Bur75a, Day70, Eck74b, HD72, Lam70, SRY99, Ter87, FL08, FLP08]. proposal Rad70, NH74, Pri95]. quadratischen [LLJ15]. Proposed [CP91c, HPC02]. [BI87]. Quality [THY+18, YWH09, GW94]. protected [AGBR19]. Protecting quality-size [GW94]. Quantification [LMJC07]. Protection [GC95]. Quantile [KS87b, KS89b]. [DF01, DGKK12, SP21]. Protein Quantitative [Hea82]. quantities [Bee83]. [LLW10, ZLY+12]. Protein-Protein Quantization [YWH09, YGC+12]. [ZLY+12]. Protocol [Ano95a, BT12a, Quantum [BBD09b, BHT97, BHT98, Dam93, GI12, HMNB07, HCPLSB12, MKAA17, SE21, BD08, BBD09b]. Quark HLC10, JRPK07, JK11, OVY94b, TY03, [AHMNP12, AHMNP13]. Quasi YLSZ19, CJP15, Dam94, GB17, LW04, [Cze98, LLW10, MD05]. Quasi-Bicliques OVY94a, SPLHCB14, CJP12, JL14]. [LLW10]. Quasi-perfect [Cze98]. Protocols [LLL09, SDK91, KLL+97]. Quasi-Pipelined [MD05]. Quaternary Provable [ANS09]. Provably [KP96]. Québec [ACM02]. Queensland [BCGS16, DY90, DY91, HM96, JP07, LM95, [SZ93]. Queries [APV07, Bur75b, CLD82, Sho96, IN89, SXL16]. Provably-Secure Cha84a, CHY97, DHL+94, DHL+02, GST90, [DY90, DY91, HM96]. Provide [Sch01b]. GYW+19, KS12, LCML94, LOY00, LLG+17, Providence [IEE07]. Proving LB07, ML86, MPP14, PAPV08, PF88, [Kil01, WS76]. proxies [TC04]. Proximity SD90b, SD90a, SW91, Sol93, Stu85, BZL+15, [MPP14, SX08]. Proxy [ZJ09]. Pruning DH84, Fal88, HYKS08, HAKM15, HAK+16, 53

HR93, HF91, Hua85, LL13, MBKS07, [GK12a]. Randomized SWQ+14, TL93, Wil78, Wil85a]. Query [AEP18, KR81, LQZH14, Mat93, YWH09, [ODB89, BG92, FB87, Ger86a, Ger86b, DHKP97, MSS96]. randomly [RH90]. Gra92, Gra93c, Gra94c, HLC10, HFZ+15, Randomness [AY14, Knu77, Vit81b, LW17, HFF+17, Kie85, Kim80, LC96, MS88a, PVCQ08, Sar15, SS90a, Vit82a]. Range Sac86, SD89b, Sch90b, Spe92, TS85, Toy86, [ACM85a, LCML94, LB07, CCL91, Fal88, CCY91, CKKW00, DSD95, GMP95, HR93, Wil85a]. Rank [TC93]. Ranking LYJ+13, LMLC14, Loh89, RAD15, SP89, [LR96a]. RANs [SZO+20]. RANSAC WLLG08, YLC+09, Yu92]. query-adaptive [FWG18]. Rapid [CG79, Dum56, Gri79, [LYJ+13]. Query-aware LG96, PT11b, WKO78]. Rapidly [Dav73]. [HFZ+15, HFF+17]. Querying Rate [CJKK19, IABV15, KL95, HKL04]. [CN07, LOON01,¨ TT10, AK09, NDMR08]. Raton [HB93]. raw [CXLK19]. Ray Questions [Mit09]. Queue [ACM82, SS89b, ZRL+08]. RBIBDs [KV91, MV88, KM07]. queueing [MSV87]. [Woe06a]. RC4 [IP08, RS14, Sar15, YZ16]. Queues [AFK83, AFK84, Woo89, GJM02]. RC4-Hash [IP08]. RC4-like [RS14]. quick [FDL86]. QuikFind [Cha91]. RC4A [Sar15]. Rdbm [Pei82, Pet83]. Quotient Rdbm-verwaltungsdaten [Pei82]. RDF [BK70, Bel70, Bel72, Bel83, Bur75a, Lam70]. [AOD19,¨ HAKM15, LL13]. RDMA [CCW+17]. re [Par18, WWG+18]. r [KKT91, LJF19, WYW14]. R* [ML86]. re-identification [WWG+18]. r-th [KKT91]. Rabin [FH79, GBY90]. race re-registration [Par18]. Reactive [BT12a]. [Hil05]. radio [CJP12, CJP15]. Read [MT11, NM10]. Read-Only radio-frequency [CJP12, CJP15]. [MT11, NM10]. Reading [LYDA19]. RadioGatún [BDPV06, BDPV09, BF08]. Readings [Sto88]. Real Radisson [ACM85a]. Radix [ASA+09, Ano96, DadH90, Dre17c, FVS12, [FB87, Lin63, SKD15]. Radon LHWL21, Lyo83, Man12, NS16b, PSSC17, [GH07, RGNMPM12]. Ragged [Ros77]. Ros21, ZRL+08, AY14]. Real-Time RAM [PSR90]. RAMA [MK93]. [Lyo83, NS16b, PSSC17, ASA+09, FVS12, Ramanujan [SV06]. RANDOM [DJRZ06, Man12, ZRL+08, AY14]. Realizing DJNR09, AD85, Ano86, BH90, BM76, [Can97, PBDD95, Rul93]. Reallocation BBS90, Can97, Cha84a, Cla77, Dev99, Die96, [Bay73c]. Reasoning [BJM14]. Dum56, EAA+16, FP10, FMM09, FMM11, Reassignment [DDMM05]. Rebound GHR99, Gui89, HSR+01, JTOT09, KLSY07, [KNR10, MRST10]. Rechenanlage [Dit76]. KM88b, LT12, MY79, Mil95, MEK+14, Reciprocal [CS85a, Cha86a, Jae81]. ORX90, Ols69, Ore83, Pet57, PV19, Sie04, Recognition [BM90b, CFP19, Fre90, GK94, Tra63, Yao91, de 69, BR75, BK07a, BK88, GK95, IEE88d, KG95, KR79, KRJ+80, CM01, DW03, FP82, GW94, HC11, JCC00, KRRH84, LW88, PW94, SSaS01,ˇ SR89, KLL+97, Kut06, Lin63, MYS12, MFK+06, SA97, WPKK94, Fly92, GG92, LG96]. Ram89a, TSY98, WL07, ZGG05]. Recognized [RJK79]. Recommendation Random-Access [MY79, Pet57, Tra63]. [BK07a, WYD+18, QZD+18]. Random-Walk [FMM09, FMM11]. Reconfigurable [PJBM90]. Randomization Reconstruction [BT12b, Tv83, Ven84]. [GSB94, DJRZ06, DJNR09]. Randomize Record [ACM75c, ACM76, ACM77b, [GK12a]. Randomize-Hash-then-Sign LFP82, KS86, KS87a, KS87b, ACM91d]. 54

Records [Bra84a, Bra85, Bra86, MF92, AS89, EBD91, ISH+91, KR88, SP89]. Ols69, Rém92, SD78, DSS10]. Recovering Relationalen [Nee79, Pet83]. Relations [JCK+18]. Recovery [KHT89, NP91, SW91, PCK95, UHT95]. [AS82, CY06, Moh90, Moh93]. recreations relationship [LMSF89]. relationships [BC39]. Recurrence [MC89]. recursion [LC13]. Relative [GB17]. relatively [FF90]. Recursive [HF91]. relativistic [TMW10]. RelaxDHT [Coh97, DM81, Gra93b, RSD84, RSD85, [LMSM12]. Reliability [MS12, CZ14]. RS92, SDMS12, SDMS15, ATAKS07, CL09b]. Reliable [BH91, DGMP92, MKASJ18, Recyclable [NS16b]. Redesigning [AZ10]. RHM09, DHKP97, ZLL+07, ZC12]. REDOC [BS91c]. REDOC-II [BS91c]. Reliably [TCP+17]. relieving [KLL+97]. Reduce [CKW09]. Reduced Remaps [CRR18]. Remark [AD11, BM97, BCJ15, DDS14, HSR+01, [MRW89, Eck74a]. Remote HKKK10, KNR10, MRST10, MNS12, [LC95, YY07, HL12, LLH02]. Removal THY+18, WFW+12, ZWW+12, AKY13, [Leb87]. Rendering [War86, ZRL+08]. CV05, ITP14, MS13, WS13]. Rendezvous [EH17]. Reorganisation Reduced-Reference [THY+18]. [Bat80]. Reorganization Reduced-Round [AD11, CV05, ITP14]. [Bat82, Reg82, Szy82, Szy85, SI09]. Reducing [Bre73, CJKK19, Dod82, DSD95, Reorganizing [JCK+18]. Repair Kab87, Mal77, NI83]. Reduction [Bar97, CJKK19, BRM10]. Repairing [Bla95, Ken73, LT12, MT16, PL21]. [ZJ09]. Repeated [Lar80a]. Repetitions Reduction-Centric [LT12]. Reductions [YGC+12]. Replacement [Jak85, JCK+18]. [BHKN13, BHKN19]. Reducts [Wan14]. replay [BRM10]. Replica Reduits [Kar82]. Redundancy [CCF04, LRY+15]. Replicated [SDZ21]. [Bur79, CJKK19, CQW08, FES09, MSS96]. Replication [HNKO20, LMSM09, LMSM12, Redundant UIY10, WY02]. replication-based [UIY10]. [KR79, KRJ+80, RJK79, Som99]. Report [jCPB+12, MO92a, TSP+11]. Reference [THY+18]. refined [DVS+14]. reporting [YG10]. Repository [XNS+13]. refinement [CKW93, ZDI+15]. Refresh Represent [Rém92]. Representation [CJKK19]. Region [FB87, OSR10, KHH89]. [ANS10, CD84b, DCW91, BL89, BT93, Regions [JCK+18]. Registration JCC00, MHT+13, TK17]. Representations [GPA97, JBWK11, Par18]. Regression [DHT+19, KKC12, SD89b, CRS83b, [OGAB14, TGGF10]. Regular CFYT94]. representing [LK93]. reprinted [CKW09, CH94, IIL17, MSP12]. [LT80]. Reprogramming [PLKS07]. Regularized [TGGF10]. Rehashable Republic [Ano83, HL91]. Reputable [LBJ02]. Rehashed [Bin96, Kno88]. [RMB11]. Requests [LLL+16]. Required Rehashing [Kel93, Kel96, Mad80]. [PT16, PT10a]. Requirements reinforcement [SZO+20]. Related [BD92, NSW09]. Rescue [YY01]. Research [Eck74b, Mit09, BSU12, GJM02]. Relation [BV89, BIP92, IEE89, cLmL07, Rad70, [Knu74, PF88, de 69, GC90, MC89]. SVCC01, Vid90, Wol93b, CE95, Wol93a, Relational Yu92, YR87]. Researcher [GCMG15]. [Bab79, Bra84b, FP89b, Fro82, Gra88, Researchers [Con17]. Reserved Gra89, He87, Heu87, IH83, KR86b, KR86a, [ST86, Tro06, Wol84, Zou85, ST85]. KP81, Kim80, KTMO83b, KTMo83c, Residue [Ari68, KKT91, Mue04, Rad70]. MS88a, PF88, Wu85, Yam85, YNKM89, Resilience [NTY12]. Resilient 55

[ASWD18, BGS96, LMSM09, WTN09, LLG+17, LXL+19, LCL+20, SPLHCB14]. ZZM17, LMSM12]. Resistance RFIDs [LYDA19]. Rhode [IEE07]. [Mit12, BF08, MSP12]. Resistant Rhodes [AMSM+09]. Rich [GYW+19]. [BR97, BK12, CHKO08, IKO05, PGV90b, Richelot [CDS20]. Rico [IEE91b]. riding CHKO12, KHK12, PGV91, PGV93g, MS09]. [BB07]. riding-aware [BB07]. Right resisting [SXL16]. Resizable [Boy98]. [CLYY92, CLYY95]. Right-Deep resizing [ZHW19]. Resolution [CLYY92, CLYY95]. rigid [SA97]. [Ask05, CadHS00, MC86, YB95, KdlT89]. Rigorous [GLLL17]. RIMS [Got83]. Resort [PDI91, IEE88b]. Resource Rinda [ISH+91]. Ring [DB12, HM19, TL93]. response [DSD95]. [DSGKS20, GGY+19, OL89, TY91]. Responsible [IH83]. Responsive Ring-Based [GGY+19]. Rings [HJ96]. [DG93, DG94]. Responsiveness RIPEMD [BDP97, LP16, MNS12, PBD97, [BDS88, Sch82a]. Restart [LACJ18]. WFLY04, WW09]. RIPEMD-128 Restklassenhash [Eck74a]. Results [LP16, MNS12]. RIPEMD-160 [ANS09, Bur83c, DR06, DRS12, Jv86, RR08, [BDP97, PBD97]. ripple [LEHN02]. risks CV05, LY72]. RETCON [BRM10]. [DS09b]. RITS [GB17]. RKA [HLL18a]. Retention [CJKK19, ZLL+07]. Retrieval RNA [BDD+10]. Road [BDPV09, HR04]. [AU79, ANT85, BV89, BIP92, BI12, Bre73, Robin Bur76b, Bur76c, Bur77, Cha84a, CJN20, [CLM85, Cel86, CLM86, DMV04, PV19]. CJP12, CF89b, Chu90, DS84b, DP08, Robust [BFMP11, CJN20, FLP08, FLP14, DHT+19, DSSW90a, DGM89, FH69, KMW08, KMW10, KO90, Li15, LDY+16, FCDH90, FCDH91, FBY92, GPY94b, Irbxx, MMG10, MV01, MV02, OCDG11, TLZL16, Kab87, Kno71, LK84, Lar88b, LQH18, WDP+12, CWC10, EAA+16, YCJ12]. Mal77, MH00, Mor83a, NI83, OT91, RLT83, Rockefeller [IEE90]. Roma [AAC+01]. RSD85, RSSD89a, RSSD89b, RSSD90, Roman [Hol87]. Rome RSSD92, Riv74b, RT87b, SHZ+20, TS85, [AA86, IEE88d, Wol93b, Wol93a]. Root Vid90, WH83, Wil79, WKO78, YDT83, [LAKW07, TLLL07]. root-hashing YWH09, YR87, YTJ06, YD86a, ZWH17, [TLLL07]. Roots [Mue04]. rotate [FJ13]. ZZLZ21, ZLC+20, Bur76a, CCL91, CJP15, Rotated [US09]. Rotation DSSW90b, Gob75, GPY94a, LYJ+13, ML94, [Bla95, PQ98, PQ99]. RT89, Riv74a, SDR83b, WC94, YD86b, Rotation-Symmetric [PQ98, PQ99]. Zha19a, ZZLZ18]. retrieve [SG72]. Rotational [KNR10]. Rotationally Retrieving [AA79b, AA79a, Spr77]. [HSPZ08]. Round Return [Wil96]. Reusing [ZHS94]. [AD11, jCPB+12, DDS14, HSR+01, LP15, Reversible [DR11, SLC+07]. Revised PT11b, GLM+10, SY11, TSP+11, WFW+12, [SZO+20, Ytr06, BK07a, Bir07, JY14]. ABM+12, CV05, ITP14]. Round-Down Revisited [PT11b]. Round-Reduced [AHS92, BYSP98, CDMP05, FLP08, GLS91, [DDS14, WFW+12]. Rounds GLS94, HR96, HK87, KK12, KK18, KVK12, [GK08, HSIR02, Sch11]. Route AN20, BATO13,¨ Ham02, KKL+09, LP04]. [ABC+16, DF01, BLC12, YG10]. Router Revisiting [DHK+15, HLH13, Yu18]. [JL14, KLSV12]. routers Revocation [Wee11, MFES04]. Reykjavik [ATAKS07, PT12b, TKH20]. Routine [ADG+08]. RFID [CJP15, CJP12, FW09, [Hea82]. Routing [ABC+16, BT12a, GI12, GLLL17, HCPLSB12, JRPK07, LLL09, WBWV16, Cha12, HLL18b, PT10b, SPSP16, 56

TC04, TBC+05, WY02]. routing-based Scale-Invariant [NS16a]. Scaling [WY02]. rows [CDH19, FH15]. RSA [AK09, LL13, LHWL21, Ros21, TCP+17, [Joy03, Ano95a, Jun87]. Rule FHL+19, PES+12, YSL05]. SCALLA [BG92, Han90, HCKW90]. Rule-Based [LMD+12]. scanner [ISHY88]. Scanning [BG92]. rulebase [CKKK09]. Rules [Bur81, LLL11]. Scatter [CL05, CT12, PCY95, HC02, HC07]. [Ban77, BMB68, Bre73, Day70, FL73, FW76, runtime [OOK+10]. Russia [Vau06]. Ryu FW77, Luc72, Lyo78b, Mal77, Mau83, [KCC05]. Mor68, Mor83b, Mau68]. Scenes [War86]. Schanuel [KPS92]. schedules [GK12b]. s [PES+12, BLC12]. S. [Pro94]. S81 Scheduling [Lyo79, TL93]. Scheme [KTN92]. SAC [JY14, HSR+01]. safe [AK98, Alb21, BP97, Bur84, CLD82, [CCA+12, LPSW03, Lin96]. SAGA Cha84b, Cha84c, Cha85, CL86, Cha86a, [HKNW07]. Saint [GQ95, QG95]. Cha86b, CC88b, CCJ91, CW91, CGLC20, Saint-Malo [GQ95, QG95]. saliency Dat88, DJS80, DHJS83, Fah80, Hül13, [FXWW17]. same [Con17]. SAMOSA JLH08, KJC11, LW88, Lar88b, LHC05, [PHG12]. Sampler [Mil87]. Samplers LSZ+21, NXB13, Oto85a, Oto85b, PPS21, [CJ19]. samples [HYKS08]. Sampling PVM94, PACT09, SGGB00, SHF+17, TC93, [AD85, Jak85, WM19, BZZ12, CyWM91, VV84, Vit81a, YSW+11, YY07, ZJ09, ORX90, RKLC+11, ZGG05]. San ZQSH12, ZH18, Bur82, CBB05, CW93, [ACM75b, ACM91b, ACM03a, ACM07, CKW93, CP95b, Cho21, DF89, EAA+16, ACM08a, ACM11, Ano10, DT87, IEE88a, HL12, HL03, HFF+17, KCL03, Ku04, IEE91b, Joy03, Kar98, Shm00, Sto92, USE90]. KCC05, LLH02, LKY04, LWG11, MSZ+20, Sandwich [Yas07]. Santa [Bel00, Bri92, MMG10, Oka88, SDR83b, Tsa08, WZ12, Bri93, CRS83a, Cop95a, Cop95b, Fra04, YRY04, YG10, ZW05, ZC12, FF90]. Gol94, Sho05, Sti93, Sti94c, Wie99, Yun02]. Schemes [BDS09, CL05, CLC06, Cor02, Santiago [BJZ94]. SAP [SFA+19]. sat Dam87, DSS17, ED88, HM96, HDCM09, [DK07, MS13]. SAT-based [MS13]. HHL10, Jai89, Jai92a, Jai92b, Jaixx, Kal01, Satzuebergreifende [Nee79]. says [Nic17]. KM09, LM95, LRY78, LRY80, MY80, SC’11 [LCK11]. SC2002 [IEE02]. SC2003 MKASJ18, Ngu06, Ouk83, PWY+13, PF88, [ACM03b]. Scalability RL82, RS77, SDR83a, TL95, CJMS19, [DR92, Eng94, TCP+17, ATAKS07]. CQW08, DH84, GS94, HDCM11, HSMB91, Scalable IN89, KK96, KM10, ML94, NMX19, OS88, [CKKK09, DPH08, GLJ11, Gre21, IEE94c, RS75, SNW06, ZHS94]. LMD+12, MZL+19, MD97, MVB+21, Schluesselwoertern [Dos78a]. Schnellen MEK+14, PRRR15, PSZ18, PW94, SSL+18, [Kue84a]. Schnorr [DBGV93, NSW09]. Sci SKC07, SWTX18, TMW10, WPKK94, [Sar80]. Science [ACM91b, AH03, Bar83, WSZ+16, YLZ20, ZLC+20, CLL+14, Gol94, Got83, IEE76, IEE80b, IEE82, KKP+17, KYS05, KSC11, KSC12, LNS96, IEE85a, IEE88c, IEE89, IEE91b, IEE92b, LHWL20, LEHN02, NK16, PT12b, SB14, IEE99, IEE06, IEE07, IEE10, IEE11b, SE21, TLLL09, VBW94, KCR11, NTW09]. IEE13, Knu74, Kon10, LC86b, LL83, Scale [BI12, GGY+19, GLLL17, Li15, RRR99, Rie89, Rov90, Wal88, WGM88, MEK+14, MWC12, NS16a, SHF+17, Wil85b, Win78, TWW77, vL94, AT18]. YGC+12, ZZLZ21, CML+13, FES09, Kos14, science/3rd [TWW77]. Sciences [SC77]. Shi17, SXLL08, Zha19a, ZNPM16]. scientific [Fis87]. Scope [CL83, GJR79]. 57 scoped [FF90]. Scopus [AT18]. scoring MKAA17, NIS93, Nat95, NR12, PLKS07, [NADY20]. Scotland [AOV+99]. PV07, PGV92, Rei03, RSK17, SK99, Sho96, Scratchpad [vdBGLGL+16]. SDC [KO90]. Sta06a, Win84, XHZ+19, Yas07, YY07, SE [Sun02, HLL18a]. Sealed [SKM01]. Zhe90, ZHZ+19, Aam03, FFGL10, GM18, Sealed-Bid [SKM01]. Search GBL94, HLL18a, IN89, JFDF09, Sim98, [Ack74, iA91, Ban77, BM76, Boo74, Bra84a, SXL16, YRY04, ZC12, ANS97, Ano02, Bra85, Bra86, Cer81, CKB83b, CKB85, Ano08, Ano12, Bou12, FIP02b, Nat92, Sta94]. Cha91, CLP17, CS82, Eck74b, GIM99, Security [AK98, Abi12, And94, ASBdS16, HWZP18, HH85, KCB81, Kra82, Kut10, CLNY06, CN08, Cor00, Cor02, FW09, LL85, Luc72, MD97, MW09, Mue04, GK12a, HMNB07, HLMW93, HXMW94, NSS+06, Pal92, PACT09, Reg81, RSK17, ISO97, ISO04, KK12, KK18, Kil01, LC06, SD78, San76, Sev74, SG88, SSL+18, Tam85, LT12, LLL09, MP12, Men12, NAK+15, TYZO15, TKI99, Ven86, Vit83, WYY05d, PW06, RS12, SK20, SM02, WG00, WPS+12, WWZ09, WSZ+16, XNS+13, YSW+11, Yan10, ZXL19, ACM94a, ACP10, ABM+12, ZLC+12, vW94, AP92, BC06, CKB83a, AMP15, Ano93a, AGBR19, BGKZ12, Kak83, CK89, CLL+14, FP82, GP08, HFZ+15, Lai92, LC95, Men17, MPST16, PGV93c, KJS17, Kor08, KW94, Lin96, LCH+14, SF88, Sta06b, UPV11]. Seed [PNPC20]. LWWK20, MKSiA98, MT16, NM02b, NH74, Segmented [CLYY92, CLYY95]. Segments PY88, Rön07, SP12, STS+13, TYSK10, [Bor84]. Sekundaerspeichers [Pet83]. MKL21, WYY05a, WZ93, ZWT+14, select [FNY92]. selectable ZLC+18, ZHC+13, ZNPM16, WWZ09]. [BSNP96c, Gon95, Li95]. Selected Searches [LL87, Lyo85, GJM02, KHH89]. [SC77, Ytr06, Bir07, Bor81, JY14, JY14]. Searching [Bay74, BS97, Bur75a, CL85, Selecting [MHB90, Sou92]. Selection CS82, Dav73, Day70, Dos78b, Fla81, FS82, [DC81, FFGOG07, Hea82, MS12, OGAB14, Fla83a, Flo87, Gon81, Gon83, Knu73, Knu75, TYZO15, CD84a, HYKS08, Dos78a]. Lam70, Mai83, McI63, Meh84, Ouk83, Selective [DHT+19, LYDA19]. selectivity Piw85, RT81, Ram89b, RC94, SG76b, TT82, [HYKS08, MBKS07]. Selects [Bou12]. Self Wie87b, WB87, YTJ06, Yub82, CW93, [HH85, Pag85, PRRR15, SS83, Som99, CLW98, ISH+91, Mol90a, Mol90b, PH73]. TY03, Wil96, Wog89, ZF06, AOD19,¨ TKI99]. Seattle [ACM89c, LCK11, KCR11]. Self-Adjusting [Pag85, Wog89]. Seaweed [NDMR08]. Second Self-checking [Wil96]. self-clustering [ACM83b, ACM90, SDA91, AKY13, [AOD19].¨ Self-Indexed [TKI99]. ABD+16, Ano93d, BD08, Kil05, LLL+16, Self-Monitoring [SS83]. Self-Organizing Mit12, TZ12, ABM+12, IEE88b, TSP+11]. [HH85, Som99, TY03]. Self-Shrinking Second-Preimage [ABD+16]. Secondary [ZF06]. Self-Tuning [PRRR15]. Semantic [Bel70, Bel72, Bel83, Fel87, FP89b, Gui75, [CDW+19, Li15, LWZ+18, ZZLZ21, LL13, Joh61, NH74, YMI89]. Secrecy [BKST18]. MTB00]. Semantics [IH83]. Semi Secret [HR04, LMJC07, LPWW06, SNW06, [CBK83, CLL+14]. Semi-Interactive AGBR19, Par18, ZHS94]. sections [NM10]. [CBK83]. Semi-supervised [CLL+14]. Secure [AHV98, AOAAK20, Alb21, Ano93b, semijoin [CCY91]. Semite [LII92]. Ano95b, BT12a, CZLC14, CS02, Dan13, Semite-Infinite [LII92]. sensing [Ind13]. DK07, DY90, DY91, DR11, FIP93, FFGL09, Sensitive [BT12b, CSSP15, CKPT19, GHR99, GZX14, HM96, HR04, JTOT09, KBG18, Kaw15, MNP08, OWZ14, OTKH11, JK11, KMM+06, KP97, LM95, LRY+15, Pag18, ZHW21, AT18, EFMRK+20, FWG18, 58

GDGK20, HFZ+15, HFF+17, LNS11, TSP+11, AAE+14, ABM+12, BCJ15, LWXS18, LJW+17, PCM15, QZD+18, SP12, jCPB+12, Con17, DR06, GLG+02, JRPK07, STS+13, WY00, SA17]. Sensor KKRJ07, KRJ09b, KJS17, MAK+12, NIS15, [DK09, LDY+16, PLKS07, ZQSH12, ZHW21, NSS+06, PPS21, SK05, Sta94, SKP15, AK09, ADF12, GDGK20, LG13, LND08, WYY05a, WYY05d, WYY05b, WYY05c]. RAL07, YG10]. Sensors [DL12, DVS+14]. SHA-0 [BCJ15, NSS+06, WYY05d]. SHA-1 Sentence [CH12]. Sentences [Ven86]. [ANS97, AAE+14, BCJ15, Con17, DR06, sentiment [ZZLZ18]. Separate JRPK07, KKRJ07, KRJ09b, KJS17, SKP15, [Kue82b, Mul81, Kue82a]. Separating WYY05a, WYY05b, WYY05c, GLG+02]. [FK84, SG16, BvT13, LS06, vT14]. SHA-2 [SK05]. SHA-256 Separators [Lar88b, Moh90, Moh93, CS93a]. [MAK+12, PPS21]. SHA-3 [Bou12, Sept [BD88, Jou85]. September TSP+11, ABM+12, jCPB+12, NIS15]. [VLD82, AAC+01, AOV+99, AA86, BJZ94, SHA-512 [GLG+02]. SHA1 EF12, FS09, Fis87, HM08, HKNW07, Ker75, [Con17, SBK+17]. Shading [ZDI+15]. Kna89, LSC91, Vid90, Win78, Yao78]. Shading-based [ZDI+15]. Shanghai Sequence [Ano83, LC06]. Shape [SR89, SYW+20]. [BC08, FP89b, Gon81, HG77, LPT12, LL85, Share [SS88b]. Shared MS88b, BJ07, CLW98, Wog89]. Sequences [Bor84, CadHS00, DadH92, EK93, adH93, [Som99, KS88a, QJ97]. sequencing KBG18, KU88, KTN92, LTS90, MLD94, [KRML09]. Sequential MLxx, Mey93, Omi91, PG17, SD89c, SD89a, [AD85, BCCL10, CT96, GSB94, HB89a, TR02, TNKT92, VB00, Vit81a, WB03, KKC12, Lit89, Mul72, Ore83, Piw85, SK98, YNW+09, Don91, GLJ11, Kan91, Kan93, SG76b, BDPV14, HB89b, IL90]. Series KU86, MSS96, Par18, SD89d]. Shared-Disk [BJL16]. Serious [AG18]. Served [PM89]. [WB03]. Shared-Everything Server [DR92, GSL17, GBC98, Gra99, [KTN92, MLD94, TNKT92]. LLL+16, VB00, Tsa08]. Server-Side Shared-Memory [GSL17]. Servers [MLxx, TR02, Vit81a, Bor84]. [HWZP18, SKC07, KSC11, KSC12]. Serves Shared-Nothing [SD89c, SD89a, SD89d]. [Ano95d]. Service [CCF04, SWTX18, shares [ZHS94]. Sharing [LPWW06, KL08, Bac02, BPT10, QZD+18, TLLL18]. KD92, SNW06, YD86b, ZHS94]. SHAvite Services [ANS05, Ano85b, HLC10]. Session [GLM+10]. SHAvite-3-512 [GLM+10]. [HLC10]. Set [BOS11,¨ Kie85, PSZ18, SG76a, Shell [Rei03]. Shenzhen [IEE11a]. WC81, YD85, BGG12, GGR04, HYKS08, Sheraton [ACM75b]. Sheraton-Palace HDCM11, HKLS12, HM03, MI84, SA17]. [ACM75b]. Shop [Sil02a]. Short set-expression [GGR04]. Set-Oriented [AB12, CW09, CDW+19, DK09, Lyo79, [Kie85]. set-valued [HM03]. Setl [BFR87]. NR12, MT16, SV15a]. Short-Input [AB12]. Sets [AA79b, AA79a, GHK91a, GHK91b, Short-Output [NR12]. Short-Time GT93, Lit89, PBDD95, Ram92, Spr77, [CW09]. Shorter [H¨ul13, PPB16]. Should Win90a, BT89, BT93, FP82, IL90]. seven [Yao81]. Shoup [Mir01]. Showcase [RAD15]. seven-dimensional [RAD15]. [USE00a]. Shrinking [ZF06]. SHS Seventeenth [LC86b, LSC91, Rie89]. [Ano08, Ano12, NIS93, Nat92]. SIAM Seventh [ACM75c, ACM75a, ACM88a, [ACM94d, SDA90, SDA91, ACM97a, dBvL80, LL08, AAC+01, ICD91]. several ACM05, ACM08a, Kar98, Mat09, Shm00]. [DLH+79, Kan90]. SHA [ANS97, Bou12, Sichere [BN85]. Side [GO07, GSL17, TC04]. 59

SIFT [MMG10]. SIGACT [ACM82, [BPZ07, Cic80b, DH01, DS09c, GM94, ACM83a, ACM83b, ACM85b, ACM86a, GM98, IT93, KM08, Lom88, PSSC17, ACM88a, ACM89b, ACM89a, Van10, LL08]. PT12a, Ram92, Sar10, Tho13, CLS95, SIGACT-SIGMOD DKRT16, DW03, DS09b, DLM07, MV08, [ACM83a, ACM83b, ACM85b, ACM86a]. PT11a, Pri95, SKD15, SF88]. Simplicity SIGACT-SIGMOD-SIGART [Rag93]. Simplifies [OVY94b, OVY94a]. [ACM88a, ACM89b, ACM89a]. SIGAL Simplify [Dam93, Dam94]. simplifying [A+90]. SIGART [VZ12]. Simulating [adH93, Mey93]. [ACM88a, ACM89b, ACM89a, Van10, LL08]. Simulation [EK93, Hil82, Hui90, KLadH93, SIGCSE [LC86b]. SIGIR KLM96, KHW91a, YkWY83, KHW91b, [BIP92, YR87, BV89]. SIGMOD TWL+18, War14, DS84a]. [ACM82, ACM83a, ACM83b, ACM85b, Simulation-Based [EK93]. Simulations ACM86a, ACM88a, ACM89b, ACM89a, [CadHS00, DadH92, Lep98, Rey14, MSS96]. BJ93, CLM89, FMA02, GMJ90, Van10, Simultaneously [LOY00]. Sindhi [SSS05]. HF13, LL08, Nav85, SW94b, Sto92, ACM81, Sine [PPS21]. Singapore [DSS84]. Single ACM84a, BL88, HF13, Lie81, SW94a]. [AKS78, AA79b, AA79a, CS93a, CC88b, SIGMOD-SIGACT-SIGART GIS05, Lar82c, Lar82d, Lar85c, LLL+16, [Van10, LL08]. SIGMOD/PODS [HF13]. Men12, MJBD11, OT91, Spr77, YDT83, SIGMOD/PODS’13 [HF13]. Sign YSEL09, Men17, MA15, RT89]. [CK12, GHR99, PV07, GK12a]. Signal Single-Cycle [MJBD11]. Single-File [Cai84]. Signature [ANS05, Ano09a, Ano13, [Lar82c, Lar82d, Lar85c]. single-hop BDS09, CS91, Cor02, Dam87, FC87a, [MA15]. Single-Layer [YSEL09]. FC87b, HHL10, Hül13, Kal01, LR96a, LM95, Single-Pass [YDT83]. Single-Probe LL92, NXB13, PWY+13, RZ90, RR92, [OT91]. Singular [NS16a]. Sinkhole [JL14]. ZRT91, ZJ09, CR89, Con17, SE21, ZW05]. Sinnentsprechende [BN85]. Sintering Signatured [SS83]. Signatures [Rey14]. SipHash [AB12]. sites [OOK+10]. [AS16, BHH+15, But17, CK12, DK09, FL04, Sixteenth [ACM84b, ACM05]. Sixth FFGOG07, GK12a, GHR99, Hül13, HRS16, [BF89, ICD90, GJM02, LT80]. Size HBG+17, MKF+16, MCF17, Moh11, [Ack74, AHS92, Bat75, CKW09, Dev99, MKAA17, PW93, PGV93f, RR92, Rul93, Dod82, FK84, HD72, Joh97, Kab87, KV91, TT82, CFN18, NSW09, PPB16, ST93]. KNT89, MV88, Meh82, Sam76, Wil79, Signed [Sch01b, ZDI+15, SN19]. Woe01, Bee83, CM01, DW05, DW07, GW94, Significance [SP21]. significant [BCCL10]. Han17, LNS11, Sar11, Woe05]. SK signing [BGG94]. SIGPLAN [ACM79]. [LCH+14]. Skein Silbentrennung [BN85]. SIMD [AEMR09, FLS+10, KNR10]. Skeleton [AT91, RG89]. SIMD-MIMD [RG89]. [LDY+16]. Sketch [BI12, TP15, YGS+19]. Simhash [LLDZ18]. Simhash-Based sketches [NTW09, SLC+07]. Sketching [LLDZ18]. Similar [RC94]. similarities [Ind13]. Skew [UCFL08]. Similarity [Bre91, CyWM91, DNSS92, KO90, RK91, [GIM99, HCF95, LNS11, LOON01,¨ NADY20, Top92, WDYT91, WYT93, ZO93]. Skip NNA12, SHZ+20, TWZW11, WSZ+16, [AS07, Coh98, BCR10]. SL2 YTJ06, CLL+14, GP08, HYKS08, SP12, [CP95b, TZ94b]. Slack [AEP18]. SLCA SA17, STS+13, ZWT+14]. [WWZ09, ZLC+12]. SLCA-Based Similarity-Preserving [SHZ+20]. Simple [WWZ09]. Slicing [Kon10, MEK+14]. 60

SLISCP [ARH+18]. SLISCP-light Fis87, F+03, FPSS05, HT01, JD12, MSW19, [ARH+18]. sloth [LW17]. Slovenia [EF12]. PP08, SvEB84, TW91, YY01, BD82, SM3 [MXL+12, WS13, ZWW+12]. Small BCGS16, CF89b, DMPP06, GZ99, Kou93, [FHMU85, Ind01, Joh97, KR01, NN90, MN90, OP03, PSS09, Sie89, SWQ+14, NY85, YLC+09, YBQZ17, MP16, Sag85b]. TYSK10, WHS+07, Yuv75]. Small-bias [NN90]. Smaller Space-Efficient [BPZ07, JD12, PSS09]. [CRSW11, CRSW13]. Smalltalk [SUH86]. space-filling [GZ99]. space-hard Smart [Ku04]. Smartcards [JK11]. smoke [BCGS16]. Space/Time [Blo70]. Spaced [ZRL+08]. Smooth [PNPC20]. spaces [IMRV97, NN90]. Spain [ACP09, HK12a, KV09, LYY+18]. [DJRZ06, LSC91, CTC90]. Spam snapshots [PBBO12]. Snefru [ADOAH19, LZ06, UCFL08]. Spamdoop [BS91c, Bih08]. Snowbird [SM08, SM12]. [ADOAH19]. SPARC [WG94]. SPARQL SOAR [SUH86]. Social [HAKM15, HAK+16]. Sparse [KKP+17, ZWH17, PES+12, ZZLZ18]. [AL86, ASW07, vdSDW74b, FKS84, Gre21, Societies [IEE92a, IEE01]. Society Gri98, Gri77, KKN12, RT81, TY79, [IEE80a, IEE84, IEE88a]. Soft [DGKK12]. ZHC+13, vdSdW74a, Bis12, BT90, BT93, Softswitches [TLLL18]. Software CML+13, JCC00, CW91, Ind13]. Spatial [Ano85b, DT75, Eld84, FHMU85, GN80, [LR96b, SS88a, SYW+20, WYD+18, GD87, Got83, IEE80a, IEE95, Kna89, DLN+18, LH06, SS90b, ZBB+06, ZLC+18]. Lew82, MZD+18, Mil87, MW95, NP99, spatio [CWC10, DMPP06, FXWW17]. RRR99, Sch01b, SBS16, Wal88, And94, spatio-temporal [CWC10, FXWW17]. Bir07, Gol96, Mer90a, SGK09, TKH20]. speaking [LC95]. Special Software-implementation [GN80]. [ACM82, DT87, Dos78a, GIS05, MO92a]. Solution [DM90, Hop68b, Mit73, WSZ+16, specialization [SV15a]. Specialized HCF95, HL94]. Solvability [BF83]. solve [Bab79, ISH+91]. Specific [CP95a, WZ12]. solved [Loh89]. solver [RTK12, ARH+18, JDW+19]. [GZ99]. Solvers [DK07]. solving [SWQ+14]. Specifications [Nat92]. Specified [AU79]. Some [Bay73a, CV85, Gib90, Gri74, Lar85a, Specifying [GHJ+93]. Spectral Mit09, MOI90, MOI91, Nam86, Sti06, Wri83, [KKC12, Li15, WFT12, WB90, ZWT+14]. BSU12, GLC08, Inc81]. Sonographic Speech [CW09, RJK79]. Speed [SSaS01].ˇ Sophisticated [BPBBLP12]. Sort [FP89a, KMM+06, KMV10, McK89a, [GLS91, Gra94b, GLS94, KKL+09, PSR90, TK88, WZY+18, YNKM89, KTMO83b, OOB17, TR02, AKN12, BCCL10, EVF06, McK89b, MSS96, RW07, BATO13].¨ Sort-Hash [TR02]. sort-merge SLC+07, SXLL08, TLLL07, XMLC11]. [AKN12]. Sort-Merge-Join [Gra94b]. Speeding [FH96]. Speicher [GN80]. Sorted [Yao81, YLB90]. Sortieren [Meh86]. Speicherstrukturen [Kue84a]. Sorting [BS97, DS97, Gra94a, Gup89, Speichertechniken [LS85]. Speicherung Knu73, Knu75, MV90, MV91b, Meh84, [BJMM94b, BJMM94a]. ASW87, CKKW00, ISH+91, Kan90]. Sound Speicherungsstrukturen [Kue83]. [GvR08, KCF84, SDW14, BDPV14]. Source Speicherverfahren [DS84a]. Spelling [KP94, CBB05, Cha12, HC11, NMX19]. [CS82, McI82, Rad83, Zam80, MF82, Wie86]. source-based [Cha12]. Sources [CV08]. speziellen [Dos78a]. SPHINCS [BHH+15]. South [ACM91c]. SPAA [ACM91c]. Space Spiral [CK94, Mul85]. Split [Bal05, Blo70, BPZ07, BM99, CH94, DH01, [LL85, MS88b, SS06, She78, Wog89]. 61

Split-ordered [SS06]. splits [BY89]. [HKKK10]. Stereo [ZZ83]. Splittable [CP13]. Splitting Stereo-Warehouse [ZZ83]. stimulating [DR09, RT87b, Vek85]. Spoken [KRRH84]. [JFDF09]. STL [Ben98]. STM [DSS10]. Sponge [ARH+18, BDPV07, AMP12, STOC [ACM07, ACM08b]. STOC’12 BDPV08, BDP11, BDPV12]. [ACM12]. Stochastic [HKNW07]. stock Sponge-specific [ARH+18]. spongent [She06]. Stockholm [PV85, Ros74]. [BKL+11]. spongy [RS14]. sponsored Storage [ACM04, Bay74, BMB68, Bre73, [Fis87, HB93, IEE84]. spots [KLL+97]. Col93, Day70, FL73, Fel87, FB87, FP89b, Spotting [FLF11]. Sprache [BN85]. SPRC Fro82, GL82, GL88, HCJC06, HNKO20, [Wol93b]. Spreading [KO90]. Spring Hin20, Kno71, HGH+12, LCK11, Les88, [AFI63, IEE88a]. Springs [IEE11b]. Spritz LCLX19, LRY+15, MSK96, Mal77, Mau83, [RS14]. SQL [Bra88, Eng94, GBC98, Gra99]. MEK+14, Mor68, Mor83b, Mul81, Mul85, Square [ACM83a, ACM83b, EPR99]. Omi88, OT91, OS83a, OS83b, Pet57, Sam81, Squares [OG94b]. squaring [Mei95]. SHF+17, TY03, TS85, Tra63, WZY+18, SRAM [KHK15]. SRAM/DRAM WH83, Wil71, WKO78, WB87, YDT83, [KHK15]. SRS [SWQ+14]. SSD [HGH+12]. YLZ20, vdP72, vdP73, AY14, AK09, SSPIN [Cob94]. St [Vau06]. Stability CRS83b, DMB19, HGR07, Mau68, MSS96, [CW09]. stable [HF91]. Stack PT10b, QD02, YSL05, YMI89, van73]. [Bor84, KHW91a, LLL+16, KHW91b]. storage-efficiency [PT10b]. STACS [AH03]. Stage [LCM+20, QZD+18]. Storage-efficient [HCJC06, MSK96]. Store STAIRS [RCF11]. stamped [GB17]. [DW83a, LLL+16, LCM+20, MZL+19, Stamping [Cip93, Lip02, SL16]. Standard QXL+20, dW83b, SFA+19, Shi17, BP94]. [Ano93b, Ano95b, Ano08, Ano09a, Ano12, Stores [Bry84, GYW+19, JLL+20, PRRR15, Ano13, Dan13, FIP93, LYX+19, NIS93, SDZ21, WLC20]. Storing Nat95, NIS15, SK05, CV83a, GvR08, Nam86, [AL86, FKS84, MNS07, Ros77, TY79]. Ano02, Dan13, FIP02b, Nat92, Pla98, Lut88]. Stouffer [ACM87]. Strategies Standards [Bur06, Fox91, Kal93]. Stash [iA91, iA94, BI87, Dae95, Die07, adH90, [ADW12, ADW14, KMW08, KMW10]. adH93, KL87, KHT89, MD97, Mey93, State [But17, CH94, HB93, MKF+16, MNS07, Tro95, YB95]. Strategy Pre97b, Pre99, Wol93b, vdP73, ATAKS07, [CdM90, LMSM09, LC96, NKT88, RS92, HL94, PGV93c, Wol93a]. Stateful GC90, LMSM12]. Stream [DC98a, cLmL07, [NTY12, Ged14]. Stateless MNS12, NCFK11, TW07, TS85, DS09a, [BHH+15, MKAA17, NTY12]. Ged14, MV08, OCDG11, RS14, Tan83]. Stateless/Stateful [NTY12]. Static Streaming [CN07, STS+13, YSW+11, [AA79b, AA79a, LC88, Ram92, Spr77, YGS+19, CBB05, FVS12, ZC12]. DMP09]. Statistical streamlining [DSS10]. Streams [Fil02, HZ86, Sav90, TTY93, LZ06, MJ08]. [Coh98, SS83, YGC+12, BMLLC+19, CH09, Statistically [HR07, Wee07]. GGR04, SLC+07, YLC+09]. street [Sim98]. Statistically-hiding [HR07]. Statistics Strength [HS08, FH15, Ken73]. Stretching [Rob86, WGM88, DKRT15]. Status [BVF12]. String [iA94, Ask05, BRM+09, [TSP+11]. Steady [vdP73, HL94]. BH85, Bur84, CFP19, CCH09, Cha91, steady-state [HL94]. Steering [TLLL18]. Dav73, LK14, LLLC17, NNA12, TK88, Step [Dit76, ZWW+12, AKY13, WS13]. Tay89, TT82, ASM17, AZ10, Bur82, DC94, Step-Reduced [ZWW+12, WS13]. Steps GBY90, Kim99, MBKS07, RZ97, XMLC11]. 62

String-indexed [Tay89]. string-pattern [IN89, Mon19, Pri95]. Subspace [Kim99]. Strings [KRJ+80, Sch11]. Substring [BS97, Dit91, FM96, GLB21, Lit91, Pea90, [Boo73, Har71a, MKSiA98]. Subsystem Pea91, RC94, Sav90, Sav91, Zuk21, Eug90]. [HLC10]. subtype [Duc08]. subtyping Strong [CHKO08, CHKO12, JRPK07, [DL06]. Succinct HLL18a, Ku04]. strong-password [Ku04]. [ANS10, DP08, RRS07, FS08, SH92, SH94]. Strongly [BG07, LK14, Tho00]. Structural Suchen [Meh86]. Suffice [BRM+09, TWZW11, Wil96, ZMI91, FLF11, [ADW12, ADW14]. Sufficiency [NY85]. MK12, ZBB+06]. structuration [Lit77a]. Sufficient [BDPV14, IKO05, IH95, Rus92, Structure [AHS92, CK12, CJC+09, Rus93, Rus95]. suffix [BGKZ12, Kos14]. DGM89, DT91a, DT91b, FLF11, Flo77, suffix-free-prefix-free [BGKZ12]. FB87, GHK91a, GHK91b, Gre21, CTC90, Suitable [PPS21, MZI98]. sum KS12, NHS84, Omi88, SG88, WH83, Wri83, [IN89, Mon19]. summaries [KM08]. ZHW19, BR75, BGG12, IG94, KRJ09a, Summary [DLH+79]. Sums [HJ96, RRS07]. KHH89, LNS96, LCH+14, MMC01, MSK96, Super [Ano95d, HLL18a, KO90]. SB07, TMB02, YD86b]. Super-strong [HLL18a]. supercomputers Structure-Preserving [CK12]. [GLJ11]. Supercomputing Structured [CS93b, GDA10, Nak21, Piw85, [ACM04, IEE90, IEE91a, IEE93, Kha95]. SG76b, SM87, WWG+18, BPT10, GHW07, Superimposed WHS+07, WLLG08]. Structures [CJ86, FH69, SD85, SDKR87, SDR83b]. [AHU83, BDD+10, BFR87, Boy98, BJM14, superior [PT10b]. Superjoin [TRN86]. CE70, Coh84, DSZ07a, DSZ07b, DP08, superspecial [CDS20]. Supertree [GB10]. Ell85b, Ell82, Fel88, FZ87, FBY92, Fro82, supervised [CLL+14]. Supplement Gon84, GBY91, Gri74, Har88, Har71b, HS84, [SC77, Ruc15]. Supplementary [PLKS07]. Kru84, LC86a, LRY78, LRY80, Lit84, Support [CN07, Eng94, GSL17, KJC11, MO92a, RW73, Sal88, SDW14, SW86, Sne92, SK99, YCRY93, CZ14, CKKW00, JMH02, Ste82, SW87, TA81, TA86, TGL+97, TS76, KLSV12, LCRY93]. Supporting [CLS12]. TS84, VL87, WS76, WKO78, Wir86, YLB90, SURF [YCJ12]. Surface [Leb87, LDY+16]. ZLLD18, BY89, CRS83b, FP89a, GJM02, surprising [SKD15]. Surrogate [BCH87]. Har73, HM03, Inc81, IGA05, Koe72, Lin96, Surrogates [Dee82]. Surveillance [PPS21]. MTB00, NT01, NM02b, OS88, She06, VL97, Survey [CZ17, CJ19, Kal93, Sev74, Mil99, Vit01, Wil78, Wil85a, ZKR08]. Structuring RAL07, UPV11]. SUSE [PT10b]. Sweden [Bay73a]. Studies [Ros74]. Switching [IEE74]. Switzerland [Ano93d, GT80, GG80, Yub82]. Study [HKNW07, Lak96]. Sydney [SP90]. [AR17, BF83, BK07b, Cha84c, Cha85, Cra85, Symbol [CL83, Bat65, GJR79]. Symbolic DTS75, DJS80, DHJS83, Ell85b, Gri74, [ACM94b, CLD82, DL80, FH96, Jen76, Hil78b, Hil78a, LC86a, LG78, LYD71, TL95, Lak96, Lev95, Ng79, vdHvH12, GvR08, YLB90, HM03, LY72, Wee88, WTN07]. Kan91, Kan93, Ng79]. Symbols [Wil59]. style [UCFL08]. Sub [WZY+18, Pri95]. Symmetric Sub-Datasets [WZY+18]. sub-quadratic [FW09, Fil02, HC13, NHS84, Oto85b, PQ98, [Pri95]. Subgraph [ZLY+12, WLLG08]. PQ99, QG89, QG90, Roe94, SK20]. sublinear [CFN18]. Subquadratic [Val15]. Symmetry [KTN92]. Symposia [Got83]. subscribe [MJ14]. Subscripts Symposium [ACM94d, ACM75c, ACM75a, [Atk75, vdSDW74b, vdSdW74a]. subset ACM76, ACM77b, ACM79, LFP82, ACM82, 63

ACM83a, ACM83b, ACM84b, ACM85b, GI12, GLLL17, Gro86, Van10, Han90, ACM86b, ACM86a, ACM87, ACM88a, HCKW90, Har88, HNKO20, HBL+10, HF13, ACM88b, ACM89b, ACM89a, ACM89c, Kim80, KS12, KCB81, Kue84b, Kum89a, SDA90, ACM90, ACM91c, ACM91d, SDA91, LYY+18, LC86a, LL08, LLG+17, LXL+19, ACM91e, ACM94b, ACM96, ACM97a, LCL+20, Llo81, LSZ+21, Man12, MEK+14, ACM97b, ACM98, ACM01, ACM02, Mor83a, Ouk83, PFM+09, PG17, Sha86, ACM03a, ACM05, ACM07, ACM08a, She91, SHF+17, SWTX18, Toy86, Ull82, ACM08b, ACM11, ACM12, AH03, Ano10, Web72, WB03, Yam85, YLB90, ZJM94b, A+90, AiNOW11, BW92, Col93, CHK06, ZH18, dKC94, ACM94c, AKN12, ARA94, EF12, Gol94, Van10, adHMR93, HL91, DKO+84d, DAC+13, FP89a, FES09, HF13, IEE74, IEE76, IEE80b, IEE82, IEE84, GPGO16, KKP92, Lia95, Mo92b, RW07, IEE85a, IEE88c, IEE89, IEE91b, IEE92b, SK88, SGK09, SP89, TL93, UIY10, WZ12, IEE99, IEE05, IEE06, IEE07, IEE10, WTN07, ZGG05, ZJM94a, ZJM94c, SC77, IEE11b, IEE13, J´aj90, Jen76, Lak96, LL08, Sto88]. systolic [EBD91, PJM88, PJBM90]. Lev95, LC86b, Mat09, MS05, Ng79, ACM77a, Shm00, WGM88, Win78, Wol93a, T3D [DS97]. Tabellen [BI87]. Table Wol93b, vdHvH12, ACM91a, FS09, Fis87, [AL86, Bat75, BRM+09, Bee99, Bur75a, HM08, HKNW07, Kar98, IEE82]. Symsac CCF04, CW91, CHSC18, CL83, Day70, [Jen76]. Synchronization [Oak98]. DHK+15, DAC+13, FKS84, FW76, FW77, synchronizing [DTM+18, ML95]. GK94, GK95, Hop68b, HD72, HLC10, Syndicate [HM19]. Syndrome [vMG12]. IABV15, JL14, JXY07, JMH02, JD12, KG95, Syndrome-Based [vMG12]. synergy Kno71, LMJC07, Lev00, Lit80, Litxxa, [GHW07]. Synonym [QCH+81]. synopses LACJ18, Lyo85, Mai83, Mai92, MT11, ML75, [YLC+09]. Syntactic [Ven86]. synthesis Mue04, MJT+02, Pri71, Pro89, Rey14, [Sab94]. synthetic Riv76, Riv78, Sam76, Sam81, San76, Sne92, [GLC08, PGV93e, PGV94]. Syracuse Szy82, Szy85, TY79, Tro06, VB00, YD84, [IEE80b]. System YT16, YLB90, YLZ20, vdVL12, AY14, [ASWD18, Ano10, BGF88, BG92, CBK83, AZ10, BCR10, Bay73b, BGG12, Fro81, Cer85, CBK85, CZLC12a, CZLC14, CBA94, GSS01, HXLX13, KdlT89, MZK12, MA15, CJ86, DNV81, EE86, FH69, GRZ93, Gra94c, NK16, NH74, PH73, Ram87, SB95, SB97, He87, ISK+93, JXY07, KL87, Koe72, TKH20, Tsa08, WTN07, Yu18, ZGG05]. KRJ+80, HGH+12, LYX+19, Luh58, Mil85, Table-Based [HLC10, TKH20]. table/urn MK93, MFK+06, PRZ99, PSR90, QXL+20, [Ram87]. Tabled [AR16]. Tables Sar80, SBS16, SPB88, SC77, TC93, [Ack74, APV07, AK74, Ask05, Ban77, BM87, YkWY83, ZZM17, ZZ83, AS09, CZ14, Bay73c, Bay73a, BPBBLP12, Ben98, BI87, Gob75, HLL18a, KJS17, Kos14, MFES04, CRdPHF12, Cle84, CD84b, EMM07, WM93, YMI89, ZCZQ19, ZYWM20]. FFPV84, F+03, Gre21, GT93, GLB21, HP78, Systematic [SSaS01].ˇ Systems Hop68b, HC87, HC13, IK92, Jv86, KHK15, [ACM82, ACM83a, ACM83b, ACM85b, Kue82b, Kue84b, LK07, Lar88a, LMSM09, ACM86a, ACM87, ACM88a, ACM89b, LC88, Lit79b, LB07, LHWL21, Luc72, ACM89a, PDI91, And91, ANT85, BSH12,ˇ LMR02, Lyo78b, MSD19, MS02, MPP14, Bor81, Cer81, CS83b, CC87, Col93, Mit02, MC86, NY85, Pag85, PAPV08, PV92, DKO+84b, DKO+84c, DKO84a, Dum56, PTT16, PBDD95, Pla98, Qui83, Ram88a, DGKK12, Ell82, Fox91, FK84, GGY+19, RRS12, RHM09, RMB11, Ros21, SD78, 64

Sch79a, SS80, SM02, TT10, Woe06b, Yao81, De 95, DKO+84d, DJRZ06, DJNR09, GQ95, Yao95, Zuk21, Bat65, CHS+18, Fly92, ISO97, ISO04, LY72, PH73, RLH90, FPSS05, FRS94, GM79, GJR79, HKW05, SXLL08, UPV11, YSL05]. Technology KHK12, LMSM12, LVD+11, Mad80, MSD16, [IEE11a, RRR99, ISO97, ISO04, JBJ94]. MRL+19, PT10b, PT12b, QP16, SS06, Teil [Pei82]. Teletraffic [CS93b]. Temp e Tai79, TKH20, TBC+05, TMW10, Tso15, [Gol92, Yu92]. Template Wil03, Wil14, Wog89, WTN09, XLZC14, [LMC07, SP21, SK20]. Templates YTHC97, ZHW01]. tabu [WZ93]. [JTOT09, AGBR19]. Temp oral Tabulation [KW12, PT12a, TZ12, Tho13, [GY91, SHZ+20, WYD+18, CWC10, DT14, DKRT16, PT11a, PT13, Tho17]. FXWW17, MHT+13]. temporaries [Ken73]. Tabulation-Based [KW12, TZ12]. TENCON [Ano93c]. Tennessee [IEE94c]. Tabulative [GT80]. Tag [JRPK07, ZWH17, Tenth [DSS84, SC77, YR87]. Terabytes CJP15, HLL18a, SPLHCB14, CJP12]. [IEE02]. term [KP92]. termination [Er86]. tag-based [HLL18a]. Tagged [ZWH17]. Terms [Wil79, ZWCL10, vT14]. ternary tagging [TCW+13]. Tags [LCL+20]. [Bou95, KTDB20]. Terrorism [GRBCC19]. Taip ei [HL91]. Tamed [NXB13]. Tampa Tertiary [Gui75]. Test [IEE88b]. Tamp er [CHL07]. [Har71a, RT87a, Sav90, Duc08, ZCZQ19]. Tamper-proofing [CHL07]. Tamp ering Testb ed [SDK91]. Testing [TWZW11, PS08]. Tangle [AVZ11].´ Tap e [Boo73, DD11, Fil02, Sam76, WM19, AY14, [SvEB84, ML95]. Target HKLS12, TD93]. Tetris [GSS01]. [LBJ02, Mit12, HRS16, MIGA18]. Tash Tetris-Hashing [GSS01]. Tex [ACM91b]. [LYDA19]. task [JDW+19]. task-specific Texas [ACM91b, ACM97b, ACM98, IEE76, [JDW+19]. Taxonomy [CZ17]. TBE USE00b, ACM88a, IEE95, Nav85]. Text [Zha07]. TBE/IBE [Zha07]. TCC [Kil05]. [Bur81, Coh98, CDW+19, DS84b, Dit91, Tcl [USE00b]. Tcl/2k [USE00b]. Tcl/Tk Fal85b, Gon83, HZ86, Lit91, Pea90, Pea91, [USE00b]. TEA [CV05, HSR+01, HSIR02]. Sav91, TT82, Ven84, YSW+11, Gob75, HC07, Teams [GBC98, KKW99]. Technical Ram89b, RCF11, Sab94, ZZLZ18, ZHW01]. [IEE84, LC86b, Ros21, Zuk21, Mit17, SE89]. textes [LG78]. Texts [LG78]. Textual techniken [Mer72]. Technique [BH85, MLHK17]. Texture [AP93, Boo73, CL85, CS82, CT96, Dod82, [HSPZ08, SSaS01].ˇ th [KKT91]. Their HC87, KM92, Lit79a, Mau68, McK89a, [CZLC12b, CK15, CJ19, Deb03, Gra88, RZ90, Ram97, SDW14, She78, TK88, Gra89, Heu87, HK12b, NR12, RNT90, Wan84, Yam85, CCY91, GM77, Kan90, SDT75, WC81, AG10, adHMR93, NY89b, KK96, MIGA18, McK89b, Pro94, Sac86, NY89a, PW08, Pob86, Sie89]. Theorem Sag85b, MKL21]. Techniques [Cha84b, CG92, HR14, Kno88, Sho00a]. [AOAAK20, Bay73a, Bih08, Bre73, CP87, Theoretic CP88, CZ17, Dam90a, Dam91, Dav91, [Sun15, HM93, SXLL08, TZ94a, vL94]. DKO+84b, DKO+84c, DKO84a, DL79, Theoretical Dun89a, Dun89b, Fel87, Gra92, Gra93c, [AH03, CHK06, RRR99, TWW77]. Theory Gui75, Gui78, Hel94, KMV10, Kue84b, [ACM75c, ACM75a, ACM76, ACM77b, LC20, LDM92, LYD71, Mal77, Mor68, ACM82, ACM84b, ACM86b, ACM88b, Mor83b, MC86, Pri71, QV89, QV90, QG95, ACM89c, ACM90, ACM91e, ACM96, RLH91, Rue93, SD85, SDKR87, SZ93, She91, ACM97b, ACM98, ACM01, ACM02, SPSP16, Sta73, Sti94a, Vau06, YTJ06, BF08, ACM03a, ACM07, ACM08b, ACM11, 65

ACM12, AA86, BBPV11, CP87, CP88, Timing [VL87, VL97]. Tiny CS93b, Dam90a, Dam91, Dav91, Fel50, [GW94, OWZ14, SWQ+14]. title [Dit76]. HP63, Hel94, IEE74, CTC90, IRM93, KM86, Tk [USE00b]. TN [ACM94c]. To-many KM88a, KGJØ18, LC06, LK11, LL83, Mir17, [SV18]. to-one [SV18]. Tokyo Pip79, QV89, QV90, QG95, Rue93, ACM77a, [IJW89, A+90, Mo92b]. Tolerant SZ93, Sti06, Vau06, Yan10, De 95, GQ95, [DSSW90a, AAB+92, DSSW90b, HGR07]. Hua82, ISO97, Kil05, PSN95, Tso15, Kil05]. To o [CHSC18]. To ol There [AKS78]. thesaurus [RW73]. things [Lit79b, Lit80, Litxxa, MV01]. To olb ox [SKD15]. Think [DCW91]. Third [Jac92]. To olkit [FZ87]. To ols [ACM91e, jCPB+12, ICD87, IEE88a, BDS88, [Mil87, JC88b]. Top Gol96, Ano89]. Third-Round [jCPB+12]. [APV07, LRY+15, LLG+17, ZLC+12]. Top- Thirteenth [Kna89]. thirtieth [ACM98]. [APV07, LLG+17]. Top-Down Thirty [ACM03a, IEE88a]. Thirty-Fifth [LRY+15, ZLC+12]. Topic [RTK12, Gre95]. [ACM03a]. Thirty-Third [IEE88a]. Thiry Topic-Specific [RTK12]. Topics [Joy03]. [ACM02]. Thiry-Fourth [ACM02]. Topology [RHM09, Ati20]. Toronto Thousand [KRJ+80]. Thousand-Word [Gil77, KLT92]. torrent [Bak09]. Towers [KRJ+80]. thousands [BMS+17, Nic17]. [ICD88, ICD90]. TPM [WYD+18]. thrash [BFCJ+12]. Threaded [VB00]. Traceback [JL14, SXLL08]. Tracing Threading [SMZ18]. Threads [Lep98]. [SS89b]. Track [Joy03]. Tracking Three [GGR04, LLL11, UCFL08, FXWW17, ML15, [Ano95a, MLxx, MP12, SP89, Tro95, FH15]. OOK+10]. Tractability [GB10]. Trade Three-way [SP89]. Threshold [Wee11]. [ASBdS16, Blo70, CJMS19, GW94, Sar11]. Throughput trade-off [CJMS19, GW94, Sar11]. [KHK15, LPT12, LLL+16, PRM16, TP15, Trade-Offs [ASBdS16, Blo70]. tradeoff WZJS10, MAK+12, XLZC14]. Thyroiditis [Sie89]. Tradeoffs [SD89b, SD90b, SD90a]. [SSaS01].ˇ Tiger [AB96, MR07]. Tight Traditional [EMM07]. Traffic [Cha94, CV08, GHK+12, vT14]. Tightly [TLLL18, HKL04, MA15, TBC+05]. tragen [Mul81, DW05, DW07]. Tillich [BJMM94b, BJMM94a]. Transaction [Gei95, Gei96, GIMS11, PVCQ08, TNS20]. [CCW+17, SPB88, MTB00, SSU+13, Time [ASBdS16, BJL16, Blo70, Bre73, TMB02, Yu92]. Transactional BM99, CW09, CJKK19, Cip93, Cla77, [ZLLD18, BRM10, SSU+13]. Transactions CM93, DadH90, F+03, FPS13, FKS84, [CHSC18, FK89, MMC01, SSU+13]. GK76, Gra94b, Jak85, Kab87, LAKW07, Transfer [HK12a]. Transform [BR06, Lip02, Lyo83, Moh11, NI83, NS16b, PP08, GH07, HB89c, HB94, LC12, LYD71, NS16a, PSSC17, PWY+13, PS12, Sag85a, SL16, PVM94, RGNMPM12, LY72, Pob86, Ind13]. Sie04, TW91, Val15, WVT90, Win90b, AY14, Transform-Based [RGNMPM12]. ASA+09, CJMS19, CCY91, DSD95, FPSS05, Transformation [Lum73, NXB13, SR63, FVS12, GB17, GMW90, Han17, Kor08, ZLLD18, Lin63, PT10b]. Transformations Man12, MV91a, MN90, MP90, OP03, Par18, [GG86a]. Transforms [Zha07]. Transition Pro18, Sie89, ZRL+08]. Time-Memory [SP21]. Transitive [CdM89, CdM90, GC90]. [ASBdS16, CJMS19]. Time-Series [BJL16]. Translated [WSZ+16]. Translation time-space [Sie89]. Time-Stamping [BCR10, TK85]. Translators [DGGL16]. [Cip93, Lip02]. Timer [VL87, VL97]. Times Trap do or [HHL10, Wee12, LWG11, PW08]. [Mal77, SD78, PY88]. Timestamps [GY91]. Trap do ors [GPV08]. Traversal 66

[CLC06, Lip02, YSEL09]. Tree [And91, Twenty-Seventh [LL08, AAC+01]. twig AR17, BT12b, FB87, GadHW96, KHT89, [KRML09]. Twisted [PT13, DT14]. Lip02, LRY+15, LB07, Lyo83, Omi88, Oto86, TWISTER [FFGL10, FFGL09]. Twitter Piw85, SD89b, SG76b, SM87, WS93, Wil00, [RTK12]. Two [DDMM05, DAC+13, HK12a, Ati20, BLY20, BDPV14, BPT10, CLS95, HSIR02, Jv86, KSSS86, Leb87, LMPW15, DSD95, GB17, HLL18b, KW94, LLA15, Lyo85, ML15, Pan05, Pip94, PGV90a, TC93, MFES04, Omi89a, THS97, War14]. CCL91, Con17, DKRT16, GP08, Li10, MS09, Tree-Structured [Piw85, BPT10]. Trees McN03, PGV93a, PGV93b, QZD+18, [BM76, BD84, BBP88, CLYY92, CHY93, SDR83b, MKL21]. two-bit [MKL21]. CLYY95, CN07, CD84b, DCW91, Dev99, two-channel [MS09]. Two-Dimensional LQZH14, Reg81, She78, VV84, Wil00, AD08, [KSSS86, Leb87]. Two-Disk [TC93]. Bra09, CM01, FP82, FK89, KLL+97, Kos14, Two-level [DAC+13]. Two-Message Lev89, QP16, RRS07, TB91, BD84]. Trends [HK12a]. Two-permutation-based [Rie89]. Triangle [IEE89, JTOT09]. [LMPW15]. two-stage [QZD+18]. triangular [GPGO16]. Trick [DR09]. Trie Two-Way [DDMM05]. TWOBLOCK [AR16, Bur76b, Bur77, CCH09, Fla81, FS82, [Yan05]. TX Fla83a, KS12, Lit81, Lit85, LZL88, LSV89, [USE91, ACM87, ARA94, IEE94a]. Type LRLW89, LRLH91, Oto88b, Reg88, Tv83, [KPS92, KRJ09a, TNS20, SF88, SG16, SV18]. AR21, AZ10, BLC12, Bur76a]. Trie- [KS12]. Type-based [KRJ09a]. Type-Graphs Tried [ATT98]. Tries [KPS92]. type-heterogeneous [SV18]. [BT94a, BT94b, GO15, Tam81, PBBO12, Types [EjKMP80, Hej89, Rog19b, SW87, Pro18, SV15a, SV15b, SV18]. trigger Wal88, LPSW03, NMS+08]. TYPHOON [ZLY+13]. Trigram [Wil79]. triple [HKW05]. typing [DMP09]. [LWG11]. triple-trapdoor [LWG11]. Troika [KTDB20]. Trondheim [Ano95c]. Uberlegungen¨ [Kue84a]. Uebersicht truncated [FJ13]. Truncating [Sol93]. [Mer72]. UK Truncation [Wil79]. Trusted [AOV+99, Boy95b, Dav91, Gol96]. UL [KKRJ07, KRJ09b]. Trustworthy [DSS17]. Ultra [EH12, LW17]. trx [LW17]. Tsunami [QXL+20, WZJS10, YBQZ18]. Ultra-Fast [CZL12]. Tulip [XBH06]. Tunable [YBQZ18]. Ultra-Low-Latency [QXL+20]. [AOD19].¨ Tunable-LSH [AOD19].¨ tuned uncertain [BZZ12]. Undergraduate [EFMRK+20]. Tuning [Tro92]. Undergraduates [Pag06]. [KNT89, PRRR15, Tym96, Vit80a]. tuple Understanding [Dun89a, Dun89b]. [WHS+07]. Turb o [Hej89]. TV [YGC+12]. Unequal [Gon80]. Unequal-Probability Tweakable [MKASJ18]. Tweaking [Gon80]. unicast [ATAKS07]. unicorn [Zha07]. tweets [STS+13]. Twelfth [LW17]. Unification [Büt86, Cra85]. [BV89, CGO86, Col93]. Twentieth Unified [ACM88b, IEE01, Mat09]. Twenty [JV16, Mul84a, Mul84b, ABO+17, BOY11]. [ACM89c, ACM90, ACM91e, AAC+01, Uniform AOV+99, Van10, GSW98, LL08, ACM96, [ABH+73, AT93, Gui89, Kie85, KS86, KS87b, ACM97b, IEE01]. Twenty-Eight [Van10]. Lar83, Leb87, LQZH14, LPP91, LPP92, twenty-eighth [ACM96]. Twenty-fifth Mal77, OP03, PP08, PCK95, Ruˇz08, UHT95, [AOV+99]. Twenty-fourth [GSW98]. Yao85b, Ald87, AT90, MC89, Rad92]. twenty-ninth [ACM97b]. Uniform-Grid [Leb87]. uniformly 67

[MLP07]. Unifying [BG80, BG82]. Unique AT18, Bal05, BK84, Bor81, Bra84a, Bra85, [Boo74, DLH09, DLH13, SD78, ASW87]. Bra86, BC90, Gur73, NR12, Rad70, WC81, Uniqueness [Kah92]. Unit [BC90, HO72]. Er86, adHMR93, RK15, Vak85, YIAS89]. United [ACM94b, JBJ94]. Units Used [Stu85, GS94, Sch91a]. USENIX [LLLC17, WB87, SF88]. Universal [USE91, USE00b, USE90]. User [Abi12, AS96, BKST18, Bie97, Bra09, CW77a, [RTK12, YY07, Bor81, DFMR15, HL12, CW77b, CW79, CJKK19, CS02, DadH90, LLH02, LKY04, YRY04]. Using DadH92, Die96, DS09c, EPR99, F¨ur88, GC95, [ANS97, ASW07, BDPSNG97, Bar97, HHR+10, HJ96, JCK+18, Kil01, KR01, LK14, BRM+09, BCK96b, Bor84, BOS11,¨ BM90b, MNT90, MCW78, Meh82, Mul91, Nae95, BI12, BT94a, BT94b, BM01, BT12b, NY89b, NY89a, NP99, NR12, Ram88b, Sar80, BMLLC+19, CP95a, CRdPHF12, CKB85, Sho96, Sho00a, Sie04, Sti91, Sti94a, Sti94b, CdM89, CdM90, CLYY92, CCW+17, Woe01, van94, ACP10, Bie95, DS09b, IIL17, CJC+09, CJKK19, Cle84, CD84b, CE70, KYS05, KL96, KR06, LK16, LC13, MNT93, CRR18, CY06, DLT98, Dav73, DK07, Sar11, Sar13, Sie89, Tho00, Woe05, Woe06a]. Dod82, DL12, DSSW90a, DGKK12, universality [SS89a]. universe EFMRK+20, Fal85a, FLF11, FRB11, FJ13, [Bra09, Wen92]. Universes [DS09c]. GRBCC19, Ger86b, Gir87, Gre21, Gri77, Universitat [CTC90, Dit76]. Universiteit GPA97, GAS+16, Har97, HG77, HNS84, [BBD09b]. University [ACM81, IJW89, HKY12, JRPK07, JTOT09, JD12, JK11, CCC89, CRS83a, HB93, IEE74, J´aj90, Lie81, Kab87, KSSS86, KM07, LK07, LAKW07, Oxb86, Pat90, Sch82a, Dit76]. universum LQZH14, LR99, LMD+12, Lum73, MS02, [Wen92]. UNIX [SY91, WG00]. Unknown MPP14, MBBS12, MNY81, McK89a, MH00, [LCL+20]. Unlabeled [GCMG15]. unleash Moh90, Moh93, MJT+02, Mul72, NKT88, [McN03]. Unlimp [Kah92]. unsafe [Con17]. NI83, OTKH11, OG94a, Omi89b, PAPV08, unsigned [BCS89]. Unstructured PPS21, PLKS07, PKW09, PF88, PW94, [Gon83, PFM+09]. Unsupervised QG89, QG90, RL89, RLT83, RSD85, [CJN20, PKW09]. Untersuchung [Stu82]. RSSD92, Rey14, Rob86, SD78, SS83]. Using Unveiling [WZY+18, BCCL10]. UOWHFs [SRY99, Sho00b, SW86, SK05, Som99, SA97, [BR97]. updatable [ZYWM20]. Update SKM01, TK88, TC93, TA81, TA86, TGGF10, [Ano95a, GO07, GGR04]. Updates TK85, TS85, Tsa96, US09, VV84, WPKK94, [LCLX19]. Upon Wan14, WLWZ19, WDP+12, Wil96, Wil79, [CS83b, Cha84b, CS87, CW91]. Upper WM19, YY07, YBQZ18, AOD19,¨ BSNP96b, [DKM+88, DKM+94, GadHW96, DKM+91]. BLC12, BK07a, BF08, BT90, BGG12, URAL [GT63]. URAL-2 [GT63]. URLs CDS20, CKB81, CHL07, CKKK09, CP13, [AY14]. urn [Ram87]. USA CT96, DS09a, DMPP06, DKT06, DS09b, [ACM03a, ACM07, BD88, Bel00, Bri92, Bri93, DSSW90b, EH17, Fal86, FM89, Fly92, BD08, Cop95b, Deb03, DJNR09, FNY92, GKKT10, GG92, Ger86a, GDGK20, Gob75, Fra04, Fre90, Van10, GSW98, Joy03, Ker75, GBL94, HDCM11, HKL07, HKLS12, HC14, Kil05, Lom93, Sho05, Sti93, Sti94c, Wie99, Hil88, HC02, HW88, HXLX13, ISO97, Yun02, ACM94d, ACM11, ACM12, FMA02, JFDF09, JLH08, JL14, JCC00, JBWK11, HF13, ICD86, ICD87, ICD88, IEE88b, JMH02, Ken73, Kim99, KJS17, Kos14, Ku04, ICD90, IEE01, IEE02, IEE05, IEE10, IEE11b, LG96, LLH02, LKY04, LW04, LNS11, IEE13, MS05, USE91, USE00a, USE00b]. LDK12, LK16, MMC01, McK89b, MMG10, Usability [BDS88, Sch82a]. Use [ACM75b, MP16, Mue04, Oka88, PCK95, RSSD89a, 68

RSSD89b, RGNMPM12, Rön07, SK20, SB95, [Coh84, HPC02, JXY07, Kut10, Lar82c, Sar11, STS+13, Tho17, UHT95, YTHC97]. Lar82d, Lar85c, WG94, CMR98, GM18]. using [YL04, YRY04, ZGG05, ZW05, Versions [HSR+01, CV05]. Versus ZLY+13, ZRL+08]. USSR [GLB21, Zuk21]. [BD84, CF89b, DSS17, GLS91, SvEB84]. Utah [SM08, Nam86, SM12]. utentibus vertex [ZBB+06]. Verwaltung [Pet83]. [DMPP06]. Utilisation [OT91]. Utility verwaltungsdaten [Pei82]. Very [HNKO20]. Utility- [HNKO20]. Utilization [ABB93, VLD82, AW89, AAC+01, AOV+99, [PS12, Wil71, CF89b]. Utilizing [KK85]. BD88, BCH87, BJZ94, CGO86, Chu90, Utrecht [vL94]. UUID [BSH12].ˇ DSS84, DT91a, DT91b, Gon83, GSW98, HB89a, HB92, Hil78b, Hil78a, Ker75, KR79, V [PHL01]. v1.4.0 [Sun02]. VA KS87a, KS87b, LT80, LSC91, MSDS90, PV85, [ACM94d, ACM94a]. Valdivia [CHK06]. ST83a, ST83b, Yao78, Yua92, DC94, HB89b, Validation [ML86]. valuation [JDW+19]. KS89b, VLD82, AW89, CGO86, DSS84, Value [DGD02, GIS05, Gra99, GYW+19, LSC91, MSDS90, PV85, Yao78, Yua92]. JLL+20, LLL+16, LCM+20, MZL+19, VHAM [Lit77b]. VHP [LWWK20]. Via NS16a, PRRR15, PRK98, QXL+20, SDZ21, [CKN18, GH07, YTJ06, BHKN13, BHKN19, Cli95, MK12, Mil95, Shi17, WLC20]. valued BDPV09, BJKS93, BJKS94, CFN18, [DH84, HM03]. values DOP+14, Die96, EPR99, GIM99, HHR+10, [ASW87, GS94, SB95]. Vancouver Ind13, KM86, KM88a, KZ19, Lep98, [ACM05, LL08, Yua92]. Variable LCLX19, LC12, LWWK20, PT11b, PKSB18, [Dit91, Lit91, MF92, Mar64, OGAB14, SD90b, SD90a, TYZO15, TLZL16, TMW10, PHL01, Pea90, Pea91, Sam76, Sav90, Sav91, Wee11, Woe01, Woe05, ZCZQ19]. Vice ZPS90, ZPS93a, RKK14, ZPS93b]. [Hol13]. Victoria [ACM08b]. Video variable-increment [RKK14]. [GRBCC19, OTKH11, PPS21, SHZ+20, Variable-Length [MF92, Pea90]. TCY+20, WP10, CWC10, DVS+14, Variables [Die96]. Variant OCDG11, QJ97, SB14, YCJ12]. Vienna [AAE+14, McI63, PS12, PVCQ08]. Variants [ICD93]. View [BM89, BM90a, GRZ93]. [CV83b, CV84, CV85, VNP10]. viewed [vT14]. Viewpoint [Mal77]. Variationally [KR06]. varieties [FH15]. Virginia [WGM88]. Virtual variety [Zha19a]. Various [LG78, WPS+12]. [Lit78, Lit79b, Litxxb, Ste82, TK85, YLZ20, Varying [Wil79]. Vault [LMC07, LMJC07]. AS09, Lev89, LWWK20, Wie86]. VA X [JC88b]. VAX/VMS [JC88b]. VBF Virtual-Circuit [Ste82]. Virtualization [ACZ16].´ Vector [ACZ16,´ Kaw15, LH20, [MZD+18]. Virtualized [HBL+10]. Virtuel PG95, SB93, Kan91, Kan93]. Vectorization [Lit77b, Lit79a]. Virus [LLL11]. Vision [Kan90]. Vectors [Blu95, MI84, WZ93]. [IEE88b, HCF95, KI94]. Visual [MLHK17, Vegas [AFI69, IEE10]. vehicle [LWG11]. PSSC17, XNS+13, YWH09, DVS+14, ML15]. Vehicular [GZX14]. Venti [QD02]. Visual-Textual [MLHK17]. Visualization verarbeitung [Nie75]. verfahren [Hil82]. [MW95]. VLDB [Yua92]. VLSI Verfahrens [Pet83]. Vergleich [DS84a]. [Rei88, AS89, EBD91, Für88]. VMPC Vergleichende [Hil82]. Verification [Sar15]. VMS [JC88b]. Vocabularies [CLS12, EH12, Lew82, MJT+02, YKLH10, [Wil79, LK93, ZHW01]. Vocabulary CE95, KRJ09a, SD95, Tsa08, YLC+09, [KRRH84, LLZ10, YWH09, YMI89]. ZKR08]. Verified [BGH12, BGH+13]. Vocabulary-Based [LLZ10]. Voice Versa [Hol13]. Versatile [CBA94]. Version [SMS91]. Volatile 69

[ZH18, CCA+12, MSZ+20]. Volcano [GDGK20]. Winner [Bou12]. Winter [Gra94c]. volumes [Ruc15]. volumetric [USE91]. Wireless [ZDI+15]. Vorschlaege [Kue83]. Vortex [DK09, DPH08, LDY+16, PLKS07, SHRD09, [GK08]. Vowel [Wan05]. Vowel-consonant YSW+11, ZQSH12, AK09, ADF12, Cha12, [Wan05]. VPN [KMM+06]. vs LG13, LND08, YG10]. Wise [BATO13,¨ GLS94, KKL+09, Oak98]. [Ind01, Die96, FPS17]. within [Bay73b]. Vulnerability [BPBBLP12]. Without [GHR99, PV19, SL16, ASW87, Ati20, BK84, W [Hül13]. W-OTS [Hül13]. WA [LCK11]. BRM10, CP95a, Dam93, Dam94, Die96, WADS [DSZ07a, DSZ07b]. Wait [LFD17]. Jak85, KS88b, KS88c, Ku04, LW04, Mul81, Wait-Free [LFD17]. Walk Pag18, Par18, Reg82, SUH86, Tsa08, ZW05]. [FMM09, FMM11, BCR10]. wallet [Nic17]. Witnesses [AN96]. Wollongong [PSN95]. Warehouse [ZZ83]. Warwick [Pat90]. Was Word [BH86, FLF11, KRJ+80, LHC05, [HJ75]. Washington BT89, Han17, ST85]. Words [ACM84b, ACM89c, BJ93, Fis87]. [Chu90, DM90, Dos78a, KR79, KRRH84, Watermarking [DR11, WDP+12]. Wave MH00, ST86, Tro06, Wol84, Zou85]. work [LC12]. Wavelet [GH07]. Way [Col93, MV08]. Working [Cer85, CE95]. [BCFW09, DGV93, DDMM05, GK08, works [Gre95, LWXS18]. Workshop HHR+10, JLH08, LP15, McC79, Mer90b, [IJW89, ABM06, ODB89, Ano92, BBD09b, Roe94, Rul93, SP91, Sch91a, Sho00a, Tsu92a, BF89, BD08, CP87, CP88, Dam90a, Dam91, Wee07, Win83, Win84, YZ00, Zhe90, CMR98, Dav91, De 95, DSZ07a, DSZ07b, DJRZ06, Gib91, HR07, HYLT99, HL03, KST99, LW04, DJNR09, GQ95, Hel94, QV89, QV90, LHC05, Mer90a, MZI98, NY89b, NY89a, RRS06, Rei88, Rue93, SZ93, Ytr06, vL94, Sim98, SP89, Tsa08, Tsu92b, YL04, ZW05, And94, Bir07, Coh94, Gol96, KI94, Yu92, ZPS90, ZMI91, ZPS93a, ZPS93b, HMNB07]. Ano94, Heu87]. World WCC [Ytr06]. WDDL [MMMT09]. Weak [Ano93a, Dre17c, IEE92a, LC95, KLL+97]. [CFP19, HS08, Lis07, PV07]. Weaknesses worm [FNP09, CF89b]. Worst [BPSN97, DS09c, KCL03, KCC05, SGGB00]. [ANS09, ANS10, DMV04, F+03, FKS84, web [KSC11, KSC12, NMX19, AT18, Lar81, Lar82a, FPSS05, Mic02, MT16]. KLL+97, KSB+99, NM02b, Sch01b, SKC07, Worst-Case [ANS09, ANS10, DMV04, TC04, UCFL08, WY00, WY02, XBH06]. Lar82a, Lar81, Mic02]. Web-Based [Sch01b]. webcam [McN03]. worst-case/average-case [Mic02]. Wegman [Sar80]. Weight [LR96a, LL92]. Wörterbücher [Wen92]. Write Weight-Partitioned [LR96a]. Weighted [Moh90, Moh93, MNS07, ZH18, ZHZ+19]. [Ban77, Luc72, THY+18, Yao91, YZ00, SN19]. Write-Ahead [Moh90, Moh93]. Weighting [DSS17]. West [Yao78]. WG Write-Friendly [ZH18]. Write-Once [vL94]. WHAM [LPT12]. Wheels [MNS07]. Wro claw [ACJT07]. WSN [VL87, VL97]. Where [Bur06, SW91]. [DL12]. WSNs [YLSZ19]. Wyner Which [FW76, FW77]. WHIRLPOOL [DVS+14]. [RB01, Sas11, Sta06a]. Whirlwind [BNN+10]. White [BZZ12, IEE88c]. whole x [PvO95]. X9.30 [ANS97]. X9.30-2 [Pat95]. whom [LC95]. Whose [Gra94b]. [ANS97]. X9.62 [ANS05]. Xeon [JHL+15]. WI [FMA02]. Wide [KLL+97, MPST16]. XML Wien [Kui92]. Will [DCW91]. windowed [CN07, KRML09, MK12, WLLG08, WWZ09]. REFERENCES 70

XMSS [HRB13, HBG+17]. xor [FJ13, volume 450 of Lecture Notes CCHK08, MLP07, VD05, vdBGLGL+16]. in Computer Science. Spring- XOR-based [CCHK08, VD05]. XPS er-Verlag, Berlin, Germany / [Ger95]. XRDB [YNKM89]. XSB [SSW94]. Heidelberg, Germany / Lon- XTEA [CV05]. don, UK / etc., 1990. ISBN 0- 387-52921-7. LCCN QA9.58 year [Roe95]. Years [Kon10, IEE01, KR19]. .I58 1990. Yi [Wag00]. Yi-Lam [Wag00]. Ynot Anderson:1979:CPH [NMS+08]. Yokohama [AiNOW11]. Yo o [KCC05]. Yo on [KCC05]. York [AA79a] M. R. Anderson and M. G. [ACM12, GSW98, HF13, IEE90, IEE99, Anderson. Comments on per- Mat09, IEE90, Jen76]. Yorktown [Jen76]. fect hashing functions: a sin- YY [Nat92]. gle probe retrieving method for static sets. Commu- Zahlen [BJMM94b, BJMM94a]. Zakopane nications of the Association [Win78]. Zeiteffizienten [Kue83]. Zemor for Computing Machinery,22 [Gei95, Gei96, GIMS11, PVCQ08, TNS20]. (2):104, February 1979. CO- Zero [CLP13, Dam93, OVY94b, Dam94, DEN CACMA2. ISSN 0001- OVY94a]. Zero-Knowledge [CLP13, 0782 (print), 1557-7317 (elec- Dam93, OVY94b, Dam94, OVY94a]. Zheng tronic). Corrects errors in [PGV93a, PGV90a, PGV93b]. Zheng- [Spr77]. See also corrigen- Matsumoto-Imai [PGV93a, PGV93b]. Zip- dum: [AA79b]. per [LWWQ08]. Ziv [DVS+14]. Zoning [GRZ93]. Zugriffsoperationen [Pei82]. zu- Anderson:1979:CCP griffsverfahren [Stu82]. zum [Eck74a]. zur [AA79b] M. R. Anderson and M. G. [Koe72, Kue83, Kue84a, Pet83]. Zurich Anderson. Corrigendum: [HKNW07, Lak96]. “Comments on Perfect Hash- ing Functions: A Single References Probe Retrieving Method for Static Sets”. Communi- ACM:1969:PAN cations of the Association [??69] ??, editor. Proceedings 1969 for Computing Machinery,22 ACM 24th National Confer- (10):553, October 1979. CO- ence. ACM Press, New York, DEN CACMA2. ISSN 0001- NY 10036, USA, ?? 1969. 0782 (print), 1557-7317 (elec- LCCN ?? tronic). Corrects [AA79a]. Asano:1990:ISS Ausiello:1986:IIC

[A+90] Tetsuo Asano et al., edi- [AA86] Giorgio Ausiello and Paolo tors. Algorithms: Inter- Atzeni, editors. ICDT ’86: national Symposium SIGAL International Conference on ’90, Tokyo, Japan, August Database Theory, Rome, 16–18, 1990: Proceedings, Italy, September 8–10, 1986: REFERENCES 71

proceedings. Springer-Verlag, 9743 (print), 1611-3349 (elec- Berlin, Germany / Heidel- tronic). LCCN QA76.9.A25. berg, Germany / London, URL http://eprint.iacr. UK / etc., 1986. ISBN 3-540- org/2014/694; http:// 17187-8. LCCN QA76.9.D3 link.springer.com/chapter/ I55824 1986. 10.1007/978-3-319-13051- Ajtai:1992:FTG 4_1; https://malicioussha1. github.io/. [AAB+92] M. Ajtai, N. Alon, J. Bruck, R. Cypher, C. Ho, M. Naor, Anshel:2016:CHF and E. Szemerédi. Fault tol- [AAGG16] Iris Anshel, Derek Atkins, erant graphs, perfect hash Dorian Goldfeld, and Paul E. functions and disjoint paths. Gunnells. A class of hash In IEEE-FOCS’92 [IEE92b], functions based on the al- pages 693–702. ISBN 0-8186- gebraic eraserTM. Groups. 2900-2. LCCN QA 76 S979 Complexity. Cryptology,8 1992. (1):1–7, 2016. CODEN Apers:2001:PTS ???? ISSN 1867-1144 (print), 1869-6104 (electronic). [AAC+01] Peter M. G. Apers, Paolo Atzeni, Stefano Ceri, Ste- Aamodt:2003:CSP fano Paraboschi, Kota- [Aam03] Ken S. Aamodt. Acryp- giri Ramamohanarao, and tographically secure pseu- Richard T. Snodgrass, ed- dorandom number genera- itors. Proceedings of the tor. Ph.D. thesis, Purdue Twenty-seventh International University, West Lafayette, Conference on Very Large IN, USA, December 2003. Data Bases: Roma, Italy, 147 pp. URL http:// 11–14th September, 2001. catalog.lib.purdue.edu/ Morgan Kaufmann Publish- Find/Record/1380784; ers, San Francisco, CA, 2001. http://search.proquest. ISBN 1-55860-804-4. LCCN com/docview/305316022? QA76.9.D3 I559 2001. accountid=14677. Albertini:2014:MHE Anderson:1996:TFN [AAE+14] Ange Albertini, Jean-Philippe [AB96] Ross Anderson and Eli Bi- Aumasson, Maria Eichlseder, ham. Tiger: a fast new hash Florian Mendel, and Martin function. Lecture Notes in Schläffer. Malicious hash- CS, 1039:89–97, 1996. CO- ing: Eve’s variant of SHA-1. DEN LNCSD9. ISSN 0302- In Joux and Youssef [JY14], 9743 (print), 1611-3349 (elec- pages 1–19. ISBN 3-319- tronic). URL http://www. 13050-1 (print), 3-319-13051- springerlink.com/link. X (e-book). ISSN 0302- asp?id=fx0261047446n136; REFERENCES 72

http://www.springerlink. Agrawal:1993:ICV com/openurl.asp?genre= article&id=doi:10.1007/ [ABB93] Rakesh Agrawal, Seán Baker, 3-540-60865-6_46; http: and David Bell, editors. 19th //www.springerlink.com/ International Conference on openurl.asp?genre=article& Very Large Data Bases, Au- issn=0302-9743&volume= gust 24th-27th 1993, Dublin, 1039&spage=89. Ireland Proceedings, Proceed- ings of the International Con- Aumasson:2012:SFS ference on Very Large Data Bases. Morgan Kaufmann [AB12] Jean-Philippe Aumasson and Publishers, San Francisco, Daniel J. Bernstein. SipHash: CA, 1993. ISBN 1-55860-152- a fast short-input PRF. Lec- X. ISSN 0730-9317. LCCN ture Notes in CS, 7668: QA76.9.D3 I61 1993. 489–508, 2012. CODEN Ahmed:2016:RN LNCSD9. ISSN 0302-9743 + (print), 1611-3349 (elec- [ABC 16] Reaz Ahmed, Faizul Bari, tronic). URL http://link. Shihabur Rahman Chowd- springer.com/content/pdf/ hury, Golam Rabbani, Raouf 10.1007/978-3-642-34931- Boutaba, Bertrand Mathieu, 7_28. Reaz Ahmed, Faizul Bari, Shihabur Rahman Chowd- Alwen:2017:TPA hury, Golam Rabbani, Raouf Boutaba, and Bertrand [AB17] Joël Alwen and Jeremiah Mathieu. αroute: Routing on Blocki. Towards practical at- names. IEEE/ACM Trans- tacks on Argon2i and bal- actions on Networking,24 loon hashing. In IEEE, ed- (5):3070–3083, October 2016. itor, Proceedings 2nd IEEE CODEN IEANEP. ISSN European Symposium on Se- 1063-6692 (print), 1558-2566 curity and Privacy, 26–28 (electronic). April 2017, Paris, France, Andreeva:2016:NSP pages 142–157. IEEE Com- puter Society Press, 1109 [ABD+16] Elena Andreeva, Charles Spring Street, Suite 300, Sil- Bouillaguet, Orr Dunkel- ver Spring, MD 20910, USA, man, Pierre-Alain Fouque, 2017. ISBN 1-5090-5761-7. Jonathan Hoch, John Kelsey, LCCN ???? URL https: Adi Shamir, and Sébastien //ieeexplore.ieee.org/ Zimmer. New second- document/7961977. IEEE preimage attacks on hash Computer Society Order functions. Journal of Number E6100. See [BDK16, Cryptology, 29(4):657–696, BCGS16]. October 2016. CODEN REFERENCES 73

JOCREQ. ISSN 0933- Ailamaki:2006:PIW 2790 (print), 1432-1378 (electronic). URL http://link. [ABM06] Anastassia Ailamaki, Peter springer.com/accesspage/ Boncz, and Stefan Mane- article/10.1007/s00145- gold, editors. Proceedings of 015-9206-4; http://link. the 2nd International Work- springer.com/article/10. shop on Data Management 1007/s00145-015-9206-4. on New Hardware: 2006, Chicago, Illinois, June 25– Arnold:1973:UHA 25, 2006. ACM Press, New [ABH+73] R.F.Arnold,W.E.Bass, York, NY 10036, USA, 2006. M. H. Hartung, F. D. Snow, ISBN 1-59593-466-9. LCCN and R. D. Iii Stephens. Uni- QA76.9.D3 I58388 2006. form hashing algorithm. IBM URL http://portal.acm. Technical Disclosure Bul- org/toc.cfm?id=1140402. letin, 16(7):2214–2216, De- Andreeva:2012:SAS cember 1973. CODEN IBM- TAA. ISSN 0018-8689. [ABM+12] Elena Andreeva, Andrey Bogdanov, Bart Mennink, Abidin:2012:SUH Bart Preneel, and Chris- [Abi12] Aysajan Abidin. On secu- tian Rechberger. On security of universal hash func- rity arguments of the section based multiple authen- ond round SHA-3 candidates. tication. Lecture Notes in International Journal of In- CS, 7618:303–310, 2012. CO- formation Security, 11(2): DEN LNCSD9. ISSN 0302- 103–120, April 2012. CO- 9743 (print), 1611-3349 (elec- DEN ???? ISSN 1615- tronic). URL http://link. 5262 (print), 1615-5270 (elec- springer.com/content/pdf/ tronic). URL http://link. 10.1007/978-3-642-34129- springer.com/article/10. 8_27. 1007/s10207-012-0156-7. Azar:1999:BA At:2017:LAU [ABKU99] Yossi Azar, Andrei Z. [ABO+17] Nuray At, Jean-Luc Beuchat, Broder, Anna R. Karlin, and Eiji Okamoto, Ismail San, Eli Upfal. Balanced al- and Teppei Yamazaki. A locations. SIAM Journal low-area uniﬁed hardware on Computing, 29(1):180– architecture for the AES 200, February 1999. CO- and the cryptographic hash DEN SMJCAT. ISSN 0097- function Grøstl. Jour- 5397 (print), 1095-7111 (elec- nal of Parallel and Dis- tronic). URL http:// tributed Computing, 106(??): epubs.siam.org/sam-bin/ 106–120, August 2017. CO- dbq/article/28849. DEN JPDCER. ISSN REFERENCES 74

0743-7315 (print), 1096-0848 3-540-73419-8. ISSN 0302- (electronic). URL http: 9743 (print), 1611-3349 (elec- //www.sciencedirect.com/ tronic). LCCN QA267 .I55 science/article/pii/S0743731517300485. 2007. URL http://site. ebrary.com/lib/stanford/ Amdahl:1953:xxx Doc?id=10251846; http: [ABRS53] Gene M. Amdahl, Elaine M. //www.myilibrary.com?id= Boehme, Nathaniel Rochester, 135198; http://www.springerlink. and Arthur L. Samuel. ??? com/content/978-3-540- The year is uncertain (???). 73419-2; http://www. Amdahl originated the idea springerlink.com/openurl. of open addressing with asp?genre=book\%26isbn= linear probing, which was 978-3-540-73419-2; http: later independently rediscov- //www.springerlink.com/ ered and published [Ers58b]. openurl.asp?genre=issue\ The term ‘open addressing’ %26issn=0302-9743\%26volume= was apparently ﬁrst used in 4596. [Pet57] [see [Kno75, page Ackerman:1974:QSH 274].], 1953. [Ack74] A. Frank Ackerman. Quadratic Atkinson:1974:FPQ search for hash tables of [AC74] L. V. Atkinson and A. J. Cor- size pn. Communications nah. Full period quadratic of the Association for Com- hashing. International Jour- puting Machinery, 17(3): nal of Computer Mathemat- 164, March 1974. CO- ics, 4(2):177–189, September DEN CACMA2. ISSN 0001- 1974. CODEN IJCMAT. 0782 (print), 1557-7317 (elec- ISSN 0020-7160. tronic). Arge:2007:ALP ACM:1975:PSA [ACJT07] L. (Lars) Arge, Chris- tian Cachin, Tomasz Jur- [ACM75a] ACM, editor. Proceedings of dzinski, and Andrzej Tar- Seventh Annual ACM Sym- lecki, editors. Automata, posium on Theory of Com- languages and program- puting, Albuquerque, New ming: 34th international Mexico, May 5–7, 1975. colloquium, ICALP 2007, ACM Press, New York, NY Wroc law, Poland, July 9- 10036, USA, 1975. 13, 2007: proceedings,vol- ACM:1975:DUO ume 4596 of Lecture Notes in Computer Science. Spring- [ACM75b] Data: Its Use, Organization er-Verlag, Berlin, Germany / and Management: ACM Pa- Heidelberg, Germany / Lon- ciﬁc 75, Sheraton-Palace Ho- don, UK / etc., 2007. ISBN tel, San Francisco, April 17– REFERENCES 75

18, 1975. ACM Press, New ACM:1979:PSS York, NY 10036, USA, 1975. [ACM79] Proceedings of the SIG- ACM:1975:CRS PLAN Symposium on Com- piler Construction: papers [ACM75c] Conference Record of Sev- presented at the symposium, enth Annual ACM Sympo- Denver, Colorado, August 6– sium on Theory of Com- 10, 1979, SIGPLAN notices; puting: Papers Presented at v. 14, no. 8. ACM Press, New the Symposium, Albuquerque, York, NY 10036, USA, 1979. New Mexico, May 5–7, 1975. LCCN QA 76.7 A1095 v.14 ACM Press, New York, NY pt.2. 10036, USA, 1975.

ACM:1976:CRE ACM:1981:ASI

[ACM76] Conference Record of the [ACM81] ACM, editor. ACM- Eighth Annual ACM Sympo- SIGMOD 1981 International sium on Theory of Comput- Conference on Management ing: Papers Presented at the of Data: [proceedings] April Symposium, Hershey, Penn- 29–May 1, The University sylvania, May 3–5, 1976. of Michigan, Ann Arbor, ACM Press, New York, NY Michigan. ACM Press, New 10036, USA, 1976. York, NY 10036, USA, 1981. ISBN 0-89791-040-0. LCCN SIGACT:1977:PNA QA76.9.D3 I59 1981.

[ACM77a] ACM SIGACT, editor. Pro- ACM:1982:SPD ceedings of the Ninth Annual ACM Symposium on Theory [ACM82] Proceedings of the ACM of Computing. ACM Press, Symposium on Principles New York, NY 10036, USA, of Database Systems: 29– 1977. LCCN QA76.6 .A13 31 March 1982, Marina 1977. del Ray Hotel, Los Ange- ACM:1977:CRN les, California/Special In- terest Group for Automata [ACM77b] Conference Record of the and Computability Theory Ninth Annual ACM Sympo- (SIGACT), Special Interest sium on Theory of Comput- Group for the Management ing: Papers Presented at the of Data (SIGMOD).ACM Symposium, Boulder, Col- Press, New York, NY 10036, orado, May 2–4, 1977.ACM USA, 1982. ISBN 0-89791- Press, New York, NY 10036, 070-2. LCCN QA76.9.D3 USA, 1977. A33 1982. US$24.00. REFERENCES 76

ACM:1983:PAS ACM:1985:RCM

[ACM83a] ACM, editor. Proceedings [ACM85a] The Range of Computing: of the 2nd ACM SIGACT- Mid-80’s Perspective: 1985 SIGMOD Symposium on ACM Annual Conference, Principles of Database Sys- October 14–16, 1985, Radis- tems: 21–23 March 1983, son Hotel Denver, Denver, Colony Square Hotel, At- Colorado: Proceedings.ACM lanta, Georgia. ACM Press, Press, New York, NY 10036, New York, NY 10036, USA, USA, 1985. ISBN 0-89791- 1983. 170-9. LCCN QA 76 R36 1985. ACM:1983:PSA ACM:1985:PFA

[ACM83b] Proceedings of the Second [ACM85b] Proceedings of the Fourth ACM SIGACT-SIGMOD ACM SIGACT-SIGMOD Symposium on Principles Symposium on Principles of of Database Systems: 21– Database Systems, March 23 March 1983, Colony 25–27, 1985, Portland, Ore- Square Hotel, Atlanta, Geor- gon. ACM Press, New York, gia. ACM Press, New NY 10036, USA, 1985. ISBN York, NY 10036, USA, 0-89791-153-9. LCCN QA 1983. ISBN 0-89791-097-4. 76.9 D3 A296 1985. LCCN QA76.9.D3 A15 1983. US$25.00. ACM:1986:PFA [ACM86a] Proceedings of the Fifth ACM:1984:SPA ACM SIGACT-SIGMOD Symposium on Principles of [ACM84a] SIGMOD ’84: Proceedings Database Systems, March of Annual Meeting, Boston, 24–26, 1986, Cambridge, MA, June 18–21, 1984.ACM MA. ACM Press, New Press, New York, NY 10036, York, NY 10036, USA, USA, 1984. ISBN 0-89791- 1986. ISBN 0-89791-179- 128-8. LCCN QA76.9.D3 2. LCCN QA76.9.D3 A296 A15 1984. 1986. US$24.00. ACM:1984:PSA ACM:1986:PEA

[ACM84b] Proceedings of the Sixteenth [ACM86b] Proceedings of the Eighteenth Annual ACM Symposium on Annual ACM Symposium Theory of Computing: Wash- on Theory of Computing: ington, DC, April 30-May 2, Berkeley, California, May 1984. ACM Press, New York, 28–30, 1986. ACM Press, NY 10036, USA, 1984. New York, NY 10036, USA, REFERENCES 77

1986. ISBN 0-89791-193-8. Principles of Database Sys- LCCN QA76.6 .A14 198. tems, March 29–31, 1989, Philadelphia, PA.ACM ACM:1987:PEA Press, New York, NY 10036, [ACM87] Proceedings of the Eleventh USA, 1989. ISBN 0-89791- ACM Symposium on Operat- 308-6. LCCN QA 76.9 D3 ing Systems Principles: 8– A26 1989. 11 November 1987, Stouf- ACM:1989:PEA fer Austin Hotel, Austin, TX. IEEE Computer Soci- ety Press, 1109 Spring Street, [ACM89b] Proceedings of the Eighth Suite 300, Silver Spring, MD ACM SIGACT-SIGMOD- 20910, USA, 1987. ISBN 0- SIGART Symposium on 89791-242-x. LCCN QA76.6 Principles of Database Sys- .O625 v.21:5. tems, March 29–31, 1989, Philadelphia, PA.ACM ACM:1988:PPS Press, New York, NY 10036, USA, 1989. ISBN 0-89791- [ACM88a] ACM, editor. PODS ’88. 308-6. LCCN QA 76.9 D3 Proceedings of the Seventh A26 1989. ACM SIGACT-SIGMOD- SIGART Symposium on ACM:1989:PTF Principles of Database Sys- tems: March 21–23, 1988, [ACM89c] Proceedings of the Twenty Austin, Texas. ACM Press, First Annual ACM Sympo- New York, NY 10036, USA, sium on Theory of Com- 1988. ISBN 0-89791-263-2. puting: Seattle, Washing- LCCN QA76.9.D3 A15 1988. ton, May 15–17, 1989.ACM ACM:1988:PTA Press, New York, NY 10036, USA, 1989. ISBN 0-89791- [ACM88b] Proceedings of the Twenti- 307-8. LCCN QA 76.6 A13 eth Annual ACM Symposium 1989. on Theory of Computing: Chicago, Illinois, May 2–4, ACM:1990:PTS 1988. ACM Press, New York, NY 10036, USA, 1988. ISBN [ACM90] Proceedings of the Twenty 0-89791-264-0. LCCN QA Second Annual ACM Sym- 76.6 A13 1988. posium on Theory of Com- ACM:1989:PPE puting: Baltimore, Mary- land, May 14–16, 1990.ACM [ACM89a] ACM, editor. PODS ’89. Press, New York, NY 10036, Proceedings of the Eighth USA, 1990. ISBN 0-89791- ACM SIGACT-SIGMOD- 361-2. LCCN QA 76.6 A13 SIGART Symposium on 1990. REFERENCES 78

ACM:1991:PPE 21–23 January 1991.ACM Press, New York, NY 10036, [ACM91a] ACM, editor. POPL ’91. USA, 1991. ISBN 0-89791- Proceedings of the eighteenth 419-8. LCCN QA76.7 .A15 annual ACM symposium on 1991. Principles of programming ACM:1991:PTT languages, January 21–23, 1991, Orlando, FL.ACM [ACM91e] Proceedings of the Twenty Press, New York, NY 10036, Third Annual ACM Sympo- USA, 1991. ISBN ???? sium on Theory of Comput- LCCN ???? ing: New Orleans, Louisiana, ACM:1991:ACS May 6–8, 1991. ACM Press, New York, NY 10036, USA, [ACM91b] ACM Computer Science 1991. ISBN 0-89791-397-3. Conference (19th: 1991: San LCCN QA 76.6 A13 1991. Antonio, Tex.) 1991 ACM Computer Science Confer- ACM:1994:CCS ence: March 5–7, 1991, San [ACM94a] ACM, editor. Computer and Antonio Convention Center, communications security: San Antonio, Texas: proceed- 2nd conference — Novem- ings: preparing for the 21st ber 1994, Fairfax, VA,ACM century. ACM Press, New CONFERENCE ON COM- York, NY 10036, USA, 1991. PUTER AND COMMUNI- ISBN 0-89791-382-5. LCCN CATIONS SECURITY 1994; QA76.5 .A137 1991. 2nd. ACM Press, New York, ACM:1991:AAS NY 10036, USA, 1994. ISBN 0-89791-732-4. LCCN ???? [ACM91c] 3rd Annual ACM Sympo- ACM:1994:IPI sium on Parallel Algorithms and Architectures, July 21– [ACM94b] ACM, editor. ISSAC ’94: 24, 1991, Hilton Head, South Proceedings of the 1994 In- Carolina: SPAA ’91.ACM ternational Symposium on Press, New York, NY 10036, Symbolic and Algebraic Com- USA, 1991. ISBN 0-89791- putation: July 20–22, 1994, 438-4. LCCN QA76.58 .A27 Oxford, England, United 1991. Kingdom. ACM Press, New York, NY 10036, USA, 1994. ACM:1991:CRE ISBN 0-89791-638-7. LCCN [ACM91d] Conference record of the QA76.95.I59 1994. Eighteenth Annual ACM ACM:1994:MMC Symposium on Principles of Programming Languages: pa- [ACM94c] ACM, editor. Measurement pers presented at the sym- and modeling of computer posium, Orlando, Florida, systems: Conference — May REFERENCES 79

1994, Nashville, TN,volume York, NY 10036, USA, 1997. 22 (1) of PERFORMANCE CODEN PAAAF2. ISBN 0- EVALUATION REVIEW 89871-390-0. LCCN ???? 1994. ACM Press, New York, ACM:1997:PTN NY 10036, USA, 1994. CO- DEN PEREDN. ISBN 0- [ACM97b] ACM, editor. Proceedings 89791-659-X. ISSN 0163- of the twenty-ninth annual 5999 (print), 1557-9484 (elec- ACM Symposium on the tronic). LCCN ???? Theory of Computing: El Paso, Texas, May 4–6, 1997. ACM-SIAM:1994:ASD ACM Press, New York, NY [ACM94d] Proceedings of the ﬁfth an- 10036, USA, 1997. ISBN 0- nual ACM-SIAM Symposium 89791-888-6. LCCN QA76.5 on Discrete Algorithms, Ar- .A849 1997. ACM order no. lington, VA, USA. Society for 508970. Industrial and Applied Math- ACM:1998:PTA ematics, Philadelphia, PA, USA, 1994. ISBN 0-89871- [ACM98] ACM, editor. Proceedings 329-3. LCCN QA76.6 .A278 of the thirtieth annual ACM 1994. Symposium on Theory of ACM:1996:PTE Computing: Dallas, Texas, May 23–26, 1998.ACM [ACM96] ACM, editor. Proceed- Press, New York, NY 10036, ings of the twenty-eighth an- USA, 1998. ISBN 0-89791- nual ACM Symposium on 962-9. LCCN QA75.5 .A14 the Theory of Computing, 1998. ACM order number Philadelphia, Pennsylvania, 508980. May 22–24, 1996.ACM ACM:2001:PAA Press, New York, NY 10036, USA, 1996. ISBN 0-89791- [ACM01] ACM, editor. Proceedings of 785-5. LCCN QA 76.6 A13 the 33rd Annual ACM Sym- 1996. ACM order no. 508960. posium on Theory of Com- Also known as Federated puting: Hersonissos, Crete, Computing Research Confer- Greece, July 6–8, 2001.ACM ence (FCRS ’96). Press, New York, NY 10036, USA, 2001. ISBN 1-58113- ACM:1997:PEA 349-9. LCCN QA76.6 .A13 [ACM97a] ACM, editor. Proceedings 2001. ACM order number of the Eighth Annual ACM- 508010. SIAM Symposium on Dis- ACM:2002:PTF crete Algorithms, New Or- leans, Louisiana, January 5– [ACM02] ACM, editor. Proceedings 7, 1997. ACM Press, New of the Thiry-Fourth Annual REFERENCES 80

ACM Symposium on The- Spring Street, Suite 300, Sil- ory of Computing, Montr´eal, ver Spring, MD 20910, USA, Qu´ebec, Canada, May 19– 2004. ISBN 0-7695-2153-3. 21, 2002. ACM Press, New LCCN ???? York, NY 10036, USA, 2002. ISBN 1-58113-495-9. LCCN ACM:2005:PSA QA75.5 .A22 2002. ACM order number 508020. [ACM05] ACM, editor. Proceedings of the Sixteenth Annual ACM- ACM:2003:PTF SIAM Symposium on Dis- [ACM03a] ACM, editor. Proceedings crete Algorithms, Vancouver, of the Thirty-Fifth ACM BC, Canada, January 23– Symposium on Theory of 25, 2005, Discrete Mathe- Computing, San Diego, CA, matics and Computer Sci- USA, June 9–11, 2003.ACM ence Ser. Society for Indus- Press, New York, NY 10036, trial and Applied Mathemat- USA, 2003. ISBN ???? ics, Philadelphia, PA, USA, LCCN QA75.5 .A22 2003. 2005. ISBN 0-89871-585-7. ACM order number 508030. LCCN QA76.6 A184p 2005. URL http://dl.acm.org/ ACM:2003:SII citation.cfm?id=1070432. [ACM03b] ACM, editor. SC2003: Ignit- ACM:2007:SPA ing Innovation. Phoenix, AZ, November 15–21, 2003.ACM [ACM07] ACM, editor. STOC ’07: Press and IEEE Computer proceedings of the 39th An- Society Press, New York, nual ACM Symposium on NY 10036, USA and 1109 Theory of Computing, San Spring Street, Suite 300, Sil- Diego, California, USA, ver Spring, MD 20910, USA, June 11–13, 2007.ACM 2003. ISBN 1-58113-695-1. Press, New York, NY 10036, LCCN ???? USA, 2007. ISBN 1-59593- ACM:2004:SHP 631-9. LCCN ???? [ACM04] ACM, editor. SC 2004: ACM:2008:PNA High Performance Comput- ing, Networking and Stor- [ACM08a] ACM, editor. Proceedings age: Bridging communities: of the Nineteenth Annual Proceedings of the IEEE/ ACM-SIAM Symposium on ACM Supercomputing 2004 Discrete Algorithms: [San Conference, Pittsburgh, PA, Francisco, CA, January 20– November 6–12, 2004.ACM 22, 2008]. ACM Press, New Press and IEEE Computer York, NY 10036, USA, 2008. Society Press, New York, ISBN 0-89871-647-0. LCCN NY 10036, USA and 1109 QA76.9.A43 A34 2008. REFERENCES 81

ACM:2008:SPA ture Notes in CS, 5677: 671–689, 2009. CODEN [ACM08b] ACM, editor. STOC ’08: LNCSD9. ISSN 0302-9743 proceedings of the 40th An- (print), 1611-3349 (elec- nual ACM Symposium on tronic). URL http://link. Theory of Computing, Vic- springer.com/content/pdf/ toria, British Columbia, 10.1007/978-3-642-03356- Canada, May 17–20, 2008. 8_39. ACM Press, New York, NY 10036, USA, 2008. ISBN 1- Alomair:2010:PPS 60558-047-3. LCCN QA76.6 [ACP10] Basel Alomair, Andrew .A152 2008. Clark, and Radha Pooven- ACM:2011:PAI dran. The power of primes: security of authentication [ACM11] ACM, editor. Proceedings based on a universal hash- of the 2011 ACM Interna- function family. Journal of tional Symposium on The- Mathematical Cryptology,4 ory of Computing: June 6–8, (2):121–148, 2010. CODEN 2011, San Jose, CA, USA. ???? ISSN 1862-2976 (print), ACM Press, New York, NY 1862-2984 (electronic). 10036, USA, 2011. ISBN ???? LCCN ???? URL http: Alvarez-Cubero:2016:AVL //www.gbv.de/dms/tib-ub- hannover/63314455x.. [ACZ16]´ JoséAntonioAlvarez-Cubero´ and Pedro J. Zufiria. Algo- ACM:2012:SPA rithm 959: VBF: a library [ACM12] ACM, editor. STOC’12: of C++ classes for vector Proceedings of the 2012 ACM Boolean functions in cryptog- International Symposium on raphy. ACM Transactions Theory of Computing: May on Mathematical Software, 19–22, 2012, New York, 42(2):16:1–16:22, May 2016. NY, USA. ACM Press, New CODEN ACMSCU. ISSN York, NY 10036, USA, 2012. 0098-3500 (print), 1557-7295 ISBN 1-4503-1245-4. LCCN (electronic). ???? URL http://www.gbv. Ahrens:1985:SRS de/dms/tib-ub-hannover/ 63314455x.. [AD85] J. H. Ahrens and U. Di- Abdalla:2009:SPH eter. Sequential random sampling. ACM Transactions on [ACP09] Michel Abdalla, Céline Cheva- Mathematical Software,11 lier, and David Pointcheval. (2):157–169, June 1985. CO- Smooth projective hash- DEN ACMSCU. ISSN 0098- ing for conditionally ex- 3500 (print), 1557-7295 (elec- tractable commitments. Lec- tronic). REFERENCES 82

Adams:2008:ENE itors. Automata, languages and programming: [AD08] Michael D. Adams and 35th international collo- R. Kent Dybvig. Effi- quium, ICALP 2008, Reyk- cient nondestructive equal- javik, Iceland, July 7–11, ity checking for trees and 2008, proceedings, part I,vol- graphs. SIGPLAN No- ume 5125 of Lecture Notes tices, 43(9):179–188, Septem- in Computer Science. Spring- ber 2008. CODEN SIN- er-Verlag, Berlin, Germany / ODQ. ISSN 0362-1340 Heidelberg, Germany / Lon- (print), 1523-2867 (print), don, UK / etc., 2008. ISBN 1558-1160 (electronic). 3-540-70574-0 (softcover). LCCN ???? URL http: Ashur:2011:LAR //www.springerlink.com/ [AD11] Tomer Ashur and Orr content/7818221152674403/ Dunkelman. Linear analy- ; http://www.springerlink. sis of reduced-round Cube- com/content/978-3-540- Hash. Lecture Notes in CS, 70574-1. 6715:462–478, 2011. CO- Heide:1990:DHS DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [adH90] Meyer auf der Heide. Dy- tronic). URL http://link. namic hashing strategies. springer.com/content/pdf/ In Rovan [Rov90], page ?? 10.1007/978-3-642-21554- ISBN 0-387-52953-5 (New 4_27. York), 3-540-52953-5 (Berlin). LCCN QA76.9.M35 M386 Ayday:2012:DAA 1990. [ADF12] Erman Ayday, Farshid Del- Heide:1993:HSS gosha, and Faramarz Fekri. [adH93] Friedhelm Meyer auf der Data authenticity and avail- Heide. Hashing strategies ability in multihop wire- for simulating shared mem- less sensor networks. ACM ory on distributed mem- Transactions on Sensor ory machines. In auf der Networks, 8(2):10:1–10:??, Heide et al. [adHMR93], March 2012. CODEN page ?? ISBN 0-387-56731- ???? ISSN 1550-4859 (print), 3 (New York), 3-540-56731- 1550-4867 (electronic). 3 (Berlin). LCCN QA76.58 Aceto:2008:ALPa .H45 1992. US$39.00, DM52.00. + [ADG 08] Luca Aceto, Ivan Damg˚ard, Heide:1993:PAE Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir,[adHMR93] Friedhelm Meyer auf der and Igor Walukiewicz, ed- Heide, B. Monien, and REFERENCES 83

Arnold L. Rosenberg, ed- Alon:1999:LHF itors. Parallel architec- + tures and their efficient [ADM 99] Noga Alon, Martin Dietzfel- use: First Heinz Nix- binger, Peter Bro Miltersen, dorf Symposium, Pader- Erez Petrank, and Gábor born, Germany, November Tardos. Linear hash func- 11–13, 1992: proceedings. tions. Journal of the Associa- Springer-Verlag, Berlin, Ger- tion for Computing Machin- many / Heidelberg, Ger- ery, 46(5):667–683, Septem- many / London, UK / etc., ber 1999. CODEN JA- 1993. ISBN 0-387-56731-3 COAH. ISSN 0004-5411 (New York), 3-540-56731-3 (print), 1557-735X (elec- (Berlin). LCCN QA76.58 tronic). URL http://www. .H45 1992. US$39.00, acm.org/pubs/citations/ DM52.00. journals/jacm/1999-46-5/ p667-alon/. Adi:1988:DCC AlMahmoud:2019:SPP [Adi88] W. Adi. Design criteria and complexity eval- [ADOAH19] A. AlMahmoud, E. Dami- uation of a hash-based ani, H. Otrok, and Y. Al- join processor. Technical Hammadi. Spamdoop: a report, Technischen Uni- privacy-preserving big data versität Carolo-Wilhelmina platform for collaborative zu Braunschweig, Braun- spam detection. IEEE Trans- schweig, Germany, 1988. ?? actions on Big Data, 5(3): pp. 293–304, September 2019. Alon:1997:LHG ISSN 2332-7790. Aumuller:2012:EEH [ADM+97] Noga Alon, Martin Diet- zfelbinger, Peter Bro Mil- [ADW12] Martin Aumüller, Martin tersen, Erez Petrank, and Dietzfelbinger, and Philipp Gábor Tardos. Is lin- Woelfel. Explicit and effi- ear hashing good? In cient hash families suffice for ACM [ACM97b], pages 465– cuckoo hashing with a stash. 474. ISBN 0-89791-888- In Epstein and Ferragina 6. LCCN QA76.5 .A849 [EF12], pages 108–120. CO- 1997. URL http://www. DEN LNCSD9. ISBN 3-642- acm.org/pubs/articles/ 33089-4 (soft cover). ISSN proceedings/stoc/258533/ 0302-9743 (print), 1611- p465-alon/p465-alon.pdf; 3349 (electronic). LCCN http://www.acm.org/pubs/ ???? URL http:/ citations/proceedings/ /www.springerlink.com/ stoc/258533/p465-alon/. content/d7q7818203k8406t/ ACM order no. 508970. . REFERENCES 84

Aumuller:2014:EEH volume 23 of AFIPS conference proceedings. Spartan [ADW14] Martin Aumüller, Martin Books, New York, NY, USA, Dietzfelbinger, and Philipp 1963. LCCN TK7885.A1 J6 Woelfel. Explicit and effi- 1963. cient hash families suffice for cuckoo hashing with a stash. AFIPS:1969:ACP Algorithmica, 70(3):428–456, [AFI69] 1969 Fall Joint Computer November 2014. CODEN Conference, November 18– ALGOEJ. ISSN 0178- 20, 1969, Las Vegas, Nevada, 4617 (print), 1432-0541 (elec- volume 35 of AFIPS con- tronic). URL http://link. ference proceedings.AFIPS springer.com/article/10. Press, Montvale, NJ, USA, 1007/s00453-013-9840-x. 1969. LCCN TK7885.A1 J6 Atighehchi:2009:EPA 1969. [AEMR09] Kévin Atighehchi, Adriana Ajtai:1983:HFP Enache, Traian Muntean, [AFK83] M. Ajtai, M. Fredman, and and Gabriel Risterucci. An J. Komlos. Hash functions for efficient parallel algorithm priority queues. Annual Sym- for Skein hash functions. posium on Foundations of Report, ERISCS Research Computer Science (Proceed- Group, Universitédela ings), pages 299–303, 1983. Méditerranée, Parc Scien- CODEN ASFPDV. ISBN tifique de Luminy-Marseille, 0-8186-0508-1. ISSN 0272- France, September 30, 2009. 5428. IEEE Service Cent. 11 pp. Piscataway, NJ, USA. Anagnostopoulos:2018:RES Ajtai:1984:HFP [AEP18] Evangelos Anagnostopoulos, Ioannis Z. Emiris, and Ioan- [AFK84] M. Ajtai, M. Fredman, and nis Psarros. Randomized J. Komlòs. Hash functions embeddings with slack and for priority queues. Informa- high-dimensional approxi- tion and Control, 63(3):217– mate nearest neighbor. ACM 225, December 1984. CO- Transactions on Algorithms, DEN IFCNA4. ISSN 0019- 14(2):18:1–18:??, June 2018. 9958 (print), 1878-2981 (elec- CODEN ???? ISSN 1549- tronic). 6325 (print), 1549-6333 (elec- Akl:1990:ACI tronic). [AFK90] Selim G. Akl, F. Fiala, and AFIPS:1963:PSJ Waldemar W. Koczkodaj, [AFI63] Proceedings 1963 Spring editors. Advances in com- Joint Computer Conference, puting and information–ICCI REFERENCES 85

’90 / International Confer- A96 2018. URL https:// ence on Computing and In- nostarch.com/seriouscrypto. formation, Niagara Falls, Canada, May 23–26, 1990, Atighehchi:2019:GHC proceedings. Springer-Verlag, [AGBR19] Kevin Atighehchi, Loubna Berlin, Germany / Heidel- Ghammam, Morgan Bar- berg, Germany / London, bier, and Christophe Rosen- UK / etc., 1990. ISBN 0- berger. GREYC-Hashing: 387-53504-7 (New York), 3- Combining biometrics and 540-53504-7 (Berlin). LCCN secret for enhancing the se- QA75.5 .I578 1990. curity of protected tem- Appel:1993:HCG plates. Future Generation Computer Systems, 101(??): [AG93] Andrew W. Appel and 819–830, December 2019. Marcelo J. R. Goncalves. CODEN FGSEVI. ISSN Hash-consing garbage collec- 0167-739X (print), 1872-7115 tion. Technical Report CS- (electronic). URL http: TR-412-93, Princeton Uni- //www.sciencedirect.com/ versity, Computer Science science/article/pii/S0167739X1833125X. Department, February 1993. ?? pp. Agarwal:2006:AGA Alon:2010:BFP [AGJA06] R. C. Agarwal, K. Gupta, S. Jain, and S. Amala- [AG10] Noga Alon and Shai Gut- purapu. An approxima- ner. Balanced families of per- tion to the greedy algo- fect hash functions and their rithm for diﬀerential com- applications. ACM Trans- pression. IBM Journal of actions on Algorithms, 6(3): Research and Development, 54:1–54:??, June 2010. CO- 50(1):149–??, January 2006. DEN ???? ISSN 1549- CODEN IBMJAE. ISSN 6325 (print), 1549-6333 (elec- 0018-8646 (print), 2151-8556 tronic). (electronic). URL http: //www.research.ibm.com/ Aumasson:2017:SCP journal/rd/501/agarwal. [AG18] Jean-Philippe Aumasson and html. Matthew D. Green. Seri- Abramsky:2010:ALP ous Cryptography: a Prac- tical Introduction to Mod- [AGK+10] Samson Abramsky, Cyril ern Encryption.NoStarch Gavoille, Claude Kirchner, Press, San Francisco, CA, Friedhelm Meyer auf der USA, 2018. ISBN 1-59327- Heide, and Paul G. Spi- 826-8 paperback. xxii + rakis, editors. Automata, 282 pp. LCCN QA76.9.A25 languages and programming: REFERENCES 86

37th International Collo- puter Science. Springer-Ver- quium, ICALP 2010, Bor- lag, Berlin, Germany / Hei- deaux, France, July 6–10, delberg, Germany / Lon- 2010, proceedings,volume don, UK / etc., 2003. CO- 6198–6199 of Lecture Notes DEN LNCSD9. ISBN 3-540- in Computer Science. Spring- 00623-0 (softcover). ISSN er-Verlag, Berlin, Germany / 0302-9743 (print), 1611- Heidelberg, Germany / Lon- 3349 (electronic). LCCN don, UK / etc., 2010. CO- QA75.5 .S956 2003. URL DEN LNCSD9. ISBN 3- http://link.springer-ny. 642-14164-1 (vol. 1: paper- com/link/service/series/ back), 3-642-14161-7 (vol. 0558/tocs/t2607.htm; 2: paperback). ISSN 0302- http://www.springerlink. 9743 (print), 1611-3349 (elec- com/openurl.asp?genre= tronic). LCCN QA267 issue&issn=0302-9743&volume= .I55 2010. URL http: 2607. Also available via the //www.springerlink.com/ World Wide Web. content/978-3-642-14164- Aumasson:2012:QLH 5/. [AHMNP12] Jean-Philippe Aumasson, Angelino:2011:EMM Luca Henzen, Willi Meier, [AGMT11] Elaine Angelino, Michael T. and Mar´ıa Naya-Plasencia. Goodrich, Michael Mitzen- Quark: a lightweight hash. macher, and Justin Thaler. Journal of Cryptology,?? External-memory multimaps. (??):??, ???? 2012. CO- In Asano et al. [AiNOW11], DEN JOCREQ. ISSN pages 384–394. CODEN 0933-2790 (print), 1432-1378 LNCSD9. ISBN 3-642- (electronic). URL http: 25590-6. ISSN 0302-9743 //www.springerlink.com/ (print), 1611-3349 (elec- content/a310430665th50r4/ tronic). URL http:/ . /www.springerlink.com/ Aumasson:2013:QLH content/g37344t4u5112706/ . [AHMNP13] Jean-Philippe Aumasson, Alt:2003:SAS Luca Henzen, Willi Meier, and Mar´ıa Naya-Plasencia. [AH03] Helmut Alt and M. Habib, Quark: a lightweight hash. editors. STACS 2003: 20th Journal of Cryptology, 26(2): Annual Symposium on Theo- 313–339, April 2013. CO- retical Aspects of Computer DEN JOCREQ. ISSN 0933- Science, Berlin, Germany, 2790 (print), 1432-1378 (elec- February 27–March 1, 2003: tronic). URL http://link. Proceedings, volume 2607 springer.com/article/10. of Lecture Notes in Com- 1007/s00145-012-9125-6. REFERENCES 87

Ahn:1986:AH Aiello:1998:NCS

[Ahn86] Ilsoo Ahn. Adaptive hashing. [AHV98] William Aiello, Stuart Haber, Technical report, AT & T and Ramarathnam Venkate- Bell Laboratories, Columbus, san. New constructions for OH, USA, December 1986. 1– secure hash functions. Lec- 21 pp. ture Notes in CS, 1372:150– ??, 1998. CODEN LNCSD9. Ahn:1987:AH ISSN 0302-9743 (print), 1611-3349 (electronic). URL [Ahn87] I. Ahn. Adaptive hashing. http://link.springer-ny. Technical report, ????, 1987. com/link/service/series/ ?? pp. 0558/bibs/1372/13720150. htm; http://link.springer- Ahn:1993:FH ny.com/link/service/series/ [Ahn93] Ilsoo Ahn. Filtered hash- 0558/papers/1372/13720150. ing. In Lomet [Lom93], pages pdf. 85–100. ISBN 0-387-57301- Andoni:2006:NOH 1 (New York), 3-540-57301-1 (Berlin). LCCN QA76.9.D3 [AI06] Alexandr Andoni and Piotr I5535 1993. Indyk. Near-optimal hashing algorithms for approx- Aldous:1992:MSD imate nearest neighbor in [AHS92] David Aldous, Micha Hofri, high dimensions. In IEEE and Wojciech Szpankowski. [IEE06], pages 459–468. Maximum size of a dynamic ISBN 0-7695-2720-5, 0-7695- data structure: Hashing with 2362-5. ISSN 0272-5428. lazy deletion revisited. SIAM LCCN QA76 .S974 2006. Journal on Computing,21 URL http://ieeexplore. (4):713–732, August 1992. ieee.org/servlet/opac? CODEN SMJCAT. ISSN punumber=4031329. IEEE 0097-5397 (print), 1095-7111 Computer Society Order (electronic). Number P2720. Andoni:2008:NOH Aho:1983:DSA [AI08] Alexandr Andoni and Piotr [AHU83] Alfred V. Aho, John E. Indyk. Near-optimal hashing Hopcroft, and J. D. Ull- algorithms for approximate man. Data Structures and nearest neighbor in high di- Algorithms. Addison-Wesley, mensions. Communications Reading, MA, USA, 1983. of the Association for Com- ISBN 0-201-00023-7. xi + 427 puting Machinery, 51(1):117– pp. LCCN QA76.9.D35 A38 122, January 2008. CO- 1983. DEN CACMA2. ISSN 0001- REFERENCES 88

0782 (print), 1557-7317 (elec- http://www3.oup.co.uk/ tronic). computer_journal/hdb/Volume_ 17/Issue_02/tiff/136.tif; Asano:1989:CPP http://www3.oup.co.uk/ [AII89] Tetsuo Asano, H. Imai, and computer_journal/hdb/Volume_ K. Imai. Clustering/hashing 17/Issue_02/tiff/137.tif; points in the plane with http://www3.oup.co.uk/ maxmin criteria. In CCCG computer_journal/hdb/Volume_ ’89 [CCC89], page 15. ISBN 17/Issue_02/tiff/138.tif; ???? LCCN ???? http://www3.oup.co.uk/ computer_journal/hdb/Volume_ Asano:2011:ACI 17/Issue_02/tiff/139.tif; [AiNOW11] Takao Asano, Shin ichi http://www3.oup.co.uk/ Nakano, Yoshio Okamoto, computer_journal/hdb/Volume_ and Osamu Watanabe, edi- 17/Issue_02/tiff/140.tif; tors. Algorithms and Com- http://www3.oup.co.uk/ putation: 22nd Interna- computer_journal/hdb/Volume_ tional Symposium, ISAAC 17/Issue_02/tiff/141.tif; 2011, Yokohama, Japan, http://www3.oup.co.uk/ December 5–8. Proceedings, computer_journal/hdb/Volume_ volume 7074 of Lecture 17/Issue_02/tiff/142.tif. Notes in Computer Science. Abdukhalikov:1998:SHS Springer-Verlag, Berlin, Ger- many / Heidelberg, Ger- [AK98] Kanat S. Abdukhalikov and many / London, UK / etc., Chul Kim. On the secu- 2011. CODEN LNCSD9. rity of the hashing scheme ISBN 3-642-25590-6. ISSN basedonSL2. Lecture Notes 0302-9743 (print), 1611-3349 in CS, 1372:93–??, 1998. (electronic). URL http: CODEN LNCSD9. ISSN //www.springerlink.com/ 0302-9743 (print), 1611- content/978-3-642-25590- 3349 (electronic). URL 8. http://link.springer-ny. Amble:1974:OHT com/link/service/series/ 0558/bibs/1372/13720093. [AK74] O. Amble and D. E. Knuth. htm; http://link.springer- Ordered hash tables. The ny.com/link/service/series/ Computer Journal, 17(2): 0558/papers/1372/13720093. 135–142, May 1974. CO- pdf. DEN CMPJA6. ISSN 0010- 4620 (print), 1460-2067 (elec- Ahn:2009:SLD tronic). URL http:// www3.oup.co.uk/computer_ [AK09] Joon Ahn and Bhaskar Kr- journal/hdb/Volume_17/ ishnamachari. Scaling laws Issue_02/tiff/135.tif; for data-centric storage and REFERENCES 89

querying in wireless sen- Aho:1986:SDS sor networks. IEEE/ACM Transactions on Network- [AL86] Alfred V. Aho and David ing, 17(4):1242–1255, August Lee. Storing a dynamic 2009. CODEN IEANEP. sparse table. Annual Sym- ISSN 1063-6692 (print), posium on Foundations of 1558-2566 (electronic). Computer Science (Proceed- ings), pages 55–60, 1986. Albutiu:2012:MPS CODEN ASFPDV. ISBN [AKN12] Martina-Cezara Albutiu, Al- 0-8186-0740-8. ISSN 0272- fons Kemper, and Thomas 5428. IEEE Service Cent. Neumann. Massively paral- Piscataway, NJ, USA. lel sort-merge joins in main Albeshri:2021:IHB memory multi-core database systems. Proceedings of the [Alb21] Aiiad Albeshri. An im- VLDB Endowment, 5(10): age hashing-based authenti- 1064–1075, June 2012. CO- cation and secure group com- DEN ???? ISSN 2150-8097. munication scheme for IoT- enabled MANETs. Future Ajtai:1978:TNF Internet, 13(7):166, June 27, [AKS78] Miklós Ajtai, János Komlós, 2021. CODEN ???? ISSN and Endre Szemerédi. There 1999-5903. URL https:/ is no fast single hashing al- /www.mdpi.com/1999-5903/ gorithm. Information Pro- 13/7/166. cessing Letters, 7(6):270– Aldous:1987:HLP 273, October 1978. CO- DEN IFPLAT. ISSN 0020- [Ald87] David J. Aldous. Hash- 0190 (print), 1872-6119 (elec- ing with linear probing, un- tronic). der non-uniform probabilities. Technical Report TR- AlTawy:2013:SOC 88, University of California, [AKY13] Riham AlTawy, Aleksan- Berkeley. Dept. of Statistics, dar Kircanski, and Amr February 1987. 15 pp. Youssef. Second order col- Aldous:1988:HLP lision for the 42-step reduced DHA-256 hash func- [Ald88] David Aldous. Hashing with tion. Information Processing linear probing under nonuni- Letters, 113(19–21):764–770, form probabilities. Probabil- September/October 2013. ity in the Engineering and CODEN IFPLAT. ISSN Informational Sciences, 2(1): 0020-0190 (print), 1872-6119 1–14, January 1988. CO- (electronic). URL http: DEN ???? ISSN 0269- //www.sciencedirect.com/ 9648 (print), 1469-8951 (elec- science/article/pii/S0020019013002044. tronic). URL https:// REFERENCES 90

www.cambridge.org/core/ problems in hash function se- product/9D2CACA7CC9B73AAEA021B85287BB2C7curity.. Designs, Codes, and Cryptography, 77(2–3):611– Agrawal:2010:HLF 631, December 2015. CO- [ALS10] Kunal Agrawal, Charles E. DEN DCCREC. ISSN 0925- Leiserson, and Jim Sukha. 1022 (print), 1573-7586 (elec- Helper locks for fork-join par- tronic). URL http://link. allel programming. SIG- springer.com/article/10. PLAN Notices, 45(5):245– 1007/s10623-015-0096-0. 256, May 2010. CODEN Aumasson:2014:HFB SINODQ. ISSN 0362-1340 (print), 1523-2867 (print), [AMPH14] Jean-Philippe Aumasson, 1558-1160 (electronic). Willi Meier, Raphael C.-W. Phan, and Luca Henzen. The Aumasson:2007:AMH Hash Function BLAKE.In- [AM07] Jean-Philippe Aumasson and formation Security and Cryp- Willi Meier. Analysis of tography. Springer-Verlag, multivariate hash functions. Berlin, Germany / Heidel- Lecture Notes in CS, 4817: berg, Germany / London, 309–323, 2007. CODEN UK / etc., 2014. ISBN 3- LNCSD9. ISSN 0302-9743 662-44756-8 (print), 3-662- (print), 1611-3349 (elec- 44757-6 (e-book). ISSN tronic). URL http://link. 1619-7100 (print), 2197-845X springer.com/content/pdf/ (electronic). xviii + 228 + 18 10.1007/978-3-540-76788- pp. LCCN QA76.9.H36 A96 6_25. 2014. Andreeva:2012:PFG Albers:2009:ALP [AMP12] Elena Andreeva, Bart Men- [AMSM+09] Susanne Albers, Alberto nink, and Bart Preneel. The Marchetti-Spaccamela, Yossi parazoa family: generaliz- Matias, Sotiris Nikoletseas, ing the sponge hash func- and Wolfgang Thomas, ed- tions. International Journal itors. Automata, lan- of Information Security,11 guages and programming: (3):149–165, June 2012. CO- 36th international collo- DEN ???? ISSN 1615- quium, ICALP 2009, Rhodes, 5262 (print), 1615-5270 (elec- Greece, July 5–12, 2009; pro- tronic). URL http://link. ceedings, part 1, volume 5555 springer.com/article/10. of Lecture Notes in Com- 1007/s10207-012-0157-6. puter Science. Springer-Ver- lag, Berlin, Germany / Hei- Andreeva:2015:OPH delberg, Germany / Lon- [AMP15] Elena Andreeva, Bart Men- don, UK / etc., 2009. nink, and Bart Preneel. Open ISBN 3-642-02926-4. ISSN REFERENCES 91

0302-9743 (print), 1611- Spring Street, Suite 300, Sil- 3349 (electronic). LCCN ver Spring, MD 20910, USA, QA267 .I55 2009. URL 1988. IEEE catalog number http://www.springerlink. 88CH2649-2. com/content/978-3-642- Anderson:1991:TFC 02926-4; http://www. springerlink.com/content/ [And91] Ross J. Anderson. Tree 978-3-642-02926-4/. functions and cipher sys- Alon:1996:DWB tems. Cryptologia, 15(3): 194–202, July 1991. CO- [AN96] Noga Alon and Moni Naor. DEN CRYPE6. ISSN 0161- Derandomization, witnesses 1194 (print), 1558-1586 (elec- for Boolean matrix multi- tronic). URL http://www. plication and construction informaworld.com/smpp/ of perfect hash functions. content~content=a741902753~ Algorithmica, 16(4–5):434– db=all~order=page.en- 449, 1996. CODEN AL- cryption systems; plaintext GOEJ. ISSN 0178-4617 bit; hash function; ciphertext (print), 1432-0541 (elec- errors; error extension; tree tronic). function; ciphertext attack; Araujo:2020:CHR computable attack; connec- tivity; DES; RSA key selec- [AN20] Filipe Araujo and Samuel tion; algorithm design. Neves. The circulant hash revisited. Journal of Math- Anderson:1993:CHF ematical Cryptology, 15(1): 250–257, December 3, 2020. [And93] R. Anderson. The classiﬁ- CODEN ???? ISSN 1862- cation of hash functions. In 2976 (print), 1862-2984 (elec- Farrell [Far93], pages 83–94. tronic). URL https://www. ISBN 0-905091-03-5. LCCN degruyter.com/document/ ???? doi/10.1515/jmc-2018-0054/ Anderson:1994:FSE html. [And94] R. Anderson, editor. Fast Anderson:1988:PHK software encryption: Secu- [And88] Paul B. Anderson. Par- rity workshop — December allel hashed key access on 1993, Cambridge,number the connection machine. In 809 in Lecture Notes in Com- 2nd Symposium on the Fron- puter Science. Springer-Ver- tiers of Massively Paral- lag, Berlin, Germany / Hei- lel Computation (Oct 10–12 delberg, Germany / London, 1988: Fairfax, VA, USA), UK / etc., 1994. ISBN 0-387- pages 643–645. IEEE Com- 58108-1, 3-540-58108-1. ISSN puter Society Press, 1109 0302-9743 (print), 1611- REFERENCES 92

3349 (electronic). LCCN Anonymous:1989:TIC QA76.9.A25 C36 1993. [Ano89] Anonymous, editor. Third Anonymous:1983:MPM International Conference on Data Engineering,volume [Ano83] Anonymous, editor. Mi- 48(2) of Information sci- conex ’83: proceedings of ences. IEEE Computer Soci- a multi-national instrumen- ety Press, 1109 Spring Street, tation conference convened Suite 300, Silver Spring, MD in Shanghai, Peoples Repub- 20910, USA, July 1989. CO- lic of China, April 12–16, DEN ISIJBC. ISSN 0020- 1983. ISA, Research Trian- 0255 (print), 1872-6291 (elec- gle Park, NC, USA, 1983. tronic). ISBN 0-87664-739-5. LCCN TA165.M52 1983. Two vol- Anonymous:1992:PAW umes. [Ano92] Anonymous ???, editor. Pro- Anonymous:1985:PFD ceedings of the 1992 ACM Workshop on ML and its Ap- [Ano85a] Anonymous. Proceedings — plications. ACM Press, New foundations of data organi- York, NY 10036, USA, June zation. In Proceedings — 1992. Foundations of Data Organi- Anonymous:1993:CSA zation. Organizing Commit- tee of the Int Conference on [Ano93a] Anonymous, editor. Com- Foundations of Data Orga- puter security, audit and nization, Jpn, 1985. Kyoto control: 10th World con- Sangyo Univ. Computer Sci- ference — October 1993, ence Inst, Kyoto, Jpn. London, PROCEEDINGS OF COMPSEC INTERNA- Anonymous:1985:SS TIONAL 1993; 10th. Else- vier Advanced Technology, [Ano85b] Anonymous. Software and Oxford, UK, 1993. ISBN 1- services. ComputerWorld,19 85617-211-2. LCCN ???? (38):50, September 23 1985. CODEN CMPWAB. ISSN Anonymous:1993:FSH 0010-4841. [Ano93b] Anonymous. FIPS 180, Se- Anon:1986:IRN cure Hash Standard.NIST, US Department of Com- [Ano86] Anon. Integer random num- merce, Washington, DC, ber generator. IBM Technical USA, May 1993. Disclosure Bulletin, 28(11): Anonymous:1993:TCC 4869–??, April 1986. CO- DEN IBMTAA. ISSN 0018- [Ano93c] Anonymous, editor. TEN- 8689. CON ’93: computer, commu- REFERENCES 93

nication, control and power Anonymous:1995:FSH engineering: International conference — October 1993, [Ano95b] Anonymous. FIPS 180-1, Se- Beijing, volume 1 of IEEE cure Hash Standard.Na- TENCON 1993.Interna- tional Institute of Standards tional Academic Publish- and Technology, US Depart- ers, ????, 1993. ISBN 7- ment of Commerce, Washing- 80003-285-X, 0-7803-1233-3, ton, DC, USA, April 1995. ?? 0-87031-232-5, 0-87031-234- pp. 1. LCCN TK5105.5.I327 Anonymous:1995:NAF 1993. Five volumes. [Ano95c] Anonymous, editor. NATO Anonymous:1993:SAD ASI on Fractal Image En- coding and Analysis: July [Ano93d] Anonymous, editor. The Sec- 1995, Trondheim, Norway. ond Annual Dartmouth In- ????, ????, 1995. ISBN ???? stitute on Advanced Gradu- LCCN ???? ate Studies in Parallel Com- putation. Dartmouth College Anonymous:1995:SHS (??), Hanover, NH, USA, [Ano95d] Anonymous. Super hash June 1993. ISBN ?? LCCN serves up super privacy on ?? I have been unable to the Internet. Computer locate this reference in sev- Technology Review, 15(4):1– eral major libraries, includ- ??, April 1995. CODEN ingDartmoth’s,sigh.... CTERES. ISSN 0278-9647. Anonymous:1994:WAM Anonymous:1996:RF [Ano96] Anonymous. Real fake. [Ano94] Anonymous, editor. Work- Wired, 4(6):156–??, June shop: – April 1990, Milan, 1, 1996. CODEN WRE- Italy, PB REPORTS PB94- DEM. ISSN 1059-1028 124997. NTIS, ????, 1994. (print), 1078-3148 (elec- Anonymous:1995:AUC tronic). Anonymous:2002:SHS [Ano95a] Anonymous. Algorithms update: Collisions in MD4; [Ano02] Anonymous. Secure Hash more developments with Standard. Technical re- keyed hash functions; A lin- port, National Institute ear protocol failure for RSA for Standards and Tech- with exponent three. Cryp- nology, Gaithersburg, MD toBytes, 1(3):4–6, Autumn 20899-8900, USA, August 1995. URL ftp://ftp. 1, 2002. iv + 71 pp. rsa.com/pub/cryptobytes/ URL http://csrc.nist. crypto1n3.pdf. gov/publications/fips/ REFERENCES 94

fips180-2/fips180-2.pdf. (electronic). URL http: FIPS Publication 180-2. Of- //www.sciencedirect.com/ ﬁcially replaced by [Ano12], science/article/pii/S1353485809700030. but that newer version is much shorter. Anonymous:2010:NDS Anonymous:2008:SHS [Ano10] Anonymous, editor. 17th Annual Network and Dis- [Ano08] Anonymous. Secure Hash tributed System Symposium, Standard (SHS). Federal In- NDSS ’10, The Dana on formation Processing Stan- Misson Bay, San Diego, dards Publication FIPS Pub California. February 28– 180-3, National Institute for March 3, 2010.InternetSo- Standards and Technology, ciety, Reston, VA, USA, Gaithersburg, MD 20899- 2010. ISBN 1-891562-29-0, 8900, USA, October 2008. v 1-891562-30-4. LCCN ???? + 27 pp. URL http://csrc. URL http://www.isoc. nist.gov/publications/ org/isoc/conferences/ndss/ fips/fips180-3/fips180- 10/proceedings.shtml. 3_final.pdf. Superceded by FIPS 180-4 [Ano12]. Anonymous:2012:SHS

Anonymous:2009:DSS [Ano12] Anonymous. Secure Hash Standard (SHS). Federal In- [Ano09a] Anonymous. Digital Signa- formation Processing Stan- ture Standard (DSS). Federal dards Publication FIPS Pub Information Processing Stan- 180-4, National Institute for dards Publication FIPS Pub Standards and Technology, 186-3, National Institute for Gaithersburg, MD 20899- Standards and Technology, 8900, USA, March 2012. v + Gaithersburg, MD 20899- 30 pp. URL http://csrc. 8900, USA, June 2009. ix + nist.gov/publications/ 119 pp. URL http://csrc. fips/fips180-4/fips-180- nist.gov/publications/ 4.pdf; http://csrc.nist. fips/fips186-3/fips_186- gov/publications/PubsFIPS. 3.pdf. Superceded by FIPS html#fips180-4. 186-4 [Ano13]. Anonymous:2013:DSS Anonymous:2009:PCA [Ano13] Anonymous. Digital Signa- [Ano09b] Anonymous. Proof of con- ture Standard (DSS). Fed- cept attack further discred- eral Information Process- its MD5. Network Secu- ing Standards Publication rity, 2009(1):2, January 2009. FIPS Pub 186-4, National CODEN NTSCF5. ISSN Institute for Standards and 1353-4858 (print), 1872-9371 Technology, Gaithersburg, REFERENCES 95

MD 20899-8900, USA, July Albers et al. [AMSM+09], 2013. vii + 121 pp. URL pages 107–118. ISBN 3- http://nvlpubs.nist.gov/ 642-02926-4. ISSN 0302- nistpubs/FIPS/NIST.FIPS. 9743 (print), 1611-3349 (elec- 186-4.pdf. tronic). LCCN QA267 .I55 2009. URL http: ANSI:1997:AXP //www.springerlink.com/ [ANS97] ANSI. ANSI X9.30-2:1997: content/d5187mm887547j31/ Public Key Cryptography Us- ; http://www.wisdom. ing Irreversible Algorithms weizmann.ac.il/~naor/PAPERS/ — Part 2: The Secure Hash deamortized_cuckoo.pdf. Algorithm (SHA-1).Amer- Arbitman:2010:BCH ican National Standards In- stitute, 1430 Broadway, New [ANS10] Y. Arbitman, M. Naor, York, NY 10018, USA, 1997. and G. Segev. Back- URL http://webstore. yard cuckoo hashing: Con- ansi.org/ansidocstore/ stant worst-case operations product.asp?sku=ANSI+X9% with a succinct represen- 2E30%2D2%3A1997. tation. In IEEE [IEE10], pages 787–796. ISBN 1- ANSI:2005:AXP 4244-8525-8. LCCN ???? URL http://ieeexplore. [ANS05] ANSI. ANSI X9.62:2005: ieee.org/servlet/opac? Public Key Cryptography for punumber=5669376. IEEE the Financial Services In- Computer Society Order dustry, The Elliptic Curve Number P4244. Digital Signature Algorithm (ECDSA).AmericanNa- Arnaurov:1985:ODF tional Standards Institute, [ANT85] D. D. Arnaurov, N. V. 1430 Broadway, New York, Naidenov, and A. G. Ta- NY 10018, USA, 2005. sev. Organization of data URL http://csrc.nist. ﬁles for document retrieval gov/encryption/dss/ecdsa/ systems. Programming and NISTReCur.pdf; http:// Computer Software; transla- webstore.ansi.org/ansidocstore/ tion of Programmirovaniye, product.asp?sku=ANSI+X9% (Moscow, USSR) Plenum, 2E62%3A2005. 11(3):??, June 1985. CO- Arbitman:2009:ACH DEN PCSODA. ISSN 0361- 7688 (print), 1608-3261 (elec- [ANS09] Yuriy Arbitman, Moni Naor, tronic). and Gil Segev. De-amortized Al-Odat:2020:SHA cuckoo hashing: Provable worst-case performance and [AOAAK20] Zeyad A. Al-Odat, Mazhar experimental results. In Ali, Assad Abbas, and REFERENCES 96

Samee U. Khan. Secure main memory databases. In hash algorithms and the cor- Stonebraker [Sto92], pages responding FPGA optimiza- 215–224. ISBN 0-89791- tion techniques. ACM Com- 521-6. ISSN 0163-5808 puting Surveys, 53(5):97:1– (print), 1943-5835 (elec- 97:36, October 2020. CO- tronic). LCCN ???? URL DEN CMSVAN. ISSN 0360- http://www.acm.org/pubs/ 0300 (print), 1557-7341 (elec- articles/proceedings/mod/ tronic). URL https:// 130283/p215-analyti/p215- dl.acm.org/doi/10.1145/ analyti.pdf; http:// 3311724. www.acm.org/pubs/citations/ Aluc:2019:BSC proceedings/mod/130283/ p215-analyti/. [AOD19]¨ Günes Alu¸c, M. Tamer Ozsu,¨ and Khuzaima Daudjee. Analyti:1993:PAM Building self-clustering RDF [AP93] Anastasia Analyti and Sakti databases using Tunable- Pramanik. Performance LSH. VLDB Journal: Very analysis of a main mem- Large Data Bases, 28(2):173– ory multi-directory hashing 195, April 2019. CODEN technique. Information Pro- VLDBFR. ISSN 1066-8888 cessing Letters, 45(4):191– (print), 0949-877X (elec- 197, March 22, 1993. CO- tronic). DEN IFPLAT. ISSN 0020- Atkinson:1999:PTF 0190 (print), 1872-6119 (electronic). [AOV+99] Malcolm P. Atkinson, Maria E. Orlowska, Patrick Valduriez, Aumasson:2008:HED Stanley B. Zdonik, and MichaelL.Brodie,edi-[AP08] Jean-Philippe Aumasson and tors. Proceedings of the Raphael C.-W. Phan. How Twenty-fifth International (not) to efficiently dither Conference on Very Large blockcipher-based hash func- Databases, Edinburgh, Scot- tions? Lecture Notes in land, UK, 7–10 Septem- CS, 5023:308–324, 2008. CO- ber, 1999. Morgan Kaufmann DEN LNCSD9. ISSN 0302- Publishers, San Francisco, 9743 (print), 1611-3349 (elec- CA, 1999. ISBN 1-55860- tronic). URL http://link. 615-7. LCCN QA76.9.D3 springer.com/content/pdf/ I559 1999. Also known as 10.1007/978-3-540-68164- VLDB’99. 9_21. Analyti:1992:FSM Aumasson:2011:CHF [AP92] Anastasia Analyti and Sakti [AP11] Jean-Philippe Aumasson and Pramanik. Fast search in Raphael C.-W. Phan. On REFERENCES 97

the cryptanalysis of the hash Transactions on Computers, function Fugue: Partition- 66(9):1585–1598, September ing and inside-out distin- 2017. CODEN ITCOB4. guishers. Information Pro- ISSN 0018-9340 (print), cessing Letters, 111(11):512– 1557-9956 (electronic). URL 515, May 15, 2011. CO- http://ieeexplore.ieee. DEN IFPLAT. ISSN 0020- org/document/7896557/. 0190 (print), 1872-6119 (electronic). Areias:2021:CEN

Akbarinia:2007:PTK [AR21] Miguel Areias and Ricardo Rocha. On the correct- [APV07] Reza Akbarinia, Esther ness and eﬃciency of a novel Pacitti, and Patrick Val- lock-free hash trie map de- duriez. Processing top-k sign. Journal of Parallel queries in distributed hash and Distributed Computing, tables. Lecture Notes in CS, 150(??):184–195, April 2021. 4641:489–502, 2007. CO- CODEN JPDCER. ISSN DEN LNCSD9. ISSN 0302- 0743-7315 (print), 1096-0848 9743 (print), 1611-3349 (elec- (electronic). URL http: tronic). URL http://link. //www.sciencedirect.com/ springer.com/content/pdf/ science/article/pii/S0743731521000010. 10.1007/978-3-540-74466- Anger:1994:IEA 5_53. Areias:2016:LFH [ARA94] F. D. Anger, R. V. Ro- driguez, and M. Ali, edi- [AR16] Miguel Areias and Ricardo tors. Industrial and engi- Rocha. A lock-free hash neering applications of arti- trie design for concurrent ﬁcial intelligence and expert tabled logic programs. In- systems: 7th International ternational Journal of Par- conference — May 1994, allel Programming, 44(3): Austin, TX, INDUSTRIAL 386–406, June 2016. CO- AND ENGINEERING AP- DEN IJPPE5. ISSN 0885- PLICATIONS OF ARTI- 7458 (print), 1573-7640 (elec- FICIAL INTELLIGENCE tronic). URL http://link. AND EXPERT SYSTEMS - springer.com/article/10. INTERNATIONAL CONFERENCE- 1007/s10766-014-0346-1. 1994. Gordon and Breach, Langhorne, PA, USA, 1994. Atighehchi:2017:OTM ISBN 2-88449-128-7. LCCN [AR17] Kevin Atighehchi and Robert Q334.I556 1994. Rolland. Optimization of tree Altawy:2018:SLT modes for parallel hash functions: A case study. IEEE [ARH+18] Riham Altawy, Raghven- REFERENCES 98

dra Rohit, Morgan He, Ka- p540-aghili/p540-aghili. likinkar Mandal, Gangqiang pdf; http://www.acm. Yang, and Guang Gong. org/pubs/citations/journals/ SLISCP-light: Towards hard- tods/1982-7-4/p540-aghili/ ware optimized sponge- . specific cryptographic per- Abdelguerfi:1989:EVA mutations. ACM Trans- actions on Embedded Com- [AS89] M. Abdelguerfi and A. K. puting Systems, 17(4):81:1– Sood. External VLSI al- 81:??, August 2018. CODEN gorithm for the relational ???? ISSN 1539-9087 (print), database projection opera- 1558-3465 (electronic). tion. International Jour- nal of Electronics Theoretical Ariwasa:1968:RHM & Experimental, 66(3):339– [Ari68] Makota Ariwasa. Residue 347, March 1989. CODEN hash method. Journal of IJELA2. ISSN 0020-7217. the Information Processing Atici:1996:UHM Society of Japan, 12(??):??, February 1968. CODEN [AS96] M. Atici and D. R. Stin- JIPRDE. ISSN 0387-6101. son. Universal hashing and Arikan:1994:IGE multiple authentication. Lec- ture Notes in CS, 1109:16– [Ari94] E. Arikan. An improved ??, ???? 1996. CO- graph-entropy bound for per- DEN LNCSD9. ISSN 0302- fect hashing. IEEE Interna- 9743 (print), 1611-3349 (elec- tional Symposium on Infor- tronic). mation Theory, pages 314– ??, 1994. CODEN PISTFZ. Aspnes:2007:SG ISSN 0271-4655. [AS07] James Aspnes and Gauri Aghili:1982:PGD Shah. Skip graphs. ACM [AS82] Houtan Aghili and Den- Transactions on Algorithms, nis G. Severance. Practi- 3(4):37:1–37:??, November cal guide to the design of 2007. CODEN ???? ISSN differential files for recovery 1549-6325 (print), 1549-6333 of on-line databases. ACM (electronic). Transactions on Database Agrawal:2009:HBN Systems, 7(4):540–565, De- cember 1982. CODEN [AS09] Banit Agrawal and Timothy ATDSD3. ISSN 0362-5915 Sherwood. High-bandwidth (print), 1557-4644 (elec- network memory system tronic). URL http://www. through virtual pipelines. acm.org/pubs/articles/ IEEE/ACM Transactions journals/tods/1982-7-4/ on Networking, 17(4):1029– REFERENCES 99

1041, August 2009. CO- 0018-9340 (print), 1557-9956 DEN IEANEP. ISSN 1063- (electronic). 6692 (print), 1558-2566 (electronic). Askitis:2005:CCC Aysu:2016:PMH [Ask05] Justin Zobel Nikolas Aski- tis. Cache-conscious collision [AS16] Aydin Aysu and Patrick resolution in string hash ta- Schaumont. Precomputation bles. Lecture Notes in CS, methods for hash-based sig- 3772:91–102, 2005. CODEN natures on energy-harvesting LNCSD9. ISBN 3-540-29740- platforms. IEEE Transac- 5. ISSN 0302-9743 (print), tions on Computers, 65(9): 1611-3349 (electronic). 2925–2931, ???? 2016. CO- DEN ITCOB4. ISSN 0018- Al-Ssulami:2017:FSM 9340 (print), 1557-9956 (elec- [ASM17] Abdulrakeeb M. Al-Ssulami tronic). and Hassan Mathkour. Faster Alcantara:2009:RTP string matching based on hashing and bit-parallelism. [ASA+09] Dan A. Alcantara, An- Information Processing Let- drei Sharf, Fatemeh Ab- ters, 123(??):51–55, July basinejad, Shubhabrata Sen- 2017. CODEN IFPLAT. gupta, Michael Mitzen- ISSN 0020-0190 (print), macher, John D. Owens, 1872-6119 (electronic). URL and Nina Amenta. Real- http://www.sciencedirect. time parallel hashing on the com/science/article/pii/ GPU. ACM Transactions S0020019017300492. on Graphics, 28(5):154:1– Astakhov:1980:OEA 154:9, December 2009. CO- DEN ATGRDF. ISSN 0730- [Ast80] A. D. Astakhov. Orga- 0301 (print), 1557-7368 (elec- nization of efficient access tronic). by hashing. Programming and Computer Software (En- Andrade:2016:LEP glish Translation of Pro- [ASBdS16] Ewerton R. Andrade, Mar- grammirovanie), 6(3):141– cos A. Simplicio, Paulo S. 144, May–June 1980. CO- L. M. Barreto, and Paulo DEN PCSODA. C. F. dos Santos. Lyra2: Ef- Astrahan:1987:ANU ficient password hashing with high security against time- [ASW87] M. M. Astrahan, M. Schkol- memory trade-offs. IEEE nick, and K. Y. Whang. Ap- Transactions on Computers, proximating the number of 65(10):3096–3108, ???? 2016. unique values of an attribute CODEN ITCOB4. ISSN without sorting. Information REFERENCES 100

system, 12(1):11, 1987. CO- Azadegan:1991:PJA DEN INSYD6. ISSN 0306- 4379 (print), 1873-6076 (elec- [AT91] Shiva Azadegan and Anand tronic). Tripathi. Parallel join algorithms for SIMD models. In Aspnas:2007:EAS lin Wu (v.1) et al. [lWSS91], pages III–125–III–133. ISBN [ASW07] Mats Aspnäs, Artur Signell, 0-8493-0190-4 (set), 0-8493- and Jan Westerholm. Effi- 0191-2 (v. 1), 0-8493-0192- cient assembly of sparse ma- 0 (v. 2), 0-8493-0193-9 (v. trices using hashing. Lec- 3). LCCN QA76.58 .I55 1991. ture Notes in CS, 4699: ???? 900–907, 2007. CODEN LNCSD9. ISSN 0302-9743 Asano:1993:APP (print), 1611-3349 (elec- [AT93] Tetsuo Asano and Takeshi tronic). URL http://link. Tokuyama. Algorithms for springer.com/content/pdf/ projecting points to give the 10.1007/978-3-540-75755- most uniform distribution 9_107. with applications to hash- Alrabaee:2018:FRE ing. Algorithmica,9(6): 572–590, June 1993. CO- [ASWD18] Saed Alrabaee, Paria Shirani, DEN ALGOEJ. ISSN 0178- Lingyu Wang, and Mourad 4617 (print), 1432-0541 (elec- Debbabi. FOSSIL: A re- tronic). Selections from SI- silient and efficient system for GAL International Sympo- identifying FOSS functions sium on Algorithms (Tokyo, in malware binaries. ACM 1990). Transactions on Privacy and Abdulhayoglu:2018:ULS Security (TOPS), 21(2):8:1– 8:??, February 2018. ISSN [AT18] Mehmet Ali Abdulhayoglu 2471-2566 (print), 2471-2574 and Bart Thijs. Use of local- (electronic). URL https:// ity sensitive hashing (LSH) dl.acm.org/citation.cfm? algorithm to match Web of id=3175492. Science and Scopus. Sci- Asano:1990:APP entometrics, 116(2):1229– 1245, August 2018. CO- [AT90] Tetsuo Asano and T. Tokuyama. DEN SCNTDX. ISSN 0138- Algorithms for projecting 9130 (print), 1588-2861 (elec- points to give the most uni- tronic). URL http://link. form distribution with appli- springer.com/article/10. cation to hashing. In Asano 1007/s11192-017-2569-6. + et al. [A 90], pages 300–309. Al-Talib:2007:IMS ISBN 0-387-52921-7. LCCN QA9.58 .I58 1990. [ATAKS07] S. A. Al-Talib, B. M. Ali, REFERENCES 101

S. Khatun, and S. Subra- loss and gap of condensers. maniam. Improving the ACM Transactions on Com- multicast state scalability putation Theory, 11(3):15:1– in Internet routers by inte- 15:??, June 2019. CO- grating hash algorithm with DEN ???? ISSN 1942- recursive unicast. Jour- 3454 (print), 1942-3462 (elec- nal of Network and Com- tronic). URL https://dl. puter Applications, 30(4): acm.org/ft_gateway.cfm? 1445–1454, November 2007. id=3317691. CODEN JNCAF3. ISSN Ang:1998:TLH 1084-8045 (print), 1095-8592 (electronic). URL http: [ATT98] C. H. Ang, S. T. Tan, //www.sciencedirect.com/ andT.C.Tan.Triedlin- science/article/pii/S1084804506000488. ear hashing. Lecture Notes Atighehchi:2020:PNA in CS, 1538:86–??, 1998. CODEN LNCSD9. ISSN [Ati20] Kevin Atighehchi. A pre- 0302-9743 (print), 1611- cise non-asymptotic com- 3349 (electronic). URL plexity analysis of parallel http://link.springer-ny. hash functions without tree com/link/service/series/ topology constraints. Jour- 0558/bibs/1538/15380086. nal of Parallel and Dis- htm; http://link.springer- tributed Computing, 137(??): ny.com/link/service/series/ 246–251, March 2020. CO- 0558/papers/1538/15380086. DEN JPDCER. ISSN pdf. 0743-7315 (print), 1096-0848 (electronic). URL http: Aho:1979:OPM //www.sciencedirect.com/ science/article/pii/S0743731518308682[AU79]. Alfred V. Aho and Jef- frey D. Ullman. Optimal Atkinson:1975:HMS partial-match retrieval when ﬁelds are independently spec- [Atk75] L. V. Atkinson. Hash- iﬁed. ACM Transactions ing matrix subscripts. BIT on Database Systems, 4(2): (Nordisk tidskrift for infor- 168–179, June 1979. CO- mationsbehandling), 15(3): DEN ATDSD3. ISSN 0362- 328–330, 1975. CODEN BIT- 5915 (print), 1557-4644 (elec- TEL, NBITAB. ISSN 0006- tronic). URL http://www. 3835 (print), 1572-9125 (elec- acm.org/pubs/articles/ tronic). journals/tods/1979-4-2/ Aviv:2019:ELG p168-aho/p168-aho.pdf; http://www.acm.org/pubs/ [ATS19] Nir Aviv and Amnon Ta- citations/journals/tods/ Shma. On the entropy 1979-4-2/p168-aho/. REFERENCES 102

Aumasson:2009:CHF table based storage and look-up of URLs. Jour- [Aum09] Jean-Philippe Aumasson. nal of Network and Com- Cryptanalysis of a hash func- puter Applications, 41(??): tion based on norm form 197–205, May 2014. CO- equations. Cryptologia,33 DEN JNCAF3. ISSN (1):12–15, 2009. CODEN 1084-8045 (print), 1095-8592 CRYPE6. ISSN 0161-1194 (electronic). URL http: (print), 1558-1586 (elec- //www.sciencedirect.com/ tronic). science/article/pii/S1084804513002853. Alvarez:2011:IME Askitis:2010:RSH [AVZ11]´ Rafael Alvarez,´ Jos´e-Francisco [AZ10] Nikolas Askitis and Justin Vicent, and Antonio Zamora. Zobel. Redesigning the string Improving the message ex- hash table, burst trie, and pansion of the Tangle hash BST to exploit cache. ACM function. Lecture Notes in Journal of Experimental Al- CS, 6694:183–189, 2011. CO- gorithmics, 15(1):17:1–17:??, DEN LNCSD9. ISSN 0302- March 2010. ISSN 1084-6654. 9743 (print), 1611-3349 (elec- Babb:1979:IRD tronic). URL http://link. springer.com/content/pdf/ [Bab79] E. Babb. Implementing 10.1007/978-3-642-21323- a relational database by 6_23. means of specialized hardware. ACM Transactions Apers:1989:VLD on Database Systems, 4(1): [AW89] Peter M. G. Apers and Gio 1–29, March 1979. CO- Wiederhold, editors. Very DEN ATDSD3. ISSN 0362- Large Data Bases: Proceed- 5915 (print), 1557-4644 (elec- ings of the Fifteenth Inter- tronic). URL http://www. national Conference on Very acm.org/pubs/articles/ Large Data Bases, August journals/tods/1979-4-1/ 22–25/1989, Amsterdam, the p1-babb/p1-babb.pdf; Netherlands. Morgan Kauf- http://www.acm.org/pubs/ mann Publishers, San Fran- citations/journals/tods/ cisco, CA, 1989. ISBN 1- 1979-4-1/p1-babb/. 55860-101-5. LCCN QA 76.9 Back:2001:HC D3 I61 1989. Ahmad:2014:RTN [Bac01] A. Back. Hash cash. Web document., 2001. URL [AY14] Tahir Ahmad and Usman https://web.archive.org/ Younis. Randomness testing web/20010614013848/http: of non-cryptographic hash //cypherspace.org/hashcash/ functions for real-time hash . REFERENCES 103

Back:2002:HDS the use of metric properties of the Hamming space. [Bac02] A. Back. Hashcash — a The Computer Journal,48 denial of service counter (1):4–16, January 2005. CO- measure. Web docu- DEN CMPJA6. ISSN 0010- ment., 2002. URL http:// 4620 (print), 1460-2067 (elec- www.hashcash.org/papers/ tronic). URL http:// hashcash.pdf.. www3.oup.co.uk/computer_ journal/hdb/Volume_48/ Bailey:1981:CHP Issue_01/bxh059.sgm.abs. [Bai81] Richard W. Bailey, editor. html; http://www3.oup. Computing in the humani- co.uk/computer_journal/ ties: papers from the Fifth hdb/Volume_48/Issue_01/ International Conference on pdf/bxh059.pdf. Computing in the Humani- Bandypadhyay:1977:CWI ties, Ann Arbor, Michigan, May 1981. North-Holland, [Ban77] S. K. Bandypadhyay. Com- Amsterdam, The Nether- ment on weighted increment lands, 1981. ISBN 0-444- linear search for scatter ta- 86423-7. LCCN AZ105 bles. Communications of .I57.1981. the Association for Com- Bakker:2009:MHT puting Machinery, 20(4): 262–263, April 1977. CO- [Bak09] Arno Bakker. Merkle hash DEN CACMA2. ISSN 0001- torrent extension. Web doc- 0782 (print), 1557-7317 (elec- ument., August 2009. URL tronic). http://www.bittorrent. org/beps/bep_0030.html,. Burrows:1989:LAa Balakirsky:1996:HDB [BAN89] Michael Burrows, Martin Abadi, and Roger Needham. [Bal96] V. B. Balakirsky. Hashing of A logic of authentication. databases based on indirect Technical Report 39, Digi- observations of Hamming dis- tal Equipment Corporation, tances. IEEE Transactions Systems Research Centre, on Information Theory,42 February 28, 1989. 48 pp. (2):664–671, March 1, 1996. CODEN IETTAW. ISSN Barter:1983:ACS 0018-9448 (print), 1557-9654 [Bar83] C. J. Barter, editor. Aus- (electronic). tralian Computer Science Balakirsky:2005:HDU Conference. Proceedings of the 7th Conference (Adelaide, [Bal05] Vladimir B. Balakirsky. Australia, Feb. 6–8, 1983). Hashing of databases with University of Adelaide, Com- REFERENCES 104

puter Science Department, Batory:1980:OFD Adelaide, South Australia, Australia, 1983. Published [Bat80] D. S. Batory. Optimal as Australian Computer Sci- ﬁle design and reorganisa- ence Communications; vol 6, tion points. Technical report, no. 1. ????, Toronto, ON, Canada, 1980. ?? pp. Barequet:1997:UGH Batory:1981:AMP [Bar97] Gill Barequet. Using geometric hashing to repair CAD [Bat81] D. S. Batory. An an- objects. IEEE Computa- alytical model of physical tional Science & Engineer- databases. Technical report, ing, 4(4):22–28, October/ ????, Toronto, ON, Canada, December 1997. CODEN 1981. ?? pp. ISCEE4. ISSN 1070-9924 Batory:1982:OFD (print), 1558-190X (electronic). URL http://dlib. [Bat82] D. S. Batory. Optimal computer.org/cs/books/ ﬁle designs and reorganiza- cs1997/pdf/c4022.pdf; tion points. ACM Transac- http://www.computer.org/ tions on Database Systems, cse/cs1998/c4022abs.htm. 7(1):??, March 1982. CO- Batson:1965:OST DEN ATDSD3. ISSN 0362- 5915 (print), 1557-4644 (elec- [Bat65] A. Batson. The organization tronic). Also published in/as: of symbol tables. Communi- University of Toronto, TR- cations of the Association for CSRG-110, 1980. Computing Machinery, 8(2): Balkesen:2013:MCM 111–112, February 1965. CO- DEN CACMA2. ISSN 0001- [BATO13]¨ Cagri Balkesen, Gustavo 0782 (print), 1557-7317 (elec- Alonso, Jens Teubner, and tronic). M. Tamer Ozsu.¨ Multi-core, Batagelj:1975:QHM main-memory joins: sort vs. hash revisited. Proceedings of [Bat75] Vladimir Batagelj. Quadratic the VLDB Endowment, 7(1): hash method when the ta- 85–96, September 2013. CO- ble size is not a prime num- DEN ???? ISSN 2150-8097. ber. Communications of Bays:1973:STS the Association for Com- puting Machinery, 18(4): [Bay73a] C. Bays. Some techniques for 216–217, April 1975. CO- structuring chained hash ta- DEN CACMA2. ISSN 0001- bles. The Computer Journal, 0782 (print), 1557-7317 (elec- 16(2):126–131, May 1973. tronic). CODEN CMPJA6. ISSN REFERENCES 105

0010-4620 (print), 1460-2067 14, January 1973. CO- (electronic). URL http:// DEN CACMA2. ISSN 0001- www3.oup.co.uk/computer_ 0782 (print), 1557-7317 (elec- journal/hdb/Volume_16/ tronic). Issue_02/160126.sgm.abs. html; http://www3.oup. Bayer:1974:SCM co.uk/computer_journal/ [Bay74] Rudolf Bayer. Storage char- hdb/Volume_16/Issue_02/ acteristics and methods for tiff/126.tif; http:// searching and addressing. In www3.oup.co.uk/computer_ Rosenfeld [Ros74], page ?? journal/hdb/Volume_16/ ISBN 0-444-10689-8. LCCN Issue_02/tiff/127.tif; QA 76 I615. http://www3.oup.co.uk/ computer_journal/hdb/Volume_ Bohm:2007:FRA 16/Issue_02/tiff/128.tif; http://www3.oup.co.uk/ [BB07] Klemens B¨ohm and Erik computer_journal/hdb/Volume_ Buchmann. Free riding- 16/Issue_02/tiff/129.tif; aware forwarding in Content- http://www3.oup.co.uk/ Addressable Networks. VLDB computer_journal/hdb/Volume_ Journal: Very Large Data 16/Issue_02/tiff/130.tif; Bases, 16(4):463–482, Octo- http://www3.oup.co.uk/ ber 2007. CODEN VLDBFR. computer_journal/hdb/Volume_ ISSN 1066-8888 (print), 16/Issue_02/tiff/131.tif. 0949-877X (electronic).

Bays:1973:NWC Berman:1982:CFP

[Bay73b] Carter Bays. A note on [BBD+82] Francine Berman, Mary Ellen when to chain overﬂow items Bock, Eric Dittert, Michael J. within a direct-access ta- O’Donnell, and Darrell ble. Communications of Plank. Collections of func- the Association for Com- tions for perfect hashing. puting Machinery, 16(1):46– Technical Report CSD-TR- 47, January 1973. CO- 408, Department of Com- DEN CACMA2. ISSN 0001- puter Science, Purdue Uni- 0782 (print), 1557-7317 (elec- versity, West Lafayette, IN, tronic). USA, 1982. ?? pp.

Bays:1973:RHC Berman:1986:CFP

[Bay73c] Carter Bays. The real- [BBD+86] Francine Berman, Mary Ellen location of hash-coded ta- Bock, Eric Dittert, Michael J. bles. Communications of O’Donnell, and Darrell the Association for Com- Plank. Collections of func- puting Machinery, 16(1):11– tions for perfect hashing. REFERENCES 106

SIAM Journal on Com- hash-CBC construction. Lec- puting, 15(2):604–618, May ture Notes in CS, 2139:292– 1986. CODEN SMJCAT. ??, 2001. CODEN LNCSD9. ISSN 0097-5397 (print), ISSN 0302-9743 (print), 1095-7111 (electronic). 1611-3349 (electronic). URL http://link.springer-ny. Belazzougui:2009:HDC com/link/service/series/ [BBD09a] Djamal Belazzougui, Fabi- 0558/bibs/2139/21390292. ano C. Botelho, and Mar- htm; http://link.springer- tin Dietzfelbinger. Hash, ny.com/link/service/series/ displace, and compress. In 0558/papers/2139/21390292. Fiat and Sanders [FS09], pdf. pages 682–693. CODEN Bellare:2012:LCH LNCSD9. ISBN 3-642- 04127-2. ISSN 0302-9743 [BBKN12] M. Bellare, A. Boldyreva, (print), 1611-3349 (elec- L. Knudsen, and C. Nam- tronic). LCCN QA76.9.A43 prempre. On-line ciphers E83 2009. URL http: and the hash-CBC construc- //www.springerlink.com/ tions. Journal of Cryptology, content/d41867w7r1236506/ 25(4):640–679, October 2012. . CODEN JOCREQ. ISSN Bernstein:2009:PQC 0933-2790 (print), 1432- 1378 (electronic). URL [BBD09b] Daniel J. (Daniel Julius) http://www.springerlink. Bernstein, Johannes Buch- com/openurl.asp?genre= mann, and Erik Dahm´en, ed- article&issn=0933-2790& itors. Post-quantum cryptog- volume=25&issue=4&spage= raphy: [First International 640. Workshop on Post-Quantum Bernstein:1988:OCE Cryptography . . . at the Katholieke Universiteit Leu- [BBP88] D. Bernstein, H. Boral, ven in 2006]. Springer-Ver- andR.Y.Pinter. Opti- lag, Berlin, Germany / Hei- mal chaining in expression delberg, Germany / London, trees. IEEE Transactions UK / etc., 2009. ISBN 3-540- on Computers, 37(11):1366– 88701-6 (hardcover), 3-642- 1374, November 1988. CO- 10019-8 (softcover). LCCN DEN ITCOB4. ISSN 0018- QA76.9.A25 P67 2009. 9340 (print), 1557-9956 (electronic). Bellare:2001:OCH Belazzougui:2011:TPM [BBKN01] Mihir Bellare, Alexandra Boldyreva, Lars Knudsen, [BBPV11] Djamal Belazzougui, Paolo and Chanathip Namprem- Boldi, Rasmus Pagh, and Se- pre. Online ciphers and the bastiano Vigna. Theory and REFERENCES 107

practice of monotone mini- [Knu73, p. 507], this is one mal perfect hashing. ACM of two papers that first dis- Journal of Experimental Al- cuss the birthday paradox: gorithmics, 16(1):32:1–32:??, “if 23 or more people are 2011. ISSN 1084-6654. present in the same room, chances are good that two Bennett:1988:PAP of them will have the same [BBR88] Charles H. Bennett, Gilles month and day of birth! In Brassard, and Jean-Marc other words, if we select a Robert. Privacy amplifica- random function which maps tion by public discussion. 23 keys into a table of size SIAM Journal on Comput- 365, the probability that no ing, 17(2):210–229, April two keys map into the same 1988. CODEN SMJCAT. location is only 0.4927 (less ISSN 0097-5397 (print), than one-half).” The discov- 1095-7111 (electronic). Ap- ery is credited to unpublished plies hash functions to prob- work of H. Davenport (1927). lems of error correction in See also [vM39]. messages. Burkowski:1990:UPH Bollobas:1990:CDC [BC90] F. J. Burkowski and G. V. Cormack. Use of perfect [BBS90] Béla Bollobás, Andrei Z. hashing in a paged memory Broder, and Istvan Simon. management unit. In Wah The cost distribution of clus- (v.1) et al. [WPY90], pages tering in random probing. 96–100. ISBN 0-271-00728- Journal of the Association 1. LCCN QA 76.58 I58 1990. for Computing Machinery, Three volumes. 37(2):224–237, April 1990. CODEN JACOAH. ISSN Bird:2006:BSE 0004-5411 (print), 1557-735X [BC06] Steven Bird and James R. (electronic). Curran. Building a search Ball:1939:MRE engine to drive problem- based learning. SIGCSE [BC39] W. W. Rouse (Walter Bulletin (ACM Special Inter- William Rouse) Ball and est Group on Computer Sci- H. S. M. (Harold Scott Mac- ence Education), 38(3):153– Donald [“Donald”]) Coxeter. 157, September 2006. CO- Mathematical recreations and DEN SIGSD3. ISSN 0097- essays. Macmillan Publish- 8418 (print), 2331-3927 (elec- ing Company, New York, tronic). NY, USA, 11th edition, 1939. Balachandran:2008:SHC 45 pp. LCCN QA95 .B3 1939. According to Knuth [BC08] S. Balachandran and C. Con- REFERENCES 108

stantinescu. Sequence of Gibbs, and Stuart Schechter. hashes compression in data Balloon hashing: Prov- de-duplication. In Storer ably space-hard hash func- and Marcellin [SM08], page tions with data-independent 505. ISBN 0-7695-3121- access patterns, January 0. ISSN 1068-0314. LCCN 14, 2016. URL https: QA76.9.D33 D372 2008; //pdfs.semanticscholar. QA76.9.D33 INTERNET. org/f49f/8e135695937bfe03e467e215177eec79d7d URL http://ieeexplore. pdf. Cryptology ePrint ieee.org/stamp/stamp.jsp? Archive Report 2016/027 tp=&arnumber=4483332. Version: 20160601:225540. See [AB17]. Bu:2010:SHF Berra:1987:CAS [BCCL10] Tian Bu, Jin Cao, Aiyou Chen,andPatrickP.C.Lee. [BCH87] P. B. Berra, Soon M. Chung, Sequential hashing: a ﬂexible and Nabil I. Hachem. Com- approach for unveiling signif- puter architecture for a sur- icant patterns in high speed rogate ﬁle to a very large networks. Computer Net- data/knowledge base. Com- works (Amsterdam, Nether- puter, 20(3):25–32, March lands: 1999), 54(18):3309– 1987. CODEN CPTRB4. 3326, December 20, 2010. ISSN 0018-9162 (print), CODEN ???? ISSN 1389- 1558-0814 (electronic). 1286 (print), 1872-7069 (electronic). Biham:2015:CSR

Boldyreva:2009:FNM [BCJ15] Eli Biham, Raﬁ Chen, and Antoine Joux. Crypt- [BCFW09] Alexandra Boldyreva, David analysis of SHA-0 and re- Cash, Marc Fischlin, and duced SHA-1. Journal Bogdan Warinschi. Founda- of Cryptology, 28(1):110– tions of non-malleable hash 160, January 2015. CO- and one-way functions. Lec- DEN JOCREQ. ISSN 0933- ture Notes in CS, 5912: 2790 (print), 1432-1378 (elec- 524–541, 2009. CODEN tronic). URL http://link. LNCSD9. ISSN 0302-9743 springer.com/article/10. (print), 1611-3349 (elec- 1007/s00145-014-9179-8. tronic). URL http://link. Bellare:1996:KHF springer.com/content/pdf/ 10.1007/978-3-642-10366- [BCK96a] M. Bellare, R. Canetti, and 7_31. H. Krawczyk. Keying hash Boneh:2016:BHP functions for message authentication. Lecture Notes [BCGS16] Dan Boneh, Henry Corrigan- in CS, 1109:1–15, 1996. REFERENCES 109

CODEN LNCSD9. ISSN tion of unsigned integers in 0302-9743 (print), 1611-3349 Ada. Ada Letters, 9(1):47–70, (electronic). URL http: January–February 1989. CO- //www.research.ibm.com/ DEN AALEE5. security/. Black:2009:IHE Bellare:1996:MAU [BCS09] J. Black, M. Cochran, and [BCK96b] Mihir Bellare, Ran Canetti, T. Shrimpton. On the im- and Hugo Krawczyk. Mes- possibility of highly-eﬃcient sage authentication using blockcipher-based hash func- hash functions: the HMAC tions. Journal of Cryptology, construction. CryptoBytes,2 22(3):311–329, July 2009. (1):12–15, Spring 1996. URL CODEN JOCREQ. ISSN ftp://ftp.rsa.com/pub/ 0933-2790 (print), 1432- cryptobytes/crypto2n1. 1378 (electronic). URL pdf. http://www.springerlink. com/openurl.asp?genre= Bedau:2004:CHF article&issn=0933-2790& [BCR04] M. Bedau, R. E. Crandall, volume=22&issue=3&spage= and M. Raven. Crypto- 311. graphic hash functions based Bell:1982:KSC on Artiﬁcial Life. Report, Reed College, Portland, OR, [BD82] D. A. Bell and S. M. Deen. USA, 2004. 20 pp. URL Key space compression and http://people.reed.edu/~ hashing in PRECI. The crandall/papers/crypto8. Computer Journal, 25(4): pdf. 486–492, November 1982. CODEN CMPJA6. ISSN Barr:2010:TCS 0010-4620 (print), 1460-2067 (electronic). [BCR10] Thomas W. Barr, Alan L. Cox, and Scott Rixner. Bell:1984:HTV Translation caching: skip, don’t walk (the page ta- [BD84] D. A. Bell and S. M. Deen. ble). ACM SIGARCH Com- Hash trees versus B-Trees. puter Architecture News,38 The Computer Journal,27 (3):48–59, June 2010. CO- (3):218–224, August 1984. DEN CANED2. ISSN 0163- CODEN CMPJA6. ISSN 5964 (print), 1943-5851 (elec- 0010-4620 (print), 1460-2067 tronic). (electronic). Bardin:1989:IUI Bancilhon:1988:PFI [BCS89] B. Bardin, C. Colket, and [BD88] Francois Bancilhon and D. Smith. Implementa- David J. DeWitt, editors. REFERENCES 110

Proceedings of the Fourteenth tures. IEEE/ACM Transac- International Conference on tions on Computational Bi- Very Large Data Bases, Los ology and Bioinformatics,7 Angeles, USA, Aug. 29/Sept. (2):309–322, April 2010. CO- 1, 1988. Morgan Kaufmann DEN ITCBCY. ISSN 1545- Publishers, San Francisco, 5963 (print), 1557-9964 (elec- CA, 1988. ISBN 0-934613- tronic). 75-3. LCCN QA76.9.D3 I559 1988. Bao:2020:GAH Bauspiess:1992:RCH [BDG+20] Zhenzhen Bao, Itai Dinur, [BD92] Fritz Bauspiess and Frank Jian Guo, Ga¨etan Leurent, Damm. Requirements for and Lei Wang. Generic at- cryptographic hash func- tacksonhashcombiners. tions. Computers and Secu- Journal of Cryptology, 33(3): rity, 11(5):427–437, Septem- 742–823, July 2020. CO- ber 1, 1992. CODEN DEN JOCREQ. ISSN 0933- CPSEDU. ISSN 0167-4048. 2790 (print), 1432-1378 (electronic). URL https://link. Buchmann:2008:PQC springer.com/article/10. [BD08] Johannes Buchmann and Jin- 1007/s00145-019-09328-w. tai Ding, editors. Post- Biryukov:2016:ANG Quantum Cryptography: Sec- ond International Workshop, [BDK16] Alex Biryukov, Daniel Dinu, PQCrypto 2008 Cincinnati, and Dmitry Khovratovich. OH, USA, October 17–19, Argon2: new generation of 2008 Proceedings,volume memory-hard functions for 5299 of Lecture Notes in password hashing and other Computer Science. Springer- applications. In IEEE, ed- Verlag, Berlin, Germany / itor, 2016 IEEE European Heidelberg, Germany / Lon- Symposium on Security and don, UK / etc., 2008. Privacy (EURO S&P 2016). ISBN 3-540-88403-3. LCCN 21–24 March 2016 Saar- QA76.9.A25 P63 2008. URL bruecken, Germany, pages http://www.springer.com/ 292–302. IEEE Computer computer/security+and+ Society Press, 1109 Spring cryptology/book/978-3- Street, Suite 300, Silver 540-88402-6. Spring, MD 20910, USA, Blin:2010:ARS 2016. ISBN 1-5090-1751-8. LCCN ???? URL https: [BDD+10] Guillaume Blin, Alain Denise, //ieeexplore.ieee.org/ Serge Dulucq, Claire Her- document/7467361. IEEE rbach, and Heleene Touzet. Computer Society Order Alignments of RNA struc- Number P5776. See [AB17]. REFERENCES 111

Berger:2012:GFL tions. Report, STMicroelec- tronics, Antwerp, Belgium [BDM+12] Thierry P. Berger, Joffrey (??), January 14, 2011. 93 D’Hayer, Kevin Marquet, pp. URL http://sponge. Marine Minier, and Gaël noekeon.org/CSF-0.1.pdf. Thomas. The GLUON family: a lightweight hash func- Bertoni:2012:KIO tion family based on FC- [BDP+12] Guido Bertoni, Joan Dae- SRs. Lecture Notes in CS, men, Michaël Peeters, Gilles 7374:306–323, 2012. CO- Van Assche, and Ronny DEN LNCSD9. ISSN 0302- Van Keer. Keccak im- 9743 (print), 1611-3349 (elec- plementation overview. Re- tronic). URL http://link. port, STMicroelectronics, springer.com/chapter/10. Antwerp, Belgium (??), May 1007/978-3-642-31410-0_ 29, 2012. 59 pp. URL 19/. http://keccak.noekeon. Bussi:2019:MHF org/Keccak-implementation- 3.2.pdf. [BDMD19] Khushboo Bussi, Dhanan- joyDey,P.R.Mishra,and Baraani-Dastjerdi:1997:UCH B. K. Dass. MGR hash functions. Cryptologia,43 [BDPSNG97] A. Baraani-Dastjerdi, J. Piep- (5):372–390, 2019. CO- rzyk, R. Safavi-Naini, and DEN CRYPE6. ISSN 0161- J. R. Getta. Using cryp- 1194 (print), 1558-1586 (elec- tographic hash functions for tronic). URL http:// discretionary access control www.tandfonline.com/doi/ in object-oriented databases. full/10.1080/01611194. J.UCS: Journal of Univer- 2019.1596995. sal Computer Science,3 (6):730–??, June 28, 1997. Bosselaers:1997:RCH ISSN 0948-6968. URL [BDP97] Antoon Bosselaers, Hans http://medoc.springer. Dogbbertin, and Bart Pre- de:8000/jucs_3_6/using_ neel. The RIPEMD-160 cryp- cryptographic_functions_ tographic hash function. Dr. for; internal&sk=05460486. Dobbs Journal, 22(1):24, 26, Bertoni:2006:RBM 28, 78, 80, January 1997. CODEN DDJOEB. ISSN [BDPV06] G. Bertoni, J. Daemen, 1044-789X. M. Peeters, and G. Van Bertoni:2011:CSF Assche. RadioGatún, a belt-and-mill hash function. [BDP11] Guido Bertoni, Joan Dae- Report, STMicroelectronics, men, and Michaël Peeters. Antwerp, Belgium (??), 2006. Cryptographic sponge func- URL http://radiogatun. REFERENCES 112

noekeon.org/.Presented 2009. ISSN 1862-4405. URL at the Second Cryptographic http://drops.dagstuhl. Hash Workshop, Santa Bar- de/opus/volltexte/2009/ bara, August 2006. 1958. Bertoni:2007:SF Bertoni:2012:KSF

[BDPV07] G. Bertoni, J. Daemen, [BDPV12] Guido Bertoni, Joan Dae- M. Peeters, and G. Van men, Michaël Peeters, and Assche. Sponge func- Gilles Van Assche. The tions. Report, STMicroelec- Keccak sponge function fam- tronics, Antwerp, Belgium ily. Web site, October 24, (??), 2007. URL http:/ 2012. URL http://keccak. /www.csrc.nist.gov/pki/ noekeon.org/. HashWorkshop/Public_Comments/ Bertoni:2014:SCS 2007_May.html.Presented at the Ecrypt Hash Work- [BDPV14] Guido Bertoni, Joan Dae- shop 2007, May 2007. men, Michaël Peeters, and Bertoni:2008:ISC Gilles Van Assche. Suffi- cient conditions for sound [BDPV08] G. Bertoni, J. Daemen, tree and sequential hashing M. Peeters, and G. Van Ass- modes. International Jour- che. On the indifferentiabil- nal of Information Security, ity of the sponge construc- 13(4):335–353, August 2014. tion. Lecture Notes in Com- CODEN ???? ISSN 1615- puter Science, 4965:181–197, 5262 (print), 1615-5270 (elec- 2008. ISBN ???? URL http: tronic). URL http://link. //sponge.noekeon.org. springer.com/article/10. 1007/s10207-013-0220-y. Bertoni:2009:RPK Beeri:1988:PTI [BDPV09] Guido Bertoni, Joan Dae- men, Michaël Peeters, and [BDS88] Catriel Beeri, Umeshwar Gilles Van Assche. The Dayal, and Joachim W. road from Panama to Keccak Schmidt, editors. Pro- via RadioGatún. In Helena ceedings of the third In- Handschuh, Stefan Lucks, ternational Conference on Bart Preneel, and Phillip Data and Knowledge Bases– Rogaway, editors, Symmet- Improving Usability and Re- ric Cryptography,number sponsiveness: June 28–30, 09031 in Dagstuhl Semi- 1988, Jerusalem, Israel.Mor- nar Proceedings, page ?? gan Kaufmann Publishers, Schloss Dagstuhl — Leibniz- San Francisco, CA, 1988. Zentrum für Informatik, Ger- ISBN 0-934613-95-8. LCCN many, Dagstuhl, Germany, QA76.9.D3 I5541 1988. REFERENCES 113

Buchmann:2009:HBD Bell:1972:QQM

[BDS09] Johannes Buchmann, Erik [Bel72] James R. Bell. The quadratic Dahmen, and Michael Szydlo. quotient method: a hash Hash-based digital signa- code eliminating secondary ture schemes. In Bernstein clustering. Communications et al. [BBD09b], pages 35–94. of the Association for Com- ISBN 3-540-88701-6 (hard- puting Machinery, 13(2):107– cover), 3-642-10019-8 (soft- 109, February 1972. CO- cover). LCCN QA76.9.A25 DEN CACMA2. ISSN 0001- P67 2009. 0782 (print), 1557-7317 (elec- Beeton:TB4-1-36 tronic). [Bee83] Barbara Beeton. Determin- Bell:1983:QQM ing hashtable size and other quantities. TUGboat, 4(1): [Bel83] J. R. Bell. The quadratic 36–37, April 1983. ISSN quotient method: a hash 0896-3207. code eliminating secondary clustering. Communications Beebe:1999:HTL of the Association for Com- [Bee99] Nelson H. F. Beebe. The hash puting Machinery, 26(1):62– table library. Report, Cen- 63, January 1983. CO- ter for Scientiﬁc Computing DEN CACMA2. ISSN 0001- and Department of Mathe- 0782 (print), 1557-7317 (elec- matics, University of Utah, tronic). Salt Lake City, UT 84112, Bellare:2000:ACC USA, March 12, 1999. 10 pp. URL http://www.math. [Bel00] Mihir Bellare, editor. Ad- utah.edu/pub/emacs/; vances in cryptology — http://www.math.utah.edu/ CRYPTO 2000: 20th an- pub/emacs/hash-1.00.tar. nual International Cryptol- gz. ogy Conference, Santa Bar- Bell:1970:QQM bara, California, USA, Au- gust 20–24, 2000: proceed- [Bel70] James R. Bell. The quadratic ings, volume 1880 of Lec- quotient method: a hash ture Notes in Computer Sci- code eliminating secondary ence. Springer-Verlag, Berlin, clustering. Communications Germany / Heidelberg, Ger- of the Association for Com- many / London, UK / puting Machinery, 13(2):107– etc., 2000. ISBN 3-540- 109, February 1970. CO- 67907-3. ISSN 0302-9743 DEN CACMA2. ISSN 0001- (print), 1611-3349 (elec- 0782 (print), 1557-7317 (electronic). LCCN QA76.9.A25 tronic). C79 2000 Bar. REFERENCES 114

Benzinger:1998:SCB 9743 (print), 1611-3349 (electronic). URL ????. [Ben98] Mike Benzinger. STL containers based on hash tables. Bender:2012:DTH

C/C++ Users Journal,16 + (2):??, February 1998. CO- [BFCJ 12] Michael A. Bender, Mar- DEN CCUJEX. ISSN 1075- tin Farach-Colton, Rob 2838. Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Bell:1983:MCS Medjedovic, Pablo Montes, [BF83] R. Charles Bell and Bryan Pradeep Shetty, Richard P. Floyd. Monte Carlo study of Spillane, and Erez Zadok. Cichelli hash-function solv- Don’t thrash: how to cache ability. Communications of your hash on ﬂash. Proceed- the Association for Comput- ings of the VLDB Endow- ing Machinery, 26(11):924– ment, 5(11):1627–1637, July 925, November 1983. CO- 2012. CODEN ???? ISSN DEN CACMA2. ISSN 0001- 2150-8097. 0782 (print), 1557-7317 (elec- Barn:1995:ODP tronic). [BFG+95] C. Barn, G. Fecteau, A. Goyal, Boral:1989:DMS H. i. Hsiao, A. Jhin- gran, S. Padmanabhan, and [BF89] Haran Boral and Pascal W. Wilson. An overview of Faudemay, editors. Database Machines: Sixth Interna- DB2 parallel edition. SIG- MOD Record (ACM Spe- tional Workshop, IWDM cial Interest Group on Man- ’89, Deauville, France, June agement of Data), 24(2): 1989: Proceedings,volume 460–462, May 1995. CO- 368 of Lecture Notes in Com- DEN SRECD8. ISSN 0163- puter Science. Springer-Ver- 5808 (print), 1943-5835 (elec- lag, Berlin, Germany / Hei- tronic). delberg, Germany / London, UK / etc., 1989. ISBN 0-387- Battiato:2011:RFH 51324-8. LCCN QA76.9.D3 D3576 1989. [BFMP11] Sebastiano Battiato, Gio- Bouillaguet:2008:ACR vanni Maria Farinella, En- rico Messina, and Giovanni [BF08] C. Bouillaguet and P.-A. Puglisi. A robust forensic Fouque. Analysis of the hash component for image collision resistance of Radio- alignment. Lecture Notes in Gat´un using algebraic tech- CS, 6978:473–483, 2011. CO- niques. Lecture Notes in DEN LNCSD9. ISSN 0302- CS, 4876:??, 2008. CO- 9743 (print), 1611-3349 (elec- DEN LNCSD9. ISSN 0302- tronic). URL http://link. REFERENCES 115

springer.com/content/pdf/ on Database Systems, 17(2): 10.1007/978-3-642-24085- 247–303, June 1992. CO- 0_49. DEN ATDSD3. ISSN 0362- 5915 (print), 1557-4644 (elec- Boeker:1987:SAG tronic). URL http://www. [BFR87] Michael Boeker, Dietmar acm.org/pubs/articles/ Fox, and Elisabeth Rueter. journals/tods/1992-17-2/ Setl in action: a gallery of p247-becker/p247-becker. data structures. Technical re- pdf; http://www.acm. port, ????, Hildesheim, Ger- org/pubs/citations/journals/ many, 1987. ?? pp. tods/1992-17-2/p247-becker/ ; http://www.acm.org/ Batory:1980:UMP pubs/toc/Abstracts/tods/ [BG80] D. S. Batory and C. C. 128905.html. Gotlieb. A unifying model Baritaud:1993:FHCb of physical databases. Tech- nical report, ????, Toronto, [BG93] T. Baritaud and H. Gilbert. ON, Canada, 1980. ?? pp. FFT hashing is not collision- free. In Rueppel [Rue93], Batory:1982:UMP pages 31–40. ISBN 0-387- [BG82] D. S. Batory and C. C. 56413-6 (New York), 3-540- Gotlieb. A unifying model 56413-6 (Berlin). LCCN of physical databases. ACM QA76.9.A25 E964 1992. Transactions on Database Blelloch:2007:SHI Systems, 7(4):509–539, De- cember 1982. CODEN [BG07] G. E. Blelloch and D. Golovin. ATDSD3. ISSN 0362-5915 Strongly history-independent (print), 1557-4644 (elec- hashing with applications. tronic). URL http://www. In IEEE [IEE07], pages acm.org/pubs/articles/ 272–282. ISBN 0-7695- journals/tods/1982-7-4/ 3010-9. ISSN 0272-5428. p509-batory/p509-batory. LCCN QA76 .S974 2007. pdf; http://www.acm. URL http://ieeexplore. org/pubs/citations/journals/ ieee.org/servlet/opac? tods/1982-7-4/p509-batory/ punumber=4389466. IEEE . Computer Society order Becker:1992:RBO number P3010. Broadbery:1995:IDE [BG92] Ludger Becker and Ralf Hart- mut G¨uting. Rule-based op- [BGDW95] P. A. Broadbery, T. G´omez- timization and query pro- D´ıaz, and S. M. Watt. On cessing in an extensible the implementation of dy- geometric database sys- namic evaluation. In Levelt tem. ACM Transactions [Lev95], pages 77–84. ISBN REFERENCES 116

0-89791-699-9. LCCN QA Brun:2012:LLS 76.95 I59 1995. URL http: //www.acm.org:80/pubs/ [BGG12] Emmanuel Brun, Arthur citations/proceedings/ Guittet, and Frédéric Gi- issac/220346/p77-broadbery/ bou. A local level-set method . ACM order number: using a hash table data 505950. structure. Journal of Com- putational Physics, 231(6): Barak:1988:HFS 2528–2536, March 20, 2012. [BGF88] Amnon Barak, Bernard A. CODEN JCTPAH. ISSN Galler, and Yaron Farber. A 0021-9991 (print), 1090-2716 holographic file system for (electronic). URL http: a multicomputer with many //www.sciencedirect.com/ disk nodes. Technical Report science/article/pii/S0021999111006991. 88-6, Dept. of Computer Sci- Barthe:2012:VIH ence, Hebrew University of Jerusalem, May 1988. ?? pp. [BGH12] Gilles Barthe, Benjamin Grégoire, and Sylvain Her- Baritaud:1993:FHCa aud. Verified indifferen- [BGG93] T. Baritaud, H. Gilbert, and tiable hashing into elliptic M. Girault. FFT hashing curves. Lecture Notes in CS, is not collision-free. Lec- 7215:209–228, 2012. CO- ture Notes in CS, 658:35– DEN LNCSD9. ISSN 0302- 44, 1993. CODEN LNCSD9. 9743 (print), 1611-3349 (elec- ISSN 0302-9743 (print), tronic). URL http://link. 1611-3349 (electronic). URL springer.com/chapter/10. http://link.springer-ny. 1007/978-3-642-28641-4_ com/link/service/series/ 12/. 0558/bibs/0658/06580035. Barthe:2013:VIH htm; http://link.springer- ny.com/link/service/series/[BGH+13] Gilles Barthe, Benjamin 0558/papers/0658/06580035. Grégoire, Sylvain Heraud, pdf. Federico Olmedo, and San- tiago Zanella-Béguelin. Ver- Bellare:1994:ICC ified indifferentiable hashing [BGG94] M. Bellare, O. Goldreich, into elliptic curves. Jour- and S. Goldwasser. Incre- nal of Computer Security, mental cryptography: the 21(6):881–917, ???? 2013. case of hashing and sign- CODEN JCSIET. ISSN ing. Lecture Notes in CS, 0926-227X (print), 1875-8924 839:216–233, 1994. CO- (electronic). DEN LNCSD9. ISSN 0302- Bagheri:2012:SFP 9743 (print), 1611-3349 (electronic). [BGKZ12] Nasour Bagheri, Praveen REFERENCES 117

Gauravaram, Lars R. Knud- puter Society Press, 1109 sen, and Erik Zenner. The Spring Street, Suite 300, Sil- suffix-free-prefix-free hash ver Spring, MD 20910, USA, function construction and 1985. ISBN 0-8186-0639-8. its indifferentiability secu- 122–127 pp. LCCN QA75.5 rity analysis. Interna- .I6351 1985. IEEE Service tional Journal of Informa- Cent. Piscataway, NJ, USA. tion Security, 11(6):419– 434, November 2012. CO- Bruckner:1986:MPH DEN ???? ISSN 1615- [BH86] Jared A. Bruckner and James 5262 (print), 1615-5270 (elec- Harp. Minimal perfect hash- tronic). URL http://link. ing functions for Modula-2 springer.com/article/10. word lists. Journal of Pas- 1007/s10207-012-0175-4. cal, Ada and Modula-2, 5(6): Bierbrauer:1996:OAR 39–40, November–December 1986. CODEN JPAME8. [BGS96] Jürgen Bierbrauer, K. Gopalakr- ISSN 0747-1351, 0735-1232. ishnan, and D. R. Stinson. Orthogonal arrays, resilient Banieqbal:1990:RMH functions, error-correcting codes, and linear program- [BH90] B. Banieqbal and S. Hilditch. ming bounds. SIAM Jour- The random matrix hash- nal on Discrete Mathematics, ing algorithm. Technical 9(3):424–452, August 1996. Report UMCS-90-9-1, De- CODEN SJDMEC. ISSN partment of Computer Sci- 0895-4801 (print), 1095-7146 ence, University of Manch- (electronic). ester, Manchester, UK, 1990. ?? pp. Bosselaers:1996:FHP Bast:1991:FRP [BGV96] A. Bosselaers, R. Govaerts, and J. Vandewalle. Fast [BH91] Holger Bast and Torben hashing on the Pentium. Hagerup. Fast and reliable Lecture Notes in CS, 1109: parallel hashing. In ACM- 298–312, 1996. CODEN PAA’91 [ACM91c], pages 50– LNCSD9. ISSN 0302-9743 61. ISBN 0-89791-438-4. (print), 1611-3349 (elec- LCCN QA76.58 .A27 1991. tronic). Ban-Hashemi:1993:FAC Berkovich:1985:MSP [BH93] A. Ban-Hashemi. A Fourier [BH85] Simon Y. Berkovich and Abd approach to camera orien- El Fatah A. Hegazy. Match- tation. IEEE Transactions ing String Patterns in Large on Pattern Analysis and Ma- Textual Files. IEEE Com- chine Intelligence, 15(11): REFERENCES 118

1197, 1993. CODEN ITPIDJ. 9743 (print), 1611-3349 (elec- ISSN 0162-8828. tronic). URL http://link. Bernstein:2015:SPS springer.com/chapter/10. 1007/978-3-642-36594-2_ [BHH+15] Daniel J. Bernstein, Daira 3/. Hopwood, Andreas H¨ulsing, Berman:2019:HPR Tanja Lange, Ruben Nieder- hagen, Louiza Papachristodoulou,[BHKN19] Itay Berman, Iftach Hait- Michael Schneider, Peter ner, Ilan Komargodski, and Schwabe, and Zooko Wilcox- Moni Naor. Hardness- O’Hearn. SPHINCS: Practi- preserving reductions via cal stateless hash-based sig- cuckoo hashing. Journal natures. Lecture Notes in of Cryptology, 32(2):361– CS, 9056:368–397, 2015. CO- 392, April 2019. CO- DEN LNCSD9. ISSN 0302- DEN JOCREQ. ISSN 0933- 9743 (print), 1611-3349 (elec- 2790 (print), 1432-1378 (electronic). URL https://link. tronic). URL https://link. springer.com/chapter/10. springer.com/article/10. 1007/978-3-662-46800-5_ 1007/s00145-018-9293-0. 15. Brassard:1997:QCH Ben-Haim:2012:PHC [BHT97] Gilles Brassard, Peter Høyer, [BHIMM12] Yael Ben-Haim, Alexan- and Alain Tapp. Quantum der Ivrii, Oded Margalit, cryptanalysis of hash and and Arie Matsliah. Per- claw-free functions. ACM fect hashing and CNF en- SIGACT News, 28(2):14– codings of cardinality con- 19, June 1997. CODEN straints. Lecture Notes in SIGNDM. ISSN 0163- CS, 7317:397–409, 2012. CO- 5700 (print), 1943-5827 (elec- DEN LNCSD9. ISSN 0302- tronic). 9743 (print), 1611-3349 (elec- Brassard:1998:QCH tronic). URL http://link. springer.com/content/pdf/ [BHT98] G. Brassard, P. Hoyer, and 10.1007/978-3-642-31612- A. Tapp. Quantum crypt- 8_30. analysis of hash and claw-free functions. Lecture Notes in Berman:2013:HPR CS, 1380:163–??, 1998. CO- [BHKN13] Itay Berman, Iftach Hait- DEN LNCSD9. ISSN 0302- ner, Ilan Komargodski, and 9743 (print), 1611-3349 (elec- Moni Naor. Hardness pre- tronic). serving reductions via cuckoo Bohm:1987:BQK hashing. Lecture Notes in CS, 7785:40–59, 2013. CO- [BI87] Alexander B¨ohm and Jan- DEN LNCSD9. ISSN 0302- nis Iliadis. Ein Beitrag REFERENCES 119

zu den quadratischen Kol- versal hashing and geomet- lisionsstrategien in Hash- ric codes. Designs, Codes, Tabellen—Ein neuer Al- and Cryptography, 11(3): gorithmus. (German) [on 207–221, July 1997. CO- quadratic strategies for han- DEN DCCREC. ISSN dling collisions in hash tables 0925-1022 (print), 1573-7586 — a new algorithm]. Ange- (electronic). URL http: wandte Informatik, 29(3): //www.wkap.nl/oasis.htm/ 111–118, March 1987. CO- 131331. DEN AWIFA7. Biham:2008:NTC Bozas:2012:LSS [Bih08] Eli Biham. New tech- [BI12] Konstantinos Bozas and niques for cryptanalysis of Ebroul Izquierdo. Large hash functions and improved scale sketch based image re- attacks on Snefru. Lec- trieval using patch hash- ture Notes in CS, 5086: ing. Lecture Notes in CS, 444–461, 2008. CODEN 7431:210–219, 2012. CO- LNCSD9. ISSN 0302-9743 DEN LNCSD9. ISSN 0302- (print), 1611-3349 (elec- 9743 (print), 1611-3349 (electronic). URL http://link. tronic). URL http://link. springer.com/content/pdf/ springer.com/content/pdf/ 10.1007/978-3-540-71039- 10.1007/978-3-642-33179- 4_28. 4_21. Binstock:1996:HR Bierbrauer:1995:CUH [Bin96] Andrew Binstock. Hashing [Bie95] J. Bierbrauer. A2-codes rehashed. Dr. Dobbs Journal, from universal hash classes. 21(4):24–??, April 1, 1996. In Guillou and Quisquater CODEN DDJOEB. ISSN [GQ95], pages 311–318. 1044-789X. ISBN 3-540-59409-4. ISSN Belkin:1992:PAI 0302-9743 (print), 1611- 3349 (electronic). LCCN [BIP92] Nicholas Belkin, Peter Ingw- QA76.9.A25 C794 1995. URL ersen, and Annelise Mark Pe- http://link.springer-ny. jtersen, editors. Proceedings com/link/service/series/ of the 15th Annual Interna- 0558/bibs/0921/09210311. tional ACM SIGIR Confer- htm; http://link.springer- ence on Research and Devel- ny.com/link/service/series/ opment in Information Re- 0558/papers/0921/09210311. trieval, Copenhagen, Den- pdf. mark, June 21–24, 1992. ACM Press, New York, NY Bierbrauer:1997:UHG 10036, USA, 1992. ISBN [Bie97] J¨urgen Bierbrauer. Uni- 0-89791-523-2 (paperback), REFERENCES 120

0-89791-524-0 (hardcover). 592-5. LCCN QA76.A1 LCCN Z699.A1 I659 1992. A1135 v.22:2.

Biryukov:2007:FSE Barwick:2007:SAL

[Bir07] Alex Biryukov, editor. Fast [BJ07] Susan G. Barwick and Wen- software encryption: 14th in- Ai Jackson. A sequence ternational workshop, FSE approach to linear perfect 2007, Luxembourg, Luxem- hash families. Designs, bourg, March 26–28, 2007, Codes, and Cryptography,45 revised selected papers,vol- (1):95–121, October 2007. ume 4593 of Lecture notes CODEN DCCREC. ISSN in computer science. Spring- 0925-1022 (print), 1573- er-Verlag, Berlin, Germany / 7586 (electronic). URL Heidelberg, Germany / Lon- http://www.springerlink. don, UK / etc., 2007. com/openurl.asp?genre= ISBN 3-540-74617-X (soft- article&issn=0925-1022& cover). LCCN QA76.9.A25 volume=45&issue=1&spage= F77 2007. URL http: 95. //www.springerlink.com/ openurl.asp?genre=book\ Bierbrauer:1993:FHF %26isbn=978-3-540-74617- 1. [BJKS93] J. Bierbrauer, T. Johans- Biscani:2012:PSP son, G. Kabatianskii, and B. Smeets. On families of [Bis12] Francesco Biscani. Paral- hash functions via geometric lel sparse polynomial mul- codes and concatenation. In tiplicationonmodernhard- Stinson [Sti93], pages 331– ware architectures. In 342. ISBN 0-387-57766-1 van der Hoeven and van (New York), 3-540-57766-1 Hoeij [vdHvH12], pages 83– (Berlin). LCCN QA76.9.A25 90. ISBN 1-4503-1269-1. C79 1993. LCCN QA76.95 .I59 2012. Bierbrauer:1994:FHF Buneman:1993:PAS [BJKS94] Jurgen Bierbrauer, Thomas [BJ93] Peter Buneman and Sushil Johansson, Gregory Kaba- Jajodia, editors. Proceedings tianskii, and Ben Smeets. On of the 1993 ACM SIGMOD families of hash functions via International Conference on geometric codes and concate- Management of Data: SIG- nation. Lecture Notes in MOD ’93, Washington, DC, CS, 773:331–342, 1994. CO- May 26–28, 1993.ACM DEN LNCSD9. ISSN 0302- Press, New York, NY 10036, 9743 (print), 1611-3349 (elec- USA, 1993. ISBN 0-89791- tronic). REFERENCES 121

Benhamouda:2016:NFP Benouamer:1994:HLN

[BJL16] Fabrice Benhamouda, Marc [BJMM94b] M. O. Benouamer, P. Jail- Joye, and BenoˆıT Libert. A lon, D. Michelucci, and J.-M. new framework for privacy- Moreau. Hashing lazy num- preserving aggregation of bers: Hash-Speicherung von time-series data. ACM ,,tragen” Zahlen. Comput- Transactions on Information ing, 53(3 / 4):205–??, 1994. and System Security, 18(3): CODEN CMPTA2. ISSN 10:1–10:??, April 2016. CO- 0010-485X (print), 1436-5057 DEN ATISBQ. ISSN 1094- (electronic). 9224 (print), 1557-7406 (electronic). Bocca:1994:ICV

Braibant:2014:IRA [BJZ94] Jorge Bocca, Matthias Jarke, [BJM14] Thomas Braibant, Jacques- and Carlo Zaniolo, edi- Henri Jourdan, and David tors. 20th International Monniaux. Implementing Conference on Very Large and reasoning about hash- Data Bases, September 12th– consed data structures in 15th 1994, Santiago, Chile Coq. Journal of Auto- proceedings, PROCEED- mated Reasoning, 53(3):271– INGS OF THE INTERNA- 304, October 2014. CO- TIONAL CONFERENCE DEN JAREEW. ISSN 0168- ON VERY LARGE DATA 7433 (print), 1573-0670 (elec- BASES 1994; EDIT 20. Mor- tronic). URL http://link. gan Kaufmann Publishers, springer.com/article/10. San Francisco, CA, 1994. 1007/s10817-014-9306-0. ISBN 1-55860-153-8. ISSN 0730-9317. LCCN QA76.9 Benouamer:1994:HST D3 I61 1994. [BJMM94a] M. O. Benouamer, P. Jail- Bell:1970:LQH lon, D. Michelucci, and J.-M. Moreau. Hash-Speicherung [BK70] James R. Bell and Charles H. von ,,tragen” Zahlen. (Ger- Kaman. The linear quotient man) [Hashing “lazy” num- hash code. Communications bers]. Computing, 53(3– of the Association for Com- 4):205–217, 1994. CODEN puting Machinery, 13(11): CMPTA2. ISSN 0010-485X 675–677, November 1970. (print), 1436-5057 (elec- CODEN CACMA2. ISSN tronic). International Sym- 0001-0782 (print), 1557-7317 posium on Scientiﬁc Com- (electronic). Independent puting, Computer Arith- discovery of technique of sec- metic and Validated Numer- ondary hash functions ﬁrst ics (Vienna, 1993). proposed by [de 69]. REFERENCES 122

Bechtold:1984:UEH nistpubs/800-90/SP800- 90revised_March2007.pdf. [BK84] Ulrich Bechtold and Klaus Küspert. On the use of Bradford:2007:PSC extendible hashing without hashing. Information [BK07b] Phillip G. Bradford and Processing Letters, 19(1): Michael N. Katehakis. A 21–26, July 1984. CO- probabilistic study on com- DEN IFPLAT. ISSN 0020- binatorial expanders and 0190 (print), 1872-6119 (elec- hashing. SIAM Journal tronic). on Computing, 37(1):83– Brassard:1988:GRP 111, ???? 2007. CO- DEN SMJCAT. ISSN 0097- [BK88] Gilles Brassard and Sam- 5397 (print), 1095-7111 (elec- path Kannan. The gener- tronic). ation of random permutations on the fly. Informa- Boldyreva:2012:NPG tion Processing Letters,28 (4):207–212, July 1988. CO- [BK12] Alexandra Boldyreva and DEN IFPLAT. ISSN 0020- Virendra Kumar. A new 0190 (print), 1872-6119 (elec- pseudorandom generator from tronic). collision-resistant hash functions. Report, School of Broder:1990:MAH Computer Science, Georgia [BK90] Andrei Z. Broder and Anna R. Institute of Technology, At- Karlin. Multilevel adaptive lanta, GA, USA, February 6, hashing. In SDA’90 [SDA90], 2012. URL http://eprint. pages 43–53. ISBN 0-89871- iacr.org/2012/056. 251-3. LCCN QA76.6 .A278 1990. Bogdanov:2011:SLH Barker:2007:RRN [BKL+11] Andrey Bogdanov, Miroslav [BK07a] Elaine Barker and John Kneˇzević, Gregor Leander, Kelsey. Recommendation for Deniz Toz, and Kerem Varıcı. random number generation spongent: a lightweight hash using deterministic random function. Lecture Notes in bit generators (revised).Na- CS, 6917:312–325, 2011. CO- tional Institute for Standards DEN LNCSD9. ISSN 0302- and Technology, Gaithers- 9743 (print), 1611-3349 (elec- burg, MD 20899-8900, USA, tronic). URL http://link. March 2007. viii + 124 springer.com/content/pdf/ pp. URL http://csrc. 10.1007/978-3-642-23951- nist.gov/publications/ 9_21. REFERENCES 123

Brier:2009:LFC T. Paul Lee. Point representation and hashing of an [BKMP09] Eric Brier, Shahram Khaz- interval. Information Pro- aei, Willi Meier, and Thomas cessing Letters, 30(4):201– Peyrin. Linearization frame- 203, February 1989. CO- work for collision attacks: DEN IFPLAT. ISSN 0020- Application to CubeHash 0190 (print), 1872-6119 (elec- and MD6. Lecture Notes in tronic). CS, 5912:560–577, 2009. CO- DEN LNCSD9. ISSN 0302- Blasius:1995:GRR 9743 (print), 1611-3349 (elec- [Bla95] Arlene Blasius. Generating tronic). URL http://link. a rotation reduction perfect springer.com/content/pdf/ hashing function. Mathe- 10.1007/978-3-642-10366- matics Magazine, 68(1):35– 7_33. ??, February 1, 1995. CO- Bibak:2018:AUH DEN MAMGA8. ISSN 0025- 570X. [BKST18] Khodakhast Bibak, Bruce M. Blackburn:2000:PHF Kapron, Venkatesh Srini- vasan, and LászlóTóth. [Bla00] S. R. Blackburn. Perfect hash On an almost-universal hash families: Probabilistic meth- function family with applica- ods and explicit constructions to authentication and tions. Journal of Combinato- secrecy codes. International rial Theory (Series A), 92(1): Journal of Foundations of 54–60, October 2000. CO- Computer Science, 29(3): DEN JCBTA7. ISSN 0097- 357–??, April 2018. CODEN 3165. IFCSEN. ISSN 0129-0541. Bando:2012:FBG Boral:1988:SIC [BLC12] Masanori Bando, Yi-Li Lin, [BL88] Haran Boral and Per-Ake˚ and H. Jonathan Chao. Larson, editors. SIG- FlashTrie: beyond 100-Gb/s MOD International Con- IP route lookup using hash- ference on Management of based prefix-compressed trie. Data, Chicago, Illinois, June IEEE/ACM Transactions 1–3: 1988 Proceedings.ACM on Networking, 20(4):1262– Press, New York, NY 10036, 1275, August 2012. CO- USA, 1988. ISBN 0-89791- DEN IEANEP. ISSN 1063- 268-3. LCCN QA 76.9 6692 (print), 1558-2566 (elec- D3 S53 v.17 no.3 1988. tronic). US$33.00. Bloom:1970:STT Barkley:1989:PRH [Blo70] Burton H. Bloom. Space/ [BL89] Ronald E. Barkley and time trade-offs in hash cod- REFERENCES 124

ing with allowable errors. of search trees and random Communications of the As- access files. ACM Transac- sociation for Computing Ma- tions on Database Systems,1 chinery, 13(7):422–426, July (1):37–52, March 1976. CO- 1970. CODEN CACMA2. DEN ATDSD3. ISSN 0362- ISSN 0001-0782 (print), 5915 (print), 1557-4644 (elec- 1557-7317 (electronic). tronic). Also published in [Ker75, p. 508–510]. Barber:2014:MEH Barklund:1987:HTL [BLP+14] R. Barber, G. Lohman, I. Pandis, V. Raman, R. Si- [BM87] J. Barklund and H. Mill- dle, G. Attaluri, N. Chainani, roth. Hash tables in logic S. Lightstone, and D. Sharpe. programming. In Lassez Memory-efficient hash joins. [Las87], pages 411–427. ISBN Proceedings of the VLDB En- 0-262-12125-5 (ensemble) 0- dowment, 8(4):353–364, De- 262-12129-8 (vol. 2). LCCN cember 2014. CODEN ???? QA76.6 .L589 1987 v. 1-2. ISSN 2150-8097. Blakeley:1989:JIM Blustein:1995:IBV [BM89] J. A. Blakeley and N. L. Mar- [Blu95] James Blustein. Implement- tin. Join index, material- ing bit vectors in C. Dr. ized view, and hybrid-hash Dobbs Journal, 20(8):42, 44, join: a performance analy- 46, 96, 98–100, August 1, sis. Technical Report T, In- 1995. CODEN DDJOEB. diana University, Computer ISSN 1044-789X. Science Department, June Battulga:2020:HTP 1989. ?? pp. [BLY20] Lkhagvadorj Battulga, Sang- Blakeley:1990:JIM Hyun Lee, and Kwan-Hee [BM90a] Jose A. Blakeley and Nancy L. Yoo. Hash-tree PCA: accel- Martin. Join index, materi- erating PCA with hash-based alized view, and hybrid-hash grouping. The Journal of Su- join: a performance anal- percomputing, 76(10):8248– ysis. In Blakeley & Mar- 8264, October 2020. CO- tin [ICD90], pages 256–263. DEN JOSUED. ISSN 0920- ISBN 0-8186-2025-0 (paper- 8542 (print), 1573-0484 (elec- back), 0-8186-9025-9 (hard- tronic). URL https://link. cover), 0-8186-6025-2 (mi- springer.com/article/10. crofiche). LCCN QA76.9.D3 1007/s11227-019-02947-x. I5582 1990. Bayer:1976:EST Bourdon:1990:ORU [BM76] R. Bayer and J. K. Met- [BM90b] Olivier Bourdon and Gérard zger. On the encipherment Medioni. Object Recogni- REFERENCES 125

tion Using Geometric Hash- pages 1454–1463. ISBN ing on the Connection Ma- 0-7803-7016-3 (softbound), chine. In Freeman [Fre90], 0-7803-7017-1 (microfiche), pages 596–600. ISBN 0-8186- 0-7803-7018-X (CD-ROM). 2062-5 (v.1, paperback), 0- LCCN TK5105.5 .I48 2001. 8186-2063-3 (v.2, paper- URL http://ieeexplore. back), 0-8186-6062-7 (v.1, ieee.org/servlet/opac? microfiche), 0-8186-6063-5 punumber=7321. (v.2, microfiche), 0-8186- 9062-3 (v.1, hardcover), 0- Beyer:1968:LEC 8186-9063-1 (v.2, hardcover). [BMB68] J. D. Beyer, W. D. Mau- LCCN TK7882.P3 I58 1990. rer, and Frank K. Bam- Two volumes. berger. Letter to the Edi- Bellare:1997:NPC tor: Comments on “an improved hash code for scat- [BM97] M. Bellare and D. Mic- ter storage”. Communi- ciancio. A new paradigm cations of the Association for collision-free hashing: for Computing Machinery,11 Incrementality at reduced (5):378, May 1968. CO- cost. Lecture Notes in CS, DEN CACMA2. ISSN 0001- 1233:163–??, 1997. CO- 0782 (print), 1557-7317 (elec- DEN LNCSD9. ISSN 0302- tronic). 9743 (print), 1611-3349 (electronic). Bustio-Martinez:2019:UHL

Brodnik:1999:MCT [BMLLC+19] Lázaro Bustio-Mart´ınez, Mart´ın Letras-Luna, René Cumplido, [BM99] Andrej Brodnik and J. Ian Raudel Hernández-León, Clau- Munro. Membership in dia Feregrino-Uribe, and constant time and almost- José M. Bande-Serrano. Us- minimum space. SIAM Jour- ing hashing and lexicographic nal on Computing, 28(5): order for Frequent Itemsets 1627–1640, October 1999. Mining on data streams. CODEN SMJCAT. ISSN Journal of Parallel and Dis- 0097-5397 (print), 1095-7111 tributed Computing, 125(??): (electronic). URL http:/ 58–71, March 2019. CO- /epubs.siam.org/sam-bin/ DEN JPDCER. ISSN dbq/article/29416. 0743-7315 (print), 1096-0848 (electronic). URL http: Broder:2001:UMH //www.sciencedirect.com/ [BM01] Andrei Broder and Michael science/article/pii/S0743731518308244. Mitzenmacher. Using multi- Black:1998:GHA ple hash functions to improve IP lookups. In IEEE [IEE01], [BMQ98] John R. Black, Jr., Charles U. REFERENCES 126

Martel, and Hongbin Qi. nung für die Deutsche Graph and hashing al- Sprache. Angewandte Infor- gorithms for modern ar- matik, Applied Informatics, chitectures: Design and 27(4):152–159, April 1985. performance. In Kurt CODEN AWIFA7. Mehlhorn, editor, Proceed- Barreto:2010:WNC ings of the 2nd Work- shop on Algorithm Engineer- [BNN+10] Paulo Barreto, Ventzislav ing (WAE’98), Saarbrücken, Nikov, Svetla Nikova, Vin- Germany, August 1998, cent Rijmen, and Elmar Tis- page ?? Max-Planck-Institut chhauser. Whirlwind: a für Informatik, Saarbrücken, new cryptographic hash func- Germany, 1998. ISBN ???? tion. Designs, Codes, and LCCN ???? Report number Cryptography, 56(2–3):141– MPI-I-98-1-019. 162, August 2010. CO- Buhrman:2002:BO DEN DCCREC. ISSN 0925-1022 (print), 1573- [BMRV02] H. Buhrman, P. B. Mil- 7586 (electronic). URL tersen, J. Radhakrishnan, http://www.springerlink. and S. Venkatesh. Are bitvec- com/openurl.asp?genre= tors optimal? SIAM Jour- article&issn=0925-1022& nal on Computing, 31(6): volume=56&issue=2&spage= 1723–1744, December 2002. 141. CODEN SMJCAT. ISSN Bobrow:1975:NHL 0097-5397 (print), 1095-7111 (electronic). URL http:/ [Bob75] Daniel G. Bobrow. A note /epubs.siam.org/sam-bin/ on hash linking. Commu- dbq/article/40529. nications of the Association for Computing Machinery,18 Barthels:2017:DJA (7):413–415, July 1975. CO- [BMS+17] Claude Barthels, Ingo Müller, DEN CACMA2. ISSN 0001- Timo Schneider, Gustavo 0782 (print), 1557-7317 (elec- Alonso, and Torsten Hoe- tronic). fler. Distributed join algo- Bolour:1979:OPM rithms on thousands of cores. Proceedings of the VLDB [Bol79] Azad Bolour. Optimality Endowment, 10(5):517–528, properties of multiple-key January 2017. CODEN ???? hashing functions. Journal ISSN 2150-8097. of the Association for Com- Barth:1985:SSS puting Machinery, 26(2):196– 210, April 1979. CODEN [BN85] Wilhelm Barth and Hein- JACOAH. ISSN 0004-5411 rich Nirschl. Sichere Sin- (print), 1557-735X (elec- nentsprechende Silbentren- tronic). REFERENCES 127

Bookstein:1972:DH of SIGSOC Bulletin.ACM Press, New York, NY 10036, [Boo72] Abraham Bookstein. Dou- USA, 1981. CODEN SG- ble hashing. Journal of the BLDB. ISBN 0-89791-056-7 American Society for Infor- (pt. 1), 0-89791-064-8 (pt. 2). mation Science, 23(6):402– ISSN 0163-5794. LCCN H61 405, November 1972. CO- .S53 v.12 no.4-v.13 no.1-3. DEN AISJB6. ISSN 0002- Borgwardt:1984:PPU 8231 (print), 1097-4571 (electronic). [Bor84] P. Borgwardt. Parallel Pro- log using stack segments Bookstein:1973:HST on shared-memory multipro- [Boo73] Abraham Bookstein. On cessors. In IEEE-ISLP’84 Harrison’s substring testing [IEE84], page ?? ISBN technique. Communications 0-8186-0522-7 (paperback), of the Association for Com- 0-8186-8522-0 (hardcover), puting Machinery, 16(3):180– 0-8186-4522-9 (microﬁche). 181, March 1973. CO- LCCN QA76.6 .I5735 1984. DEN CACMA2. ISSN 0001- CH2007-3/84/0002$01.00. 0782 (print), 1557-7317 (elec- Bosselaers:19xx:EFH tronic).

Bookstein:1974:HCN [Bosxx] A. Bosselaers. Even faster hashing on the Pentium. [Boo74] Abraham Bookstein. Hash In ????, page ???? ????, coding with a non-unique ????, 19xx. URL ftp: search key. Journal of the //ftp.esat.kuleuven.ac. American Society for Infor- be/pub/COSIC/bosselae/ mation Science, 25(4):232– pentiumplus.ps.gz.Pre- 236, July–August 1974. CO- sented at the rump session DEN AISJB6. ISSN 0002- of Eurocrypt’97, Konstanz, 8231 (print), 1097-4571 (elec- Germany, May 12-15, 1997, tronic). and updated on November 13, 1997. Borman:1981:PSP Bos:2011:EHU [Bor81] Lorraine Borman, editor. Proceedings: selected papers [BOS11]¨ Joppe W. Bos, Onur Ozen,¨ from the Conference on Eas- and Martijn Stam. Ef- ier and More Productive Use ﬁcient hashing using the of Computer Systems, May AES instruction set. Lec- 20–22, 1981, Ann Arbor, ture Notes in CS, 6917: Michigan. Part 2. Human in- 507–522, 2011. CODEN teraction and the user inter- LNCSD9. ISSN 0302-9743 face, volume 12(4), 13(1–3) (print), 1611-3349 (elec- REFERENCES 128

tronic). URL http://link. Boyd:1995:CCI springer.com/content/pdf/ 10.1007/978-3-642-23951- [Boy95b] Colin Boyd, editor. Cryptog- 9_33. raphy and coding: 5th IMA conference, Cirencester, UK, Boukliev:1995:NTL December 18–20, 1995, proceedings, volume 1025 of Lec- [Bou95] I. G. Boukliev. New ternary ture Notes in Computer Sci- linear codes. IEEE Interna- ence. Springer-Verlag, Berlin, tional Symposium on Infor- Germany / Heidelberg, Ger- mation Theory, ????(????): many / London, UK / etc., 500–??, ???? 1995. CODEN 1995. CODEN LNCSD9. PISTFZ. ISSN 0271-4655. ISBN 3-540-60693-9. ISSN Boutin:2012:NSW 0302-9743 (print), 1611- 3349 (electronic). LCCN [Bou12] Chad Boutin. NIST se- QA268 .C76 1995. URL lects winner of Secure http://link.springer-ny. Hash Algorithm (SHA-3) com/link/service/series/ Competition. Press re- 0558/tocs/t1025.htm; lease., October 2, 2012. http://www.springerlink. URL http://csrc.nist. com/content/978-3-540- gov/groups/ST/hash/sha- 60693-2; http://www. 3/index.html; http:// springerlink.com/openurl. csrc.nist.gov/groups/ST/ asp?genre=issue&issn=0302- hash/sha-3/winner_sha-3. 9743&volume=1025.Papers html; http://www.nist. from the 5th IMA Conference gov/itl/csd/sha-100212. on Cryptography and Cod- cfm. ing. Boyd:1995:CCC Boyer:1998:AAR

[Boy95a] C. Boyd, editor. Cryptog- [Boy98] John Boyer. Algorithm al- raphy and coding: 5th Con- ley: Resizable data struc- ference — December 1995, tures. Dr. Dobbs Jour- Cirencester, number 1025 nal, 23(1):115–116, 118, 129, in Lecture Notes in Com- January 1998. CODEN puter Science. Springer-Ver- DDJOEB. ISSN 1044-789X. lag, Berlin, Germany / Hei- Discusses some deﬁciencies of delberg, Germany / London, the Java library hash ta- UK / etc., 1995. ISBN 3- ble support, and compares it 540-60693-9. ISSN 0302- with his algorithm and that 9743 (print), 1611-3349 (elec- used in the C++ Standard tronic). LCCN QA268 .C76 Template Library. Also com- 1995. pares the Jenkins hash func- REFERENCES 129

tion [Jen97] with the one pro- Brier:2009:CC posed in this paper. [BP09] Eric Brier and Thomas Beuchat:2011:LAU Peyrin. Cryptanalysis of CubeHash. Lecture Notes in [BOY11] Jean-Luc Beuchat, Eiji CS, 5536:354–368, 2009. CO- Okamoto, and Teppei Ya- DEN LNCSD9. ISSN 0302- mazaki. A low-area uni- 9743 (print), 1611-3349 (elec- ﬁed hardware architecture tronic). URL http://link. for the AES and the cryp- springer.com/content/pdf/ tographic hash function 10.1007/978-3-642-01957- ECHO. Journal of Cryp- 9_22. tographic Engineering, 1(2): 101–121, August 2011. CO- Budroni:2018:HGB DEN ???? ISSN 2190- [BP18] Alessandro Budroni and Fed- 8508 (print), 2190-8516 (elec- erico Pintore. Hashing to tronic). URL http://link. G2 on BLS pairing-friendly springer.com/article/10. curves. ACM Communi- 1007/s13389-011-0009-8. cations in Computer Alge- Biliris:1994:EEO bra, 52(3):63–66, September 2018. CODEN ???? ISSN [BP94] Alexandros Biliris and Eu- 1932-2232 (print), 1932-2240 thimios Panagos. EOS: (electronic). An Extensible Object Store. SIGMOD Record (ACM Spe- Ben-Porat:2012:VHH cial Interest Group on Man- [BPBBLP12] Udi Ben-Porat, Anat Bremler- agement of Data), 23(2): Barr, Hanoch Levy, and 517, June 1994. CO- Bernhard Plattner. On the DEN SRECD8. ISSN 0163- vulnerability of hardware 5808 (print), 1943-5835 (elec- hash tables to sophisticated tronic). attacks. Lecture Notes in Barbour:1997:DMH CS, 7289:135–148, 2012. CO- DEN LNCSD9. ISSN 0302- [BP97] A. D. Barbour and R. M. 9743 (print), 1611-3349 (elec- Phatarfod. Dimension- tronic). URL http://link. ing a multiple hashing springer.com/chapter/10. scheme. Journal of Ap- 1007/978-3-642-30045-5_ plied Probability, 34(2):477– 11/. 486, June 1997. CO- Bakhtiari:1997:WGC DEN JPRBAM. ISSN 0021-9002 (print), 1475-6072 [BPSN97] S. Bakhtiari, J. Pieprzyk, (electronic). URL http: and R. Safavi-Naini. On the //www.jstor.org/stable/ weaknesses of Gong’s colli- 3215386. sionful hash function. J.UCS: REFERENCES 130

Journal of Universal Com- December ??, 1975. CO- puter Science, 3(3):185–??, DEN IFPLAT. ISSN 0020- March 28, 1997. ISSN 0948- 0190 (print), 1872-6119 (elec- 6968. URL http://www. tronic). iicm.edu/jucs_3_3/hash_ function. Bellare:1994:OAEa Buehrer:2010:DPS [BR94] Mihir Bellare and Phillip Ro- gaway. Optimal asymmetric [BPT10] Gregory Buehrer, Srini- encryption. Research report vasan Parthasarathy, and RC 19610 (86198), IBM T. Shirish Tatikonda. A dis- J. Watson Research Center, tributed placement service Yorktown Heights, NY, USA, for graph-structured and June 16, 1994. 19 pp. Ap- tree-structured data. SIG- pears in Advances in Cryp- PLAN Notices, 45(5):355– tology — Eurocrypt 94 Pro- 356, May 2010. CODEN ceedings, 1994. SINODQ. ISSN 0362-1340 (print), 1523-2867 (print), Bellare:1997:CRH 1558-1160 (electronic). [BR97] Mihir Bellare and Phillip Ro- Botelho:2007:SSE gaway. Collision-resistant [BPZ07] Fabiano C. Botelho, Ras- hashing: Towards making mus Pagh, and Nivio Zi- UOWHFs practical. Lec- viani. Simple and space- ture Notes in CS, 1294:470– eﬃcient minimal perfect ??, 1997. CODEN LNCSD9. hash functions. In Dehne ISSN 0302-9743 (print), et al. [DSZ07b], pages 139– 1611-3349 (electronic). URL 150. CODEN LNCSD9. http://link.springer-ny. ISBN 3-540-73948-3. ISSN com/link/service/series/ 0302-9743 (print), 1611- 0558/bibs/1294/12940470. 3349 (electronic). LCCN htm; http://link.springer- ???? URL http:/ ny.com/link/service/series/ /www.springerlink.com/ 0558/papers/1294/12940470. content/12165xq21248x275/ pdf. ; http://www.springerlink. Bellare:2006:MPP com/content/978-3-540- 73948-7/. [BR06] Mihir Bellare and Thomas Ristenpart. Multi-property- Banerjee:1975:DLD preserving hash domain ex- [BR75] J. Banerjee and V. Rajara- tension and the EMD trans- man. A dual link data struc- form. Lecture Notes in CS, ture for random ﬁle orga- 4284:299–314, 2006. CO- nization. Information Pro- DEN LNCSD9. ISSN 0302- cessing Letters, 4(3):64–69, 9743 (print), 1611-3349 (elec- REFERENCES 131

tronic). URL http://link. erage search lengths in hash springer.com/content/pdf/ files with open adressing. 10.1007/11935230_20.pdf. The Computer Journal (to appear), ??(??):??, August Bellare:2014:CCH 1985. [BR14] Mihir Bellare and Todor Ris- Bradley:1986:UMD tov. A characterization of chameleon hash functions [Bra86] J. Bradley. Use of mean and new, efficient designs. distance between overflow Journal of Cryptology, 27(4): records to compute aver- 799–823, October 2014. CO- age search lengths in hash DEN JOCREQ. ISSN 0933- files with open addressing. 2790 (print), 1432-1378 (elec- The Computer Journal,29 tronic). URL http://link. (2):167–170, April 1986. CO- springer.com/article/10. DEN CMPJA6. ISSN 0010- 1007/s00145-013-9155-8. 4620 (print), 1460-2067 (electronic). Bradley:1984:UMD Bradley:1988:BFP [Bra84a] James Bradley. Use of mean distance between over- [Bra88] James Bradley. Business file flow records to compute av- processing!: COBOL, CICS, erage search lengths in hash and SQL. Mitchell Pub- files with open addressing. lishing, Inc., Santa Cruz, Technical Report 84/154/12, CA, USA, 1988. ISBN University of Calgary, May 0-394-39217-5. 400 pp. 1984. ?? pp. (email LCCN QA76.9.F5 B725 [email protected]). 1988. US$28.00. Includes two chapters on hash file process- Bratbergsengen:1984:HMR ing. [Bra84b] Kjell Bratbergsengen. Hash- Brassard:1990:ACC ing methods and relational algebra operations. In [Bra90] Gilles Brassard, editor. Ad- Proceedings of the 10th vances in cryptology: CRYPTO Conference on Very Large ’89: proceedings, volume 435 Databases, Singapore, pages of Lecture Notes in Com- 323–333. Morgan Kaufmann puter Science. Springer-Ver- Publishers, San Francisco, lag, Berlin, Germany / Hei- CA, August 1984. delberg, Germany / Lon- Bradley:1985:UMD don, UK / etc., 1990. CO- DEN LNCSD9. ISBN 0-387- [Bra85] James Bradley. Use of 97317-6, 3-540-97317-6. ISSN mean distance between over- 0302-9743 (print), 1611- flow records to compute av- 3349 (electronic). LCCN REFERENCES 132

QA76.9.A25 C79 1989. URL and dealing with duplicates. http://link.springer-ny. M.s. thesis, Univ. of Col- com/link/service/series/ orado at Boulder, Boulder, 0558/tocs/t0435.htm; CO, USA, 1991. ?? pp. http://www.springerlink. Brickell:1992:ACC com/content/978-0-387- 97317-3; http://www. [Bri92] Ernest F. Brickell, editor. springerlink.com/openurl. Advances in Cryptology– asp?genre=issue&issn=0302- CRYPTO ’92: 12th An- 9743&volume=435.Confer- nual International Cryptol- ence held Aug. 20–24, 1989 ogy Conference, Santa Bar- at the University of Califor- bara, California, USA, Au- nia, Santa Barbara. gust 16–20, 1992: Proceed- Brass:2009:UHF ings, volume 740 of Lec- ture Notes in Computer Sci- [Bra09] Peter Brass. Universal ence. Springer-Verlag, Berlin, hash functions for an in- Germany / Heidelberg, Ger- ﬁnite universe and hash many / London, UK / etc., trees. Information Pro- 1992. ISBN 0-387-57340-2 cessing Letters, 109(10):461– (New York), 3-540-57340-2 462, April 30, 2009. CO- (Berlin). LCCN QA76.9.A25 DEN IFPLAT. ISSN 0020- C79 1992. DM104.00. 0190 (print), 1872-6119 (elec- Brickell:1993:ACC tronic). [Bri93] Ernest F. Brickell, editor. Brent:1973:RRT Advances in Cryptology — [Bre73] Richard P. Brent. Reducing CRYPTO ’92: 12th An- the retrieval time of scatter nual International Cryptol- storage techniques. Commu- ogy Conference, Santa Bar- nications of the Association bara, California, USA, Au- for Computing Machinery,16 gust 16–20, 1992: Pro- (2):105–109, February 1973. ceedings, volume 740 of CODEN CACMA2. ISSN Lecture Notes in Com- 0001-0782 (print), 1557-7317 puter Science. Springer-Ver- (electronic). Modiﬁcation of lag, Berlin, Germany / Hei- open addressing with double delberg, Germany / Lon- hashing to reduce the average don, UK / etc., 1993. CO- number of probes for a suc- DEN LNCSD9. ISBN 0-387- cessful search. 57340-2 (New York), 3-540- 57340-2 (Berlin). ISSN 0302- Bremers:1991:HPP 9743 (print), 1611-3349 (elec- [Bre91] H. L. Bremers. Hash par- tronic). LCCN QA76.9.A25 titioning performance im- C79 1992. DM104.00. URL proved by exploiting skew http://link.springer-ny. REFERENCES 133

com/link/service/series/ pages 320–335. CODEN 0558/tocs/t0740.htm; LNCSD9. ISBN 3-540-44050- http://www.springerlink. X (paperback). ISSN 0302- com/content/978-0-387- 9743 (print), 1611-3349 (elec- 57340-3; http://www. tronic). LCCN QA76.9.A25 springerlink.com/openurl. C79 2002. URL http:/ asp?genre=issue&issn=0302- /link.springer.de/link/ 9743&volume=740. service/series/0558/bibs/ Bauer:2009:FSA 2442/24420320.htm; http: //link.springer.de/link/ [BRM+09] Raphael Andr´eBauer,Kris- service/series/0558/papers/ tian Rother, Peter Moor, 2442/24420320.pdf. Knut Reinert, Thomas Steinke, Janusz M. Bujnicki, and Black:2010:ABB Robert Preissner. Fast struc- [BRSS10] J. Black, P. Rogaway, tural alignment of biomolecules T. Shrimpton, and M. Stam. using a hash table, N-grams An analysis of the blockcipher– and string descriptors. Al- based hash functions from gorithms (Basel), 2(2):692– PGV. Journal of Cryptology, 709, June 2009. CODEN 23(4):519–545, October 2010. ALGOCH. ISSN 1999-4893 CODEN JOCREQ. ISSN (electronic). URL https:/ 0933-2790 (print), 1432- /www.mdpi.com/1999-4893/ 1378 (electronic). URL 2/2/692. http://www.springerlink. Blundell:2010:RTR com/openurl.asp?genre= article&issn=0933-2790& [BRM10] Colin Blundell, Arun Ragha- volume=23&issue=4&spage= van, and Milo M. K. Mar- 519. tin. RETCON: transac- Bode:1993:PPA tional repair without replay. ACM SIGARCH Computer [BRW93] Arndt Bode, Mike Reeve, Architecture News, 38(3): and Gottfried Wolf, edi- 258–269, June 2010. CO- tors. PARLE ’93, Parallel DEN CANED2. ISSN 0163- Architectures and Languages 5964 (print), 1943-5851 (elec- Europe: 5th International tronic). PARLE Conference, Munich, Germany, June 14–17, 1993, Black:2002:BBA Proceedings. Springer-Verlag, [BRS02] John Black, Phillip Rog- Berlin, Germany / Heidel- away, and Thomas Shrimp- berg, Germany / London, ton. Black-box analysis of UK / etc., 1993. ISBN 0- the block-cipher-based hash- 387-56891-3 (New York), 3- function constructions from 540-56891-3 (Berlin). LCCN PGV. In Yung [Yun02], QA76.58 .I564 1993. REFERENCES 134

Bryant:1984:EHL Bhatia:1994:FPH

[Bry84] R. M. Bryant. Extendible [BS94a] S. Bhatia and C. Sabhar- hashing for line-oriented pag- wal. A fast perfect hash func- ing stores. IBM Technical tion for image databases. In Disclosure Bulletin, 26(11): Anger et al. [ARA94], pages 6046–6049, April 1984. CO- 337–346. ISBN 2-88449-128- DEN IBMTAA. ISSN 0018- 7. LCCN Q334.I556 1994. 8689. Biham:1991:DCFb Bhatia:1994:FIP

[BS91a] E. Biham and A. Shamir. [BS94b] Sanjiv K. Bhatia and Chaman L. Diﬀerential cryptanalysis of Sabharwal. A fast imple- Feal and N-hash. In Davies mentation of a perfect hash [Dav91], pages 1–?? ISBN 0- function for picture objects. 387-54620-0 (New York), 3- Pattern Recognition, 27(3): 540-54620-0 (Berlin). ISSN 365–376, March 1994. CO- 0302-9743 (print), 1611- DEN PTNRA8. ISSN 0031- 3349 (electronic). LCCN 3203 (print), 1873-5142 (elec- QA76.9.A25 E964 1991. tronic).

Biham:1991:DCFa Bjatia:1994:FIP [BS91b] Eli Biham and Adi Shamir. [BS94c] S.K.BjatiaandC.L. Diﬀerential cryptanalysis of Sabharwal. A fast im- Feal and N-hash. Techni- plementation of a perfect cal report CS91-17, Depart- hash function for picture ob- ment of Applied Mathemat- jects. Pattern Recognition, ics and Computer Science, 27(3):365–??, 1994. CO- Weizmann Institute of Sci- DEN PTNRA8. ISSN 0031- ence, Rehovot, Israel, Octo- 3203 (print), 1873-5142 (elec- ber 1991. 34 pp. tronic). Biham:1991:DCS Bentley:1997:FAS [BS91c] Eli Biham and Adi Shamir. Diﬀerential cryptanalysis of [BS97] Jon L. Bentley and Robert Snefru, Khafre, REDOC-II, Sedgewick. Fast algorithms LOKI and Lucifer. Techni- for sorting and searching cal report CS91-18, Depart- strings. In ACM [ACM97a], ment of Applied Mathemat- pages 360–369. CODEN ics and Computer Science, PAAAF2. ISBN 0-89871-390- Weizmann Institute of Sci- 0. LCCN ???? URL http: ence, Rehovot, Israel, Octo- //www.cs.princeton.edu/~ ber 1991. 36 pp. rs/strings/paper.pdf. REFERENCES 135

Balkic:2012:GUI DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [BSH12]ˇ Zoran Balkić, Damir Soˇˇ starić, tronic). and Goran Horvat. Geo- Hash and UUID identifier for Blackburn:2012:CHA multi-agent systems. Lec- ture Notes in CS, 7327: [BSU12] Simon R. Blackburn, Dou- 290–298, 2012. CODEN glas R. Stinson, and Jalaj LNCSD9. ISSN 0302-9743 Upadhyay. On the com- (print), 1611-3349 (elec- plexity of the herding at- tronic). URL http://link. tack and some related at- springer.com/content/pdf/ tacksonhashfunctions. De- 10.1007/978-3-642-30947- signs, Codes, and Cryptog- 2_33. raphy, 63(1):??, April 2012. CODEN DCCREC. ISSN Bakhtiari:1996:KHF 0925-1022 (print), 1573- 7586 (electronic). URL [BSNP96a] S. Bakhtiari, R. Safavi-Naini, http://www.springerlink. and J. Pieprzyk. Keyed hash com/openurl.asp?genre= functions. In Dawson and article&issn=0925-1022& Golic [DG96], pages 201–214. volume=0&issue=0&spage=? ISBN 3-540-60759-5. ISSN ?. 0302-9743 (print), 1611- 3349 (electronic). LCCN Brain:1989:NPH QA76.9.A25 C844 1996. [BT89] Marshall D. Brain and Bakhtiari:1996:PBA Alan L. Tharp. Near-perfect [BSNP96b] S. Bakhtiari, R. Safavi- hashing for large word sets. Naini, and J. Pieprzyk. Software—Practice and Ex- On password-based authen- perience, 19(10):967–978, ticated key exchange us- October 1, 1989. CODEN ing collisionful hash func- SPEXBL. ISSN 0038-0644 tions. Lecture Notes in CS, (print), 1097-024X (elec- 1172:299–??, 1996. CO- tronic). DEN LNCSD9. ISSN 0302- Brain:1990:PHU 9743 (print), 1611-3349 (electronic). [BT90] Marshall D. Brain and Bakhtiari:1996:SCH Alan L. Tharp. Perfect hashing using sparse matrix pack- [BSNP96c] S. Bakhtiari, R. Safavi- ing. Information system, Naini, and J. Pieprzyk. On 15(3):281–290, 1990. CO- selectable collisionful hash DEN INSYD6. ISSN 0306- functions. Lecture Notes in 4379 (print), 1873-6076 (elec- CS, 1172:287–??, 1996. CO- tronic). REFERENCES 136

Briggs:1993:ERS springer.com/chapter/10. 1007/978-3-642-32298-3_ [BT93] Preston Briggs and Linda 17/. Torczon. An eﬃcient representation for sparse sets. Brown:2012:FPT ACM Letters on Program- [BT12b] Daniel G. Brown and Jakub ming Languages and Sys- Truszkowski. Fast phyloge- tems, 2(4):59–69, March netic tree reconstruction us- 1993. CODEN ALPSE8. ing locality-sensitive hash- ISSN 1057-4514 (print), ing. Lecture Notes in CS, 1557-7384 (electronic). URL 7534:14–29, 2012. CO- http://www.acm.org/pubs/ DEN LNCSD9. ISSN 0302- toc/Abstracts/1057-4514/ 9743 (print), 1611-3349 (elec- 176484.html. tronic). URL http://link. Brain:1994:UTE springer.com/chapter/10. 1007/978-3-642-33122-0_ [BT94a] Marshall D. Brain and 2/. Alan L. Tharp. Using tries to Buchholz:1963:FOA eliminate pattern collisions in perfect hashing. IEEE Trans- [Buc63] Werner Buchholz. File or- actions on Knowledge and ganization and addressing. Data Engineering, 6(2):239– IBM Systems Journal, 2(1): 247, April 1994. CODEN IT- 86–111, June 1963. CO- KEEH. ISSN 1041-4347. DEN IBMSA7. ISSN 0018- Brian:1994:UTE 8670. Comprehensive survey of hashing, with a good dis- [BT94b] M. D. Brian and A. L. cussion of hash functions. Tharp. Using tries to elimi- Buckhart:1982:AII nate pattern collisions in perfect hashing. IEEE Trans- [Buc82] Walter A. Buckhart. Ad- actions on Knowledge and vances in interpolation-based Data Engineering, 6(2):239– index maintenance. In Pro- ??, April 1, 1994. CODEN ceedings of the 1982 Confer- ITKEEH. ISSN 1041-4347. ence on Information Sciences and Systems., pages 488–491. Bouabana-Tebibel:2012:HCB Princeton University Press, [BT12a] Thouraya Bouabana-Tebibel. Princeton, NJ, USA, 1982. Hash chains at the basis of a Burkhard:1975:FTQ secure reactive routing protocol. Lecture Notes in CS, [Bur75a] W. A. Burkhard. Full table 7222:258–270, 2012. CO- quadratic quotient search- DEN LNCSD9. ISSN 0302- ing. The Computer Journal, 9743 (print), 1611-3349 (elec- 18(2):161–163, May 1975. tronic). URL http://link. CODEN CMPJA6. ISSN REFERENCES 137

0010-4620 (print), 1460-2067 Burkhard:1976:PMR (electronic). URL http: //comjnl.oxfordjournals. [Bur76c] Walter A. Burkhard. Par- org/content/18/2/161.full. tial match retrieval. BIT pdf+html; http://www3. (Nordisk tidskrift for infor- oup.co.uk/computer_journal/ mationsbehandling), 16(1): hdb/Volume_18/Issue_02/ 13–31, 1976. CODEN BIT- tiff/161.tif; http:// TEL, NBITAB. ISSN 0006- www3.oup.co.uk/computer_ 3835 (print), 1572-9125 (elec- journal/hdb/Volume_18/ tronic). Issue_02/tiff/162.tif; Burkhard:1977:ART http://www3.oup.co.uk/ computer_journal/hdb/Volume_[Bur77] Walter A. Burkhard. As- 18/Issue_02/tiff/163.tif. sociative retrieval trie hash- coding. Journal of Computer Burkhard:1975:PMQ and System Sciences, 15(3): 280–299, December 1977. [Bur75b] Walter A. Burkhard. Partial- CODEN JCSSBM. ISSN matchqueriesandﬁlede- 0022-0000 (print), 1090-2724 signs. In Kerr [Ker75], (electronic). page ?? ISBN ???? Burkhard:1978:PMH ISSN 0278-2596. LCCN QA76.9.D3 I55 1975. US$15.00.[Bur78] W. A. Burkhard. Partial- match hash coding projection Burkhard:1976:ART functions. Proceedings of the Hawaii International Confer- [Bur76a] Walter A. Burkhard. As- ence on System Science,1 sociative retrieval trie hash- (??):99–105, ???? 1978. CO- coding. In ACM-TOC’76 DEN PHISD7. [ACM76], pages 211–219. Burkhard:1979:PMH Burkhard:1976:HTA [Bur79] Walter A. Burkhard. Partial- matchhashcoding:Beneﬁts [Bur76b] Walter A. Burkhard. Hash- of redundancy. ACM Trans- ing and trie algorithms for actions on Database Systems, partial-match retrieval. ACM 4(2):228–239, June 1979. Transactions on Database CODEN ATDSD3. ISSN Systems, 1(2):175–187, 1976. 0362-5915 (print), 1557- CODEN ATDSD3. ISSN 4644 (electronic). URL 0362-5915 (print), 1557-4644 http://www.acm.org/pubs/ (electronic). Also published articles/journals/tods/ in/as: UCSD, Appl. Physics 1979-4-2/p228-burkhard/ and Inf. Sc, CS TR.2, Jun. p228-burkhard.pdf; http: 1975. //www.acm.org/pubs/citations/ REFERENCES 138

journals/tods/1979-4-2/ Burkhard:1983:PRI p228-burkhard/. [Bur83c] Walter A. Burkhard. Perfor- Burkowski:1981:PHH mance results for interpolation- [Bur81] F. J. Burkowski. Parallel based index maintenance. In hashing hardware for text Proceedings of the 17th An- scanning applications. Pro- nual Conference on Informa- ceedings of the International tion Sciences and Systems., Conference on Parallel Pro- pages 484–489. Johns Hop- cessing, pages 282–286, 1981. kins Univ, Baltimore, Md, CODEN PCPADL. ISSN USA, 1983. 0190-3918. Burkowski:1984:CHH Burkowski:1982:HHS [Bur84] F. J. Burkowski. Correc- [Bur82] Forbes J. Burkowski. A hard- tion to “A Hardware Hash- ware hashing scheme in the ing Scheme in the Design design of a multiterm string of a Multiterm String Com- comparator. IEEE Transac- parator”. IEEE Transac- tions on Computers, C-31(9): tions on Computers,C-33 825–834, September 1982. (4):375, April 1984. CO- CODEN ITCOB4. ISSN DEN ITCOB4. ISSN 0018-9340 (print), 1557-9956 0018-9340 (print), 1557- (electronic). 9956 (electronic). URL Burkhard:1983:IBI http://ieeexplore.ieee. org/stamp/stamp.jsp?tp= [Bur83a] Walter A. Burkhard. Interpolation- &arnumber=1676447.See based index maintenance. [Bur82]. BIT (Nordisk tidskrift for informationsbehandling),23 Burk:1992:HGP (3):274–294, 1983. CODEN BITTEL, NBITAB. ISSN [Bur92] Ron L. Burk. Hashing: From 0006-3835 (print), 1572-9125 good to perfect. CUsers (electronic). Discusses con- Journal, 10(2):41–??, Febru- struction of order-preserving ary 1992. ISSN 0898-9788. hash functions for use in Burkhard:2005:DHP range queries. [Bur05] Walter A. Burkhard. Dou- Burkhard:1983:IIM ble hashing with passbits. [Bur83b] Walter A. Burkhard. Interpolation- Information Processing Let- based index maintenance. In ters, 96(5):162–166, De- ACM-PODS’83 [ACM83b], cember 16, 2005. CO- pages 76–89. ISBN 0-89791- DEN IFPLAT. ISSN 0020- 097-4. LCCN QA76.9.D3 0190 (print), 1872-6119 (elec- A15 1983. US$25.00. tronic). REFERENCES 139

Burr:2006:CHS sp/2017/04/msp2017040037- abs.html. [Bur06] William E. Burr. Cryp- tographic hash standards: Belkin:1989:SPT Where do we go from here? [BV89] Nicholas J. Belkin and C. J. IEEE Security & Privacy,4 Van Rijsbergen, editors. SI- (2):88–91, March/April 2006. GIR ’89: Proceedings of the CODEN ???? ISSN 1540- Twelfth Annual International 7993 (print), 1558-4046 (elec- ACM SIGIR Conference on tronic). Research and Development in Burr:2008:NHC Information Retrieval: Cam- bridge, Massachusetts, June [Bur08] William E. Burr. A new 25–28, 1989, Information Ac- hash competition. IEEE Se- cess Methods. ACM Press, curity & Privacy, 6(3):60–62, New York, NY 10036, USA, May/June 2008. CODEN 1989. ISBN 0-89791-321-3. ???? ISSN 1540-7993 (print), LCCN Z699.A1 I571 1989. 1558-4046 (electronic). Barreto:2012:HCS Buttner:1986:UDM [BVF12] João Barreto, Lu´ıs Veiga, [Büt86] Wolfram Büttner. Unifica- and Paulo Ferreira. Hash tion in datastructure mul- challenges: Stretching the tisets. Journal of Auto- limits of compare-by-hash mated Reasoning, 2(1):75– in distributed data dedupli- 88, March 1986. CODEN cation. Information Pro- JAREEW. ISSN 0168- cessing Letters, 112(10): 7433 (print), 1573-0670 (elec- 380–385, May 31, 2012. tronic). URL http://link. CODEN IFPLAT. ISSN springer.com/article/10. 0020-0190 (print), 1872-6119 1007/BF00246024. Discusses (electronic). URL http: generalization of extendible //www.sciencedirect.com/ hashing to handle partial science/article/pii/S0020019012000385. match retrieval efficiently. Bazrafshan:2013:IBS Butin:2017:HBS [BvT13] Marjan Bazrafshan and Tran [But17] Denis Butin. Hash-based van Trung. Improved bounds signatures: State of play. for separating hash fami- IEEE Security & Privacy,15 lies. Designs, Codes, and (4):37–43, July/August 2017. Cryptography, 69(3):369–382, CODEN ???? ISSN 1540- December 2013. CODEN 7993 (print), 1558-4046 (elec- DCCREC. ISSN 0925- tronic). URL https://www. 1022 (print), 1573-7586 (elec- computer.org/csdl/mags/ tronic). URL http://link. REFERENCES 140

springer.com/article/10. (4):349–362, February 1989. 1007/s10623-012-9673-7. CODEN AINFA2. ISSN Breen:1989:HFP 0001-5903 (print), 1432-0525 (electronic). [BW89] Edmond J. Breen and Keith L. Williams. Hash Baeza-Yates:1998:ALH function performance on different biological databases. [BYSP98] Ricardo A. Baeza-Yates and Computer Methods and Pro- Héctor Soza-Pollman. Anal- grams in Biomedicine, 28(2): ysis of linear hashing revis- 87–91, February 1989. CO- ited. Nordic Journal of Com- DEN CMPBEK. ISSN 0169- puting, 5(1):70–85, Spring 2607 (print), 1872-7565 (elec- 1998. CODEN NJCOFR. tronic). ISSN 1236-6064. URL http://www.cs.helsinki. Bruynooghe:1992:PLI fi/njc/References/baeza- [BW92] Maurice Bruynooghe and yatess1998:70.html. Martin Wirsing, editors. Pro- gramming language imple- Barnes:2015:PEP mentation and logic programming: 4th International Sym- [BZL+15] Connelly Barnes, Fang- posium, PLILP ’92, Leu- Lue Zhang, Liming Lou, ven, Belgium, August 26–28, Xian Wu, and Shi-Min Hu. 1992: proceedings. Springer- PatchTable: efficient patch Verlag, Berlin, Germany / queries for large datasets and Heidelberg, Germany / Lon- applications. ACM Trans- don, UK / etc., 1992. ISBN actions on Graphics, 34(4): 0-387-55844-6 (New York), 3- 97:1–97:??, August 2015. 540-55844-6 (Berlin). LCCN CODEN ATGRDF. ISSN QA76.7 .I5773 1992. 0730-0301 (print), 1557-7368 (electronic). Blackburn:1998:OLP [BW98] S. R. Blackburn and P. R. Bao:2012:WBS Wild. Optimal linear perfect hash families. Journal [BZZ12] Tao Bao, Yunhui Zheng, of Combinatorial Theory (Se- and Xiangyu Zhang. White ries A), 83(2):233–250, Au- box sampling in uncertain gust 1998. CODEN JCBTA7. data processing enabled by ISSN 0097-3165. program analysis. SIG- PLAN Notices, 47(10):897– Baeza-Yates:1989:MSF 914, October 2012. CODEN [BY89] Ricardo A. Baeza-Yates. SINODQ. ISSN 0362-1340 Modeling splits in file struc- (print), 1523-2867 (print), tures. Acta Informatica,26 1558-1160 (electronic). REFERENCES 141

Czumaj:2000:CRH http://link.springer-ny. com/link/service/series/ [CadHS00] Artur Czumaj, Friedhelm Meyer 0558/bibs/1294/12940455. auf der Heide, and Volker htm; http://link.springer- Stemann. Contention resolu- ny.com/link/service/series/ tion in hashing based shared 0558/papers/1294/12940455. memory simulations. SIAM pdf. Journal on Computing,29 (5):1703–1739, October 2000. Coelkesen:1994:MCV CODEN SMJCAT. ISSN 0097-5397 (print), 1095-7111 [CBA94] R. Coelkesen, K. Balasubra- (electronic). URL http:/ manian, and Z. G. Altun. /epubs.siam.org/sam-bin/ A microprocessor-controlled dbq/article/29564. versatile 3D motion control system incorporating a dy- Chen:2007:IHJ namic hash function com- [CAGM07] Shimin Chen, Anastassia mand interpreter. Labora- Ailamaki, Phillip B. Gib- tory microcomputer, 13(1):3– bons, and Todd C. Mowry. ??, 1994. CODEN LMICDI. Improving hash join per- ISSN 0262-2955. formance through prefetch- Challal:2005:HHC ing. ACM Transactions on Database Systems,32[CBB05] Yacine Challal, Abdelmad- (3):17:1–17:??, August 2007. jid Bouabdallah, and Hatem CODEN ATDSD3. ISSN Bettahar. H2A:Hybrid 0362-5915 (print), 1557-4644 hash-chaining scheme for (electronic). adaptive multicast source authentication of media- Cain:1984:MAD streaming. Computers [Cai84] Peter Cain. Mixing analogue and Security, 24(1):57–68, and digital circuitry in a sig- February 2005. CODEN nal generator. IEE Collo- CPSEDU. ISSN 0167- quium (Digest), 1984/1:4.1– 4048 (print), 1872-6208 (elec- 4.4, 1984. CODEN DCILDN. tronic). URL https:/ /www.sciencedirect.com/ Canetti:1997:TRR science/article/pii/S0167404804001816. [Can97] Ran Canetti. Towards real- Cercone:1983:SIS izing random oracles: Hash functions that hide all partial [CBK83] Nick Cercone, John Boates, information. Lecture Notes and Max Krause. A semi- in CS, 1294:455–??, 1997. interactive system for ﬁnding CODEN LNCSD9. ISSN perfect hash functions. Tech- 0302-9743 (print), 1611- nical report CMPT TR 83- 3349 (electronic). URL 4, Simon Fraser University, REFERENCES 142

Burnaby, BC, Canada, 1983. with single parameter. In- ?? pp. (email library@cs. formation Processing Letters, sfu.ca). 27(2):79–83, February 1988. CODEN IFPLAT. ISSN Cercone:1985:ISF 0020-0190 (print), 1872-6119 (electronic). [CBK85] Nick Cercone, John Boates, and Max Krause. An in- Chang:1991:NAA teractive system for finding perfect hash functions. [CC91] C. C. Chang and C. Y. IEEE Software, 2(6):38– Chen. A note on allocating k- 53, November 1985. CO- ary multiple key hashing files DEN IESOEG. ISSN 0740- among multiple disks. Infor- 7459 (print), 0740-7459 (elec- mation sciences, 55(1 / 3): tronic). 69–??, June 1, 1991. CO- DEN ISIJBC. ISSN 0020- Chang:1987:PAG 0255 (print), 1872-6291 (elec- [CC87] C. C. Chang and C. Y. Chen. tronic). Performance analysis of the Coburn:2012:NHM generalised disc modulo allocation method for multiple [CCA+12] Joel Coburn, Adrian M. key hashing files on multi- Caulfield, Ameen Akel, disc systems. The Com- Laura M. Grupp, Rajesh K. puter Journal, 30(6):535– Gupta, Ranjit Jhala, and 540, December 1987. CO- Steven Swanson. NV- DEN CMPJA6. ISSN 0010- Heaps: making persistent 4620 (print), 1460-2067 (elec- objects fast and safe with tronic). next-generation, non-volatile Chan:1988:OMP memories. SIGPLAN No- tices, 47(4):105–118, April [CC88a] M. Y. Chan and W. L. 2012. CODEN SINODQ. Chung. Optimal multidisk ISSN 0362-1340 (print), partial match file designs. In- 1523-2867 (print), 1558-1160 formation Processing Letters, (electronic). 28(3):149–155, July 4, 1988. CODEN IFPLAT. ISSN CCCG:1989:CCC 0020-0190 (print), 1872-6119 [CCC89] Canadian Conference on (electronic). Computational Geometry Chang:1988:OMP (1st: 1989: McGill Uni- versity, Montréal).North- [CC88b] C. C. Chang and C. H. Holland, Amsterdam, The Chang. An ordered mini- Netherlands, 1989. ISBN mal perfect hashing scheme ???? LCCN ???? REFERENCES 143

Cai:2004:PPR perfect hashing scheme. The Computer Journal, 34(5): [CCF04] Min Cai, Ann Chervenak, 469–474, October 1991. CO- and Martin Frank. A peer-to- DEN CMPJA6. ISSN peer replica location service 0010-4620 (print), 1460-2067 based on a distributed hash (electronic). URL http: table. In ACM [ACM04], //comjnl.oxfordjournals. page 56. ISBN 0-7695-2153-3. org/content/34/5/469.full. LCCN ???? pdf+html; http://www3. Chang:2009:HTF oup.co.uk/computer_journal/ hdb/Volume_34/Issue_05/ [CCH09] Ye-In Chang, Jiun-Rung tiff/469.tif; http:// Chen, and Min-Tze Hsu. A www3.oup.co.uk/computer_ hash trie ﬁlter approach to journal/hdb/Volume_34/ approximate string match- Issue_05/tiff/470.tif; ing for genomic databases. http://www3.oup.co.uk/ Lecture Notes in CS, 5579: computer_journal/hdb/Volume_ 816–825, 2009. CODEN 34/Issue_05/tiff/471.tif; LNCSD9. ISSN 0302-9743 http://www3.oup.co.uk/ (print), 1611-3349 (elec- computer_journal/hdb/Volume_ tronic). URL http://link. 34/Issue_05/tiff/472.tif; springer.com/content/pdf/ http://www3.oup.co.uk/ 10.1007/978-3-642-02568- computer_journal/hdb/Volume_ 6_83. 34/Issue_05/tiff/473.tif; Cho:2008:DNX http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [CCHK08] Sung-Jin Cho, Un-Sook 34/Issue_05/tiff/474.tif. Choi, Yoon-Hee Hwang, and Han-Doo Kim. Design of Chen:1991:DMK new XOR-based hash functions for cache memories. [CCL91] C. Y. Chen, C. C. Chang, Computers and Mathemat- andR.C.T.Lee.Onthe ics with Applications,55 design of multiple key hash- (9):2005–2011, May 2008. ing ﬁles for concurrent or- CODEN CMAPDK. ISSN thogonal range retrieval be- 0898-1221 (print), 1873-7668 tween two disks. Information (electronic). URL http: system, 16(6):613–626, 1991. //www.sciencedirect.com/ CODEN INSYD6. ISSN science/article/pii/S0898122107006682. 0306-4379 (print), 1873-6076 (electronic). Chang:1991:DMI Chen:2017:FMT [CCJ91] C. C. Chang, C. Y. Chen, and J. K. Jan. On the design [CCW+17] Haibo Chen, Rong Chen, of a machine-independent Xingda Wei, Jiaxin Shi, REFERENCES 144

Yanzhe Chen, Zhaoguo ing hash tables. Techni- Wang, Binyu Zang, and cal Report 84/162/20, Uni- Haibing Guan. Fast in- versity of Calgary, Septem- memory transaction pro- ber 1984. ?? pp. (email cessing using RDMA and [email protected]). HTM. ACM Transactions on Computer Systems, 35(1): Colbourn:2019:DHF 3:1–3:??, July 2017. CO- [CDH19] Charles J. Colbourn, Ryan E. DEN ACSYEC. ISSN 0734- Dougherty, and Daniel Hors- 2071 (print), 1557-7333 (elec- ley. Distributing hash fam- tronic). ilies with few rows. Theo- Chen:1991:HNT ret. Comput. Sci., 800(??): 31–41, December 31, 2019. [CCY91] Tung-Shou Chen, Arbee L. P. CODEN TCSCDI. ISSN Chen, and Wei-Pang Yang. 0304-3975 (print), 1879-2294 Hash-semijoin: a new tech- (electronic). URL http: nique for minimizing dis- //www.sciencedirect.com/ tributed query time. In Pro- science/article/pii/S0304397519306437. ceedings of the Third Work- shop on Future Trends of Cheiney:1989:PTC Distributed Computing Sys- [CdM89] J.-P. Cheiney and C. de Main- tems, Taipei, Taiwan, April dreville. A parallel transi- 14–16, 1991, pages 325–330 tive closure algorithm using (of xiii + 426). IEEE Com- hash-based clustering. In Bo- puter Society Press, 1109 ral and Faudemay [BF89], Spring Street, Suite 300, Sil- page 301. ISBN 0-387-51324- ver Spring, MD 20910, USA, 8. LCCN QA76.9.D3 D3576 1991. ISBN 0-8186-2755-7. 1989. LCCN QA76.9.D5 I335 1992. Cheiney:1990:PST Chang:1984:CHC [CdM90] J. P. Cheiney and C. de Main- [CD84a] S. K. Chang and J. C. Dorng. dreville. A parallel strategy Concatenated hash code se- for transitive closure using lection. International Jour- double hash-based clustering. nal of Computer and Infor- In McLeod et al. [MSDS90], mation Sciences, 13(5):395– page 347. ISBN 1-55860-149- 412, October 1984. CODEN X. LCCN ??? IJCIAH. ISSN 0091-7036. Coron:2005:MDR Cleary:1984:FCR [CDMP05] Jean-S´ebastien Coron, Yev- [CD84b] John G. Cleary and John J. geniy Dodis, C´ecile Malin- Darragh. A fast compact aud, and Prashant Puniya. representation of trees us- Merkle–Damg˚ard revisited: REFERENCES 145

Howtoconstructahash acm.org/ft_gateway.cfm? function. In Shoup [Sho05], id=3326166. pages 430–?? ISBN 3- 540-28114-2. ISSN 0302- Coffman:1970:FSU 9743 (print), 1611-3349 (electronic). LCCN QA76.9.A25 [CE70] E. G. Coffman, Jr. and C79 2005; QA76.9 .A25; J. Eve. File structures using QA76.9 C79 2005; QA76.9 hashing functions. Commu- C794 2005; QA76.9; In- nications of the Association ternet. URL http:/ for Computing Machinery,13 /www.springerlink.com/ (7):427–432, 436, July 1970. openurl.asp?genre=issue& CODEN CACMA2. ISSN issn=0302-9743&volume= 0001-0782 (print), 1557-7317 3621. (electronic). Castryck:2020:HFS Camurati:1995:CHD [CDS20] Wouter Castryck, Thomas Decru, and Benjamin Smith. [CE95] P. E. Camurati and H. Evek- Hash functions from super- ing, editors. Correct hard- special genus-2 curves using ware design and verification Richelot isogenies. Journal of methods: Advanced research Mathematical Cryptology,14 working conference on correct (1):268–292, August 7, 2020. hardware design methodolo- CODEN ???? ISSN 1862- gies — October 1995, Frank- 2976 (print), 1862-2984 (elec- furt am Main, Germany, tronic). URL https://www. number 987 in Lecture Notes degruyter.com/document/ in Computer Science. Spring- doi/10.1515/jmc-2019-0021/ er-Verlag, Berlin, Germany / html. Heidelberg, Germany / Lon- Cui:2019:STA don, UK / etc., 1995. ISBN 3-540-60385-9. ISSN 0302- [CDW+19] Wanqiu Cui, Junping Du, 9743 (print), 1611-3349 (elec- Dawei Wang, Xunpu Yuan, tronic). LCCN TK7874.75 Feifei Kou, Liyan Zhou, and .A39 1995. Nan Zhou. Short text analysis based on dual semantic Celis:1986:RHHa extension and deep hashing in microblog. ACM Transac- [Cel86] Pedro Celis. Robin Hood tions on Intelligent Systems Hashing. PhD thesis, De- and Technology (TIST),10 partment of Computer Sci- (4):38:1–38:??, August 2019. ence, University of Waterloo, CODEN ???? ISSN 2157- Waterloo, Ontario, Canada, 6904 (print), 2157-6912 (elec- 1986. ?? pp. See also tronic). URL https://dl. [CLM86]. REFERENCES 146

Cercone:1981:PHFa CODEN AMLEEL. ISSN 0893-9659 (print), 1873-5452 [Cer81] N. Cercone. Perfect hash (electronic). function search with application to natural language sys- Christodoulakis:1989:FOA tems. Technical report TR81- 6, Simon Fraser University, [CF89a] S. Christodoulakis and D. A. Burnaby, BC, Canada, 1981. Ford. File organizations and access methods for CLV opti- Cercone:1983:CL cal discs. In Belkin and Van Rijsbergen [BV89], page 152. [Cer83] N. Cercone. Computational ISBN 0-89791-321-3. LCCN Linguistics. International Z699.A1 I571 1989. Series in Modern Applied Mathematics and Computer Christodoulakis:1989:RPV Science, vol. 5. Pergamon [CF89b] Stavros Christodoulakis and Press, Oxford, UK, 1983. Daniel Alexander Ford. Re- ISBN 0-08-030253-X. xi + trieval performance versus 245 pp. LCCN P98 .C612 disc space utilization on 1983. US$37.50. WORM optical discs. SIG- Cercone:1985:AAA MOD Record (ACM Spe- cial Interest Group on Man- [Cer85] N. Cercone. The Automated Academic Advisor, LCCR agement of Data), 18(2): 306–314, June 1989. CO- working paper #2. an inter- DEN SRECD8. ISSN 0163- active system for ﬁnding perfect hash functions. Techni- 5808 (print), 1943-5835 (electronic). cal report LCCR TR85-3, Si- mon Fraser University, Burn- Celis:1992:AHL aby, BC, Canada, 1985. [CF92] Pedro Celis and John Franco. Cercone:1987:FAP The analysis of hashing with [Cer87] Nick Cercone. Finding and lazy deletions. Informa- applying perfect hash function sciences, 62(1 / 2):13– tions. Applied Mathemat- 26, July 1, 1992. CO- ics Letters, 0(1):21–24, 1987. DEN ISIJBC. ISSN 0020- CODEN AMLEEL. ISSN 0255 (print), 1872-6291 (elec- 0893-9659 (print), 1873-5452 tronic). (electronic). Catalano:2018:HSS Cercone:1988:FAP [CFN18] Dario Catalano, Dario Fiore, [Cer88] Nick Cercone. Finding and and Luca Nizzardo. Homo- applying perfect hash func- morphic signatures with sub- tions. Applied Mathemat- linear public keys via asym- ics Letters, 1(1):25–28, 1988. metric programmable hash REFERENCES 147

functions. Designs, Codes, 266–278. ISBN 0-387-09519- and Cryptography, 86(10): 5. LCCN QA155.7.E4 I57 2197–2246, October 2018. 1979. CODEN DCCREC. ISSN Cotter:1992:CTK 0925-1022 (print), 1573- 7586 (electronic). URL [CG92] N. E. Cotter and T. J. https://link.springer. Guillerm. The CMAC com/article/10.1007/s10623- and a theorem of Kol- 017-0444-3. mogorov. Neural Networks,5 Cantone:2019:LES (??):221–228, 1992. CODEN NNETEB. ISSN 0893-6080. [CFP19] Domenico Cantone, Simone Faro, and Arianna Pavone. Chen:2020:PPM Linear and eﬃcient string [CGLC20] T. Chen, X. Gao, T. Liao, matching algorithms based and G. Chen. Pache: a on weak factor recognition. packet management scheme ACM Journal of Experimen- of cache in data center tal Algorithmics, 24(1):1.8:1– networks. IEEE Transac- 1.8:??, October 2019. CO- tions on Parallel and Dis- DEN ???? ISSN 1084- tributed Systems, 31(2):253– 6654. URL https://dl. 265, February 2020. CO- acm.org/ft_gateway.cfm? DEN ITDSEO. ISSN 1045- id=3301295. 9219 (print), 1558-2183 (elec- Cooperman:1994:CPR tronic).

[CFYT94] Gene Cooperman, Larry Chu:1986:VLD Finkelstein, Bryant York, and Michael Tselman. Con- [CGO86] Wesley Chu, Georges Gar- structing permutation rep- darin, and Setsuo Ohsuga, resentations for large ma- editors. Very Large Data trix groups. In ACM Bases: Proceedings Twelfth [ACM94b], pages 134–138. International Conference on ISBN 0-89791-638-7. LCCN Very Large Data Bases, Ky- QA76.95.I59 1994. URL oto, Japan, August 15–18, http://www.acm.org:80/ 1986. Morgan Kaufmann pubs/citations/proceedings/ Publishers, San Francisco, issac/190347/p134-cooperman/ CA, 1986. ISBN 0-934613- . 18-4. LCCN QA76.9.D3 I559 1986. Cowan:1979:HKR Cousin:1994:PIS [CG79] Richard M. Cowan and Mar- tin L. Griss. Hashing – the [CH94] B. Cousin and J. Helary. key to rapid pattern match- Performance improvement of ing. In Ng [Ng79], pages state space exploration by REFERENCES 148

regular and diﬀerential hash- Chang:1984:OMP ing functions. Lecture Notes in CS, 818:364–??, 1994. CO- [Cha84b] C. C. Chang. An or- DEN LNCSD9. ISSN 0302- dered minimal perfect hash- 9743 (print), 1611-3349 (elec- ing scheme based upon Eu- tronic). ler’s theorem. Information sciences, 32(3):165–172, June Cormode:2009:FFI 1984. CODEN ISIJBC. ISSN 0020-0255 (print), 1872-6291 [CH09] Graham Cormode and Mar- (electronic). ios Hadjieleftheriou. Finding the frequent items in streams Chang:1984:SOM of data. Communications [Cha84c] C. C. Chang. The study of of the Association for Com- an ordered minimal perfect puting Machinery, 52(10):97– hashing scheme. Commu- 105, October 2009. CO- nications of the Association DEN CACMA2. ISSN 0001- for Computing Machinery,27 0782 (print), 1557-7317 (elec- (4):384–387, April 1984. CO- tronic). DEN CACMA2. ISSN 0001- Ceglarek:2012:FPD 0782 (print), 1557-7317 (electronic). The English trans- [CH12] Dariusz Ceglarek and Kon- lation of Ref. 6 of this pa- stanty Haniewicz. Fast pla- per appears in [Hua82]; that giarism detection by sentence book contains the fundamen- hashing. Lecture Notes in tal prime number functions CS, 7268:30–37, 2012. CO- needed for the ordered min- DEN LNCSD9. ISSN 0302- imal perfect hash functions 9743 (print), 1611-3349 (elec- described here. tronic). URL http://link. Chang:1985:SLO springer.com/chapter/10. 1007/978-3-642-29350-4_ [Cha85] C. C. Chang. Study of a let- 4/. ter oriented minimal perfect hashing scheme. In Proceed- Chang:1984:OIR ings — Foundations of Data [Cha84a] C. C. Chang. Optimal Organization., pages 61–65. information retrieval when Organizing Committee of the queries are not random. In- Int Conference on Founda- formation sciences, 34(3): tions of Data Organization, 199–223, 1984. CODEN Japan, 1985. Kyoto Sangyo ISIJBC. ISSN 0020-0255 Univ. Computer Science Inst, (print), 1872-6291 (elec- Kyoto, Jpn. tronic). Discusses the Mul- Chang:1986:LOR tiple Key Hashing method of Rothnie and Lozano [RL74]. [Cha86a] C. C. Chang. Letter-oriented REFERENCES 149

reciprocal hashing scheme. Chang:2012:HCM Information sciences, 38(3): 243–255, June 1986. CO- [Cha12] Chao-Tsun Chang. Hash DEN ISIJBC. ISSN 0020- caching mechanism in source- 0255 (print), 1872-6291 (elec- based routing for wireless tronic). ad hoc networks. Jour- nal of Network and Com- Chang:1986:SCO puter Applications, 35(1): 447–458, January 2012. CO- [Cha86b] C. C. Chang. A scheme DEN JNCAF3. ISSN for constructing ordered min- 1084-8045 (print), 1095-8592 imal perfect hashing func- (electronic). URL http: tions. Information sciences, //www.sciencedirect.com/ 39(2):187–195, September science/article/pii/S1084804511001858. 1986. CODEN ISIJBC. ISSN 0020-0255 (print), 1872-6291 Chen:1984:DACa (electronic). [Che84a] Wen-Chin Chen. The De- Chang:1988:APC sign and Analysis of Coa- lesced Hashing.PhDthe- [Cha88] C. C. Chang. Application of sis, Department of Com- principal component analysis puter Science, Brown Univer- to multi-disk concurrent ac- sity, Providence, RI, USA, cessing. BIT (Copenhagen), November 1984. ?? pp. See 28(2):205–214, 1988. CO- also [Che84b]. DEN NBITAB. Chen:1984:DACb Chapman:1991:QSS [Che84b] Wen-Chin Chen. The de- [Cha91] Rob Chapman. QuikFind sign and analysis of coa- string search. Forth Dimen- lesced hashing. Technical Re- sions, 13(4):21–??, November port CS-84-22, Department 1, 1991. CODEN FODMD5. of Computer Science, Brown ISSN 0884-0822. University, Providence, RI, Chaudhuri:1994:TBO USA, November 1984. ?? pp. This is the author’s Ph.D. [Cha94] Shiva Chaudhuri. Tight thesis, [Che84a]. bounds on oblivious chain- Chin:1991:LPH ing. SIAM Journal on Computing, 23(6):1253–1265, [Chi91] A. Chin. Locality-preserving December 1994. CODEN hash functions for general SMJCAT. ISSN 0097- purpose parallel computa- 5397 (print), 1095-7111 (elec- tion. Technical Report PRG- tronic). URL http:// TR-9-91, Programming Re- epubs.siam.org/sam-bin/ search Group, Oxford Uni- dbq/article/23027. versity, 1991. ?? pp. REFERENCES 150

Chin:1993:LPH UK / etc., 2006. CODEN LNCSD9. ISBN 3-540-32755- [Chi93] Andrew Chin. Locality- X (softcover). ISSN 0302- preserving hashing. In 9743 (print), 1611-3349 (elec- Anonymous [Ano93d], pages tronic). LCCN ???? URL 87–98. ISBN ?? LCCN ?? http://www.springerlink. I have been unable to locate com/content/978-3-540- this reference in several ma- 32755-4/; http://www. jor libraries, including Dart- springerlink.com/openurl. moth’s, sigh. . . . asp?genre=issue&issn=0302- Chin:1994:LPHb 9743&volume=3887. Camacho:2008:SAC [Chi94] A. Chin. Locality-preserving hash functions for general [CHKO08] Philippe Camacho, Alejan- purpose parallel computa- dro Hevia, Marcos Kiwi, and tion. Algorithmica, 12(2– RobertoOpazo.Strongac- 3):170–181, 1994. CO- cumulators from collision- DEN ALGOEJ. ISSN 0178- resistant hashing. Lec- 4617 (print), 1432-0541 (elec- ture Notes in CS, 5222: tronic). 471–486, 2008. CODEN Cormack:1985:PPH LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [CHK85] G. V. Cormack, R. N. S. tronic). URL http://link. Horspool, and M. Kaiserw- springer.com/content/pdf/ erth. Practical perfect hash- 10.1007/978-3-540-85886- ing. The Computer Journal, 7_32. 28(1):54–58, February 1985. Camacho:2012:SAC CODEN CMPJA6. ISSN 0010-4620 (print), 1460-2067 [CHKO12] Philippe Camacho, Alejan- (electronic). dro Hevia, Marcos Kiwi, and RobertoOpazo.Strongac- Correa:2006:LTI cumulators from collision- [CHK06] Jos´e R. Correa, Alejan- resistant hashing. Inter- dro Hevia, and Marcos national Journal of Infor- Kiwi, editors. LATIN mation Security, 11(5):349– 2006: Theoretical Infor- 363, October 2012. CO- matics: 7th Latin Amer- DEN ???? ISSN 1615- ican Symposium, Valdivia, 5262 (print), 1615-5270 (elec- Chile, March 20–24, 2006. tronic). URL http://link. Proceedings, volume 3887 springer.com/article/10. of Lecture Notes in Com- 1007/s10207-012-0169-2. puter Science. Springer-Ver- Chen:2007:TPB lag, Berlin, Germany / Hei- delberg, Germany / London, [CHL07] Hsiang-Yang Chen, Ting- REFERENCES 151

Wei Hou, and Chun-Liang (print), 1879-2294 (elec- Lin. Tamper-prooﬁng ba- tronic). sis path by using oblivious hashing on Java. SIG- Choudhury:2021:HLS PLAN Notices, 42(2):9–16, [Cho21] Hiten Choudhury. HashXor: February 2007. CODEN a lightweight scheme for iden- SINODQ. ISSN 0362-1340 tity privacy of IoT devices in (print), 1523-2867 (print), 5G mobile network. Com- 1558-1160 (electronic). puter Networks (Amsterdam, Czech:1992:OAGa Netherlands: 1999), 186(??): Article 107753, February 26, [CHM92a] Zbigniew J. Czech, George 2021. CODEN ???? ISSN Havas, and Bohdan S. Ma- 1389-1286 (print), 1872-7069 jewski. An optimal algo- (electronic). URL http: rithm for generating mini- //www.sciencedirect.com/ mal perfect hash functions. science/article/pii/S1389128620313335. Technical Report 92-24, Cen- Christodoulakis:1984:ICA ter for Discrete Mathematics and Theoretical Computer [Chr84] S. Christodoulakis. Implica- Science (DIMACS) at Rut- tions of certain assumptions gers University, New Jersey, in data base performance 1992. ?? pp. evaluation. ACM Transac- tions on Database Systems, Czech:1992:OAGb 9(2):??, June 1984. CO- DEN ATDSD3. ISSN 0362- [CHM92b] Zbigniew J. Czech, George 5915 (print), 1557-4644 (elec- Havas, and Bohdan S. Ma- tronic). Also published in/as: jewski. An optimal algorithm rcvd 1983. for generating minimal perfect hash functions. Infor- Chen:2018:CHT mation Processing Letters,43 + (5):257–264, October 5, 1992. [CHS 18] Zhiwen Chen, Xin He, Jian- CODEN IFPLAT. ISSN hua Sun, Hao Chen, and Lig- 0020-0190 (print), 1872-6119 ang He. Concurrent hash ta- (electronic). bles on multicore machines: Comparison, evaluation and Czech:1997:PH implications. Future Gen- eration Computer Systems, [CHM97] Z. J. Czech, G. Havas, and 82(??):127–141, May 2018. B. S. Majewski. Perfect CODEN FGSEVI. ISSN hashing. Theoret. Com- 0167-739X (print), 1872-7115 put. Sci., 182(1-2):1–43, Au- (electronic). URL https: gust 15, 1997. CODEN //www.sciencedirect.com/ TCSCDI. ISSN 0304-3975 science/article/pii/S0167739X17317715. REFERENCES 152

Chen:2018:YCE the execution of bushy trees. In Agrawal et al. [ABB93], [CHSC18] Zhiwen Chen, Xin He, Jian- pages 505–516. ISBN 1- hua Sun, and Hao Chen. 55860-152-X. ISSN 0730- Have your cake and eat it 9317. LCCN QA76.9.D3 I61 (too): a concurrent hash ta- 1993. ble with hardware transac- Chen:1997:AHF tions. International Jour- nal of Parallel Programming, [CHY97] Ming-Syan Chen, Hui-I 46(4):699–709, August 2018. Hsiao, and Philip S. Yu. CODEN IJPPE5. ISSN 0885- On applying hash ﬁlters to 7458 (print), 1573-7640 (elec- improving the execution of tronic). multi-join queries. VLDB Journal: Very Large Data Chung:1990:BCW Bases, 6(2):121–131, August [Chu90] S. Chung. Block code words 1997. CODEN VLDBFR. for partial match retrieval in ISSN 1066-8888 (print), very large databases. Tech- 0949-877X (electronic). URL nical Report WSU-CS-90-10, http://ftp.informatik. Washington State University, rwth-aachen.de/dblp/db/ 1990. ?? pp. indices/a-tree/c/Chen: Ming=Syan.html; http: Chung:1991:IEH //ftp.informatik.rwth- aachen.de/dblp/db/indices/ [Chu91] Soon M. Chung. In- a-tree/h/Hsiao:Hui=I.html; dexed extendible hashing for http://ftp.informatik. databases. Technical Report rwth-aachen.de/dblp/db/ WSU-CS-91-02, Washington indices/a-tree/y/Yu:Philip_ State University, 1991. ?? S=.html; http://link. pp. springer.de/link/service/ Chung:1992:IEH journals/00778/bibs/7006002/ 70060121.htm; http:// [Chu92] Soon M. Chung. Indexed link.springer.de/link/ extendible hashing. Infor- service/journals/00778/ mation Processing Letters,44 papers/7006002/70060121. (1):1–6, November 9, 1992. pdf; http://link.springer. CODEN IFPLAT. ISSN de/link/service/journals/ 0020-0190 (print), 1872-6119 00778/papers/7006002/70060121. (electronic). ps.gz. Electronic edition. Chen:1993:AHF Cichelli:1980:CMP [CHY93] M.-S. Chen, H.-I. Hsiao, [Cic80a] R. J. Cichelli. On Ci- and P. S. Yu. Apply- chelli’s minimal perfect hash ing hash ﬁlters to improving functions method. Com- REFERENCES 153

munications of the Associ- EUR 130.54. URL http: ation for Computing Ma- //www.gbv.de/dms/bowker/ chinery, 23(12):728–729, De- toc/9783540275800.pdf; cember 1980. CODEN http://www.springerlink. CACMA2. ISSN 0001- com/content/978-3-540- 0782 (print), 1557-7317 (elec- 27580-0/; http://www. tronic). This is the author’s zentralblatt-math.org/ response to the comments in zmath/en/search/?an=1078. [JO80] about [Cic80b]. See 68001. also [Sag85a]. Cipra:1993:ETS Cichelli:1980:MPH [Cip93] Barry Cipra. Electronic time-stamping: The no- [Cic80b] Richard J. Cichelli. Min- tary public goes digital: imal perfect hash functions All the hash that’s ﬁt to made simple. Communi- print. Science, 261(5118): cations of the Association 162–163, July 9, 1993. CO- for Computing Machinery, DEN SCIEAS. ISSN 0036- 23(1):17–19, January 1980. 8075 (print), 1095-9203 (elec- CODEN CACMA2. ISSN tronic). 0001-0782 (print), 1557-7317 (electronic). See remarks in Colomb:1986:CIS [JO80], and the author’s re- [CJ86] R. M. Colomb and Jaya- sponse in [Cic80a]. A sim- sooriah. A clause index- ple improvement giving dra- ing system for PROLOG matic speedups is described basedonsuperimposedcod- in [Tro95]. ing. Australian Computer Caires:2005:ALP Journal, 18(1):18–25, 1986. CODEN ACMJB2. ISSN [CIM+05] Lu´ıs Caires, Guiseppe F. Ital- 0004-8917. Compares clause iano, Lu´ıs Monteiro, Catus- indexing with hashing. cia Palamidessi, and Moti Cormode:2019:STA Yung, editors. Automata, languages and programming: [CJ19] Graham Cormode and Hos- 32nd international collo- sein Jowhari. Lp sam- quium, ICALP 2005, Lis- plers and their applications: bon, Portugal, July 11–15, asurvey. ACM Com- 2005: proceedings,volume puting Surveys, 52(1):16:1– 3580 of Lecture Notes in 16:??, February 2019. CO- Computer Science. Springer- DEN CMSVAN. ISSN 0360- Verlag, Berlin, Germany / 0300 (print), 1557-7341 (elec- Heidelberg, Germany / Lon- tronic). URL https://dl. don, UK / etc., 2005. ISBN acm.org/ft_gateway.cfm? 3-540-27580-0. LCCN ???? id=3297715. REFERENCES 154

Choi:2009:DSC tronic). URL http://link. springer.com/article/10. + [CJC 09] Myung Geol Choi, Eunjung 1007/s10207-018-0405-5. Ju, Jung-Woo Chang, Je- hee Lee, and Young J. Kim. Cheng:2020:RUC Data structure and colli- [CJN20] Miaomiao Cheng, Liping sion detection: Linkless oc- Jing, and Michael K. Ng. tree using multi-level per- Robust unsupervised cross- fect hashing. Computer modal hashing for multime- Graphics Forum, 28(7):1773– dia retrieval. ACM Trans- 1780, October 2009. CO- actions on Information Sys- DEN CGFODY. ISSN 0167- tems, 38(3):30:1–30:25, June 7055 (print), 1467-8659 (elec- 2020. CODEN ATISET. tronic). ISSN 1046-8188. URL Choi:2019:RDR https://dl.acm.org/doi/ abs/10.1145/3389547. [CJKK19] Kyu Hyun Choi, Jaeyung Jun, Minseong Kim, and Cho:2012:CBF Seon Wook Kim. Reducing [CJP12] Jung-Sik Cho, Young-Sik DRAM refresh rate using re- Jeong, and Sang Oh Park. tention time aware univer- Consideration on the brute- sal hashing redundancy re- force attack cost and repair. ACM Transactions on trieval cost: a hash-based Design Automation of Elec- radio-frequency identifica- tronic Systems., 24(5):53:1– tion (RFID) Tag Mutual Au- 53:31, October 2019. CO- thentication Protocol. Com- DEN ATASFO. ISSN 1084- puters and Mathematics 4309 (print), 1557-7309 (elec- with Applications, 69(1):58– tronic). URL https://dl. 65, January 2012. CO- acm.org/doi/abs/10.1145/ DEN CMAPDK. ISSN 3339851. 0898-1221 (print), 1873-7668 Chang:2019:CTM (electronic). URL http: [CJMS19] Donghoon Chang, Arpan //www.sciencedirect.com/ . Jati, Sweta Mishra, and science/article/pii/S0898122112001393 See cryptanalysis [SPLHCB14]. Somitra Kumar Sanadhya. Cryptanalytic time-memory Cho:2015:CBF trade-off for password hashing schemes. Interna- [CJP15] Jung-Sik Cho, Young-Sik tional Journal of Informa- Jeong, and Sang Oh Park. tion Security, 18(2):163– Consideration on the brute- 180, April 2019. CO- force attack cost and re- DEN ???? ISSN 1615- trieval cost: a hash-based 5262 (print), 1615-5270 (elec- radio-frequency identifica- REFERENCES 155

tion (RFID) tag mutual au- 9743 (print), 1611-3349 (elec- thentication protocol. Com- tronic). URL http://link. puters and Mathematics springer.com/chapter/10. with Applications, 69(1):58– 1007/978-3-642-32928-9_ 65, January 2015. CO- 8/. DEN CMAPDK. ISSN Chierichetti:2015:LPF 0898-1221 (print), 1873-7668 (electronic). URL http: [CK15] Flavio Chierichetti and Ravi //www.sciencedirect.com/ Kumar. LSH-preserving science/article/pii/S0898122112001393. functions and their applications. Journal of the Cercone:1989:IAP Association for Computing [CK89] N. Cercone and M. Krause. Machinery, 62(5):33:1–33:??, An informal analysis of per- November 2015. CODEN fect hash function search. JACOAH. ISSN 0004-5411 Applied Mathematics Letters, (print), 1557-735X (elec- 2(3):287–291, 1989. CO- tronic). DEN AMLEEL. ISSN 0893- Cercone:1981:LDU 9659 (print), 1873-5452 (electronic). [CKB81] Nick Cercone, Max Krause, and John Boates. Lexicon de- Chu:1994:ASH sign using perfect hash functions. In Borman [Bor81], [CK94] Jiang-Hsing Chu and Gary D. pages 69–78. CODEN SG- Knott. An analysis of spi- BLDB. ISBN 0-89791-056-7 ral hashing. The Com- (pt. 1), 0-89791-064-8 (pt. 2). puter Journal, 37(8):715– ISSN 0163-5794. LCCN H61 719, ???? 1994. CO- .S53 v.12 no.4-v.13 no.1-3. DEN CMPJA6. ISSN 0010- 4620 (print), 1460-2067 (elec- Cercone:1983:MAMa tronic). URL http:// [CKB83a] N. Cercone, M. Krause, and www3.oup.co.uk/computer_ J. Boates. Minimal and al- journal/Volume_37/Issue_ most minimal perfect hash 08/Vol37_08.body.html# function search with appli- AbstractChu. cation to natural language Chase:2012:NHS lexicon design. In Compu- tational Linguistics [Cer83], [CK12] Melissa Chase and Markulf pages 215–232. ISBN 0-08- Kohlweiss. A new hash-and- 030253-X. LCCN P98 .C612 sign approach and structure- 1983. US$37.50. preserving signatures from Cercone:1983:MAMb DLIN. Lecture Notes in CS, 7485:131–148, 2012. CO- [CKB83b] Nick Cercone, Max Krause, DEN LNCSD9. ISSN 0302- and John Boates. Mini- REFERENCES 156

mal and almost minimal perfor decision support query fect hash function search processing. VLDB Journal: with application to natu- Very Large Data Bases,9 ral language lexicon design. (3):190–213, December 2000. Computers and Mathemat- CODEN VLDBFR. ISSN ics with Applications, 9(1): 1066-8888 (print), 0949-877X 215–231, ???? 1983. CO- (electronic). DEN CMAPDK. ISSN 0898-1221 (print), 1873-7668 Chierichetti:2014:CLF (electronic). URL http: //www.sciencedirect.com/ [CKM14] Flavio Chierichetti, Ravi science/article/pii/0898122183900160. Kumar, and Mohammad Mahdian. The complexity Cercone:1985:ESL of LSH feasibility. Theo- [CKB85] N. Cercone, M. Krause, and ret. Comput. Sci., 530(??): J. Boates. Eﬃcient search 89–101, April 17, 2014. of large lexicons using per- CODEN TCSCDI. ISSN fect hash functions. In 1983 0304-3975 (print), 1879-2294 International Conference on (electronic). URL http: Data Bases in the Human- //www.sciencedirect.com/ ities Social Sciences, New science/article/pii/S0304397514001467. Brunswick, NJ, pages 359– Cygan:2018:FHC 373. Paradigm Press, ????, 1985. [CKN18] Marek Cygan, Stefan Kratsch, Choi:2009:SPC and Jesper Nederlof. Fast Hamiltonicity checking via [CKKK09] Lynn Choi, Hyogon Kim, bases of perfect matchings. Sunil Kim, and Moon Hae Journal of the Association Kim. Scalable packet classiﬁ- for Computing Machinery,65 cation through rulebase par- (3):12:1–12:??, March 2018. titioning using the maximum CODEN JACOAH. ISSN entropy hashing. IEEE/ 0004-5411 (print), 1557-735X ACM Transactions on Net- (electronic). working, 17(6):1926–1935, December 2009. CODEN Chierichetti:2019:DLS IEANEP. ISSN 1063-6692 (print), 1558-2566 (elec- [CKPT19] Flavio Chierichetti, Ravi Ku- tronic). mar, Alessandro Panconesi, and Erisa Terolli. On the Claussen:2000:EES distortion of locality sensi- [CKKW00] J. Claussen, A. Kemper, tive hashing. SIAM Jour- D. Kossmann, and C. Wies- nal on Computing, 48(2): ner. Exploiting early sort- 350–372, ???? 2019. CO- ing and early partitioning DEN SMJCAT. ISSN 0097- REFERENCES 157

5397 (print), 1095-7111 (elec- CODEN IESEDJ. ISSN tronic). 0098-5589 (print), 1939-3520 (electronic). Chang:1993:RCO Chang:1985:PAK [CKW93] Chin-Chen Chang, Huey- Cheue Kowng, and Tzong- [CL85] Chin-Chen Chang and Jenn Chen Wu. A reﬁnement Liang. Performance analy- of a compression-oriented sis of a k-nearest neighbor addressing scheme. BIT searching technique. Chung- (Nordisk tidskrift for infor- kuo Kung Ch’eng Hsueh mationsbehandling), 33(4): K’an/Journal of the Chinese 529–535, December 1993. Institute of Engineers, 8(2): CODEN BITTEL, NBITAB. 157–169, April 1985. CO- ISSN 0006-3835 (print), DEN CKCKDZ. 1572-9125 (electronic). URL Chang:1986:LOM http://www.mai.liu.se/ BIT/contents/bit33.html; [CL86] C. C. Chang and R. C. T. http://www.springerlink. Lee. A letter-oriented mini- com/openurl.asp?genre= mal perfect hashing scheme. article&issn=0006-3835& The Computer Journal,29 volume=33&issue=4&spage= (3):277–281, June 1986. CO- 529. DEN CMPJA6. ISSN 0010- Coetser:2009:REH 4620 (print), 1460-2067 (electronic). [CKW09] Wikus Coetser, Derrick G. Kourie, and Bruce W. Wat- Chang:1995:CHE son. On regular expression hashing to reduce FA [CL95] Ye-In Chang and Chien-I size. International Jour- Lee. Climbing hashing for nal of Foundations of Com- expansible ﬁles. Informa- puter Science, 20(6):1069– tion sciences, 86(1 / 3):77– 1086, December 2009. CO- ??, September 1, 1995. CO- DEN IFCSEN. ISSN 0129- DEN ISIJBC. ISSN 0020- 0541 (print), 1793-6373 (elec- 0255 (print), 1872-6291 (electronic). tronic). Cook:1983:STA Chang:2005:PHS [CL83] R. P. Cook and T. J. [CL05] Chin-Chen Chang and Chih- LeBlanc. A symbol table ab- Yang Lin. Perfect hash- straction to implement lan- ing schemes for mining as- guages with explicit scope sociation rules. The Com- control. IEEE Transactions puter Journal, 48(2):168– on Software Engineering,SE- 179, March 2005. CO- 9(1):8–12, January 1983. DEN CMPJA6. ISSN 0010- REFERENCES 158

4620 (print), 1460-2067 (elec- DEN CACMA2. ISSN 0001- tronic). URL http:// 0782 (print), 1557-7317 (elec- www3.oup.co.uk/computer_ tronic). journal/hdb/Volume_48/ Issue_02/bxh074.sgm.abs. Chang:1992:OPD html; http://www3.oup. [CLC92] C. C. Chang, H. F. Lin, co.uk/computer_journal/ and C. Y. Chen. Optimality hdb/Volume_48/Issue_02/ properties of the disc mod- pdf/bxh074.pdf. ulo allocation method for k- ary multiple key hashing files. Colbourn:2009:LHF The Computer Journal,35 [CL09a] Charles J. Colbourn and (4):390–394, August 1, 1992. Alan C. H. Ling. Lin- CODEN CMPJA6. ISSN ear hash families and for- 0010-4620 (print), 1460-2067 bidden configurations. De- (electronic). signs, Codes, and Cryptogra- Chang:2006:PHS phy, 52(1):25–55, July 2009. CODEN DCCREC. ISSN [CLC06] Chin-Chen Chang, Chih- 0925-1022 (print), 1573- Yang Lin, and Henry Chou. 7586 (electronic). URL Perfect hashing schemes for http://www.springerlink. mining traversal patterns. com/openurl.asp?genre= Fundamenta Informaticae, article&issn=0925-1022& 70(3):185–202, May 2006. volume=52&issue=1&spage= CODEN FUMAAJ. ISSN 25. 0169-2968 (print), 1875-8681 Colbourn:2009:RCP (electronic). Chang:1982:SGC [CL09b] Charles J. Colbourn and Alan C. H. Ling. A re- [CLD82] C. C. Chang, R. C. T. Lee, cursive construction for per- and M. W. Du. Symbolic fect hash families. Journal gray code as a perfect mul- of Mathematical Cryptology, tiattribute hashing scheme 3(4):291–306, 2009. CODEN for partial match queries. ???? ISSN 1862-2976 (print), IEEE Transactions on Soft- 1862-2984 (electronic). ware Engineering, SE-8(3): 235–249, May 1982. CO- Clapson:1977:IAT DEN IESEDJ. ISSN 0098- [Cla77] Philip Clapson. Improving 5589 (print), 1939-3520 (elec- the access time for random tronic). access files. Communications Cleary:1984:CHT of the Association for Com- puting Machinery, 20(3):127– [Cle84] John G. Cleary. Compact 135, March 1977. CO- hash tables using bidirec- REFERENCES 159

tional linear probing. IEEE multi-graph hashing for scal- Transactions on Computers, able similarity search. Com- C-33(9):828–834, September puter vision and image un- 1984. CODEN ITCOB4. derstanding: CVIU, 124(??): ISSN 0018-9340 (print), 12–21, July 2014. CO- 1557-9956 (electronic). URL DEN CVIUF4. ISSN 1077- http://ieeexplore.ieee. 3142 (print), 1090-235X org/stamp/stamp.jsp?tp=& (electronic). URL http: arnumber=1676499. //www.sciencedirect.com/ science/article/pii/S1077314214000794. Charles:2009:CHF Celis:1985:RHH [CLG09] Denis X. Charles, Kristin E. Lauter, and Eyal Z. Goren. [CLM85] Pedro Celis, Per-Ake˚ Larson, Cryptographic hash func- and J. Ian Munro. Robin tions from expander graphs. Hood hashing. In IEEE- Journal of Cryptology,22 FOCS’85 [IEE85a], pages (1):93–113, January 2009. 281–288. ISBN 0-8186-0644- CODEN JOCREQ. ISSN 4 (paperback), 0-8186-4644- 0933-2790 (print), 1432- 6 (microfiche), 0-8186-8644-8 1378 (electronic). URL (hardcover). LCCN QA 76 http://www.springerlink. S979 1985. com/openurl.asp?genre= article&issn=0933-2790& Celis:1986:RHHb volume=22&issue=1&spage= 93. [CLM86] P. Celis, P. A.˚ Larson, and Click:1995:GCM J. I. Munro. Robin Hood hashing. Technical Report [Cli95] Cliff Click. Global code CS-86-14, Department of motion: global value num- Computer Science, Univer- bering. SIGPLAN No- sity of Waterloo, Waterloo, tices, 30(6):246–257, June Ontario, Canada, April 1986. 1995. CODEN SINODQ. ?? pp. See also [Cel86]. ISSN 0362-1340 (print), 1523-2867 (print), 1558-1160 Clifford:1989:AIC (electronic). URL http: [CLM89] James Clifford, Bruce Lind- //www.acm.org:80/pubs/ say, and David Maier, ed- citations/proceedings/ itors. Proceedings of the pldi/207110/p246-click/. 1989 ACM SIGMOD Inter- Cheng:2014:SSM national Conference on the Management of Data, Port- [CLL+14] Jian Cheng, Cong Leng, land, Oregon. ACM Press, Peng Li, Meng Wang, and New York, NY 10036, USA, Hanqing Lu. Semi-supervised 1989. ISBN 0-89791-317-5. REFERENCES 160

LCCN QA 76.9 D3 S53 v.18 Chiu:2017:AAS no.2 1989. [CLP17] Chih-Yi Chiu, Yu-Cyuan Li:2007:RNH Liou, and Amorntip Pray- [cLmL07] Jun cao Li and Chun ming oonwong. Approximate Li. Research on a novel asymmetric search for bi- hashing stream cipher. Lec- nary embedding codes. ACM ture Notes in CS, 4456: Transactions on Multime- 481–490, 2007. CODEN dia Computing, Communica- LNCSD9. ISSN 0302-9743 tions, and Applications,13 (print), 1611-3349 (elec- (1):3:1–3:??, January 2017. tronic). URL http://link. CODEN ???? ISSN 1551- springer.com/content/pdf/ 6857 (print), 1551-6865 (elec- 10.1007/978-3-540-74377- tronic). 4_51. Chen:1995:STP Chang:2006:ISA [CLS95] Tzer-Shyong Chen, Feipei [CLNY06] Donghoon Chang, Sangjin Lai, and Rung-Ji Shang. A Lee, Mridul Nandi, and Moti simple tree pattern matching Yung. Indifferentiable secu- algorithm for code generator. rity analysis of popular hash In IEEE [IEE95], pages 162– functions with prefix-free 167. ISBN 0-8186-7119-X. padding. Lecture Notes in LCCN ???? IEEE Catalog CS, 4284:283–298, 2006. CO- No. 95CB35838. DEN LNCSD9. ISSN 0302- Chen:2012:EDI 9743 (print), 1611-3349 (electronic). URL http://link. [CLS12] Long Chen, Banglan Liu, and springer.com/content/pdf/ Wei Song. An efficient data 10.1007/11935230_19.pdf. integrity verification method supporting multi-granular Canetti:2013:PCC operation with commutative [CLP13] Ran Canetti, Huijia Lin, and hash. Lecture Notes in CS, Omer Paneth. Public-coin 7413:132–141, 2012. CO- concurrent zero-knowledge DEN LNCSD9. ISSN 0302- in the global hash model. 9743 (print), 1611-3349 (elec- Lecture Notes in CS, 7785: tronic). URL http://link. 80–99, 2013. CODEN springer.com/chapter/10. LNCSD9. ISSN 0302-9743 1007/978-3-642-32115-3_ (print), 1611-3349 (elec- 15/. tronic). URL http://link. Colbourn:2018:ACM springer.com/chapter/10. 1007/978-3-642-36594-2_ [CLS18] Charles J. Colbourn, Erin 5/. Lanus, and Kaushik Sarkar. REFERENCES 161

Asymptotic and construc- Knowledge and Data Engi- tive methods for covering neering, 7(4):656–??, August perfect hash families and 1, 1995. CODEN ITKEEH. covering arrays. Designs, ISSN 1041-4347. Codes, and Cryptography,86 Czech:1993:LTA (4):907–937, April 2018. CO- DEN DCCREC. ISSN 0925- [CM93] Zbigniew J. Czech and Bo- 1022 (print), 1573-7586 (elec- hdan S. Majewski. A lin- tronic). URL https://link. ear time algorithm for finding springer.com/article/10. minimal perfect hash func- 1007/s10623-017-0369-x. tions. The Computer Jour- nal, 36(6):579–587, Decem- Chu:1998:EHB ber 1993. CODEN CM- [CLW98] K. W. Chu, S. K. Lam, PJA6. ISSN 0010-4620 and M. H. Wong. An ef- (print), 1460-2067 (elec- ficient hash-based algorithm tronic). URL http:/ for sequence data search- /comjnl.oxfordjournals. ing. The Computer Journal, org/content/36/6/579.full. 41(6):402–415, ???? 1998. pdf+html; http://www3. CODEN CMPJA6. ISSN oup.co.uk/computer_journal/ 0010-4620 (print), 1460-2067 Volume_36/Issue_06/Vol36_ (electronic). URL http:// 06.body.html#AbstractCzech. www3.oup.co.uk/computer_ Christophi:2001:DSR journal/Volume_41/Issue_ 06/Vol41_06.body.html# [CM01] C. A. Christophi and H. M. AbstractChu. Mahmoud. Distribution of Chen:1992:USR the size of random hash trees, pebbled hash trees and N- [CLYY92] M-S. Chen, M. L. Lo, P. S. trees. Statistics & Prob- Yu, and H. C. Young. Using ability Letters, 53(3):277– segmented right-deep trees 282, June 15, 2001. CO- for the execution of pipelined DEN SPLTDC. ISSN 0167- hash joins. In Yuan [Yua92], 7152 (print), 1879-2103 (elec- page 15. ISBN 1-55860-151-1. tronic). LCCN QA76.9.D3 I61 1992. Chen:2013:LSM Chen:1995:ASR [CML+13] Xiangyu Chen, Yadong Mu, [CLYY95] Ming-Syan Chen, Mingling Hairong Liu, Shuicheng Yan, Lo, Philip S. Yu, and Hon- Yong Rui, and Tat-Seng esty C. Young. Applying Chua. Large-scale multil- segmented right-deep trees abel propagation based on to pipelining multiple hash efficient sparse graph con- joins. IEEE Transactions on struction. ACM Transac- REFERENCES 162

tions on Multimedia Comput- Disclosure Bulletin, 26(2): ing, Communications, and 515–516, July 1983. CODEN Applications, 10(1):6:1–6:??, IBMTAA. ISSN 0018-8689. December 2013. CODEN ???? ISSN 1551-6857 (print), Cheng:2007:DHL 1551-6865 (electronic). [CN07] James Cheng and Wilfred Contini:2007:EFA Ng. A development of hash-lookup trees to support [CMP07] Scott Contini, Krystian Ma- querying streaming XML. tusiewicz, and Josef Piep- Lecture Notes in CS, 4443: rzyk. Extending FORK-256 768–780, 2007. CODEN attack to the full hash func- LNCSD9. ISSN 0302-9743 tion. Lecture Notes in CS, (print), 1611-3349 (elec- 4861:296–305, 2007. CO- tronic). URL http://link. DEN LNCSD9. ISSN 0302- springer.com/content/pdf/ 9743 (print), 1611-3349 (elec- 10.1007/978-3-540-71703- tronic). URL http://link. 4_64. springer.com/content/pdf/ 10.1007/978-3-540-77048- Chang:2008:IIS 0_23. Canetti:1998:POW [CN08] Donghoon Chang and Mridul Nandi. Improved indiﬀer- [CMR98] Ran Canetti, Daniele Mic- entiability security analy- ciancio, and Omer Rein- sis of chopMD hash func- gold. Perfectly one-way tion. Lecture Notes in CS, probabilistic hash functions 5086:429–443, 2008. CO- (preliminary version). In DEN LNCSD9. ISSN 0302- ACM [ACM98], pages 131– 9743 (print), 1611-3349 (elec- 140. ISBN 0-89791-962- tronic). URL http://link. 9. LCCN QA75.5 .A14 springer.com/content/pdf/ 1998. URL http://www. 10.1007/978-3-540-71039- acm.org/pubs/articles/ 4_27. proceedings/stoc/276698/ p131-canetti/p131-canetti. Comer:1982:GPA pdf; http://www.acm. org/pubs/citations/proceedings/[CO82a] Douglas Comer and Michael J. stoc/276698/p131-canetti/ O’Donnell. Geometric prob- . ACM order number 508980. lems with application to hashing. SIAM Journal Carter:1983:CEI on Computing, 11(2):217– [CMW83] J. L. Carter, G. Markowsky, 226, ???? 1982. CO- and M. N. Wegman. Class DEN SMJCAT. ISSN 0097- of easily implemented hash 5397 (print), 1095-7111 (elec- functions. IBM Technical tronic). REFERENCES 163

Cook:1982:LOM delberg, Germany / London, UK / etc., 1994. ISBN 3- [CO82b] Curtis R. Cook and R. R. 540-57843-9. ISSN 0302- Oldehoeft. A letter ori- 9743 (print), 1611-3349 (elec- ented minimal perfect hash- tronic). LCCN QA268 .A397 ing function. SIGPLAN No- 1994. tices, 17(9):18–27, Septem- Cohen:1997:RHF ber 1982. CODEN SIN- ODQ. ISSN 0362-1340 [Coh97] Jonathan D. Cohen. Recur- (print), 1523-2867 (print), sive hashing functions for n- 1558-1160 (electronic). A grams. ACM Transactions on simple improvement giving Information Systems, 15(3): dramatic speedups is de- 291–320, July 1997. CODEN scribed in [Tro95]. ATISET. ISSN 1046-8188. URL Coburn:1994:ISH http://www.acm.org: 80/tois/abstracts/cohen. [Cob94] T. K. Coburn. An introduc- html. tion to the SSPIN hash func- Cohen:1998:GHS tion: Making more out of the multidimensional array. In [Coh98] Jonathan D. Cohen. An n- IEEE [IEE94b], pages 919– gram hash and skip algo- 925. ISBN 0-7803-1893-5, rithm for ﬁnding large num- 0-7803-1894-3, 0-7803-1895- bers of keywords in continu- 1. ISSN 0547-3578. LCCN ous text streams. Software— TL 693 N37 1994. Two vol- Practice and Experience, umes. 28(15):1605–1635, Decem- ber 25, 1998. CODEN Cohen:1984:MSP SPEXBL. ISSN 0038-0644 [Coh84] Shimon Cohen. Multi- (print), 1097-024X (elec- Version Structures in Pro- tronic). URL http:// log. Ohmsha, Ltd., 3-1 www3.interscience.wiley. Kanda Nishiki-cho, Chiyoda- com/cgi-bin/abstract?ID= ku, Tokyo 101, Japan, 1984. 10050312; http://www3. ISBN 4-274-07221-5. 229–234 interscience.wiley.com/ pp. LCCN ???? cgi-bin/fulltext?ID=10050312& PLACEBO=IE.pdf. Cohen:1994:ACF Coleman:1993:PTI [Coh94] G. Cohen, editor. Alge- braic coding: 1st French- [Col93] Samuel S. Coleman, editor. Israeli workshop — July Proceedings: Twelfth IEEE 1993, Paris, number 781 Symposium on Mass Storage in Lecture Notes in Com- Systems: putting all that data puter Science. Springer-Ver- to work, April 26–29, 1993, lag, Berlin, Germany / Hei- Monterey, California. IEEE REFERENCES 164

Computer Society Press, ifornia, USA, August 27– 1109 Spring Street, Suite 300, 31, 1995: proceedings,vol- Silver Spring, MD 20910, ume 963 of Lecture Notes in USA, 1993. ISBN 0-8186- Computer Science. Springer- 3462-6. LCCN TK7895.M4 Verlag, Berlin, Germany / I5 1993. Heidelberg, Germany / Lon- Constantin:2017:SHF don, UK / etc., 1995. CO- DEN LNCSD9. ISBN 3- [Con17] Lucian Constantin. The 540-60221-6 (Berlin). ISSN SHA1 hash function is now 0302-9743 (print), 1611- completely unsafe: Re- 3349 (electronic). LCCN searchers have achieved the QA76.9.A25 C79 1995. URL first practical SHA-1 colli- http://link.springer-ny. sion, generating two PDF com/link/service/series/ files with the same signa- 0558/tocs/t0963.htm; ture. ComputerWorld,?? http://www.springerlink. (??):??, February 23, 2017. com/openurl.asp?genre= CODEN CMPWAB. ISSN issue&issn=0302-9743&volume= 0010-4841. URL https:/ 963.Sponsoredbythe /www.computerworld.com/ International Association article/3173616/the-sha1- for Cryptologic Research hash-function-is-now-completely- (IACR), in cooperation with unsafe.html. the IEEE Computer Society Coppersmith:1995:ACA Technical Committee on Se- curity and Privacy. [Cop95a] D. Coppersmith, editor. Ad- vances in cryptology: 15th Coron:2000:ESF Annual international conference — August 1995, Santa Barbara, CA, number 963 [Cor00] Jean-Sébastien Coron. On in Lecture Notes in Com- the exact security of full do- puter Science. Springer-Ver- main hash. In Bellare [Bel00], lag, Berlin, Germany / Hei- pages 229–?? ISBN 3- delberg, Germany / London, 540-67907-3. ISSN 0302- UK / etc., 1995. ISBN 3-540- 9743 (print), 1611-3349 (elec- 60221-6. LCCN QA76.9.A25 tronic). LCCN QA76.9.A25 C79 1995. C79 2000 Bar. URL Coppersmith:1995:ACC http://link.springer-ny. com/link/service/series/ [Cop95b] Don Coppersmith, editor. 0558/bibs/1880/18800229. Advances in cryptology, CRYPTO htm; http://link.springer- ’95: 15th Annual Interna- ny.com/link/service/series/ tional Cryptology Confer- 0558/papers/1880/18800229. ence, Santa Barbara, Cal- pdf. REFERENCES 165

Coron:2002:SPP dam, The Netherlands, April 13–15, 1987: proceedings, [Cor02] Jean-S´ebastien Coron. Secu- volume 304 of Lecture Notes rity proof for partial-domain in Computer Science. Spring- hash signature schemes. In er-Verlag, Berlin, Germany / Yung [Yun02], pages 613– Heidelberg, Germany / Lon- 626. CODEN LNCSD9. don, UK / etc., 1988. CO- ISBN 3-540-44050-X (pa- DEN LNCSD9. ISBN 0- perback). ISSN 0302-9743 387-19102-X (New York), 3- (print), 1611-3349 (elec- 540-19102-X (Berlin). ISSN tronic). LCCN QA76.9.A25 0302-9743 (print), 1611- C79 2002. URL http:/ 3349 (electronic). LCCN /link.springer.de/link/ QA76.9.A25 E9631 1987; service/series/0558/bibs/ QA267.A1 L43 no.304. URL 2442/24420613.htm; http: http://link.springer-ny. //link.springer.de/link/ com/link/service/series/ service/series/0558/papers/ 0558/tocs/t0304.htm; 2442/24420613.pdf. http://www.springerlink. Chaum:1987:ACE com/content/978-0-387- 19102-7; http://www. [CP87] David Chaum and Wyn L. springerlink.com/openurl. Price, editors. Advances in asp?genre=issue&issn=0302- Cryptology–EUROCRYPT 9743&volume=304.Spon- ’87: Workshop on the Theory sored by the International and Application of Crypto- Association for Cryptologic graphic Techniques, Amster- Research. dam, The Netherlands, April Cai:1991:MNH 13–15, 1987: Proceedings, volume 304 of Lecture Notes [CP91a] Jiazhen Cai and Robert in Computer Science. Spring- Paige. “Look Ma, no hashing, er-Verlag, Berlin, Germany / and no arrays neither”. In Heidelberg, Germany / Lon- ACM-POPL’91 [ACM91d], don, UK / etc., 1987. ISBN 0- pages 143–154. ISBN 0- 387-19102-X (New York), 3- 89791-419-8. LCCN QA76.7 540-19102-X (Berlin). LCCN .A15 1991. QA76.9.A25 E963 1987. Cai:1991:LMN Chaum:1988:ACE [CP91b] Jiazhen Cai and Robert A. [CP88] David Chaum and Wyn L. Paige. Look ma, no hash- Price, editors. Advances in ing, and no arrays neither. In cryptology — EUROCRYPT ACM [ACM91a], pages 143– ’87: Workshop on the Theory 154. ISBN ???? LCCN and Application of Crypto- ???? URL http://www.acm. graphic Techniques, Amster- org:80/pubs/citations/ REFERENCES 166

proceedings/plan/99583/ CODEN SINODQ. ISSN p143-cai/. 0362-1340 (print), 1523-2867 (print), 1558-1160 (elec- Camion:1991:KHF tronic). Haskell ’14 confer- [CP91c] P. Camion and J. Patarin. ence proceedings. The knapsack hash function Chaudhuri:2008:LCF proposed at Crypto ’89 can be broken. In Davies [Dav91], [CPP08] Kaustuv Chaudhuri, Frank pages 39–53. ISBN 0-387- Pfenning, and Greg Price. 54620-0 (New York), 3-540- A logical characterization 54620-0 (Berlin). ISSN 0302- of forward and backward 9743 (print), 1611-3349 (elec- chaining in the inverse tronic). LCCN QA76.9.A25 method. Journal of Auto- E964 1991. mated Reasoning, 40(2–3): Cai:1995:UMD 133–177, March 2008. CO- DEN JAREEW. ISSN 0168- [CP95a] Jiazhen Cai and R. Paige. 7433 (print), 1573-0670 (elec- Using multiset discrimina- tronic). URL http://link. tion to solve language pro- springer.com/article/10. cessing problems without 1007/s10817-007-9091-0. hashing. Theoret. Com- put. Sci., 145(1-2):189–228, Chen:2008:IRS July 10, 1995. CODEN [CQW08] Guihai Chen, Tongqing Qiu, TCSCDI. ISSN 0304-3975 and Fan Wu. Insight into re- (print), 1879-2294 (elec- dundancy schemes in DHTs. tronic). The Journal of Supercomput- Charnes:1995:ASH ing, 43(2):183–198, February 2008. CODEN JOSUED. [CP95b] C. Charnes and J. Pieprzyk. ISSN 0920-8542 (print), Attacking the SL2 hashing 1573-0484 (electronic). URL scheme. Lecture Notes in http://www.springerlink. CS, 917:322–??, 1995. CO- com/openurl.asp?genre= DEN LNCSD9. ISSN 0302- article&issn=0920-8542& 9743 (print), 1611-3349 (elec- volume=43&issue=2&spage= tronic). 183. Claessen:2013:SPN Chung:1989:DSH

[CP13] Koen Claessen and MichalH. [CR89] Yunmo Chung and M. V. Pa lka. Splittable pseudo- Ramakrishna. Dynamic sig- random number generators nature hashing. In Knaﬂ using cryptographic hash- [Kna89], pages 257–262. ing. SIGPLAN Notices,48 ISBN 0-8186-1964-3. LCCN (12):47–58, December 2013. QA76.6 .C62951 1989. REFERENCES 167

Crammond:1985:CSU Fast mesh-to-mesh remaps using hash algorithms. SIAM [Cra85] Jim Crammond. A com- Journal on Scientific Com- parative study of unifica- puting, 40(4):C450–C476, tion algorithms for OR- ???? 2018. CODEN parallel execution of logic SJOCE3. ISSN 1064-8275 languages. IEEE Transac- (print), 1095-7197 (elections on Computers, C-34(1): tronic). 911–917, October 1985. CO- DEN ITCOB4. ISSN 0018- Chaum:1983:ACP 9340 (print), 1557-9956 (electronic). Compares directory [CRS83a] David Chaum, Ronald L. trees, hash windows, and Rivest, and Alan T. Sher- variable importation. man, editors. Advances in Cryptology: Proceedings of Carreras-Riudavets:2012:MAU CRYPTO ’83 (21–24 August 1983: University of Califor- [CRdPHF12] Francisco J. Carreras-Riudavets, nia, Santa Barbara). Plenum Juan C. Rodr´ıguez del Press, New York, NY, USA, Pino, and Zenón Hernández- 1983. ISBN 0-306-41637-9, 1- Figueroa. A morphological 4757-0604-9 (print), 1-4757- analyzer using hash tables 0602-2. LCCN QA76.9.A25 in main memory (MAHT) C791 1983. and a lexical knowledge base. Lecture Notes in Chung:1983:PSR CS, 7181:80–91, 2012. CO- DEN LNCSD9. ISSN 0302- [CRS83b] F.R.K.Chung,A.L.Rosen- 9743 (print), 1611-3349 (elec- berg, and Lawrence Snyder. tronic). URL http://link. Perfect storage representa- springer.com/chapter/10. tions for families of data 1007/978-3-642-28604-9_ structures. SIAM Journal of 7/. Algebraic Discrete Methods,4 (4):548–565, December 1983. Cromwell:1998:PBD CODEN SJAMDU. ISSN 0196-5212 (print), 2168-345X [Cro98] Jeff Cromwell. Programmer’s (electronic). bookshelf: The dawning of the age of multithreading. Celis:2011:BBS Dr. Dobbs Journal, 23(9): 127, 129, September 1998. [CRSW11] L. E. Celis, O. Reingold, CODEN DDJOEB. ISSN G. Segev, and U. Wieder. 1044-789X. Balls and bins: Smaller hash Collom:2018:FMM families and faster evaluation. In IEEE [IEE11b], [CRR18] Gerald Collom, Colin Red- pages 599–608. ISBN 1-4577- man, and Robert W. Robey. 1843-X. LCCN ???? REFERENCES 168

Celis:2013:BBS CODEN PCCCDU. ISSN 0732-6181. [CRSW13] L. Elisa Celis, Omer Rein- gold, Gil Segev, and Udi Chang:1985:FAC Wieder. Balls and bins: [CS85a] C. C. Chang and J. C. Shieh. Smaller hash families and Fast Algorithm for Con- faster evaluation. SIAM structing Reciprocal Hash- Journal on Computing,42 ing Functions. IEEE Com- (3):1030–1050, ???? 2013. puter Society Press, 1109 CODEN SMJCAT. ISSN Spring Street, Suite 300, Sil- 0097-5397 (print), 1095-7111 ver Spring, MD 20910, USA, (electronic). 1985. ISBN 0-8186-0639-8. Comer:1982:HBS 232–236 pp. LCCN ???? IEEE Service Cent. Piscat- [CS82] Douglas Comer and Vin- away, NJ, USA. cent Yun Shen. Hash- bucket search — a fast Chang:1985:DLO technique for searching an [CS85b] C.-C. Chang and J.-C. Shieh. English spelling dictionary. On the design of letter ori- Software—Practice and Ex- ented minimal perfect hash- perience, 12(7):669–682, July ing functions (in Chinese). 1982. CODEN SPEXBL. Journal of Chinese Institute ISSN 0038-0644 (print), of Engineers, 8(3):285–297, 1097-024X (electronic). July 1985. CODEN CK- Chang:1983:DOM CKDZ. ISSN 0368-7058. Chang:1985:DLM [CS83a] C. C. Chang and J. C. Shieh. On the design of ordered min- [CS85c] Chin-Chen Chang and Jiann- imal perfect hashing func- Cherng Shieh. On the de- tions and join dependencies. sign of letter-oriented min- Was to appear in J. ACM, imal perfect hashing func- but did not. Where was it ﬁ- tions. Chung-kuo Kung nally published?, 1983. Ch’eng Hsueh K’an/Journal of the Chinese Institute Chang:1983:PMF of Engineers, 8(3):285–297, [CS83b] C. C. Chang and D. H. Su. July 1985. CODEN CK- Properties of multi-attribute CKDZ. ﬁle systems based upon mul- Chang:1986:DOM tiple key hashing functions. Proceedings — Annual Aller- [CS86] C. C. Chang and J. C. Shieh. ton Conference on Commu- On the design of ordered min- nication, Control, and Com- imal perfect hashing func- puting, pages 675–682, 1983. tions. In ICDE’86 [ICD86], REFERENCES 169

pages 112–115. ISBN 0-8186- Cooper:1993:TTA 0655-X (paperback), 0-8186- 8655-3 (hardcover), 0-8186- [CS93b] Robert B. Cooper and Mar- 4655-1 (microfiche). LCCN tin K. Solomon. Teletraffic QA 76.9 D3 I5582 1986. theory applied to the analysis of hash-structured files. Chang:1987:PAM AEU: Archiv für Elektronik und Ubertragungstech, 47(5 [CS87] Chin-Chen Chang and Don- / 6):336–341, September 1, Hsin Su. Performance anal- 1993. CODEN AEUTAH. yses of multi-attribute files ISSN 0001-1096. based upon multiple key Cramer:2002:UHP hashing functions and haphazard files. Chung-kuo Kung [CS02] Ronald Cramer and Victor Ch’eng Hsueh K’an/Journal Shoup. Universal hash proofs of the Chinese Institute and a paradigm for adap- of Engineers, 10(1):99–105, tive chosen ciphertext secure January 1987. CODEN CK- public-key encryption. Lec- CKDZ. ture Notes in CS, 2332:45– ??, 2002. CODEN LNCSD9. Cesarini:1991:DHM ISSN 0302-9743 (print), 1611-3349 (electronic). URL [CS91] F. Cesarini and G. Soda. A http://link.springer-ny. dynamic hash method with com/link/service/series/ signature. ACM Transac- 0558/bibs/2332/23320045. tions on Database Systems, htm; http://link.springer- 16(2):309–337, June 1, 1991. ny.com/link/service/series/ CODEN ATDSD3. ISSN 0558/papers/2332/23320045. 0362-5915 (print), 1557-4644 pdf. (electronic). Chakrabarti:2015:BPL Cesarini:1993:SAH [CSSP15] Aniket Chakrabarti, Venu [CS93a] F. Cesarini and G. Soda. Satuluri, Atreya Srivathsan, Single access hashing with and Srinivasan Parthasarathy. overflow separators for dy- A Bayesian perspective on lo- namic files. BIT (Nordisk cality sensitive hashing with tidskrift for informations- extensions for kernel meth- behandling), 33(1):15–28, ods. ACM Transactions on 1993. CODEN BITTEL, Knowledge Discovery from NBITAB. ISSN 0006-3835 Data (TKDD), 10(2):19:1– (print), 1572-9125 (elec- 19:??, October 2015. CO- tronic). URL http://www. DEN ???? ISSN 1556-4681 mai.liu.se/BIT/contents/ (print), 1556-472X (elec- bit33.html. tronic). REFERENCES 170

Cooperman:1996:NSP tronic). URL http://link. springer.com/chapter/10. [CT96] Gene Cooperman and Michael 1007/978-3-642-29426-6_ Tselman. New sequential and 14/. parallel algorithms for generating high dimension Hecke IEEE:1990:FAS algebras using the conden- [CTC90] Fifth Annual Structure in sation technique. In Lak- Complexity Theory Confer- shman Y.N. [Lak96], pages ence Proceedings: July 8–11 155–160. ISBN 0-89791- 1990, Universitat Politecnica 796-0. LCCN QA 76.95 de Catalunya, Barcelona, I59 1996. URL http: Spain. IEEE Computer Soci- //www.acm.org:80/pubs/ ety Press, 1109 Spring Street, citations/proceedings/ Suite 300, Silver Spring, MD issac/236869/p155-cooperman/ 20910, USA, 1990. ISBN . 0-8186-2072-2 (paper), 0- Cormode:2010:ANG 8186-6072-4 (microﬁche), 0- 8186-9072-0 (case). LCCN [CT10] Graham Cormode and Ma- QA267.7 .S75 1990. rina Thottan, editors. Al- gorithms for next gener- Chen:2011:CIK ation networks.Com- puter Communications and [CTZD11] Xiaofeng Chen, Haibo Tian, Networks. Springer-Verlag, Fangguo Zhang, and Yong Berlin, Germany / Hei- Ding. Comments and im- delberg, Germany / Lon- provements on key-exposure don, UK / etc., 2010. free Chameleon hashing ISBN 1-84882-764-4. xx + based on factoring. Lec- 462 pp. LCCN TK5105.5 ture Notes in CS, 6584: .A39523 2010. URL http: 415–426, 2011. CODEN //www.springerlink.com/ LNCSD9. ISSN 0302-9743 content/978-1-84882-764- (print), 1611-3349 (elec- 6/. tronic). URL http://link. springer.com/content/pdf/ Chiou:2012:IMA 10.1007/978-3-642-21518- [CT12] Chuang-Kai Chiou and Judy 6_29. C. R. Tseng. An incremental Chen:1983:AEI mining algorithm for association rules based on minimal [CV83a] Wen Chin Chen and Jef- perfect hashing and prun- frey Scott Vitter. Analy- ing. Lecture Notes in CS, sis of early-insertion standard 7234:106–113, 2012. CO- coalesced hashing. SIAM DEN LNCSD9. ISSN 0302- Journal on Computing,12 9743 (print), 1611-3349 (elec- (4):667–676, November 1983. REFERENCES 171

CODEN SMJCAT. ISSN DEN CMPJA6. ISSN 0010- 0097-5397 (print), 1095-7111 4620 (print), 1460-2067 (elec- (electronic). tronic). Chen:1983:NVC Castro:2005:NRG

[CV83b] Wen-Chin Chen and Jef- [CV05] Julio César Hernández Cas- frey Scott Vitter. New vari- tro and Pedro Isasi Viñuela. ants of coalesced hashing. New results on the ge- Proceedings — Annual Aller- netic cryptanalysis of TEA ton Conference on Commu- and reduced-round versions nication, Control, and Com- of XTEA. New Gen- puting, pages 683–692, 1983. eration Computing, 23(3): CODEN PCCCDU. ISSN 233–243, 2005. CODEN 0732-6181. NGCOE5. ISSN 0288- 3635 (print), 1882-7055 Chen:1984:ANV (electronic). URL http: [CV84] Wen-Chin Chen and Jef- //www.springerlink.com/ frey Scott Vitter. Analysis content/e018uh040400kh87/ of new variants of coalesced . hashing. ACM Transac- Chung:2008:TBH tions on Database Systems,9 (4):616–645, December 1984. [CV08] Kai-Min Chung and Salil CODEN ATDSD3. ISSN Vadhan. Tight bounds for 0362-5915 (print), 1557-4644 hashing block sources. Lec- (electronic). ture Notes in CS, 5171: 357–370, 2008. CODEN Chen:1985:AAS LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [CV85] W.-C. Chen and J. S. Vit- tronic). URL http://link. ter. Addendum to Analysis of springer.com/content/pdf/ Some New Variants of Coa- 10.1007/978-3-540-85363- lesced Hashing. ACM Trans- 3_29. actions on Database Systems, 10(1):127, March 1985. CO- Carrea:2014:OHN DEN ATDSD3. ISSN 0362- [CVR14] Laura Carrea, Alexei Vernit- 5915 (print), 1557-4644 (elec- ski, and Martin Reed. Op- tronic). timized hash for network Chen:1986:DAC path encoding with minimized false positives. Com- [CV86] W. C. Chen and J. S. Vit- puter Networks (Amster- ter. Deletion algorithms for dam, Netherlands: 1999), coalesced hashing. The Com- 58(??):180–191, January 15, puter Journal, 29(5):436– 2014. CODEN ???? ISSN 450, October 1986. CO- 1389-1286 (print), 1872-7069 REFERENCES 172

(electronic). URL http: Chang:1993:HON //www.sciencedirect.com/ science/article/pii/S1389128613003046[CW93]. C. C. Chang and T. C. Wu. A hashing oriented Carter:1977:UCHa nearest neighbor searching scheme. Pattern Recog- [CW77a] I. L. Carter and M. N. Weg- nition Letters, 14(8):625– man. Universal classes of ??, August 1, 1993. CO- hash functions. In Carter DEN PRLEDG. ISSN 0167- & Wegman [ACM77b], pages 8655 (print), 1872-7344 (elec- 106–112. tronic).

Carter:1977:UCHb Chen:2009:SHA

[CW77b] J. L. Carter and M. N. [CW09] Ning Chen and Wang-Gen Wegman. Universal classes Wan. Speech hashing algo- of hash functions. Techni- rithm based on short-time cal report, ????, Yorktown stability. Lecture Notes in Heights, NY, USA, 1977. ?? CS, 5769:426–434, 2009. CO- pp. DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Carter:1979:UCH tronic). URL http://link. springer.com/content/pdf/ [CW79] J. Lawrence Carter and 10.1007/978-3-642-04277- Mark N. Wegman. Uni- 5_43. versal classes of hash functions. Journal of Computer Chiu:2010:FMH and System Sciences, 18(2): [CWC10] Chih-Yi Chiu, Hsin-Min 143–154, April 1979. CO- Wang, and Chu-Song Chen. DEN JCSSBM. ISSN 0022- Fast min-hashing indexing 0000 (print), 1090-2724 (elec- and robust spatio-temporal tronic). matching for detecting video copies. ACM Transactions Chang:1991:LOP on Multimedia Computing, Communications, and Ap- [CW91] Chin-Chen Chang and Tzong- plications, 6(2):10:1–10:??, Chen Wu. A letter-oriented March 2010. CODEN perfect hashing scheme based ???? ISSN 1551-6857 (print), upon Sparse table compres- 1551-6865 (electronic). sion. Software—Practice and Experience, 21(1):35– Chandramouli:2019:FFI 49, January 1991. CODEN SPEXBL. ISSN 0038-0644 [CXLK19] Badrish Chandramouli, Dong (print), 1097-024X (elec- Xie, Yinan Li, and Don- tronic). ald Kossmann. FishStore: REFERENCES 173

fast ingestion and index- Chi:2017:HTS ing of raw data. Proceed- ings of the VLDB Endow- [CZ17] Lianhua Chi and Xingquan ment, 12(12):1922–1925, Au- Zhu. Hashing techniques: a gust 2019. CODEN ???? survey and taxonomy. ACM ISSN 2150-8097. Computing Surveys, 50(1): 11:1–11:36, April 2017. CO- Contini:2006:FPK DEN CMSVAN. ISSN 0360- 0300 (print), 1557-7341 (elec- [CY06] Scott Contini and Yiqun Lisa tronic). Yin. Forgery and partial key- Czech:1998:QPH recovery attacks on HMAC and NMAC using hash col- [Cze98] Zbigniew J. Czech. Quasi- lisions. Lecture Notes in perfect hashing. The CS, 4284:37–53, 2006. CO- Computer Journal, 41(6): DEN LNCSD9. ISSN 0302- ??, ???? 1998. CO- 9743 (print), 1611-3349 (elec- DEN CMPJA6. ISSN 0010- tronic). URL http://link. 4620 (print), 1460-2067 (elec- springer.com/content/pdf/ tronic). URL http:// 10.1007/11935230_3.pdf. www3.oup.co.uk/computer_ journal/Volume_41/Issue_ Cobb:1991:SIP 06/Vol41_06.body.html# AbstractCzech. [CyWM91] Jorge A. Cobb, Shiow yang Chu:2012:TMP Wu, and Daniel P. Miranker. Skew insensitive parallel join [CZL12] Xiaowen Chu, Kaiyong Zhao, with sampling. Technical Re- and Zongpeng Li. Tsunami: port TR-91-35, University of massively parallel homo- Texas, Austin, Austin, TX, morphic hashing on many- USA, November 1991. 18 pp. core GPUs. Concurrency and Computation: Practice Chen:2014:MLC and Experience, 24(17):2028– 2039, December 10, 2012. [CZ14] Long Chen and Zhao Zhang. CODEN CCPEBO. ISSN MemGuard: a low cost and 1532-0626 (print), 1532-0634 energy eﬃcient design to (electronic). support and enhance mem- Chen:2012:AIB ory system reliability. ACM SIGARCH Computer Ar- [CZLC12a] Yu Chen, Zongyang Zhang, chitecture News, 42(3):49– Dongdai Lin, and Zhenfu 60, June 2014. CODEN Cao. Anonymous identity- CANED2. ISSN 0163- based hash proof system 5964 (print), 1943-5851 (elec- and its applications. Lec- tronic). ture Notes in CS, 7496: REFERENCES 174

143–160, 2012. CODEN Jerusalem, Department of LNCSD9. ISSN 0302-9743 Computer Science, 1992. ?? (print), 1611-3349 (elec- pp. tronic). URL http://link. springer.com/chapter/10. Dietzfelbinger:1993:OPD 1007/978-3-642-33272-2_ [DA93] M. Dietzfelbinger and F. M. 10/. Aufderheide. An optimal Chen:2012:IBE parallel dictionary. Informa- tion and Computation, 102 [CZLC12b] Yu Chen, Zongyang Zhang, (2):196–217, February 1993. Dongdai Lin, and Zhenfu CODEN INFCEC. ISSN Cao. Identity-based ex- 0890-5401 (print), 1090-2651 tractable hash proofs and (electronic). URL http: their applications. Lec- //www.sciencedirect.com/ ture Notes in CS, 7341: science/article/pii/S0890540183710072. 153–170, 2012. CODEN LNCSD9. ISSN 0302-9743 Crescenzo:2012:DFC (print), 1611-3349 (elec- [DA12] Giovanni Di Crescenzo and tronic). URL http://link. Gonzalo Arce. Data foren- springer.com/chapter/10. sics constructions from cryp- 1007/978-3-642-31284-7_ tographic hashing and cod- . 10/ ing. Lecture Notes in CS, Chen:2014:CSI 7128:494–509, 2012. CO- DEN LNCSD9. ISSN 0302- [CZLC14] Yu Chen, Zongyang Zhang, 9743 (print), 1611-3349 (elec- Dongdai Lin, and Zhenfu tronic). URL http://link. Cao. CCA-secure IB– springer.com/content/pdf/ KEM from identity-based 10.1007/978-3-642-32205- extractable hash proof sys- 1_39. tem. The Computer Jour- nal, 57(10):1537–1556, Oc- Diaz:2013:TLH tober 2014. CODEN CM- [DAC+13] Antonio F. D´ıaz, Mancia PJA6. ISSN 0010-4620 Anguita, Hugo E. Cama- (print), 1460-2067 (elec- cho, Erik Nieto, and Julio tronic). URL http:/ Ortega. Two-level hash/ /comjnl.oxfordjournals. table approach for metadata org/content/57/10/1537. management in distributed Dolev:1992:NPH ﬁle systems. The Journal of Supercomputing, 64(1): [D+92] D. Dolev et al. On neigh- 144–155, April 2013. CO- borhood preserving hash- DEN JOSUED. ISSN 0920- ing. Technical report 92- 8542 (print), 1573-0484 (elec- 31, Hebrew University of tronic). URL http://link. REFERENCES 175

springer.com/article/10. Damgaard:1987:CFH 1007/s11227-012-0801-y. [Dam87] I. B. Damg˚ard. Collision free Dietzfelbinger:1990:NUC hash functions and public key signature schemes. In Chaum [DadH90] M. Dietzfelbinger and Meyer and Price [CP87], pages 203– auf der Heide. A new uni- 216. ISBN 0-387-19102-X versal class of hash func- (New York), 3-540-19102-X tions and dynamic hashing (Berlin). LCCN QA76.9.A25 in real time. In Paterson E963 1987. [Pat90], pages 6–19. ISBN Damgaard:1990:ACE 0-387-52826-1 (New York), 3- 540-52826-1 (Berlin). LCCN [Dam90a] I. B. Damg˚ard, editor. QA267.A1 L43 no.443. Advances in Cryptology– EUROCRYPT ’90: Work- Dietzfelbinger:1992:HPU shop on the Theory and Ap- plication of Cryptographic [DadH92] Martin Dietzfelbinger and Techniques, Aarhus, Den- Friedhelm Meyer auf der mark, May 21–24, 1990: Heide. High performance proceedings. Springer-Verlag, universal hashing, with ap- Berlin, Germany / Heidel- plications to shared memory berg, Germany / London, simulations. In Monien and UK / etc., 1990. ISBN 0- Ottmann [MO92a], pages 387-53587-X (New York), 3- 250–269. ISBN 0-387- 540-53587-X (Berlin). LCCN 55488-2 (New York), 3-540- QA76.9.A25 E964 1990. 55488-2 (Berlin). LCCN DM69.00. QA76.9.D35D36 1992. Pa- pers presented at a sympo- Damgaard:1990:DPH sium held at the Freie Uni- [Dam90b] I. B. Damg˚ard. A de- versit¨at Berlin, Sept. 23–26, sign principle for hash func- 1991. tions. In Brassard [Bra90], Daemen:1995:HFC pages 416–427. CODEN LNCSD9. ISBN 0-387-97317- [Dae95] Joan Daemen. Hash Func- 6, 3-540-97317-6. ISSN tion and Cipher Design: 0302-9743 (print), 1611- Strategies Based on Linear 3349 (electronic). LCCN and Diﬀerential Cryptanaly- QA76.9.A25 C79 1989. URL sis. Ph.D. thesis, Katholieke http://link.springer-ny. Universiteit Leuven, Leuven, com/link/service/series/ Belgium, March 1995. 280 0558/tocs/t0435.htm; pp. URL http://wwwlib. http://www.springerlink. umi.com/dissertations/ com/content/978-0-387- fullcit/f548867. 97317-3; http://www. REFERENCES 176

springerlink.com/openurl. assumptions. Lecture Notes asp?genre=issue&issn=0302- in CS, 773:100–109, 1994. 9743&volume=435.Confer- CODEN LNCSD9. ISSN ence held Aug. 20–24, 1989 0302-9743 (print), 1611- at the University of Califor- 3349 (electronic). URL nia, Santa Barbara. http://link.springer-ny. com/link/service/series/ Damgaard:1991:ACE 0558/bibs/0773/07730100. [Dam91] I. B. Damg˚ard, editor. Ad- htm; http://link.springer- vances in cryptology — EU- ny.com/link/service/series/ ROCRYPT ’90: Workshop 0558/papers/0773/07730100. on the Theory and Ap- pdf. plication of Cryptographic Techniques, Aarhus, Den- Dang:2013:CFI mark, May 21–24, 1990: [Dan13] Quynh Dang. Changes in proceedings, volume 473 Federal Information Process- of Lecture Notes in Com- ing Standard (FIPS) 180-4, puter Science. Springer-Ver- Secure Hash Standard. Cryp- lag, Berlin, Germany / Hei- tologia, 37(1):69–73, 2013. delberg, Germany / Lon- CODEN CRYPE6. ISSN don, UK / etc., 1991. CO- 0161-1194 (print), 1558-1586 DEN LNCSD9. ISBN 0-387- (electronic). 53587-X (New York), 3-540- 53587-X (Berlin). ISSN 0302- Datta:1988:IPH 9743 (print), 1611-3349 (electronic). LCCN QA76.9.A25 [Dat88] S. Datta. Implementation E964 1990. DM69.00. of a perfect hashing func- Damgaard:1993:IHC tion scheme. M.s. thesis, De- partment of Computer Sci- [Dam93] I. B. Damg˚ard. Interac- ence, Virginia Polytechnic tive hashing can simplify Institute and State Univer- zero-knowledge protocol de- sity, Blacksburg, VA 24061- sign without complexity as- 0106, USA, March 1988. ?? sumptions. In Stinson [Sti93], pp. page ?? ISBN 0-387-57766- 1 (New York), 3-540-57766-1 Davison:1973:RSC (Berlin). LCCN QA76.9.A25 C79 1993. [Dav73] G. A. Davison. Rapidly Damgaard:1994:IHC searching for character string matches using hash coding. [Dam94] Ivan B. Damg˚ard. Inter- IBM Technical Disclosure active hashing can simplify Bulletin, 16(1):??, June 1973. zero-knowledge protocol de- CODEN IBMTAA. ISSN sign without computational 0018-8689. REFERENCES 177

Davies:1991:ACE 10.1007/978-3-642-32808- 4_33. [Dav91] Donald Watts Davies, edi- Daemen:1993:CSH tor. Advances in Cryptology– EUROCRYPT ’91: Work- [DBGV93] Joan Daemen, Antoon Bosse- shop on the Theory and laers, Rene Govaerts, and Application of Cryptographic Joos Vandewalle. Colli- Techniques, Brighton, UK, sions for Schnorr’s hash func- April 8–11, 1991: Proceed- tion FFT-Hash presented ings, volume 547 of Lec- at Crypto’91. In Imai ture Notes in Computer Sci- et al. [IRM93], pages 477– ence. Springer-Verlag, Berlin, 480. ISBN 0-387-57332-1 Germany / Heidelberg, Ger- (New York), 3-540-57332-1 many / London, UK / etc., (Berlin). LCCN QA76.9.A25 1991. ISBN 0-387-54620- I555 1991. DM96.00. 0 (New York), 3-540-54620- 0 (Berlin). ISSN 0302- Bakker:1980:ALP 9743 (print), 1611-3349 (elec- [dBvL80] J. W. de Bakker and J. van tronic). LCCN QA76.9.A25 Leeuwen, editors. Automata, E964 1991. Languages, and Program- Day:1970:FTQ ming: Seventh Colloquium, Noordwijkerhout, the Nether- [Day70] A. C. Day. Full table lands, July 14–18, 1980. quadratic searching for scat- Springer-Verlag, Berlin, Ger- ter storage. Communications many / Heidelberg, Ger- of the Association for Com- many / London, UK / etc., puting Machinery, 13(8):481– 1980. ISBN 0-387-10003-2. 482, August 1970. CO- LCCN QA267.A1 L43 no.85. DEN CACMA2. ISSN 0001- 0782 (print), 1557-7317 (elec- Dorng:1981:CHC tronic). [DC81] J. C. Dorng and S. K. Chang. Concatenated hash code se- Drechsler:2012:IEH lection. Proceedings - IEEE [DB12] Chris Drechsler and Thomas Computer Society’s Interna- Bauschert. Improving the ef- tional Computer Software & ﬁciency of HTTP caching by Applications Conference 5th., hash based resource identi- pages 245–256, 1981. CO- ﬁers. Lecture Notes in CS, DEN PSICD2. IEEE Serv 7479:362–371, 2012. CO- Cent. Piscataway, NJ, USA. DEN LNCSD9. ISSN 0302- Du:1994:ADV 9743 (print), 1611-3349 (electronic). URL http://link. [DC94] M.-W. Du and S. C. Chang. springer.com/content/pdf/ Approach to designing very REFERENCES 178

fast approximate string age authentication. Algo- matching algorithms. IEEE rithms (Basel), 11(1), Jan- Transactions on Knowledge uary 2018. CODEN AL- and Data Engineering, 6(4): GOCH. ISSN 1999-4893 620–633, August 1994. CO- (electronic). URL https:/ DEN ITKEEH. ISSN 1041- /www.mdpi.com/1999-4893/ 4347. 11/1/6. Daemen:1998:FHS Darragh:1991:BCR

[DC98a] J. Daemen and C. S. K. [DCW91] John J. Darragh, John G. Clapp. Fast hashing and Cleary, and Ian H. Witten. stream encryption with Bonsai: a compact repre- PANAMA. Lecture Notes sentation of trees predictive in CS, 1372:60–74, 1998. interfaces: What will they CODEN LNCSD9. ISSN think of next? oriented 0302-9743 (print), 1611- database definitions. Techni- 3349 (electronic). URL cal Report 91/447/31, Uni- http://link.springer-ny. versity of Calgary, October com/link/service/series/ 1991. ?? pp. (email 0558/bibs/1372/13720060. [email protected]). htm; http://link.springer- ny.com/link/service/series/ DeBonis:2011:CGT 0558/papers/1372/13720060. [DD11] Annalisa De Bonis and Gio- pdf. vanni Di Crescenzo. Com- Daemen:1998:PCF binatorial group testing for corruption localizing hash- [DC98b] Joan Daemen and Craig ing. Lecture Notes in CS, Clapp. The Panama cryp- 6842:579–591, 2011. CO- tographic function. Dr. DEN LNCSD9. ISSN 0302- Dobbs Journal, 23(12):42, 9743 (print), 1611-3349 (elec- 44, 46, 48–49, December tronic). URL http://link. 1998. CODEN DDJOEB. springer.com/content/pdf/ ISSN 1044-789X. URL 10.1007/978-3-642-22685- http://www.ddj.com/ddj/ 4_50. 1998/1998_12/../../../ ftp/1998/1998_12/panama. Dhawan:2015:AEN . zip [DD15] Udit Dhawan and AndréDe- Ding:2018:NPH hon. Area-efficient near- associative memories on FP- [DCM18] Kaimeng Ding, Shiping GAs. ACM Transactions Chen, and Fan Meng. A on Reconfigurable Technol- novel perceptual hash algo- ogy and Systems, 7(4):3:1– rithm for multispectral im- 3:??, January 2015. CODEN REFERENCES 179

???? ISSN 1936-7406 (print), deBalbine:1969:CAR 1936-7414 (electronic). [de 69] Guy de Balbine. Computa- Danezis:2007:END tional Analysis of the Ran- dom Components Induced by [DDF+07] George Danezis, Claudia a Binary Equivalence Rela- Diaz, Sebastian Faust, Emilia tion. Ph.d. thesis, Califor- K¨asper, and Carmela Tron- nia Institute of Technology, coso. Eﬃcient negative Pasadena, CA, USA, 1969. databases from cryptographic 168 pp. First use of second hash functions. Lecture Notes hash function for computing in CS, 4779:423–436, 2007. next hash table location after CODEN LNCSD9. ISSN a collision. See also [BK70]. 0302-9743 (print), 1611-3349 (electronic). URL http:// DeSantis:1995:ACE link.springer.com/content/ [De 95] A. De Santis, editor. Ad- pdf/10.1007/978-3-540- vances in cryptology: EURO- 75496-1_28. CRYPT ’94: Workshop on Dalal:2005:TWC the theory and application of cryptographic techniques — [DDMM05] Ketan Dalal, Luc Devroye, May 1994, Perugia, Italy, Ebrahim Malalla, and Erin number 950 in Lecture Notes McLeish. Two-way chain- in Computer Science. Spring- ing with reassignment. SIAM er-Verlag, Berlin, Germany / Journal on Computing,35 Heidelberg, Germany / Lon- (2):327–340, ???? 2005. CO- don, UK / etc., 1995. ISBN DEN SMJCAT. ISSN 0097- 3-540-60176-7. ISSN 0302- 5397 (print), 1095-7111 (elec- 9743 (print), 1611-3349 (electronic). tronic). LCCN QA76.9.A25 E965 1995. Dinur:2014:IPA Debnath:2003:CTA

[DDS14] Itai Dinur, Orr Dunkel- [Deb03] Narayan C. Debnath, editor. man, and Adi Shamir. Im- Computers and Their Appli- proved practical attacks on cations: proceedings of the round-reduced Keccak. Jour- ISCA 18th international con- nal of Cryptology, 27(2): ference, Honolulu, Hawaii, 183–209, April 2014. CO- USA March 26–28, 2003. DEN JOCREQ. ISSN 0933- ISCA, Carey, NC, USA, 2790 (print), 1432-1378 (elec- 2003. ISBN 1-880843-46-3 tronic). URL http://link. (paperback). LCCN QA75.5 springer.com/article/10. I76 2003; QA76.76.A65 I83 1007/s00145-012-9142-5. 2003. REFERENCES 180

Deen:1982:IIS Denert:1977:D

[Dee82] S. M. Deen. Implementation [DF77] Ernst Denert and Reinhold of impure surrogates. Very Franxk. Datenstrukturen. Large Data Bases, Interna- Bibliographisches Institut, tional Conference on Very Mannheim, Germany, 1977. Large Data Bases, pages ISBN 3-411-01524-1. 362 pp. 245–256, 1982. CODEN LCCN QA76.9.D35 D46. VLDBDP. Datta:1989:IPH Devroye:1986:LNB [DF89] S. Datta and E. A. Fox. [Dev86] Luc Devroye. Lecture Implementation of a perfect Notes on Bucket Algorithms. hash function scheme. Tech- Birkh¨auser, Cambridge, MA, nical Report TR 89-9, De- USA; Berlin, Germany; partment of Computer Sci- Basel, Switzerland, 1986. ence, Virginia Polytechnic ISBN 0-8176-3328-6. 148 Institute and State Univer- pp. LCCN QA76.9.D35 D48 sity, Blacksburg, VA 24061- 1986. 0106, USA, 1989. ?? pp. Devine:1993:DID Domingo-Ferrer:2001:MAR [DF01] J. Domingo-Ferrer. Mo- [Dev93] Robert Devine. Design and bile agent route protection implementation of DDH: a through hash-based mech- distributed dynamic hashing anisms. Lecture Notes algorithm. Lecture Notes in in CS, 2247:17–??, 2001. CS, 730:101–114, 1993. CO- CODEN LNCSD9. ISSN DEN LNCSD9. ISSN 0302- 0302-9743 (print), 1611- 9743 (print), 1611-3349 (elec- 3349 (electronic). URL tronic). http://link.springer-ny. com/link/service/series/ Devroye:1999:HSR 0558/bibs/2247/22470017. [Dev99] Luc Devroye. The height htm; http://link.springer- and size of random hash ny.com/link/service/series/ trees and random pebbled 0558/papers/2247/22470017. hash trees. SIAM Jour- pdf. nal on Computing, 28(4): DellAmico:2015:UAP 1215–1224, August 1999. CODEN SMJCAT. ISSN [DFMR15] Matteo Dell’Amico, Maurizio 0097-5397 (print), 1095-7111 Filippone, Pietro Michiardi, (electronic). URL http:/ and Yves Roudier. On /epubs.siam.org/sam-bin/ user availability prediction dbq/article/32617. and network applications. REFERENCES 181

IEEE/ACM Transactions Dawson:1996:CPA on Networking, 23(4):1300– 1313, August 2015. CO- [DG96] E. Dawson and J. Golic, ed- DEN IEANEP. ISSN 1063- itors. Cryptography: pol- 6692 (print), 1558-2566 (elec- icy and algorithms: Inter- tronic). national conference — July 1995, Brisbane, Australia, DeWitt:1985:MHBa number 1029 in Lecture Notes in Computer Science. [DG85a] D. J. DeWitt and R. Ger- Springer-Verlag, Berlin, Ger- ber. Multiprocessor hash- many / Heidelberg, Ger- based join algorithms. Tech- many / London, UK / nical report, University of etc., 1996. ISBN 3-540- Wisconsin–Madison, Madi- 60759-5. ISSN 0302-9743 son, WI, USA, 1985. ?? pp. (print), 1611-3349 (elec- DeWitt:1985:MHBb tronic). LCCN QA76.9.A25 C844 1996. [DG85b] D. J. DeWitt and R. H. Ger- Desmet:2002:IHC ber. Multiprocessor hash- based join algorithms. In [DGD02] V. Desmet, B. Goeman, and Pirotte and Vassiliou [PV85], K. De Bosschere. Indepen- page 151. ISBN 0-934613-17- dent hashing as conﬁdence 6. LCCN QA 76.9 D3 I61 mechanism for value predic- 1985. tors in microprocessors. Lec- Davison:1993:MCR ture Notes in CS, 2400:458– ??, 2002. CODEN LNCSD9. [DG93] D. L. Davison and G. Graefe. ISSN 0302-9743 (print), Memory-contention respon- 1611-3349 (electronic). URL sive hash joins. Technical Re- http://link.springer-ny. port CU-CS-682-93, Univer- com/link/service/series/ sity of Colorado Computer 0558/bibs/2400/24000458. Science Department, Boul- htm; http://link.springer- der, CO, USA, 1993. ?? pp. ny.com/link/service/series/ 0558/papers/2400/24000458. Davison:1994:MRH pdf. [DG94] D. L. Davison and G. Graefe. DeWitt:1986:GHP Memory-contention responsive hash joins. In Bocca [DGG+86] D. J. DeWitt, R. H. Gerber, et al. [BJZ94], pages 379–390. G. Graefe, M. L. Heytens, ISBN 1-55860-153-8. ISSN K. B. Kumar, and M. Mu- 0730-9317. LCCN QA76.9 ralikrishna. GAMMA — a D3 I61 1994. URL http: high performance dataﬂow //www.vldb.org/dblp/db/ database machine. In conf/vldb/vldb94-379.html. Chu et al. [CGO86], page REFERENCES 182

228. ISBN 0-934613-18-4. and Data Engineering, 1(2): LCCN QA76.9.D3 I559 1986. ??, June 1989. CODEN IT- Reprinted in M. Stonebraker, KEEH. ISSN 1041-4347. Also Readings in Database Sys., published in [ICD87]. Morgan Kaufmann, San Ma- Dietzfelbinger:1992:PHF teo, CA, 1988. [DGMP92] M. Dietzfelbinger, J. Gil, Dantras:2016:OIB Y. Matias, and N. Pippenger. [DGGL16] Amanieu D’antras, Cosmin Polynomial hash functions Gorgovan, Jim Garside, and are reliable. In Kuich [Kui92], Mikel Luján. Optimizing in- pages 235–246. ISBN 0-387- direct branches in dynamic 55719-9 (New York), 3-540- binary translators. ACM 55719-9 (Berlin). ISSN 0302- Transactions on Architecture 9743 (print), 1611-3349 (elec- and Code Optimization,13 tronic). LCCN QA267.A1 (1):7:1–7:??, April 2016. CO- L43 no.623. DEN ???? ISSN 1544- DeWitt:1990:GDMb 3566 (print), 1544-3973 (elec- + tronic). [DGS 90a] David J. DeWitt, Shaharm Ghandeharizadeh, Dono- Durvaux:2012:IPP van A. Schneider, Allan Bricker, Hui i Hsiao, and [DGKK12] Fran¸cois Durvaux, Benoˆıt Rick Rasmusen. The Gérard, Stéphanie Kerckhof, gamma database machine and Fran¸cois Koeune. In- project. IEEE Transactions tellectual property protection on Knowledge and Data En- for integrated systems us- gineering, 2(1):44–62, March ing soft physical hash func- 1990. CODEN ITKEEH. tions. Lecture Notes in CS, ISSN 1041-4347. 7690:208–225, 2012. CO- DeWitt:1990:GDMa DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [DGS+90b] David J. DeWitt, Shahram tronic). URL http://link. Ghandeharizadeh, Donovan springer.com/chapter/10. Schneider, Allan Bricker, 1007/978-3-642-35416-8_ Hui-I Hsiao, and Rick Ras- 15/. mussen. The gamma Du:1989:EFS database machine project. Technical Report TR 921, [DGM89] D. H. C. Du, S. Ghanta, University of Wisconsin, and K. J. Maly. An efficient March 1990. ?? pp. file structure for document Daemen:1993:FDO retrieval in the automated office environment. IEEE [DGV93] Joan Daemen, Rene Gov- Transactions on Knowledge aerts, and Joos Vandewalle. REFERENCES 183

A framework for the de- 0558/papers/2161/21610109. sign of one-way hash func- pdf. tions including cryptanalysis of damg˚ard’s one-way Du:1983:SNP function based on a cellu- [DHJS83] M. W. Du, T. M. Hsieh, K. F. lar automaton. In Imai Jea, and D. W. Shieh. The et al. [IRM93], pages 82– study of a new perfect hash 96. ISBN 0-387-57332-1 scheme. IEEE Transactions (New York), 3-540-57332- on Software Engineering,SE- 1 (Berlin). ISSN 0302- 9(3):305–313, May 1983. CO- 9743 (print), 1611-3349 (elec- DEN IESEDJ. ISSN 0098- tronic). LCCN QA76.9.A25 5589 (print), 1939-3520 (elec- I555 1991. DM96.00. tronic). Donaldson:1984:CMV Debnath:2015:RHT [DH84] Val Donaldson and Lois W. [DHK+15] Biplob Debnath, Alireza Hawkes. Cyclic multiple- Haghdoost, Asim Kadav, valued filing schemes for Mohammed G. Khatib, and higher-order queries. Infor- Cristian Ungureanu. Revis- mation sciences, 32(1):47– iting hash table design for 74, February 1984. CO- phase change memory. Op- DEN ISIJBC. ISSN 0020- erating Systems Review,49 0255 (print), 1872-6291 (elec- (2):18–26, December 2015. tronic). Combinatorial fil- CODEN OSRED8. ISSN ing schemes are a class of file 0163-5980 (print), 1943-586X organizations for formatted (electronic). records which are based on multiattribute hashing. Dietzfelbinger:1997:RRA [DHKP97] Martin Dietzfelbinger, Tor- Dietzfelbinger:2001:SMP ben Hagerup, Jyrki Kata- [DH01] Martin Dietzfelbinger and jainen, and Martti Pent- Torben Hagerup. Simple tonen. A reliable ran- minimal perfect hashing in domized algorithm for the less space. Lecture Notes closest-pair problem. Jour- in CS, 2161:109–??, 2001. nal of Algorithms, 25(1):19– CODEN LNCSD9. ISSN 51, ???? 1997. CO- 0302-9743 (print), 1611- DEN JOALDV. ISSN 0196- 3349 (electronic). URL 6774 (print), 1090-2678 (elec- http://link.springer-ny. tronic). com/link/service/series/ Dolev:1994:NPH 0558/bibs/2161/21610109. htm; http://link.springer-[DHL+94] Danny Dolev, Yuval Harari, ny.com/link/service/series/ Nathan Linial, Noam Nisan, REFERENCES 184

and Michal Parnas. Neigh- Weidling. A dictionary borhood preserving hashing implementation based on and approximate queries. In dynamic perfect hashing. ACM-SIAM-SDA’94 [ACM94d], ACM Journal of Experimen- pages 73–85. ISBN 0-89871- tal Algorithmics, 12:1.11:1– 329-3. LCCN QA76.6 .A278 1.11:??, June 2008. CODEN 1994. ???? ISSN 1084-6654. Dolev:2002:NPH Dietzfelbinger:1990:HDD + [DHL 02] Danny Dolev, Yuval Harari, [Die90] Martin Dietzfelbinger. How Nathan Linial, Noam Nisan, to distribute a dictionary in and Michal Parnas. Neigh- a complete network. In Pro- borhood preserving hash- ceedings of the 22nd Annual ing and approximate queries. ACM Symposium on Theory SIAM Journal on Dis- of Computing (May 14–16 crete Mathematics, 15(1):73– 1990: Baltimore, MD, USA), 85, 2002. CODEN SJD- pages 117–127. ACM Press, MEC. ISSN 0895-4801 New York, NY 10036, USA, (print), 1095-7146 (elec- 1990. ISBN 0-89791-361-2. tronic). URL http:// LCCN QA 76.6 A13 1990. epubs.siam.org/sam-bin/ dbq/article/31809. Dietzfelbinger:1996:UHW Do:2019:SDC [Die96] M. Dietzfelbinger. Univer- sal hashing and k-wise in- [DHT+19] Thanh-Toan Do, Tuan Hoang, dependent random variables Dang-Khoa Le Tan, Huu Le, via integer arithmetic with- Tam V. Nguyen, and Ngai- out primes. Lecture Notes in Man Cheung. From selective CS, 1046:569–??, 1996. CO- deep convolutional features DEN LNCSD9. ISSN 0302- to compact binary represen- 9743 (print), 1611-3349 (elec- tations for image retrieval. tronic). ACM Transactions on Mul- timedia Computing, Commu- Dietzfelbinger:2007:DSM nications, and Applications, 15(2):43:1–43:??, June 2019. [Die07] Martin Dietzfelbinger. De- CODEN ???? ISSN 1551- sign strategies for min- 6857 (print), 1551-6865 (elec- imal perfect hash func- tronic). URL https://dl. tions. In Hromkoviˇcetal. acm.org/ft_gateway.cfm? [HKNW07], pages 2–17. CO- id=3314051. DEN LNCSD9. ISBN 3-540- Dietzfelbinger:2008:DIB 74870-9 (paperback). ISSN 0302-9743 (print), 1611-3349 [DHW08] Martin Dietzfelbinger, Mar- (electronic). LCCN QA9.58 tin H¨uhne, and Christoph .S24 2007. URL http: REFERENCES 185

//www.springerlink.com/ this author [Dit76]. See also content/y48k83u127014207/ comments in [Sav91, Lit91, . Pea91]. Dittmer:1976:IEP Dinur:2009:ARC [Dit76] Ingo Dittmer. Implemen- [DJNR09] Irit Dinur, Klaus Jansen, tation eines Einschrittcom- Joseph Naor, and José Rolim, pilers für die Programmier- editors. Approximation, ran- sprache PASCAL auf der domization, and combinato- Rechenanlage IBM/360 der rial optimization: algorithms Universität Münster. (En- and techniques: 12th In- glish title: Implementation ternational Workshop, AP- of a one-step compiler for PROX 2009, and 13th In- the programming language ternational Workshop, RAN- PASCAL on the IBM/360 DOM 2009, Berkeley, CA, of the University of Muen- USA, August, 21–23, 2009: ster). Master’s thesis, Uni- proceedings, volume 5687 versität Münster, Münster, of Lecture Notes in Com- Germany, 1976. ?? pp. puter Science. Springer-Ver- Diplomearbeit Münster 1976 lag, Berlin, Germany / Hei- und doert angegebene Lit- delberg, Germany / London, eratur (English: Muenster UK / etc., 2009. ISBN 3- diploma work 1976 and the 642-03684-8. ISSN 0302- literature cited therein). The 9743 (print), 1611-3349 (elec- hashing method was redis- tronic). LCCN QA75.5 .I643 covered fourteen years later 2009. URL http://www. by Pearson [Pea90], and then loc.gov/catdir/enhancements/ commented on by several au- fy1208/2009932147-d.html; thors [Dit91, Sav91, Lit91, http://www.springerlink. Pea91]. com/content/978-3-642- Dittmer:1991:NFH 03684-2/. Diaz:2006:ARC [Dit91] I. Dittmer. Note on fast hashing of variable length [DJRZ06] J. (Josep) D´ıaz, Klaus text strings. Communi- Jansen, José D. P. Rolim, cations of the Association and Uri Zwick, editors. Ap- for Computing Machinery, proximation, randomization 34(11):118, November 1991. and combinatorial optimiza- CODEN CACMA2. ISSN tion: algorithms and tech- 0001-0782 (print), 1557-7317 niques: 9th International (electronic). Points out Workshop on Approxima- that Pearson’s hashing al- tion Algorithms for Combi- gorithm [Pea90] was discov- natorial Optimization Prob- ered fourteen years earlier by lems, APPROX 2006, and REFERENCES 186

10th International Workshop (print), 1611-3349 (elec- on Randomization and Com- tronic). URL http://link. putation, RANDOM 2006, springer.com/content/pdf/ Barcelona, Spain, August 10.1007/978-3-642-04444- 28–30, 2006: proceedings, 1_30. volume 4110 of Lecture Notes in Computer Science. Damgaard:1994:BAH Springer-Verlag, Berlin, Ger- [DK94] I. B. Damg˚ard and L. R. many / Heidelberg, Ger- Knudsen. The breaking of many / London, UK / etc., the AR hash function. In 2006. CODEN LNCSD9. Helleseth [Hel94], pages 286– ISBN 3-540-38044-2 (paper- 292. ISBN 0-387-57600- back). ISSN 0302-9743 2 (New York), 3-540-57600- (print), 1611-3349 (elec- 2 (Berlin). ISSN 0302- tronic). LCCN QA75.5 .I643 9743 (print), 1611-3349 (elec- 2006. URL http://www. tronic). LCCN QA76.9.A25 loc.gov/catdir/enhancements/ E964 1993. fy0825/2006931401-d.html; http://www.loc.gov/catdir/ Delfs:2002:ICP toc/fy0703/2006931401. html; http://www.springerlink.[DK02] Hans Delfs and Helmut com/content/978-3-540- Knebl. Introduction to Cryp- 38044-3/; http://www. tography: Principles and Ap- springerlink.com/openurl. plications. Information Se- asp?genre=issue\%26issn= curity and Cryptography. 0302-9743\%26volume=4110. Springer-Verlag, Berlin, Ger- many / Heidelberg, Ger- Du:1980:SNP many / London, UK / [DJS80] Min Wen Du, Kuen Fang etc., 2002. ISBN 3-642- Jea, and Den Wey Shieh. 87126-7 (e-book), 3-642- Study of a new perfect 87128-3. ISSN 1619-7100 hash scheme. In IEEE- (print), 2197-845X (elec- COMPSAC’80 [IEE80a], pages tronic). xiv + 310 pp. LCCN 341–347. LCCN QA 75.5 QA76.9.A25. URL http: C586 1980. //www.springerlink.com/ content/978-3-642-87126- DiCrescenzo:2009:CLH 9. [DJSN09] Giovanni Di Crescenzo, De:2007:IAS Shaoquan Jiang, and Rei- haneh Safavi-Naini. Corruption-[DK07] Debapratim De and Abishek localizing hashing. Lec- Kumarasubramanian. In- ture Notes in CS, 5789: version attacks on secure 489–504, 2009. CODEN hash functions using sat LNCSD9. ISSN 0302-9743 solvers. Lecture Notes in REFERENCES 187

CS, 4501:377–382, 2007. CO- 1619-7100 (print), 2197-845X DEN LNCSD9. ISSN 0302- (electronic). xx + 508 + 9743 (print), 1611-3349 (elec- 5 pp. LCCN QA76.9.A25; tronic). URL http://link. QA76.9.D35. URL http:/ springer.com/content/pdf/ /link.springer.com/book/ 10.1007/978-3-540-72788- 10.1007/978-3-662-47974- 0_36. 2. Dahmen:2009:SHB deKergommeaux:1994:PLP

[DK09] Erik Dahmen and Christoph [dKC94] Jacques Chassin de Ker- Krauß. Short hash-based sig- gommeaux and Philippe natures for wireless sensor Codognet. Parallel logic pro- networks. Lecture Notes in gramming systems. ACM CS, 5888:463–476, 2009. CO- Computing Surveys, 26(3): DEN LNCSD9. ISSN 0302- 295–336, September 1994. 9743 (print), 1611-3349 (elec- CODEN CMSVAN. ISSN tronic). URL http://link. 0360-0300 (print), 1557- springer.com/content/pdf/ 7341 (electronic). URL 10.1007/978-3-642-10433- http://www.acm.org/pubs/ 6_31. toc/Abstracts/0360-0300/ 185453.html. Drmota:2012:PAC Dietzfelbinger:1988:DPH

[DK12] Michael Drmota and Rein- [DKM+88] M. Dietzfelbinger, A. Kar- hard Kutzelnigg. A pre- lin, K. Mehlhorn, F. Meyer cise analysis of Cuckoo hash- auf der Heide, H. Rohnert, ing. ACM Transactions and R. E. Tarjan. Dynamic on Algorithms, 8(2):11:1– perfect hashing: Upper and 11:36, April 2012. CODEN lower bounds. In IEEE- ???? ISSN 1549-6325 (print), FOCS’88 [IEE88c], pages 1549-6333 (electronic). 524–531. ISBN 0-8186-0877- Delfs:2015:ICP 3 (paperback), 0-8186-4877- 5 (microﬁche), 0-8186-8877-7 [DK15] Hans Delfs and Helmut (hardcover). LCCN QA 76 Knebl. Introduction to Cryp- S979 1988. tography : Principles and Dietzfelbinger:1991:DPH Applications. Information Security and Cryptography. [DKM+91] M. Dietzfelbinger, A. Kar- Springer-Verlag, Berlin, Ger- lin, K. Mehlhorn, F. Meyer many / Heidelberg, Ger- auf def Heide, H. Rohnert, many / London, UK / etc., and Robert E. Tarjan. Dy- third edition, 2015. ISBN namic perfect hashing: upper 3-662-47973-7 (paper), 3- and lower bounds. Technical 662-47974-5 (e-book). ISSN Report CS-TR-310-91, De- REFERENCES 188

partment of Computer Sci- M. R. Stonebraker, and ence, Princeton University, D. Wood. Implementation Princeton, NJ, USA, March techniques for main memory 1991. ?? pp. database systems. Techni- cal Report UCB/ERL 84/5, Dietzfelbinger:1994:DPH Electronics Research Labora- [DKM+94] Martin Dietzfelbinger, Anna tory, University of California, Karlin, Kurt Mehlhorn, Berkeley, CA, USA, January Friedhelm Meyer auf der 1984. 1–23 pp. Heide, Hans Rohnert, and DeWitt:1984:ITMd Robert E. Tarjan. Dynamic perfect hashing: Upper and [DKO+84d] David J. DeWitt, Randy H. lower bounds. SIAM Jour- Katz, Frank Olken, Leonard D. nal on Computing, 23(4): Shapiro, Michael R. Stone- 738–761, ???? 1994. CO- braker, and David Wood. DEN SMJCAT. ISSN 0097- Implementation techniques 5397 (print), 1095-7111 (elec- for main memory database tronic). systems. SIGMOD Record (ACM Special Interest Group DeWitt:1984:ITMc on Management of Data), [DKO84a] D. J. DeWitt, H. R. Katz, 14(2):1–8, 1984. CODEN SRECD8. ISBN 0-89791-128- and F. Olken. Implemen- tation techniques for main 8. ISSN 0163-5808 (print), 1943-5835 (electronic). memory database systems. Technical report, Univer- Dahlgaard:2015:HSP sity of Wisconsin–Madison, Madison, WI, USA, 1984. ?? [DKRT15] Søren Dahlgaard, Mathias pp. Bæk Tejs Knudsen, Eva Rotenberg, and Mikkel Tho- DeWitt:1984:ITMa rup. Hashing for statistics over k-partitions. In IEEE, [DKO+84b] D. J. DeWitt, R. Katz, editor, 2015 IEEE 56th An- F. Olken, L. Shapiro, M. Stone- nual Symposium on Foun- braker, and D. Wood. Im- dations of Computer Sci- plementation techniques for ence (FOCS), pages 1292– main memory database sys- 1310. IEEE Computer Soci- tems. In Proc. ACM SIG- ety Press, 1109 Spring Street, MOD Conf, page 1. ACM Suite 300, Silver Spring, MD Press, New York, NY 10036, 20910, USA, 2015. ISBN USA, June 1984. 1-4673-8191-8. ISSN 0272- DeWitt:1984:ITMb 5428. Dahlgaard:2016:PTC [DKO+84c] D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, [DKRT16] Søren Dahlgaard, Mathias REFERENCES 189

Bæk Tejs Knudsen, Eva Denielou:2006:APS Rotenberg, and Mikkel Tho- rup. The power of two choices [DL06] Pierre-Malo Deni´elou and with simple tabulation. In James J. Leifer. Abstrac- Robert Krauthgamer, edition preservation and sub- tor, Proceedings of the 27th typing in distributed lan- SODA (2016), pages 1631– guages. SIGPLAN No- 1642. ACM Press, New tices, 41(9):286–297, Septem- York, NY 10036, USA, 2016. ber 2006. CODEN SIN- URL http://dl.acm.org/ ODQ. ISSN 0362-1340 citation.cfm?id=2884435. (print), 1523-2867 (print), 2884546. 1558-1160 (electronic).

Dharmapurikar:2006:LPM Dong:2012:UAS [DL12] Qi Dong and Donggang Liu. [DKT06] Sarang Dharmapurikar, Praveen Using auxiliary sensors for Krishnamurthy, and David E. pairwise key establishment Taylor. Longest prefix in WSN. ACM Trans- matching using Bloom fil- actions on Embedded Com- ters. IEEE/ACM Transac- puting Systems, 11(3):59:1– tions on Networking, 14(2): 59:??, September 2012. CO- 397–409, April 2006. CO- DEN ???? ISSN 1539- DEN IEANEP. ISSN 1063- 9087 (print), 1558-3465 (elec- 6692 (print), 1558-2566 (electronic). tronic). Dinur:2017:IGA Devillers:1979:HTG [DL17] Itai Dinur and Gaëtan Leurent. Improved generic [DL79] R. Devillers and G. Louchard. attacks against hash-based Hashing techniques, a global MACs and HAIFA. Al- approach. BIT (Copen- gorithmica, 79(4):1161–1195, hagen), 19(3):302–311, ???? December 2017. CODEN 1979. CODEN NBITAB. ALGOEJ. ISSN 0178- Du:1980:SGC 4617 (print), 1432-0541 (electronic).

[DL80] H. C. Du and R. C. T. DeRemer:1979:SCS Lee. Symbolic Gray code as a multikey hashing function. [DLH+79] Frank DeRemer, Philip Levy, IEEE Transactions on Pat- Steve Hanson, Philip Jack- tern Analysis and Machine son, Richard Jullig, and Intelligence, PAMI-2(1):83– Tom Pittman. Summary 90, January 1980. CODEN of the characteristics of sev- ITPIDJ. ISSN 0162-8828. eral ‘modern’ programming REFERENCES 190

languages. SIGPLAN No- 0163-5700 (print), 1943-5827 tices, 14(5):28–45, May 1979. (electronic). CODEN SINODQ. ISSN 0362-1340 (print), 1523- Duan:2018:EGS 2867 (print), 1558-1160 (elec- [DLN+18] Weiwei Duan, Jianxin Luo, tronic). Guiqiang Ni, Bin Tang, Qi Hu, and Yi Gao. Exclu- Dolev:2009:BAU sive grouped spatial hashing. [DLH09] Shlomi Dolev, Limor Lahi- Computers and Graphics,70 ani, and Yinnon Haviv. Brief (??):71–79, February 2018. announcement: Unique per- CODEN COGRD2. ISSN mutation hashing. Lec- 0097-8493 (print), 1873-7684 ture Notes in CS, 5873: (electronic). URL http: 777–778, 2009. CODEN //www.sciencedirect.com/ LNCSD9. ISSN 0302-9743 science/article/pii/S0097849317301474. (print), 1611-3349 (elec- Damiani:1998:EDH tronic). URL http://link. springer.com/content/pdf/ [DLT98] Ernesto Damiani, Valentino 10.1007/978-3-642-05118- Liberali, and Andrea G. B. 0_56. Tettamanzi. Evolutionary design of hashing function Dolev:2013:UPH circuits using an FPGA. Lec- ture Notes in CS, 1478:36– [DLH13] Shlomi Dolev, Limor Lahi- ??, 1998. CODEN LNCSD9. ani, and Yinnon Haviv. ISSN 0302-9743 (print), Unique permutation hashing. 1611-3349 (electronic). URL Theoret. Comput. Sci., 475 http://link.springer-ny. (??):59–65, March 4, 2013. com/link/service/series/ CODEN TCSCDI. ISSN 0558/bibs/1478/14780036. 0304-3975 (print), 1879-2294 htm; http://link.springer- (electronic). URL http: ny.com/link/service/series/ //www.sciencedirect.com/ 0558/papers/1478/14780036. science/article/pii/S0304397513000133. pdf. Durand:2007:SPP Davie:1981:RDC

[DLM07] Arnaud Durand, Clemens [DM81] A. J. T. Davie and R. Mor- Lautemann, and Malika rison. Recursive Descent More. A simple proof of the Compiling. Ellis Horwood polylog counting ability of Series in Computers and ﬁrst-order logic: guest col- their Applications, Editor: umn. ACM SIGACT News, Brian Meek. Ellis Horwood, 38(4):40–45, December 2007. New York, NY, USA, 1981. CODEN SIGNDM. ISSN ISBN 0-470-27270-8 (Hal- REFERENCES 191

stead Press), 0-85312-386- storage data auditing. The- 1 (Ellis Horwood). 195 oret. Comput. Sci., 800(??): pp. LCCN QA76.6 .D373. 42–51, December 31, 2019. US$34.95. Discusses han- CODEN TCSCDI. ISSN dling of clustering in hash ta- 0304-3975 (print), 1879-2294 bles. (electronic). URL http: Diby:1990:DDK //www.sciencedirect.com/ science/article/pii/S0304397519306449. [DM90] K. Diby and P. Mateti. Design documentation of Ducournau:2009:EAO Knuth’s solution to the com- [DMP09] Roland Ducournau, Flor´eal mon words problem. Tech- Morandat, and Jean Pri- nical Report WSU-CS-90-08, vat. Empirical assessment Washington State University, of object-oriented implemen- 1990. ?? pp. tations with multiple inheri- Devroye:2003:CHF tance and static typing. SIG- PLAN Notices, 44(10):41– [DM03] Luc Devroye and Pat Morin. 60, October 2009. CODEN Cuckoo hashing: Further SINODQ. ISSN 0362-1340 analysis. Information Pro- (print), 1523-2867 (print), cessing Letters, 86(4):215– 1558-1160 (electronic). 219, May 31, 2003. CO- DEN IFPLAT. ISSN 0020- Demaine:2006:DDP 0190 (print), 1872-6119 (elec- [DMPP06] E. D. Demaine, F. Meyer tronic). auf der Heide, R. Pagh, and Ducournau:2011:PCH M. P˘atra¸scu. De dictionariis dynamicis pauco spa- [DM11] Roland Ducournau and tio utentibus. (latin) [On Flor´eal Morandat. Perfect dynamic dictionaries using class hashing and number- little space]. In Correa ing for object-oriented im- et al. [CHK06], pages 349– plementation. Software— 361. CODEN LNCSD9. Practice and Experience, ISBN 3-540-32755-X (soft- 41(6):661–694, May 2011. cover). ISSN 0302-9743 CODEN SPEXBL. ISSN (print), 1611-3349 (elec- 0038-0644 (print), 1097-024X tronic). LCCN ???? URL (electronic). http://www.springerlink. com/content/978-3-540- Doukas:2019:HFD 32756-1. [DMB19] Nikolaos Doukas, Olek- Dietzfelbinger:2011:CHP sandr P. Markovskyi, and Nikolaos G. Bardis. Hash [DMR11] Martin Dietzfelbinger, Michael function design for cloud Mitzenmacher, and Michael REFERENCES 192

Rink. Cuckoo hashing with Dodds:1982:PRD pages. Lecture Notes in CS, 6942:615–627, 2011. CO- [Dod82] D. J. Dodds. Pracniques: DEN LNCSD9. ISSN 0302- Reducing dictionary size 9743 (print), 1611-3349 (elec- by using a hashing tech- tronic). URL http://link. nique. Communications of springer.com/content/pdf/ the Association for Com- 10.1007/978-3-642-23719- puting Machinery, 25(6): 5_52. 368–370, June 1982. CO- DEN CACMA2. ISSN 0001- Devroye:2004:WCR 0782 (print), 1557-7317 (elec- [DMV04] Luc Devroye, Pat Morin, and tronic). Alfredo Viola. On worst-case Robin Hood hashing. SIAM Donovan:1991:PSM Journal on Computing,33 (4):923–936, August 2004. [Don91] Kevin Donovan. Perfor- CODEN SMJCAT. ISSN mance of shared memory in 0097-5397 (print), 1095-7111 a parallel computer. IEEE (electronic). URL http:/ Transactions on Parallel and /epubs.siam.org/sam-bin/ Distributed Systems, 2(2): dbq/article/40337. 253–256, April 1991. CO- DEN ITDSEO. ISSN 1045- DeWitt:1992:PSH 9219 (print), 1558-2183 (electronic). [DNSS92] David J. DeWitt, Jef- frey F. Naughton, Dono- Dodis:2005:GIF van A. Schneider, and S. Se- shadri. Practical skew han- [DOP05] Yevgeniy Dodis, Roberto dling in parallel joins. Tech- Oliveira, and Krzysztof nical Report TR 1098, Com- Pietrzak. On the generic in- puter Sciences Department, security of the full domain University of Wisconsin– hash. In Shoup [Sho05], Madison, July 1992. ?? pp. pages 449–?? ISBN 3- Deen:1981:DCD 540-28114-2. ISSN 0302- 9743 (print), 1611-3349 (elec- [DNV81] S. M. Deen, D. Nikodem, tronic). LCCN QA76.9.A25 and A. Vashishta. Design C79 2005; QA76.9 .A25; of a canonical database sys- QA76.9 C79 2005; QA76.9 tem (PRECI). The Com- C794 2005; QA76.9; In- puter Journal, 24(3):200– ternet. URL http:/ 209, August 1981. CO- /www.springerlink.com/ DEN CMPJA6. ISSN 0010- openurl.asp?genre=issue& 4620 (print), 1460-2067 (elec- issn=0302-9743&volume= tronic). 3621. REFERENCES 193

Diegues:2014:OHH ship (extended abstract). In Aceto et al. [ADG+08], [DOP+14] Nuno Diegues, Muhammet pages 385–396. ISBN Orazov, Jo˜ao Paiva, Lu´ıs 3-540-70574-0 (softcover). Rodrigues, and Paolo Ro- LCCN ???? URL http: mano. Optimizing hyper- //www.springerlink.com/ space hashing via analyti- content/r124235788213548/ cal modelling and adapta- . tion. ACM SIGAPP Ap- Das:2008:DHS plied Computing Review,14 (2):23–35, June 2014. CO- [DPH08] Saumitra M. Das, Himabindu DEN ???? ISSN 1559- Pucha, and Y. Charlie Hu. 6915 (print), 1931-0161 (elec- Distributed hashing for scal- tronic). URL https://dl. able multicast in wireless acm.org/doi/abs/10.1145/ ad hoc networks. IEEE 2656864.2656866. Transactions on Parallel and Doster:1978:AHG Distributed Systems, 19(3): 347–362, March 2008. CO- [Dos78a] Wolfgang Doster. Auswahl DEN ITDSEO. ISSN 1045- eines Hashverfahrens bei 9219 (print), 1558-2183 (elec- grosser Anzahl von speziellen tronic). Schluesselwoertern (Postort- snamen). [Selection of a Delis:1992:PSC hash-coding method for a large number of special key [DR92] A. Delis and N. Roussopou- words (postal place names)]. los. Performance and scal- Wissenschaftliche Berichte ability of client-server archi- AEG-Telefunken, 51(2-3): tectures. In Proceedings of 104–114, ???? 1978. CODEN the 18th Conference on Very WBATB3. ISSN 0043-6801. Large Databases, Vancouver, page ?? Morgan Kaufmann Doszkocs:1978:AAI Publishers, San Francisco, [Dos78b] Tamas E. Doszkocs. AID, CA, August 1992. an associative interactive dic- DeCanniere:2006:FSC tionary for online searching. Online Review, 2(2): [DR06] Christophe De Canni`ere and 163–165, June 1978. CODEN Christian Rechberger. Find- OLREDR. ing SHA-1 characteristics: Dietzfelbinger:2008:SDS General results and applications. Lecture Notes in [DP08] Martin Dietzfelbinger and CS, 4284:1–20, 2006. CO- Rasmus Pagh. Succinct DEN LNCSD9. ISSN 0302- data structures for retrieval 9743 (print), 1611-3349 (elec- and approximate member- tronic). URL http://link. REFERENCES 194

springer.com/content/pdf/ 10.1007/978-1-4842-2604- 10.1007/11935230_1.pdf; 9. http://link.springer. com/content/pdf/bfm:978- Drescher:2017:HD 3-540-49476-8/1.pdf. [Dre17b] Daniel Drescher. Hashing Dietzfelbinger:2009:AST data. In Blockchain Ba- [DR09] Martin Dietzfelbinger and sics [Dre17a], pages 71– Michael Rink. Applications 79. ISBN 1-4842-2603-8 of a splitting trick. In Al- (print), 1-4842-2604-6 (e- bers et al. [AMSM+09], pages book). LCCN HG1710 .D74 354–365. CODEN LNCSD9. 2017. URL http://link. ISBN 3-642-02926-4. ISSN springer.com/chapter/10. 0302-9743 (print), 1611-3349 1007/978-1-4842-2604-9_ (electronic). LCCN QA267 10. .I55 2009. URL http: //www.springerlink.com/ Drescher:2017:HRW content/27w12p275w8njju3/ . [Dre17c] Daniel Drescher. Hashing in Doyoddorj:2011:NSI the real world. In Blockchain Basics [Dre17a], pages 81– [DR11] Munkhbaatar Doyoddorj and 92. ISBN 1-4842-2603-8 Kyung-Hyune Rhee. A (print), 1-4842-2604-6 (e- novel secure image hashing book). LCCN HG1710 .D74 based on reversible water- 2017. URL http://link. marking for forensic analy- springer.com/chapter/10. sis. Lecture Notes in CS, 1007/978-1-4842-2604-9_ 6908:286–294, 2011. CO- 11. DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Dodis:2012:HHA tronic). URL http://link. springer.com/content/pdf/ [DRS12] Yevgeniy Dodis, Thomas 10.1007/978-3-642-23300- Ristenpart, and John Stein- 5_22. berger. To hash or not to hash again? (in)diﬀerentiability Drescher:2017:BB results for H2 and HMAC. [Dre17a] Daniel Drescher. Blockchain Lecture Notes in CS, 7417: Basics. Apress, Berkeley, 348–366, 2012. CODEN CA, USA, 2017. ISBN 1- LNCSD9. ISSN 0302-9743 4842-2603-8 (print), 1-4842- (print), 1611-3349 (elec- 2604-6 (e-book). xv + tronic). URL http://link. 255 pp. LCCN HG1710 springer.com/content/pdf/ .D74 2017. URL http:/ 10.1007/978-3-642-32009- /link.springer.com/book/ 5_21. REFERENCES 195

Dertmann:1984:SBI 229–241, May/June 2009. CODEN CPSEDU. ISSN [DS84a] M. Dertmann and G. Saake. 0167-4048 (print), 1872-6208 Simulation von Bounded In- (electronic). URL https: dex Exponential Hashing //www.sciencedirect.com/ im Vergleich mit Anderen science/article/pii/S0167404808001193. Dynamischen Speicherver- fahren. Studienarbeit, 1984. Dietzfelbinger:2009:RUC

Devine:1984:DFO [DS09b] M. Dietzfelbinger and U. Schell- bach. On risks of using [DS84b] K. Devine and F. J. Smith. cuckoo hashing with simple Direct ﬁle organization for universal hash classes. In lemmatized text retrieval. Mathieu [Mat09], pages 795– Inf. Tech. Res. Dev. Appl., 804. ISBN 0-89871-680-2. 3(1):25–32, January 1984. LCCN QA76.6 A849 2009. CODEN ITRDDE. ISSN URL http://dl.acm.org/ 0144-817X. citation.cfm?id=1496857. Dixon:1997:HPS Dietzfelbinger:2009:WCH [DS97] Brandon Dixon and John Swallow. High-performance [DS09c] Martin Dietzfelbinger and sorting algorithms for the Ulf Schellbach. Weak- CRAY T3D parallel com- nesses of cuckoo hashing puter. The Journal of with a simple universal hash Supercomputing, 10(4):371– class: The case of large uni- 395, December 1997. CO- verses. Lecture Notes in CS, DEN JOSUED. ISSN 5404:217–228, 2009. CO- 0920-8542 (print), 1573- DEN LNCSD9. ISSN 0302- 0484 (electronic). URL 9743 (print), 1611-3349 (elec- http://www.springerlink. tronic). URL http://link. com/openurl.asp?genre= springer.com/content/pdf/ article&issn=0920-8542& 10.1007/978-3-540-95891- volume=10&issue=4&spage= 8_22. 371; http://www.wkap. Du:1995:RMQ nl/oasis.htm/134570. Deepthi:2009:DIA [DSD95] Weimin Du, Ming-Chien Shan, and Umeshwar Dayal. [DS09a] P. P. Deepthi and P. S. Reducing multidatabase query Sathidevi. Design, imple- response time by tree bal- mentation and analysis of ancing. SIGMOD Record hardware eﬃcient stream ci- (ACM Special Interest Group phers using LFSR based on Management of Data),24 hash functions. Comput- (2):293–303, May 1995. CO- ers and Security, 28(3–4): DEN SRECD8. ISSN 0163- REFERENCES 196

5808 (print), 1943-5835 (elec- Dhayal:2017:MMP tronic). [DSS17] Anant Dhayal, Jayalal Sarma, Dachman-Soled:2020:TRA and Saurabh Sawlani. Min/ max-poly weighting schemes [DSGKS20] Dana Dachman-Soled, Hui- and the NL versus UL prob- jing Gong, Mukul Kulkarni, lem. ACM Transactions on and Aria Shahverdi. To- Computation Theory, 9(2): wards a ring analogue of the 10:1–10:??, May 2017. CO- leftover hash lemma. Jour- DEN ???? ISSN 1942- nal of Mathematical Cryp- 3454 (print), 1942-3462 (elec- tology, 15(1):87–110, Novem- tronic). ber 17, 2020. CODEN Dontas:1990:FTHa ???? ISSN 1862-2976 (print), 1862-2984 (elec- [DSSW90a] K. Dontas, J. Sarma, P. Srini- tronic). URL https://www. vasan, and H. Wechsler. degruyter.com/document/ Fault tolerant hashing and doi/10.1515/jmc-2020-0076/ information retrieval using html. back propagation. In Pro- ceedings of HICCS-90, pages Dayal:1984:VLD 345–352. ????, ????, 1990.

[DSS84] Umeshwar Dayal, G. Schlageter, Dontas:1990:FTHb and Lim Huat Seng, editors. Very Large Data Bases: [DSSW90b] Kejitan Dontas, Jayshree Proceedings: Tenth Interna- Sarma, Padmini Srinivasan, tional Conference on Very and Harry Wechsler. Fault- Large Data Bases, Singapore, tolerant hashing and infor- August 27–31, 1984.Very mation retrieval using back Large Data Bases Endow- propagation. Proceedings ment, Saratoga, CA, USA, of the Hawaii International 1984. Conference on System Sci- ence, 4:345–352, 1990. CO- Dalessandro:2010:NSS DEN PHISD7. ISBN 0- 8186-2011-0. ISSN 0073- [DSS10] Luke Dalessandro, Michael F. 1129. IEEE catalog number Spear, and Michael L. Scott. 90TH0294-9. NOrec: streamlining STM by Dehne:2007:ADS abolishing ownership records. SIGPLAN Notices, 45(5):67– [DSZ07a] Frank Dehne, J¨org-R¨udiger 78, May 2010. CODEN Sack, and Norbert Zeh, SINODQ. ISSN 0362-1340 editors. Algorithms and (print), 1523-2867 (print), Data Structures. 10th Inter- 1558-1160 (electronic). national Workshop, WADS REFERENCES 197

2007, Halifax, Canada, Au- ings of Association for Com- gust 15–17, 2007. Proceed- puting Machinery Special In- ings, volume 4619. Spring- terest Group on Management er-Verlag, Berlin, Germany / of Data 1987 annual con- Heidelberg, Germany / Lon- ference, San Francisco, May don, UK / etc., 2007. CO- 27–29, 1987. ACM Press, DEN LNCSD9. ISBN 3- New York, NY 10036, USA, 540-73948-3. ISSN 0302- 1987. ISBN 0-89791-236-5. 9743 (print), 1611-3349 (elec- LCCN QA 76.9 D3 P76 1987. tronic). LCCN ???? URL ACM order number 472870. http://www.springerlink. Du:1991:MEH com/content/978-3-540- 73948-7. [DT91a] D. H. C. Du and S.-R. Tong. Dehne:2007:PAI Multilevel extendible hashing: a file structure for very [DSZ07b] Frank Dehne, Jörg-Rüdiger large databases. IEEE Trans- Sack, and Norbert Zeh, actions on Knowledge and editors. Algorithms and Data Engineering, 3(3):357– Data Structures. 10th Inter- 370, September 1, 1991. CO- national Workshop, WADS DEN ITKEEH. ISSN 1041- 2007, Halifax, Canada, Au- 4347. gust 15–17, 2007. Proceed- Du:1991:PDD ings, volume 4619. Spring- er-Verlag, Berlin, Germany / [DT91b] D.H.C.DuandS.-R. Heidelberg, Germany / Lon- Tong. Physical database don, UK / etc., 2007. CO- design multilevel extendible DEN LNCSD9. ISBN 3- hashing: a file structure for 540-73948-3. ISSN 0302- very large databases. IEEE 9743 (print), 1611-3349 (elec- Transactions on Knowledge tronic). LCCN ???? and Data Engineering,3 Dubost:1975:SIN (3):357–??, September 1991. CODEN ITKEEH. ISSN [DT75] P. Dubost and J.-M. Trousse. 1041-4347. Software implementation of a Dahlgaard:2014:AMI new method of combinatorial hashing. Technical Report [DT14] Søren Dahlgaard and Mikkel STAN-CS-75-511, Stanford Thorup. Approximately University Computer Sci- minwise independence with ence Department, September twisted tabulation. In 1975. ?? pp. R. Ravi and Inge Li Gørtz, editors, Algorithm The- Dayal:1987:PAC ory — SWAT 2014: 14th [DT87] Umeshwar Dayal and Irv Scandinavian Symposium Traiger, editors. Proceed- and Workshops, Copen- REFERENCES 198

hagen, Denmark, July 2– Ducournau:2008:PHA 4, 2014. Proceedings, pages 134–145. Springer-Verlag, [Duc08] Roland Ducournau. Perfect Berlin, Germany / Heidel- hashing as an almost perfect berg, Germany / London, subtype test. ACM Transac- UK / etc., 2014. URL tions on Programming Lan- https://link.springer. guages and Systems, 30(6): com/content/pdf/10.1007/ 33:1–33:56, October 2008. 978-3-319-08404-6_12.pdf. CODEN ATPSDT. ISSN 0164-0925 (print), 1558-4593 Daloze:2018:PDL (electronic).

+ [DTM 18] Benoit Daloze, Arie Tal, Dumey:1956:IRR Stefan Marr, Hanspeter M¨ossenb¨ock, and Erez Pe- [Dum56] Arnold I. Dumey. Index- trank. Parallelization of dy- ing for rapid random access namic languages: synchro- memory systems. Comput- nizing built-in collections. ers and Automation, 5(12): Proceedings of the ACM 6–9, December 1956. CO- on Programming Languages DEN CPAUAJ. ISSN 0010- (PACMPL), 2(OOPSLA): 4795, 0887-4549. First paper 108:1–108:30, October 2018. in open literature on hash- URL https://dl.acm.org/ ing. First use of hashing by doi/abs/10.1145/3276478. taking the modulus of division by a prime number. Deutscher:1975:CSD Mentions chaining for colli- [DTS75] R. F. Deutscher, R. P. sion handling, but not open Tremblay, and P. G. Soren- addressing. See [Ers58b] for son. A comparative study the latter. of distribution-dependent Duncan:1989:PPU and distribution-independent hashing functions. In [Dun89a] Ray Duncan. Power pro- ACM-DUOM’75 [ACM75b], gramming — understanding page ?? Also published hashing techniques. PC Mag- in/as: Dept. Computational azine, 8(8):297–??, April 25, Science, Report 75.4, Mar. 1989. CODEN PCMGEP. 1975. ISSN 0888-8507. Du:1986:DAM Duncan:1989:UHT

[Du86] H. C. Du. Disk allocation [Dun89b] Ray Duncan. Understand- mehods for binary Cartesian ing hashing techniques. PC product ﬁles. BIT (Copen- Magazine, 8(8):297–??, April hagen), 26(2):138–147, 1986. 17, 1989. CODEN PCMGEP. CODEN NBITAB. ISSN 0888-8507. REFERENCES 199

Daemen:2007:PCP uary 1983. CODEN IPETD3. ISSN 0143-7062. [DV07] J. Daemen and G. Van Dietzfelbinger:2003:ARG Assche. Producing collisions for PANAMA, instanta- [DW03] Martin Dietzfelbinger and neously. In Biryukov [Bir07], Philipp Woelfel. Almost pages 1–18. ISBN 3-540- random graphs with simple 74617-X (softcover). LCCN hash functions. In ACM QA76.9.A25 F77 2007. URL [ACM03a], pages 629–638. http://www.springerlink. ISBN ???? LCCN QA75.5 com/openurl.asp?genre= .A22 2003. ACM order num- book\%26isbn=978-3-540- ber 508030. 74617-1. Dietzfelbinger:2005:BAD Deligiannis:2014:PRW [DW05] Martin Dietzfelbinger and Christoph Weidling. Bal- [DVS+14] Nikos Deligiannis, Frederik anced allocation and dictio- Verbist, J¨urgen Slowack, naries with tightly packed Rik van de Walle, Pe- constant size bins. In ter Schelkens, and Adrian Caires et al. [CIM+05], Munteanu. Progressively pages 166–178. ISBN 3- reﬁned Wyner–Ziv video 540-27580-0. LCCN ???? coding for visual sensors. EUR 130.54. URL http: ACM Transactions on Sen- //www.springerlink.com/ sor Networks, 10(2):21:1– content/39gwr5b5hp6dl5hw/ 21:??, January 2014. CO- ; http://www.tuilmenau. DEN ???? ISSN 1550- de/fakia/mdpapers.html. 4859 (print), 1550-4867 (electronic). Dietzfelbinger:2007:BAD

DaSilva:1983:PAS [DW07] Martin Dietzfelbinger and Christoph Weidling. Bal- [DW83a] J. Da Silva and I. Watson. anced allocation and dictio- Pseudo-associative store with naries with tightly packed hardware hashing. IEEE constant size bins. Theo- Proceedings, Pt. E(1):19–24, ret. Comput. Sci., 380(1–2): 1983. 47–68, June 21, 2007. CO- daSilva:1983:PSH DEN TCSCDI. ISSN 0304- 3975 (print), 1879-2294 (elec- [dW83b] J. G. D. da Silva and I. Wat- tronic). son. Pseudo-associative store DeSantis:1990:DPS with hardware hashing. IEE Proceedings, Part E: Com- [DY90] A. De Santis and M. Yung. puters and Digital Tech- On the design of provably- niques, 130(1):19–24, Jan- secure cryptographic hash REFERENCES 200

functions. In Damg˚ard (electronic). URL http: [Dam90a], pages 377–397. //www.sciencedirect.com/ ISBN 0-387-53587-X (New science/article/pii/S0020019015002239. York), 3-540-53587-X (Berlin). LCCN QA76.9.A25 E964 Elleithy:1991:VIS 1990. DM69.00. [EBD91] K. M. Elleithy, M. A. Bay- DeSantis:1991:DPS oumi, and L. M. Delcambre. VLSI implementation of a [DY91] A. De Santis and M. Yung. systolic database machine for On the design of provably- relational algebra and hash- secure cryptographic hash ing. Integration, the VLSI functions. In Damg˚ard journal, 11(2):169–??, April [Dam91], pages 377–397. CO- 1, 1991. CODEN IVJODL. DEN LNCSD9. ISBN 0-387- ISSN 0167-9260. 53587-X (New York), 3-540- 53587-X (Berlin). ISSN 0302- Ecker:1974:BRG 9743 (print), 1611-3349 (elec- [Eck74a] A. Ecker. Eine Bemerkung tronic). LCCN QA76.9.A25 zum Restklassenhash. (Ger- E964 1990. DM69.00. man) [Remark on the di- Ding:2008:MPH vision hash code]. Ange- [DY08] Jintai Ding and Bo-Yin wandte Informatik/Applied Yang. Multivariates poly- Informatics, 16(6):253–256, nomials for hashing. Lec- June 1974. CODEN AW- ture Notes in CS, 4990: IFA7. 358–371, 2008. CODEN Ecker:1974:PSQ LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [Eck74b] A. Ecker. Period of search tronic). URL http://link. for the quadratic and related springer.com/content/pdf/ hash methods. The Com- 10.1007/978-3-540-79499- puter Journal, 17(4):340– 8_28. 343, November 1974. CO- DEN CMPJA6. ISSN 0010- Ehdaie:2016:HCR 4620 (print), 1460-2067 (elec- [EAA+16] Mohammad Ehdaie, Nikos tronic). Alexiou, Mahmoud Ahma- Enbody:1988:DHS dian, Mohammad Reza Aref, and Panos Papadimitratos. [ED88] R. J. Enbody and H. C. Du. 2D hash chain robust random Dynamic hashing schemes. key distribution scheme. In- ACM Computing Surveys,20 formation Processing Letters, (2):85–113, June 1988. CO- 116(5):367–372, May 2016. DEN CMSVAN. ISSN 0360- CODEN IFPLAT. ISSN 0300 (print), 1557-7341 (elec- 0020-0190 (print), 1872-6119 tronic). REFERENCES 201

Ege:1986:DIG nology (TIST), 11(6):71:1– 71:18, November 2020. CO- [EE86] A. Ege and C. A. Ellis. De- DEN ???? ISSN 2157- sign and implementation of 6904 (print), 2157-6912 (elec- GORDION, an object base tronic). URL https:// management system. Techni- dl.acm.org/doi/10.1145/ cal Report STP-172-86, Soft- 3408889. ware Technology Program, MCC, Austin, TX, USA, Essex:2012:HTE May 1986. 1–22 pp. [EH12] Aleksander Essex and Urs Epstein:2012:AEA Hengartner. Hover: Trust- worthy elections with hash- [EF12] Leah Epstein and Paolo Fer- only verification. IEEE Se- ragina, editors. Algorithms curity & Privacy, 10(5):18– – ESA 2012: 20th An- 24, September/October 2012. nual European Symposium, ISSN 1540-7993 (print), Ljubljana, Slovenia, Septem- 1558-4046 (electronic). ber 10–12, 2012. Proceed- ings, volume 7501 of Lec- Elghamrawy:2017:PFC ture Notes in Computer Sci- [EH17] Sally M. Elghamrawy and ence. Springer-Verlag, Berlin, Aboul Ella Hassanien. A Germany / Heidelberg, Ger- partitioning framework for many / London, UK / etc., Cassandra NoSQL database 2012. CODEN LNCSD9. using Rendezvous hashing. ISBN 3-642-33089-4 (soft The Journal of Supercomput- cover). ISSN 0302-9743 ing, 73(10):4444–4465, Oc- (print), 1611-3349 (elec- tober 2017. CODEN JO- tronic). LCCN ???? URL SUED. ISSN 0920-8542 http://www.springerlink. (print), 1573-0484 (elec- com/content/978-3-642- tronic). 33089-6/. Eiras-Franco:2020:FDN Ehrig:1980:AIA [EFMRK+20] Carlos Eiras-Franco, David [EjKMP80] Hartmut Ehrig, H. j. Kre- Mart´ınez-Rego, Leslie Kan- owski, B. Mahr, and P. Padawitz. than, César Piñeiro, An- Algebraic implementation of tonio Bahamonde, Bertha abstract data types. Techni- Guijarro-Berdiñas, and Am- cal report, ????, Berlin, Ger- paro Alonso-Betanzos. Fast many, 1980. ?? pp. distributed k NN graph con- Engelmann:1993:SBC struction using auto-tuned locality-sensitive hashing. [EK93] Curd Engelmann and Jörg ACM Transactions on In- Keller. Simulation-based telligent Systems and Tech- comparison of hash functions REFERENCES 202

foremulatedsharedmem- Ellis:1985:CLH ory. In Bode et al. [BRW93], pages 1–11. ISBN 0-387- [Ell85a] C. Ellis. Concurrency and 56891-3 (New York), 3-540- linear hashing. In ACM- 56891-3 (Berlin). LCCN PODS’85 [ACM85b], page 1. QA76.58 .I564 1993. ISBN 0-89791-153-9. LCCN QA 76.9 D3 A296 1985. Elder:1984:CDP Ellis:1985:DDS [Eld84] John Elder. Construction of Data Processing Soft- [Ell85b] Carla Schlatter Ellis. Dis- ware. Prentice-Hall, En- tributed data structures: a glewood Cliﬀs, NJ 07632, case study. IEEE Trans- USA, 1984. ISBN 0-13- actions on Computers,C- 168675-5. xiv + 432 pp. 34(12):1178–1185, Decem- LCCN QA76.6 .E434 1984. ber 1985. CODEN IT- US$22.95. Presents code in COB4. ISSN 0018-9340 Pascal Plus and COBOL for (print), 1557-9956 (elec- a wide variety of algorithms, tronic). including hashing. Ellis:1987:CLH

Ellzey:1982:DSC [Ell87] Carla Schlatter Ellis. Con- [Ell82] Roy S. Ellzey. Data Struc- currency in linear hash- tures for Computer Infor- ing. ACM Transactions mation Systems. Science on Database Systems, 12(2): Research Associates, Inc., 195–217, June 1987. CO- Chicago, IL, USA, 1982. DEN ATDSD3. ISSN 0362- ISBN 0-574-21400-3. xii + 5915 (print), 1557-4644 (elec- 270 pp. LCCN QA 76.9 D35 tronic). Also published in E44 1982. US$22.95. Under- [ACM85b]. graduate textbook treatment Ellis:1988:CEH of hashing. [Ell88] Carla Schlatter Ellis. Con- Ellis:1983:EHC currency in extendible hash- [Ell83] Carla Schlatter Ellis. Ex- ing. Information system, tendible hashing for con- 13(1):97–109, January 1988. current operations and dis- CODEN INSYD6. ISSN tributed data. In ACM- 0306-4379 (print), 1873-6076 PODS’83 [ACM83b], pages (electronic). 106–116. ISBN 0-89791-097- Erlingsson:2007:CPA 4. LCCN QA76.9.D3 A15 1983. US$25.00. ACM (order [EMM07] Ulfar Erlingsson, Mark Man- n 475830). Baltimore, MD, asse, and Frank McSh- USA. erry. A cool and prac- REFERENCES 203

tical alternative to tradi- DEN CMPJA6. ISSN 0010- tional hash tables. Report, 4620 (print), 1460-2067 (elec- Microsoft Research, Moun- tronic). URL http:// tain View, CA, USA, March www3.oup.co.uk/computer_ 27, 2007. URL http:// journal/hdb/Volume_29/ www.ru.is/faculty/ulfar/ Issue_05/tiff/430.tif; CuckooHash.pdf. http://www3.oup.co.uk/ computer_journal/hdb/Volume_ Englert:1994:NSS 29/Issue_05/tiff/431.tif; [Eng94] Susanne Englert. NonStop http://www3.oup.co.uk/ SQL: Scalability and avail- computer_journal/hdb/Volume_ ability for decision support. 29/Issue_05/tiff/432.tif; SIGMOD Record (ACM Spe- http://www3.oup.co.uk/ cial Interest Group on Man- computer_journal/hdb/Volume_ agement of Data), 23(2): 29/Issue_05/tiff/433.tif. 491, June 1994. CO- Ershov:1958:PAO DEN SRECD8. ISSN 0163- 5808 (print), 1943-5835 (elec- [Ers58a] Andrei P. Ershov. On tronic). programming of arithmetic operations. Communica- Etzel:1999:SHF tions of the Association for Computing Machinery, 1(8): [EPR99] M. Etzel, S. Patel, and 3–6, August 1958. CO- Z. Ramzan. Square hash: DEN CACMA2. ISSN 0001- Fast message authentication 0782 (print), 1557-7317 (elec- via optimized universal hash tronic). English translation functions. In Wiener [Wie99], of [Ers58b]. pages 234–251. ISBN 3-540- 66347-9. LCCN QA76.9.A25 Ershov:1958:PPB C79 1999 Bar. URL http://link.springer-ny. [Ers58b] Andrei P. Ershov. Pro- com/link/service/series/ gramming programs for the 0558/bibs/1666/16660234. BESM [Moscow]. Dok- htm; http://link.springer- lady Adak. Nauk SSSR, 118 ny.com/link/service/series/ (??):427–430, 1958. CO- 0558/papers/1666/16660234. DEN DANKAS. ISSN 0002- pdf. 3264. Rediscovery and first publication of linear open Er:1986:UTI addressing. See [ABRS53, [Er86] M. C. Er. The use of ter- Dum56]. English translation mination indicators in comin [Ers58a]. puter programming. The Estebanez:2014:PMC Computer Journal, 29(5): 430–433, October 1986. CO- [ESRI14] César Estébanez, Yago Saez, REFERENCES 204

Gustavo Recio, and Pe- 3349 (electronic). LCCN dro Isasi. Performance QA75.5 .S956 2003. URL of the most common non- http://link.springer-ny. cryptographic hash func- com/link/service/series/ tions. Software—Practice 0558/tocs/t2607.htm; and Experience, 44(6):681– http://www.springerlink. 698, June 2014. CODEN com/openurl.asp?genre= SPEXBL. ISSN 0038-0644 issue&issn=0302-9743&volume= (print), 1097-024X (elec- 2607. Also available via the tronic). World Wide Web. Eugenides:1990:ESM Fabry:1974:CBA

[Eug90] J. G. Eugenides. Easier [Fab74] Robert S. Fabry. Capability- strings for the Mac. Get based addressing. Commu- a handle on Mac strings nications of the Association with this C++ class. Byte for Computing Machinery,17 Magazine, 15(13):349–350, (7):403–412, July 1974. CO- 352, December 1990. CO- DEN CACMA2. ISSN 0001- DEN BYTEDJ. ISSN 0360- 0782 (print), 1557-7317 (elec- 5280 (print), 1082-7838 (electronic). tronic). Fairouz:2021:HAH Estan:2006:BAC [FAFK21] Abbas A. Fairouz, Monther [EVF06] Cristian Estan, George Abusultan, Viacheslav V. Fe- Varghese, and Michael Fisk. dorov, and Sunil P. Kha- Bitmap algorithms for count- tri. Hardware acceleration ing active ﬂows on high-speed of hash operations in mod- links. IEEE/ACM Transac- ern microprocessors. IEEE tions on Networking, 14(5): Transactions on Computers, 925–937, October 2006. CO- 70(9):1412–1426, Septem- DEN IEANEP. ISSN 1063- ber 2021. CODEN IT- 6692 (print), 1558-2566 (elec- COB4. ISSN 0018-9340 tronic). (print), 1557-9956 (electronic). Fotakis:2003:SEH Fahlman:1980:HIS [F+03] D. Fotakis et al. Space eﬃcient hash tables with [Fah80] S. E. Fahlman. The hash- worst case constant access net interconnection scheme. time. InAltandHabib Technical Report CMU-CS- [AH03], pages 271–283. CO- 80-125, Department of Com- DEN LNCSD9. ISBN 3-540- puter Science, Carnegie Mel- 00623-0 (softcover). ISSN lon University, Pittsburgh, 0302-9743 (print), 1611- PA, 1980. ?? pp. REFERENCES 205

Faloutsos:1985:MHU (electronic). URL http: //ieeexplore.ieee.org/ [Fal85a] C. Faloutsos. Multiattribute stamp/stamp.jsp?arnumber= hashing using gray codes. 6184. ACM Computing Surveys,17 Farrell:1993:CCC (1):??, March 1985. CO- DEN CMSVAN. ISSN 0360- [Far93] P. G. Farrell, editor. Codes 0300 (print), 1557-7341 (elec- and cyphers: cryptography tronic). Also published in/as: and coding IV: 4th Con- ACM SIGMOD, 1986. ference — December 1993, Faloutsos:1985:AMT Cirencester. International Academic Publishers, ????, [Fal85b] Christos Faloutsos. Access 1993. ISBN 0-905091-03-5. methods for text. ACM LCCN ???? Computing Surveys, 17(1): Farashahi:2014:HHC 49–74, March 1985. CO- DEN CMSVAN. ISSN 0360- [Far14] Reza Rezaeian Farashahi. 0300 (print), 1557-7341 (elec- Hashing into Hessian curves. tronic). Also published in/as: International Journal of Ap- “Multiattribute Hashing Us- plied Cryptography. IJACT, ing Gray Codes”, ACM SIG- 3(2):139–147, 2014. CODEN MOD, 1986. ???? ISSN 1753-0563 (print), 1753-0571 (electronic). Faloutsos:1986:MHU Fontayne:1987:MSR [Fal86] Christos Faloutsos. Multiat- tribute hashing using Gray [FB87] Yves D. Fontayne and codes. SIGMOD Record Robert J. Bowman. Multi- (ACM Special Interest Group ple Storage Radix Hash Tree: on Management of Data),15 an Improved Region Query (2):227–238, June 1986. CO- Data Structure. IEEE Com- DEN SRECD8. ISSN 0163- puter Society Press, 1109 5808 (print), 1943-5835 (elec- Spring Street, Suite 300, Sil- tronic). ver Spring, MD 20910, USA, 1987. ISBN 0-8186-0814-5. Faloutsos:1988:GCP 302–305 pp. LCCN TK 7874 [Fal88] Christos Faloutsos. Gray I3235 1987. IEEE Service codes for partial match Cent. Piscataway, NJ, USA. and range queries. IEEE Frakes:1992:IRD Transactions on Software Engineering, 14(10):1381– [FBY92] William B. Frakes and 1393, October 1988. CO- Ricardo Baeza-Yates, edi- DEN IESEDJ. ISSN 0098- tors. Information Retrieval: 5589 (print), 1939-3520 Data Structures and Algo- REFERENCES 206

rithms. Prentice-Hall, En- Heath. Order preserving min- glewood Cliffs, NJ 07632, imal perfect hash functions USA, 1992. ISBN 0- and information retrieval. In 13-463837-9. viii + 504 Vidick [Vid90], page 279. pp. LCCN QA76.9.D351543 ISBN 0-89791-408-2. LCCN 1992. US$56.00. QA76.9.D3I5588 1990, Z 699 A1 I582 1990. Faloutsos:1987:DPA Fox:1991:OPM [FC87a] Christos Faloutsos and Stavros Christodoulakis. Description [FCDH91] Edward A. Fox, Qi Fan and performance analysis of Chen, Amjad M. Daoud, and signature file methods for of- Lenwood S. Heath. Or- fice filing. ACM Transac- der preserving minimal per- tions on Office Information fect hash functions and in- Systems, 5(3):237–257, July formation retrieval. ACM 1987. CODEN ATOSDO. Transactions on Information ISSN 0734-2047. URL http: Systems, 9(3):281–308, July //www.acm.org:80. 1991. CODEN ATISET. ISSN 1046-8188. URL http: Faloutsos:1987:OSE //www.acm.org:80. Special Issue on Research and De- [FC87b] Christos Faloutsos and Stavros velopment in Information Re- Christodoulakis. Optimal trieval. signature extraction and in- Fox:1992:FAC formation loss. ACM Trans- actions on Database Systems, [FCH92] E. A. Fox, Q. F. Chen, 12(3):395–428, September andL.S.Heath. A 1987. CODEN ATDSD3. faster algorithm for con- ISSN 0362-5915 (print), structing minimal perfect 1557-4644 (electronic). URL hash functions. In Belkin http://www.acm.org/pubs/ et al. [BIP92], pages 266–273. articles/journals/tods/ ISBN 0-89791-523-2 (paper- 1987-12-3/p395-faloutsos/ back), 0-89791-524-0 (hard- p395-faloutsos.pdf; http: cover). LCCN Z699.A1 I659 //www.acm.org/pubs/citations/ 1992. journals/tods/1987-12-3/ Fox:1988:MCE p395-faloutsos/; http: //www.acm.org/pubs/toc/ [FCHD88] Edward A. Fox, Qi-Fan Abstracts/tods/214285. Chen, Lenwood Heath, and html. Sanjeev Datta. A more cost Fox:1990:OPM effective algorithm for finding perfect hash functions. Tech- [FCDH90] E. A. Fox, Q. F. Chen, nical Report TR 88-30, De- A. M. Daoud, and L. S. partment of Computer Sci- REFERENCES 207

ence, Virginia Polytechnic Feller:1950:IPT Institute and State Univer- sity, Blacksburg, VA 24061- [Fel50] W. Feller. An Introduction 0106, USA, 1988. 11 pp. to Probability Theory and its Electronic mail to fox@fox. Applications. John Wiley, cs.vt.edu. New York, NY, USA, 1950. ??? pp. LCCN QA273 Fox:1989:MCE .F37. See the discussion of the birthday paradox in Sec- [FCHD89] Edward A. Fox, Qi-Fan tion 2.3. Chen, Lenwood Heath, and Sanjeev Datta. A more cost Felician:1987:LHI effective algorithm for find- [Fel87] Leonardo Felician. Linked ing perfect hash functions. hashing: an improvement of In Riehl [Rie89], pages 114– open addressing techniques 122. ISBN 0-89791-299-3. for large secondary storage LCCN QA75.5 .A1371 1989. files. Information system, US$36.00. 12(4):385–390, 1987. CO- Fondrat:1986:PCQ DEN INSYD6. ISSN 0306- 4379 (print), 1873-6076 (elec- [FDL86] C. Fondrat, P. Dessen, and tronic). P. Le Beux. Principle of Feldman:1988:DSM codification for quick comparisons with the entire [Fel88] Michael B. Feldman. Data biomolecule databanks and Structures with Modula-2. associated programs in FOR- Prentice-Hall, Englewood TRAN 77. Nucleic Acids Re- Cliffs, NJ 07632, USA, 1988. search, 14(1):197–204, Jan- ISBN 0-13-197344-4. xvii + uary 10, 1986. CODEN 301 pp. LCCN QA76.73.M63 NARHAD. ISSN 0305-1048. F45 1988. US$40.00. Includes chapter on hash tables. Feigenbaum:1991:ACC Forman:2009:EDL [Fei91] Joan Feigenbaum, editor. Advances in Cryptology– [FES09] George Forman, Kave Es- CRYPTO ’91: Proceedings, hghi, and Jaap Suermondt. volume 576 of Lecture Notes Efficient detection of large- in Computer Science. Spring- scale redundancy in enter- er-Verlag, Berlin, Germany / prise file systems. Operating Heidelberg, Germany / Lon- Systems Review, 43(1):84– don, UK / etc., 1991. ISBN 91, January 2009. CODEN 0-387-55188-3 (New York), 3- OSRED8. ISSN 0163-5980 540-55188-3 (Berlin). LCCN (print), 1943-586X (elec- QA76.9.A25 C79 1991. tronic). REFERENCES 208

Franco:1990:TFL metric hashing based on genetic selection and its ap- [FF90] John Franco and Daniel P. plication to on-line signa- Friedman. Towards a facility tures. Lecture Notes in CS, for lexically scoped, dynamic 4642:1134–1143, 2007. CO- mutual recursion in Scheme. DEN LNCSD9. ISSN 0302- Computer Languages, 15(1): 9743 (print), 1611-3349 (elec- 55–64, ???? 1990. CO- tronic). URL http://link. DEN COLADA. ISSN 0096- springer.com/content/pdf/ 0551 (print), 1873-6742 (elec- 10.1007/978-3-540-74549- tronic). 5_118. Fleischmann:2009:TFS Figini:1984:ACH

[FFGL09] Ewan Fleischmann, Chris- [FFPV84] E. Figini, C. A. Folda, tian Forler, Michael Gorski, M. Panti, and S. Valenti. andStefanLucks.Twister An algorithm for construct- — a framework for se- ing hash tables (in Italian). cure and fast hash func- Rivista di Informatica (Mi- tions. Lecture Notes in CS, lano), 14(2):185–196, April– 5451:257–273, 2009. CO- June 1984. ISSN 0390-668X. DEN LNCSD9. ISSN 0302- Farashahi:2013:IDH

9743 (print), 1611-3349 (elec- + tronic). URL http://link. [FFS 13] Reza R. Farashahi, Pierre- Alain Fouque, Igor E. Shpar- springer.com/content/pdf/ 10.1007/978-3-642-00843- linski, Mehdi Tibouchi, and J. Felipe Voloch. Indiﬀer- 6_23. entiable deterministic hash- Fleischmann:2010:TFS ing to elliptic and hyperelliptic curves. Mathemat- [FFGL10] Ewan Fleischmann, Chris- ics of Computation, 82(281): tian Forler, Michael Gorski, 491–512, January 2013. CO- and Stefan Lucks. TWISTERπ DEN MCMPAF. ISSN 0025- — a framework for secure 5718 (print), 1088-6842 (elec- and fast hash functions. In- tronic). URL http://www. ternational Journal of Ap- ams.org/journals/mcom/ plied Cryptography. IJACT, 2013-82-281/S0025-5718- 2(1):68–81, 2010. CODEN 2012-02606-8; http:/ ???? ISSN 1753-0563 (print), /www.ams.org/journals/ 1753-0571 (electronic). mcom/2013-82-281/S0025- Freire:2007:BHB 5718-2012-02606-8/S0025- 5718-2012-02606-8.pdf. [FFGOG07] Manuel R. Freire, Julian Fisteus:2010:HCN Fierrez, Javier Galbally, and Javier Ortega-Garcia. Bio- [FGFK10] Jesus Arias Fisteus, Nor- REFERENCES 209

berto Fernández Garc´ıa, DEN SIGSBZ. ISSN 0163- Luis Sánchez Fernández, and 5824 (print), 1557-9492 (elec- Carlos Delgado Kloos. Hash- tronic). ing and canonicalizing notation 3 graphs. Jour- Fuji-Hara:2015:PHF nal of Computer and Sys- [FH15] Ryoh Fuji-Hara. Perfect hash tem Sciences, 76(7):663– families of strength three 685, November 2010. CO- with three rows from varieties DEN JCSSBM. ISSN on finite projective geome- 0022-0000 (print), 1090-2724 tries. Designs, Codes, and (electronic). URL http: Cryptography, 77(2–3):351– //www.sciencedirect.com/ 356, December 2015. CO- science/article/pii/S0022000010000048. DEN DCCREC. ISSN 0925- Files:1969:IRS 1022 (print), 1573-7586 (electronic). URL http://link. [FH69] John R. Files and Harry D. springer.com/article/10. Huskey. An information 1007/s10623-015-0052-z. retrieval system based on Fox:1989:LAF superimposed coding. In AFIPS FJCC ’69 [AFI69], [FHC89] E. A. Fox, L. Heath, and page ?? LCCN TK7885.A1 Q. Chen. An O(n log n) al- J6 1969. gorithm for finding minimal Fortune:1979:NRN perfect hash functions. Tech- nical Report TR 89-10, De- [FH79] Steve Fortune and John partment of Computer Sci- Hopcroft. A note on Ra- ence, Virginia Polytechnic bin’s nearest-neighbor algo- Institute and State Univer- rithm. Information Pro- sity, Blacksburg, VA 24061- cessing Letters, 8(1):20–23, 0106, USA, 1989. ?? pp. January 2, 1979. CO- DEN IFPLAT. ISSN 0020- Fox:1992:MPH 0190 (print), 1872-6119 (elec- [FHCD92a] Edward A. Fox, Lenwood S. tronic). Heath, Qi Fan Chen, and Fateman:1996:SLB Amjad M. Daoud. Mini- mal perfect hash functions [FH96] Richard J. Fateman and for large databases. Commu- Mark Hayden. Speeding up nications of the Association Lisp-Based symbolic math- for Computing Machinery,35 ematics. SIGSAM Bul- (1):105–121, January 1992. letin (ACM Special Interest CODEN CACMA2. ISSN Group on Symbolic and Al- 0001-0782 (print), 1557-7317 gebraic Manipulation), 30(1): (electronic). This is the first 25–30, March 1996. CO- published algorithm for com- REFERENCES 210

puting minimal perfect hash Herman, Craig Meyer, and functions for lists of millions Jayaram Udupa. Large soft- of words; previous algorithms ware problems for small com- were computationally infeasi- puters: an example from ble for more than a few hun- medical imaging. IEEE Soft- dred words. ware, 2(5):37–47, September Fox:1992:PMP 1985. CODEN IESOEG. ISSN 0740-7459 (print), [FHCD92b] Edward A. Fox, Lenwood S. 0740-7459 (electronic). Heath, Qi Fan Chen, and Amjad M. Daoud. Prac- Filiol:2002:NST tical minimal perfect hash functions for large databases. [Fil02] Eric Filiol. A new statistical Communications of the As- testing for symmetric ciphers sociation for Computing and hash functions. Techni- Machinery, 35(1):105–121, cal report, ESAT — Virology January 1992. CODEN and Cryptology Lab, B.P. CACMA2. ISSN 0001- 18 35998 Rennes, FRANCE, 0782 (print), 1557-7317 July 23, 2002. 14 pp. (electronic). URL http: URL http://eprint.iacr. //www.acm.org/pubs/toc/ org/2002/099/.Cryptol- Abstracts/0001-0782/129623. ogy ePrint Archive, Report html. This is the ﬁrst pub- 2002/099. lished algorithm for com- FIPS:1993:SHS puting minimal perfect hash functions for lists of millions [FIP93] FIPS (Federal Information of words; previous algorithms Processing Standards Publi- were computationally infeasi- cation). Secure Hash Stan- ble for more than a few hun- dard: FIPS PUB 180, May dred words. 11, 1993. United States Fan:2019:DSP Government Printing Oﬃce, Washington, DC, USA, May + [FHL 19] Wenfei Fan, Chunming Hu, 11 1993. ?? pp. Muyang Liu, Ping Lu, Qiang Yin, and Jingren Zhou. FIPS:2002:KHM Dynamic scaling for parallel graph computations. [FIP02a] FIPS. The Keyed-Hash Mes- Proceedings of the VLDB sage Authentication Code Endowment, 12(8):877–890, (HMAC). National Insti- April 2019. CODEN ???? tute for Standards and Tech- ISSN 2150-8097. nology, Gaithersburg, MD Frieder:1985:LSP 20899-8900, USA, March 6, 2002. vii + 13 pp. [FHMU85] Gideon Frieder, Gabor T. URL http://csrc.nist. REFERENCES 211

gov/publications/fips/ Fredman:1984:SSS fips198/fips-198a.pdf. [FK84] M. L. Fredman and J. Komlòs. FIPS:2002:SHS On the size of separating systems and families [FIP02b] FIPS. Secure Hash Stan- dard. National Institute of perfect hash functions. for Standards and Tech- SIAM Journal of Algebraic Discrete Methods, 5(1):61– nology, Gaithersburg, MD 20899-8900, USA, August 68, March 1984. CODEN SJAMDU. ISSN 0196-5212 1, 2002. iv + 79 pp. (print), 2168-345X (elec- URL http://csrc.nist. tronic). gov/publications/fips/ fips180-2/fips180-2.pdf. Fu:1989:CCN Fischer:1987:FMP [FK89] A. Fu and T. Kameda. Con- [Fis87] James R. Fischer, edi- currency control of nested tor. Frontiers of massively transactions accessing B- parallel scientific computa- trees. In ACM [ACM89a], tion: proceedings of the pages 270–285. ISBN 0- first symposium sponsored 89791-308-6. LCCN QA by the National Aeronau- 76.9 D3 A26 1989. URL tics and Space Adminis- http://www.acm.org/pubs/ tration, Washington, DC., articles/proceedings/pods/ and the Goodyear Aerospace 73721/p270-fu/p270-fu. Corporation, Akron, Ohio, pdf; http://www.acm. and held at NASA Goddard org/pubs/citations/proceedings/ Space Flight Center, Green- pods/73721/p270-fu/; belt, MD, September 24–25, http://www.acm.org:80/ 1986. National Aeronautics pubs/citations/proceedings/ and Space Administration, pods/73721/p270-fu/. Washington, DC, USA, 1987. Fujiwara:2021:FAA LCCN QA76.5 .F755 1987. + Field:2013:UCT [FKI 21] Yasuhiro Fujiwara, Sekitoshi Kanai, Yasutoshi Ida, Atsu- [FJ13] Rebecca E. Field and Brant C. toshi Kumagai, and Naonori Jones. Using carry-truncated Ueda. Fast algorithm for an- addition to analyze add- chor graph hashing. Proceed- rotate-xor hash algorithms. ings of the VLDB Endow- Journal of Mathematical ment, 14(6):916–928, Febru- Cryptology, 7(2):97–110, 2013. ary 2021. CODEN ???? ISSN CODEN ???? ISSN 1862- 2150-8097. URL https:// 2976 (print), 1862-2984 (elec- dl.acm.org/doi/10.14778/ tronic). 3447689.3447696. REFERENCES 212

Fredman:1984:SST Fischlin:2008:MPP [FKS84] Michael L. Fredman, János [FL08] Marc Fischlin and Anja Komlós, and Endre Sze- Lehmann. Multi-property merédi. Storing a sparse preserving combiners for table with O(1) worst case hash functions. Lecture Notes access time. Journal of in CS, 4948:375–392, 2008. the Association for Comput- CODEN LNCSD9. ISSN ing Machinery, 31(3):538– 0302-9743 (print), 1611-3349 544, July 1984. CODEN (electronic). URL http:// JACOAH. ISSN 0004-5411 link.springer.com/content/ (print), 1557-735X (elec- pdf/10.1007/978-3-540- tronic). Extends the work 78524-8_21. of Tarjan and Yao [TY79], Flajolet:1981:PEE using a two-level data structure, the first containing [Fla81] P. Flajolet. On the per- pointers to the second, and formance evaluation of ex- the second containing blocks tendible hashing and trie accessible by a perfect hash- searching. Technical report, ing function. International Business Ma- chines (IBM), San Jose, Re- Feldman:1973:CBS search Laboratory (CA), Oc- [FL73] J. A. Feldman and J. R. Low. tober 1981. ?? pp. Comment on Brent’s scatter Flajolet:1983:PEE storage algorithm. Commu- nications of the Association [Fla83a] Philippe Flajolet. On the for Computing Machinery,16 performance evaluation of ex- (11):??, November 1973. CO- tendible hashing and trie DEN CACMA2. ISSN 0001- searching. Acta Informatica, 0782 (print), 1557-7317 (elec- 20(4):345–369, ???? 1983. tronic). CODEN AINFA2. ISSN 0001-5903 (print), 1432-0525 Fan:2004:DBS (electronic). [FL04] C. I. Fan and C. L. Lei. Di- Flajolet:1983:PC visible blind signatures based on hash chains. International [Fla83b] Philippe Flajolet. Proba- Journal of Computer Ap- bilistic counting. Annual plications, 26(1):1–9, 2004. Symposium on Foundations CODEN IJCAFW. ISSN of Computer Science (Pro- 1206-212X (print), 1925-7074 ceedings), pages 76–82, 1983. (electronic). URL https:// CODEN ASFPDV. ISBN www.tandfonline.com/doi/ 0-8186-0508-1. ISSN 0272- full/10.1080/1206212X. 5428. IEEE Service Cent. 2004.11441718. Piscataway, NJ, USA. REFERENCES 213

Fernandez:2011:HWS springer.com/content/pdf/ 10.1007/978-3-540-70583- [FLF11] David Fernández, Josep 3_53. Lladós, and Alicia Fornés. Handwritten word spotting Fischlin:2014:RMP in old manuscript images using a pseudo-structural de- [FLP14] Marc Fischlin, Anja Lehmann, scriptor organized in a hash and Krzysztof Pietrzak. Ro- structure. Lecture Notes in bust multi-property combin- CS, 6669:628–635, 2011. CO- ers for hash functions. Jour- DEN LNCSD9. ISSN 0302- nal of Cryptology, 27(3): 9743 (print), 1611-3349 (elec- 397–428, July 2014. CO- tronic). URL http://link. DEN JOCREQ. ISSN 0933- springer.com/content/pdf/ 2790 (print), 1432-1378 (elec- 10.1007/978-3-642-21257- tronic). URL http://link. 4_78. springer.com/article/10. 1007/s00145-013-9148-7. Flores:1977:DSM Ferguson:2010:SHF [Flo77] Ivan Flores. Data Struc- ture and Management.Pren- [FLS+10] Niels Ferguson, Stefan Lucks, tice-Hall, Englewood Cliffs, Bruce Schneier, Doug Whit- NJ 07632, USA, second ing, Mihir Bellare, Tadayoshi edition, 1977. ISBN 0- Kohno, Jon Callas, and Jesse 13-197335-5. ix + 390 Walker. The Skein hash func- pp. LCCN QA76.9.D35 F57 tion family. Report, (var- 1977. US$17.50. ious), October 1, 2010. ii Floyd:1987:HHP + vi + 92 pp. URL http: //en.wikipedia.org/wiki/ [Flo87] Edwin T. Floyd. Hashing for Skein_(hash_function); high-performance searching. http://www.skein-hash. Dr. Dobbs Journal, 12(2):34– info/sites/default/files/ ??, February 1987. CODEN skein1.3.pdf. DDJTEQ. ISSN 0888-3076. Fischlin:2008:RMP Flynn:1992:ORU [FLP08] Marc Fischlin, Anja Lehmann, [Fly92] P. J. Flynn. 3D object recog- and Krzysztof Pietrzak. Ro- nition using invariant feature bust multi-property combin- indexing of interpretation ta- ers for hash functions revis- bles. Computer Vision, ited. Lecture Notes in CS, Graphics, and Image Pro- 5126:655–666, 2008. CO- cessing. Image Understand- DEN LNCSD9. ISSN 0302- ing, 55(2):119–129, March 9743 (print), 1611-3349 (elec- 1992. CODEN CIUNEJ. tronic). URL http://link. ISSN 1049-9660. REFERENCES 214

Flajolet:1985:PCA ishnan. Perfect hashing for strings: Forrealization and [FM85] Philippe Flajolet and G. N. algorithms. Lecture Notes in Martin. Probabilistic count- CS, 1075:130–??, 1996. CO- ing algorithms for data DEN LNCSD9. ISSN 0302- base applications. Jour- 9743 (print), 1611-3349 (elec- nal of Computer and Sys- tronic). tem Sciences, 31(2):182– 209, September 1985. CO- Franklin:2002:PAS DEN JCSSBM. ISSN 0022- [FMA02] Michael Franklin, Bongki 0000 (print), 1090-2724 (elec- Moon, and Anastassia Aila- tronic). maki, editors. Proceedings of Faloutsos:1989:DUE the ACM SIGMOD Interna- tional Conference on Man- [FM89] C. Faloutsos and D. Metaxas. agement of Data, June 3– Declustering using error cor- 6, 2002, Madison, WI, USA. recting codes. In ACM ACM Press, New York, NY [ACM89a], pages 253–258. 10036, USA, 2002. ISBN ???? ISBN 0-89791-308-6. LCCN LCCN ???? ACM order QA 76.9 D3 A26 1989. URL number 475020. http://www.acm.org/pubs/ Frieze:2009:ARW articles/proceedings/pods/ 73721/p253-faloutsos/p253-[FMM09] Alan Frieze, P´all Melsted, faloutsos.pdf; http:// and Michael Mitzenmacher. www.acm.org/pubs/citations/ An analysis of random- proceedings/pods/73721/ walk cuckoo hashing. In p253-faloutsos/; http: Dinur et al. [DJNR09], //www.acm.org:80/pubs/ pages 490–503. ISBN 3- citations/proceedings/ 642-03684-8. ISSN 0302- pods/73721/p253-faloutsos/ 9743 (print), 1611-3349 (elec- . tronic). LCCN QA75.5 Faudemay:1991:AAL .I643 2009. URL http: //www.springerlink.com/ [FM91] Pascal Faudemay and Mon- content/vr67337v41pn1055/ gia Mhiri. An associative ac- . celerator for large databases. Frieze:2011:ARW IEEE Micro, 11(6):22–34, November/December 1991. [FMM11] Alan Frieze, P´all Melsted, CODEN IEMIDZ. ISSN and Michael Mitzenmacher. 0272-1732 (print), 1937-4143 An analysis of random-walk (electronic). cuckoo hashing. SIAM Farach:1996:PHS Journal on Computing,40 (2):291–308, ???? 2011. [FM96] M. Farach and S. Muthukr- CODEN SMJCAT. ISSN REFERENCES 215

0097-5397 (print), 1095-7111 Fiat:1992:NH (electronic). URL http: //epubs.siam.org/sicomp/ [FNSS92] Amos Fiat, Moni Naor, Jean- resource/1/smjcat/v40/ ette P. Schmidt, and Alan i2/p291_s1. Siegel. Nonoblivious hashing. Journal of the Association Faezipour:2009:HPE for Computing Machinery,39 (4):764–782, October 1, 1992. [FNP09] Miad Faezipour, Mehrdad CODEN JACOAH. ISSN Nourani, and Rina Pani- 0004-5411 (print), 1557-735X grahy. A hardware platform (electronic). for efficient worm outbreak detection. ACM Transac- Finin:1992:IKM tions on Design Automation of Electronic Systems.,14[FNY92] Timothy W. Finin, Charles K. (4):49:1–49:??, August 2009. Nicholas, and Yelena Yesha, CODEN ATASFO. ISSN editors. Information and 1084-4309 (print), 1557-7309 knowledge management: ex- (electronic). panding the definition of ‘database’: First Interna- Fagin:1979:EHF tional Conference, CIKM ’92, Baltimore, Maryland, [FNPS79] Ronald Fagin, Jurg Niev- USA, November 8–11, 1992: ergelt, Nicholas Pippenger, select papers. Springer-Ver- and H. Raymond Strong. Ex- lag, Berlin, Germany / Hei- tendible hashing — a fast delberg, Germany / London, access method for dynamic UK / etc., 1992. ISBN 0- files. ACM Transactions 387-57419-0 (New York), 3- on Database Systems, 4(3): 540-57419-0 (Berlin). LCCN 315–344, September 1979. QA76.9.D3 I5586 1992. CODEN ATDSD3. ISSN Forte:2009:DM 0362-5915 (print), 1557-4644 (electronic). Also published [For09] Dario Forte. The death of in/as: IBM Research Report MD5. Network Security, 2009 RJ2305, Jul. 1978. See also (2):18–20, February 2009. [Reg85]. CODEN NTSCF5. ISSN 1353-4858 (print), 1872-9371 Fiat:1988:NOH (electronic). URL http: [FNSS88] A. Fiat, M. Naor, J. P. //www.sciencedirect.com/ Schmidt, and A. Siegel. Non- science/article/pii/S1353485809700200. oblivious hashing. In ACM- Fox:1991:GEI TOC’88 [ACM88b], pages 367–376. ISBN 0-89791-264- [Fox91] Edward A. Fox. Guest Edi- 0. LCCN QA 76.6 A13 1988. tor’s introduction: Standards REFERENCES 216

and the emergence of digital and Data Engineering, 1(3): multimedia systems. Com- 318–328, September 1989. munications of the Associa- CODEN ITKEEH. ISSN tion for Computing Machin- 1041-4347. ery, 34(4):26–29, April 1991. Fountoulakis:2010:ORH CODEN CACMA2. ISSN 0001-0782 (print), 1557- [FP10] Nikolaos Fountoulakis and 7317 (electronic). URL Konstantinos Panagiotou. http://www.acm.org/pubs/ Orientability of random hy- toc/Abstracts/0001-0782/ pergraphs and the power of 103086.html. See [FHCD92b]. multiple choices. In Abram- sky et al. [AGK+10], pages Frost:1982:FGN 348–359. CODEN LNCSD9. ISBN 3-642-14164-1 (vol. 1: [FP82] R. A. Frost and M. M. Pe- paperback), 3-642-14161-7 terson. A function for gen- (vol. 2: paperback). ISSN erating nearly balanced bi- 0302-9743 (print), 1611-3349 nary search trees from sets of (electronic). LCCN QA267 non-random keys. Software— .I55 2010. URL Practice and Experience,12 http: (2):163–168, February 1982. //www.springerlink.com/ CODEN SPEXBL. ISSN content/e8r0t858j82l7141/ . 0038-0644 (print), 1097-024X (electronic). Fountoulakis:2013:ITC Fateman:1989:SDS [FPS13] Nikolaos Fountoulakis, Kon- stantinos Panagiotou, and [FP89a] R. J. Fateman and C. G. Angelika Steger. On the Ponder. Speed and data insertion time of cuckoo structures in computer al- hashing. SIAM Journal gebra systems. SIGSAM on Computing, 42(6):2156– Bulletin (ACM Special Inter- 2181, ???? 2013. CO- est Group on Symbolic and DEN SMJCAT. ISSN 0097- Algebraic Manipulation),23 5397 (print), 1095-7111 (elec- (2):8–11, April 1989. CO- tronic). DEN SIGSBZ. ISSN 0163- 5824 (print), 1557-9492 (elec- Feigenblat:2017:MWI tronic). [FPS17] Guy Feigenblat, Ely Porat, Fotouhi:1989:OSS and Ariel Shiftan. d-k- min-wise independent fam- [FP89b] F. Fotouhi and S. Pramanik. ily of hash functions. Jour- Optimal secondary storage nal of Computer and Sys- access sequence for perform- tem Sciences, 84(??):171– ing relational join. IEEE 184, March 2017. CO- Transactions on Knowledge DEN JCSSBM. ISSN REFERENCES 217

0022-0000 (print), 1090-2724 449, August 1969. CO- (electronic). URL http: DEN CACMA2. ISSN 0001- //www.sciencedirect.com/ 0782 (print), 1557-7317 (elec- science/article/pii/S0022000016300848. tronic). Fotakis:2005:SEH Franklin:2004:ACC

[FPSS05] D. Fotakis, R. Pagh, P. Sanders,[Fra04] Matt Franklin, editor. Ad- and P. G. Spirakis. Space vances in Cryptology — eﬃcient hash tables with CRYPTO 2004: 24th An- worst case constant access nual International Cryptol- time. Theory of Com- ogy Conference, Santa Bar- puting Systems, 38(2):229– bara, California, USA, Au- 248, ???? 2005. CO- gust 15–19, 2004. Proceed- DEN TCSYFI. ISSN 1432- ings, volume 3152 of Lec- 4350 (print), 1433-0490 (elec- ture Notes in Computer Sci- tronic). URL ????. ence. Springer-Verlag, Berlin, Germany / Heidelberg, Ger- Flajolet:1998:ALP many / London, UK / etc., 2004. CODEN LNCSD9. [FPV98] Philippe Flajolet, Patri- ISBN 3-540-22668-0. ISSN cio V. Poblete, and Al- 0302-9743 (print), 1611-3349 fredo Viola. On the anal- (electronic). URL http: ysis of linear probing hash- //www.springerlink.com/ ing. Algorithmica, 22(4): openurl.asp?genre=issue& 490–515, December 1998. issn=0302-9743&volume= CODEN ALGOEJ. ISSN 3152; http://www.springerlink. 0178-4617 (print), 1432-0541 com/openurl.asp?genre= (electronic). URL http: volume&id=doi:10.1007/ //link.springer.de/link/ b99099. service/journals/00453/ bibs/22n4p490.html; http: Ferreira:2011:LHB //www.springerlink.com/ [FRB11] Kurt B. Ferreira, Rolf openurl.asp?genre=article& Riesen, and Ron Brigh- issn=0178-4617&volume= well. libhashckpt:Hash- 22&issue=4&spage=490. Average- based incremental check- case analysis of algorithms. pointing using GPU’s. Lec- Feldman:1969:ABA ture Notes in CS, 6960: 272–281, 2011. CODEN [FR69] Jerome A. Feldman and LNCSD9. ISSN 0302-9743 Paul D. Rovner. An (print), 1611-3349 (elec- Algol-based associative lan- tronic). URL http://link. guage. Communications of springer.com/content/pdf/ the Association for Comput- 10.1007/978-3-642-24449- ing Machinery, 12(8):439– 0_31. REFERENCES 218

Freeman:1990:ICP Frost:1982:BRS

[Fre90] Herbert Freeman, editor. 10th International Confer- [Fro82] R. A. Frost. Binary- ence on Pattern Recognition: relational storage structures. 16–21 June 1990, Atlantic The Computer Journal,25 City, New Jersey, USA: (3):358–367, August 1982. Proceedings. IEEE Com- CODEN CMPJA6. ISSN puter Society Press, 1109 0010-4620 (print), 1460-2067 Spring Street, Suite 300, (electronic). URL http:// Silver Spring, MD 20910, www3.oup.co.uk/computer_ USA, 1990. ISBN 0-8186- journal/hdb/Volume_25/ 2062-5 (v.1, paperback), 0- Issue_03/tiff/358.tif; 8186-2063-3 (v.2, paper- http://www3.oup.co.uk/ back), 0-8186-6062-7 (v.1, computer_journal/hdb/Volume_ microfiche), 0-8186-6063-5 25/Issue_03/tiff/359.tif; (v.2, microfiche), 0-8186- http://www3.oup.co.uk/ 9062-3 (v.1, hardcover), 0- computer_journal/hdb/Volume_ 8186-9063-1 (v.2, hardcover). 25/Issue_03/tiff/360.tif; LCCN TK7882.P3 I58 1990. http://www3.oup.co.uk/ Two volumes. computer_journal/hdb/Volume_ 25/Issue_03/tiff/361.tif; Friemel:1986:DM http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [Fri86] Andrea Friemel. Dateistruk- 25/Issue_03/tiff/362.tif; turen fuer mehrschluesselzu- http://www3.oup.co.uk/ griff. Studienarbeit, 1986. computer_journal/hdb/Volume_ 25/Issue_03/tiff/363.tif; Frost:1981:ADI http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [Fro81] R. A. Frost. Algorithm 25/Issue_03/tiff/364.tif; 112: Dumping the index http://www3.oup.co.uk/ of a dynamic hash table. computer_journal/hdb/Volume_ The Computer Journal,24 25/Issue_03/tiff/365.tif; (4):383–384, November 1981. http://www3.oup.co.uk/ CODEN CMPJA6. ISSN computer_journal/hdb/Volume_ 0010-4620 (print), 1460-2067 25/Issue_03/tiff/366.tif; (electronic). URL http:// http://www3.oup.co.uk/ www3.oup.co.uk/computer_ computer_journal/hdb/Volume_ journal/hdb/Volume_24/ 25/Issue_03/tiff/367.tif. Issue_04/tiff/383.tif; Discusses the dynamic hash- http://www3.oup.co.uk/ ing scheme used by ASDAS, computer_journal/hdb/Volume_ under development at Strath- 24/Issue_04/tiff/384.tif. clyde University. REFERENCES 219

Fraenkel:1994:EMD Heidelberg, Germany / Lon- don, UK / etc., 2009. CO- [FRS94] Aviezri S. Fraenkel, Ed- DEN LNCSD9. ISBN 3- ward M. Reingold, and 642-04127-2. ISSN 0302- Prashant Saxena. Eﬃ- 9743 (print), 1611-3349 (elec- cient management of dy- tronic). LCCN QA76.9.A43 namic tables. Information E83 2009. URL http://www. Processing Letters, 50(1):25– loc.gov/catdir/enhancements/ 30, April 8, 1994. CO- fy1208/2009933188-d.html; DEN IFPLAT. ISSN 0020- http://www.springerlink. 0190 (print), 1872-6119 (elec- com/content/978-3-642- tronic). 04127-3/. Flajolet:1982:BPA Farashahi:2009:HEC

[FS82] P. Flajolet and J.-M. Steyaert. [FSV09] Reza R. Farashahi, Igor E. Shparlinski, and José Felipe A branching process arising in dynamic hashing, trie Voloch. On hashing into elliptic curves. Journal of searching and polynomial Mathematical Cryptology,3 factorization. In Nielsen and Schmidt [NS82], pages (4):353–360, 2009. CODEN ???? ISSN 1862-2976 (print), 239–251. ISBN 0-387-11576- 5. LCCN QA267.A1 L43 1862-2984 (electronic). no.140. Fouque:2012:IHB Fortnow:2008:IIC [FT12] Pierre-Alain Fouque and Mehdi Tibouchi. Indifferen- [FS08] Lance Fortnow and Rahul tiable hashing to Barreto– Santhanam. Infeasibility Naehrig curves. Lec- of instance compression and ture Notes in CS, 7533: succinct PCPs for NP. In 1–17, 2012. CODEN ACM [ACM08b], pages 133– LNCSD9. ISSN 0302-9743 142. ISBN 1-60558-047-3. (print), 1611-3349 (elec- LCCN QA76.6 .A152 2008. tronic). URL http://link. Fiat:2009:AEA springer.com/chapter/10. 1007/978-3-642-33481-8_ [FS09] Amos Fiat and Peter Sanders, 1/. editors. Algorithms, ESA Fuerer:1988:UHV 2009: 17th annual Euro- pean symposium, Copen- [Für88] M. Fürer. Universal hash- hagen, Denmark, Septem- ing in VLSI. In Reif [Rei88], ber 7–9: proceedings,vol- pages 312–318. ISBN 0- ume 5757 of Lecture Notes 387-96818-0. LCCN TK7874 in Computer Science. Spring- .A338 1988. Lecture notes in er-Verlag, Berlin, Germany / computer science # 319. REFERENCES 220

Fusco:2012:RTC RFID Security: Techniques, Protocols and System-on- [FVS12] Francesco Fusco, Michail Chip Design, pages 373–415. Vlachos, and Marc Ph. Springer-Verlag, Berlin, Ger- Stoecklin. Real-time creation many / Heidelberg, Ger- of bitmap indexes on stream- many / London, UK / etc., ing network data. VLDB 2009. ISBN 0-387-76481- Journal: Very Large Data X (e-book), 0-387-76480-1 Bases, 21(3):287–307, June (hardcover). LCCN TK6553 2012. CODEN VLDBFR. .R45 2008eb. URL http: ISSN 1066-8888 (print), //www.springerlink.com/ 0949-877X (electronic). content/q1160h1036371331/ . Friedman:1976:GCH Fan:2018:HCS [FW76] Daniel P. Friedman and David S. Wise. Garbage collecting a heap which includes [FWG18] Jingzhe Fan, Yan Wang, and a scatter table. Information Lei Guo. Hierarchical co- Processing Letters, 5(6):161– herency sensitive hashing and 164, December ??, 1976. CO- interpolation with RANSAC DEN IFPLAT. ISSN 0020- for large displacement optical 0190 (print), 1872-6119 (elec- ﬂow. Computer vision and tronic). See erratum [FW77]. image understanding: CVIU, 175(??):1–10, October 2018. Friedman:1977:EGC CODEN CVIUF4. ISSN 1077-3142 (print), 1090-235X [FW77] Daniel P. Friedman and (electronic). URL http: David S. Wise. Erra- //www.sciencedirect.com/ tum: “Garbage Collecting science/article/pii/S1077314218304223. a Heap Which Includes a Scatter Table”. Informa- Fang:2017:OHT tion Processing Letters, 6(2): 72, April ??, 1977. CO- [FXWW17] Jianwu Fang, Hongke Xu, DEN IFPLAT. ISSN 0020- Qi Wang, and Tianjun Wu. 0190 (print), 1872-6119 (elec- Online hash tracking with tronic). See [FW76]. spatio-temporal saliency aux- Feldhofer:2009:HIS iliary. Computer vision and image understanding: CVIU, [FW09] Martin Feldhofer and Jo- 160(??):57–72, July 2017. hannes Wolkerstorfer. Hard- CODEN CVIUF4. ISSN ware implementation of sym- 1077-3142 (print), 1090-235X metric algorithms for RFID (electronic). URL http: security. In Paris Kitsos //www.sciencedirect.com/ and Yan Zhang, editors, science/article/pii/S1077314217300565. REFERENCES 221

Folk:1987:FSC Atallah, and Jeff Avery. In- hibiting and detecting offline [FZ87] Michael J. Folk and Bill Zoel- password cracking using Er- lick. File Structures: a satzPasswords. ACM Trans- Conceptual Toolkit. Addi- actions on Privacy and Secu- son-Wesley, Reading, MA, rity (TOPS), 19(3):9:1–9:??, USA, 1987. ISBN 0-201- December 2016. CODEN 12003-8. xxi + 538 pp. ???? ISSN 2471-2566 (print), LCCN QA76.9.F5 F651 1987. 2471-2574 (electronic). US$32.95. Computing Re- views: “A surprisingly thor- Guillemot:2010:FPT ough discussion of hashing al- [GB10] Sylvain Guillemot and Vin- gorithms, collision resolution, cent Berry. Fixed-parameter and the use and performance tractability of the maximum of hashed files completes the agreement supertree prob- text with chapter 11.”. lem. IEEE/ACM Transac- Gil:1996:TMH tions on Computational Bi- ology and Bioinformatics,7 [GadHW96] Joseph Gil, Friedhelm Meyer (2):342–353, April 2010. CO- auf der Heide, and Avi DEN ITCBCY. ISSN 1545- Wigderson. The tree model 5963 (print), 1557-9964 (elec- for hashing: Lower and up- tronic). per bounds. SIAM Jour- nal on Computing, 25(5): Garg:2017:RMR 936–955, ???? 1996. CO- [GB17] Neenu Garg and Seema DEN SMJCAT. ISSN 0097- Bawa. RITS–MHT: Rel- 5397 (print), 1095-7111 (elec- ative indexed and time tronic). stamped Merkle hash tree Gait:1982:AEC based data auditing protocol for cloud comput- [Gai82] J. Gait. An algorithm for ing. Journal of Network and an efficient command inter- Computer Applications,84 preter. Software—Practice (??):1–13, April 15, 2017. and Experience, 12(10):981– CODEN JNCAF3. ISSN 982, October 1982. CODEN 1084-8045 (print), 1095-8592 SPEXBL. ISSN 0038-0644 (electronic). URL http: (print), 1097-024X (elec- //www.sciencedirect.com/ tronic). science/article/pii/S1084804517300668. Gutierrez:2016:IDO Graefe:1998:HJH

[GAS+16] Christopher N. Gutierrez, [GBC98] Goetz Graefe, Ross Bunker, Mohammed H. Almeshekah, and Shaun Cooper. Hash Eugene H. Spaﬀord, Mikhail J. joins and hash teams in Mi- REFERENCES 222

crosoft SQL server. In Gupta Guh:1990:PPS et al. [GSW98], pages 86– 97. ISBN 1-55860-566-5. [GC90] Keh-Chang Guh and Jose LCCN QA76.9.D3 I559 1998. Chavarria. Parallel pro- URL http://www.vldb. cessing strategy for com- org/dblp/db/conf/vldb/ puting transitive closure of GraefeBC98.html. Also a database relation. In known as VLDB. Proceedings — Parbase-90 International Conference on Gong:1994:AKD Databases, Parallel Architec- [GBL94] Li Gong, T. A. (Thomas A.) tures, and Their Applica- Berson, and T. Mark A. Lo- tions (Mar 7–9 1990: Mi- mas. Authentication, key dis- ami Beach, FL, USA), pages tribution, and secure broad- 37–43. IEEE Computer Soci- cast in computer networks ety Press, 1109 Spring Street, using no encryption or de- Suite 300, Silver Spring, MD cryption. Technical report 20910, USA, 1990. IEEE cat- SRI-CSL-94-08, SRI Inter- alog number 90CH2728-4. national, Computer Science Graefe:1995:FAU Laboratory, Menlo Park, CA, USA, 1994. 13 + 4 + 10 pp. [GC95] Goetz Graefe and Richard L. Gonnet:1990:AKR Cole. Fast algorithms for universal quantiﬁcation in large [GBY90] Gaston H. Gonnet and Ri- databases. ACM Transac- cardo A. Baeza-Yates. Anal- tions on Database Systems, ysis of the Karp-Rabin string 20(2):187–236, June 1995. matching algorithm. Infor- CODEN ATDSD3. ISSN mation Processing Letters,34 0362-5915 (print), 1557- (5):271–274, May 1990. CO- 4644 (electronic). URL DEN IFPLAT. ISSN 0020- http://www.acm.org/pubs/ 0190 (print), 1872-6119 (elec- articles/journals/tods/ tronic). 1995-20-2/p187-graefe/ Gonnet:1991:HAD p187-graefe.pdf; http: //www.acm.org/pubs/citations/ [GBY91] Gaston H. Gonnet and Ri- journals/tods/1995-20- cardo Baeza-Yates. Hand- 2/p187-graefe/; http: book of Algorithms and Data //www.acm.org/pubs/toc/ Structures: in Pascal and Abstracts/tods/210202. C. Addison-Wesley, Read- html. ing, MA, USA, second. Gollapalli:2015:IRH edition, 1991. ISBN 0- 201-41607-7. xiv + 424 [GCMG15] Sujatha Das Gollapalli, Cor- pp. LCCN QA76.73.P2 G66 nelia Caragea, Prasenjit Mi- 1991. UK£18.95. tra, and C. Lee Giles. Im- REFERENCES 223

proving researcher homepage Computer Systems, 110(??): classiﬁcation with unlabeled 587–609, September 2020. data. ACM Transactions on CODEN FGSEVI. ISSN the Web (TWEB), 9(4):17:1– 0167-739X (print), 1872-7115 17:??, October 2015. CO- (electronic). URL http: DEN ???? ISSN 1559-1131 //www.sciencedirect.com/ (print), 1559-114X (elec- science/article/pii/S0167739X17319180. tronic). Gedik:2014:PFS Gerber:1987:IHS [Ged14] Bugra Gedik. Partitioning [GD87] R. H. Gerber and D. J. De- functions for stateful data Witt. The impact of hard- parallelism in stream pro- ware and software alterna- cessing. VLDB Journal: tives on the performance of Very Large Data Bases,23 the gamma database ma- (4):517–539, August 2014. chine. Technical Report CODEN VLDBFR. ISSN CS TR 708, University of 1066-8888 (print), 0949-877X Wisconsin–Madison, Madi- (electronic). son, WI, USA, July 1987. ?? pp. Geiselmann:1995:NHF Girdzijauskas:2010:SOH [Gei95] W. Geiselmann. A note on the hash function of [GDA10] Sar¯ˇ unas Girdzijauskas, An- Tillich and Zemor. In Boyd witaman Datta, and Karl [Boy95a], pages 257–263. Aberer. Structured over- ISBN 3-540-60693-9. ISSN lay for heterogeneous envi- 0302-9743 (print), 1611-3349 ronments: Design and evalu- (electronic). LCCN QA268 ation of Oscar. ACM Trans- .C76 1995. actions on Autonomous and Geiselmann:1996:NHF Adaptive Systems (TAAS),5 (1):2:1–2:??, February 2010. [Gei96] W. Geiselmann. A note on CODEN ???? ISSN 1556- the hash function of Tillich 4665 (print), 1556-4703 (elec- and Zemor. Lecture Notes in tronic). CS, 1039:51–??, 1996. CO- DEN LNCSD9. ISSN 0302- Giatrakos:2020:OOD 9743 (print), 1611-3349 (elec- [GDGK20] Nikos Giatrakos, Antonios tronic). Deligiannakis, Minos Garo- Gerber:1986:DQPa falakis, and Yannis Kotidis. Omnibus outlier detection [Ger86a] R. H. Gerber. Dataﬂow in sensor networks using Query Processing using Mul- windowed locality sensitive tiprocessor Hash-Partitioned hashing. Future Generation Algorithms. Ph.d. thesis, REFERENCES 224

University of Wisconsin– comparison of hashing al- Madison, Madison, WI, USA, gorithms with key deletion. October 1986. ?? pp. Journal of the Information Processing Society of Japan, Gerber:1986:DQPb 3(1):1–12, ???? 1980. CO- [Ger86b] Robert H. Gerber. Dataﬂow DEN JIPRDE. ISSN 0387- query processing using mul- 6101. tiprocessor hash-partitioned Garg:1986:OPK algorithms. Technical report, University of Wisconsin– [GG86a] Anil K. Garg and C. C. Madison, Madison, WI, USA, Gotlieb. Order-preserving 1986. ?? pp. key transformations. ACM Transactions on Database Gerber:1995:IOX Systems, 11(2):213–234, June [Ger95] Bob Gerber. Informix on- 1986. CODEN ATDSD3. line XPS. SIGMOD Record ISSN 0362-5915 (print), (ACM Special Interest Group 1557-4644 (electronic). URL on Management of Data),24 http://www.acm.org/pubs/ (2):463, May 1995. CO- articles/journals/tods/ DEN SRECD8. ISSN 0163- 1986-11-2/p213-garg/p213- 5808 (print), 1943-5835 (elec- garg.pdf; http://www. tronic). acm.org/pubs/citations/ journals/tods/1986-11- Gettys:2001:AAG 2/p213-garg/; http:/ [Get01] Thomas Gettys. Algorithm /www.acm.org/pubs/toc/ alley: Generating perfect Abstracts/tods/5923.html. hash functions. Dr. Dobbs Griswold:1986:IIP Journal, 26(2):151, 153, 155, February 2001. CODEN [GG86b] Ralph E. Griswold and DDJOEB. ISSN 1044-789X. Madge T. Griswold. The Im- URL http://www.ddj.com/ plementation of the Icon Pro- ftp/2001/2001_02/aa0201. gramming Language. Prince- txt. ton University Press, Prince- Groner:1974:CHF ton, NJ, USA, 1986. ISBN 0-691-08431-9. x + 336 [GG74] L. H. Groner and A. L. Goel. pp. LCCN QA76.73.I19 G76 Concurrency in hashed ﬁle 1986. US$39.50. The hashing access. In Rosenfeld [Ros74], algorithms used in the Icon page ?? ISBN 0-444-10689-8. compiler are described on pp. LCCN QA 76 I615. 97–107. Gunji:1980:SHC Gavrila:1992:ORI [GG80] Takao Gunji and Eiichi Goto. [GG92] D. M. Gavrila and F. C. A. Studies on hashing — 1. a Groen. 3D object recog- REFERENCES 225

nition from 2D images us- 9743 (print), 1611-3349 (elec- ing geometric hashing. Pat- tronic). URL http://link. tern Recognition Letters,13 springer.com/content/pdf/ (4):263–278, April 1992. CO- 10.1007/978-3-540-77255- DEN PRLEDG. ISSN 0167- 2_91. 8655 (print), 1872-7344 (electronic). Ghandeharizadeh:1993:ILS

Ganguly:2004:TSE [GHJ+93] S. Ghandeharizadeh, R. Hull, [GGR04] Sumit Ganguly, Minos Garo- D. Jacobs, J. Castillo, falakis, and Rajeev Ras- M. Escobar-Molano, S. Lu, togi. Tracking set-expression J. Luo, C. Tsang, and cardinalities over continu- G. Zhou. On implementing a ous update streams. VLDB language for specifying active Journal: Very Large Data database execution models. Bases, 13(4):354–369, De- In Agrawal et al. [ABB93], cember 2004. CODEN page 441. ISBN 1-55860-152- VLDBFR. ISSN 1066-8888 X. ISSN 0730-9317. LCCN (print), 0949-877X (elec- QA76.9.D3 I61 1993. tronic). Goldsmith:1991:SCIa Gao:2019:ERB [GHK91a] Judy Goldsmith, Lane A. + [GGY 19] Y. Gao, X. Gao, X. Yang, Hemachandra, and Kenneth J. Liu, and G. Chen. An Kunen. On the structure efficient ring-based meta- and complexity of infinite data management policy for sets with minimal perfect large-scale distributed file hash functions. Foundations systems. IEEE Transac- of Software Technology and tions on Parallel and Dis- Theoretical Computer Sci- tributed Systems, 30(9):1962– ence, 11(??):??, 1991. 1974, September 2019. CO- DEN ITDSEO. ISSN 1045- Goldsmith:1991:SCIb 9219 (print), 1558-2183 (electronic). [GHK91b] Judy Goldsmith, Lane A. Guo:2007:CBI Hemachandra, and Kenneth Kunen. On the structure and [GH07] Xin C. Guo and Dim- complexity of infinite sets itrios Hatzinakos. Content with minimal perfect hash based image hashing via functions. Lecture Notes in wavelet and Radon trans- CS, 560:212–223, 1991. CO- form. Lecture Notes in CS, DEN LNCSD9. ISSN 0302- 4810:755–764, 2007. CO- 9743 (print), 1611-3349 (elec- DEN LNCSD9. ISSN 0302- tronic). REFERENCES 226

Gal:2012:TBC Ghodsi:2007:ESB

[GHK+12] Anna Gál, Kristoffer Arns- [GHW07] Ali Ghodsi, Seif Haridi, and felt Hansen, Michal Koucký, Hakim Weatherspoon. Ex- Pavel Pudlák, and Emanuele ploiting the synergy be- Viola. Tight bounds on com- tween gossiping and struc- puting error-correcting codes tured overlays. Operating by bounded-depth circuits Systems Review, 41(5):61– with arbitrary gates. In 66, October 2007. CODEN ACM [ACM12], pages 479– OSRED8. ISSN 0163-5980 494. ISBN 1-4503-1245-4. (print), 1943-586X (elec- LCCN ???? URL http: tronic). //www.gbv.de/dms/tib-ub- Goto:1977:PHA hannover/63314455x.. [GI77] E. Goto and T. Ida. Paral- Ghosh:1977:DBO lel hashing algorithms. In- formation Processing Let- [Gho77] Sakti P. Ghosh. Data Base ters, 6(1):8–13, 1977. CO- Organization For Data Man- DEN IFPLAT. ISSN 0020- agement. Academic Press, 0190 (print), 1872-6119 (elec- New York, NY, USA, 1977. tronic). ISBN 0-12-281850-4. xi + 376 pp. LCCN QA76.9.F5 G47. Godor:2012:HBM

Ghosh:1986:DBO [GI12] Gy˝oz˝oG´odor and S´andor Imre. Hash-based mu- [Gho86] Sakti P. Ghosh. Data Base tual authentication proto- Organization For Data Man- col for low-cost RFID sys- agement. Academic Press, tems. Lecture Notes in New York, NY, USA, sec- CS, 7479:76–87, 2012. CO- ond edition, 1986. ISBN 0- DEN LNCSD9. ISSN 0302- 12-281852-0. xiii + 487 pp. 9743 (print), 1611-3349 (elec- LCCN QA76.9.F5 G47 1986. tronic). URL http://link. springer.com/chapter/10. Gennaro:1999:SHS 1007/978-3-642-32808-4_ 8/. [GHR99] R. Gennaro, S. Halevi, and Gibson:1990:SCD T. Rabin. Secure hash-and- sign signatures without the [Gib90] J. K. Gibson. Some com- random oracle. Lecture Notes ments on Damg˚ard’s hash- in CS, 1592:123–??, 1999. ing principle. Electronics Let- CODEN LNCSD9. ISSN ters, 26(15):1178–1179, July 0302-9743 (print), 1611-3349 19, 1990. CODEN EL- (electronic). LEAK. ISSN 0013-5194 REFERENCES 227

(print), 1350-911X (elec- of Cryptology, 24(1):148– tronic). 156, January 2011. CO- DEN JOCREQ. ISSN Gibson:1991:DLH 0933-2790 (print), 1432- 1378 (electronic). URL [Gib91] J. K. Gibson. Discrete log- http://www.springerlink. arithm hash function that is com/openurl.asp?genre= collision free and one way. article&issn=0933-2790& IEE proceedings, E: Com- volume=24&issue=1&spage= puters and digital techniques, 148. 138(6):407–410, November 1, 1991. CODEN IPETD3. Girault:1987:HFU ISSN 0143-7062. [Gir87] Mark Girault. Hash- Gilchrist:1977:IPP functions using modulo-N operations. In Chaum and [Gil77] Bruce Gilchrist, editor. In- Price [CP87], pages 217– formation Processing 77: 226. ISBN 0-387-19102-X Proceedings of IFIP Congress (New York), 3-540-19102-X 77, Toronto, August 8–12, (Berlin). LCCN QA76.9.A25 1977. North-Holland, Am- E963 1987. sterdam, The Netherlands, 1977. ISBN 0-7204-0755-9. Gebhardt:2005:NPV LCCN ???? [GIS05] M. Gebhardt, G. Illies, and Gionis:1999:SSH W. Schindler. A note on the practical value of single hash [GIM99] Aristides Gionis, Piotr In- function collisions for special dyk, and Rajeev Mot- file formats. In NIST Cryp- wani. Similarity search tographic Hash Workshop in high dimensions via 2005, page ?? ????, ????, hashing. In Atkinson 2005. ISBN ???? LCCN ???? et al. [AOV+99], pages 518– URL http://csrc.nist. 529. ISBN 1-55860-615-7. gov/pki/HashWorkshop/2005/ LCCN QA76.9.D3 I559 1999. Oct31_Presentations/Illies_ URL http://www.vldb. NIST_05.pdf. 18 slides + 15- org/dblp/db/conf/vldb/ page paper. GionisIM99.html. Also Goldwasser:2002:DSN known as VLDB’99. Grassl:2011:CTZ [GJM02] Michael H. Goldwasser, David S. Johnson, and [GIMS11] Markus Grassl, Ivana Ilić, Catherine C. McGeoch, ed- Spyros Magliveras, and itors. Data structures, Rainer Steinwandt. Crypt- near neighbor searches, and analysis of the Tillich–Zémor methodology: fifth and sixth hash function. Journal DIMACS implementation REFERENCES 228

challenges: papers related LCCN QA76.6 .G7423 1981. to the DIMACS challenge US$10.00. on dictionaries and priority Greene:1982:MAA queues (1995–1996) and the DIMACS challenge on near [GK82] Daniel H. Greene and Don- neighbor searches (1998– ald E. Knuth. Mathemat- 1999),volume59ofDIMACS ics for the Analysis of Al- series in discrete mathemat- gorithms. Birkhäuser, Cam- ics and theoretical computer bridge, MA, USA; Berlin, science.AmericanMathe- Germany; Basel, Switzer- matical Society, Providence, land, second edition, 1982. RI, USA, 2002. ISBN 0-8218- ISBN 3-7643-3102-X. 123 pp. 2892-4 (hardcover). LCCN LCCN QA76.6 .G7423 1982. QA76.9.D35 D385 2002. Grewe:1994:ILM Graham:1979:HST [GK94] Lynne Grewe and Avi Kak. [GJR79] Susan L. Graham, William N. Interactive learning of mul- Joy, and O. Roubine. Hashed tiple attribute hash table symbol tables for languages for fast 3D object recogni- with explicit scope control. tion. In Kak and Ikeuchi In ACM SIGPLAN SCC [KI94], pages 17–27. ISBN ’79 [ACM79], pages 50–57. 0-8186-5310-8, 0-8186-5311- LCCN QA 76.7 A1095 v.14 6. LCCN TA1632 .C33 1994. pt.2. Grewe:1995:ILM Goto:1976:HLT [GK95] Lynne Grewe and Avinash C. Kak. Interactive learning of a [GK76] E. Goto and Y. Kanada. multiple-attribute hash table Hashing lemmas on time classifier for fast object recog- complexities with applica- nition. Computer vision and tion to formula manipula- image understanding: CVIU, tion. In Jenks [Jen76], 61(3):387–416, May 1995. page ?? LCCN QA155.7.E4 CODEN CVIUF4. ISSN A15 1976. US$20.00. 1077-3142 (print), 1090-235X Greene:1981:MAA (electronic). Garcia:2005:HJA [GK81] Daniel H. Greene and Don- ald E. Knuth. Mathemat- [GK05] P. Garcia and H. F. Ko- icsFortheAnalysisofAl- rth. Hash-join algorithms on gorithms. Birkhäuser, Cam- modern multithreaded com- bridge, MA, USA; Berlin, puter architectures. Re- Germany; Basel, Switzer- port LUCSE-05-001, Lehigh land, 1981. ISBN 3- University, Bethlehem, PA, 7643-3046-5. 107 pp. USA, ???? 2005. REFERENCES 229

Gueron:2008:VNF springer.com/article/10. 1007/s13389-012-0037-z. [GK08] Shay Gueron and Michael E. Gauravaram:2010:HFU Kounavis. Vortex: a new family of one-way hash func- [GKKT10] Praveen Gauravaram, John tions based on AES rounds Kelsey, Lars R. Knudsen, and carry-less multiplica- and Søren S. Thomsen. On tion. Lecture Notes in CS, hash functions using check- 5222:331–340, 2008. CO- sums. International Journal DEN LNCSD9. ISSN 0302- of Information Security, 9(2): 9743 (print), 1611-3349 (elec- 137–151, April 2010. CO- tronic). URL http://link. DEN ???? ISSN 1615- springer.com/content/pdf/ 5262 (print), 1615-5270 (elec- 10.1007/978-3-540-85886- tronic). URL http://link. 7_23. springer.com/article/10. 1007/s10207-009-0100-7. Gauravaram:2012:SAR Graham:1989:CM [GK12a] Praveen Gauravaram and [GKP89] Ronald L. Graham, Don- Lars R. Knudsen. Security ald E. Knuth, and Oren analysis of Randomize-Hash- Patashnik. Concrete Math- then-Sign digital signatures. ematics. Addison-Wesley, Journal of Cryptology,25 Reading, MA, USA, 1989. (4):748–779, October 2012. ISBN 0-201-14236-8. xiii CODEN JOCREQ. ISSN + 625 pp. LCCN QA39.2 0933-2790 (print), 1432- .G7331 1989. 1378 (electronic). URL http://www.springerlink. Graham:1994:CM com/openurl.asp?genre= [GKP94] Ronald L. Graham, Don- article&issn=0933-2790& ald E. Knuth, and Oren volume=25&issue=4&spage= Patashnik. Concrete Math- 748. ematics. Addison-Wesley, Gueron:2012:PMS Reading, MA, USA, second edition, 1994. ISBN 0-201- [GK12b] Shay Gueron and Vlad Kras- 55802-5. xiii + 657 pp. LCCN nov. Parallelizing message QA39.2 .G733 1994. schedules to accelerate the Ghosh:1973:ACW computations of hash functions. Journal of Crypto- [GL73] S. P. Ghosh and V. Y. Lum. graphic Engineering, 2(4): An analysis of collisions when 241–253, November 2012. hashing by division. Tech- CODEN ???? ISSN 2190- nical Report RJ-1218, IBM 8508 (print), 2190-8516 (elec- Corporation, San Jose, CA, tronic). URL http://link. USA, May 1973. REFERENCES 230

Gonnet:1982:EHL 60–67, June 2021. CO- DEN SRECD8. ISSN 0163- [GL82] G. H. Gonnet and P.-A. 5808 (print), 1943-5835 (elec- Larson. External hash- tronic). URL https:// ing with limited inter- dl.acm.org/doi/10.1145/ nal storage. In ACM- 3471485.3471500. PODS’82 [ACM82], pages Gong:2008:SIA 256–261. ISBN 0-89791-070- 2. LCCN QA76.9.D3 A33 [GLC08] Zheng Gong, Xuejia Lai, and 1982. US$24.00. Kefei Chen. A synthetic indiﬀerentiability analysis Gonnet:1988:EHL of some block-cipher-based [GL88] Gaston H. Gonnet and Per- hash functions. Designs, Ake˚ Larson. External hash- Codes, and Cryptography, ing with limited internal stor- 48(3):293–305, September age. Journal of the Asso- 2008. CODEN DCCREC. ciation for Computing Ma- ISSN 0925-1022 (print), chinery, 35(1):161–184, Jan- 1573-7586 (electronic). URL uary 1988. CODEN JA- http://www.springerlink. COAH. ISSN 0004-5411 com/openurl.asp?genre= (print), 1557-735X (elec- article&issn=0925-1022& tronic). volume=48&issue=3&spage= 293. Gennaro:2006:FPB Grembowski:2002:CAH [GL06] Rosario Gennaro and Yehuda [GLG+02] Tim Grembowski, Roar Lien, Lindell. A framework Kris Gaj, Nghi Nguyen, Pe- for password-based authen- ter Bellows, Jaroslav Flidr, ticated key exchange. ACM Tom Lehman, and Brian Transactions on Information Schott. Comparative anal- and System Security, 9(2): ysis of the hardware imple- 181–234, May 2006. CO- mentations of hash functions DEN ATISBQ. ISSN 1094- SHA-1 and SHA-512. Lec- 9224 (print), 1557-7406 (elec- ture Notes in CS, 2433:75– tronic). ??, 2002. CODEN LNCSD9. Gubner:2021:OCH ISSN 0302-9743 (print), 1611-3349 (electronic). URL [GLB21] Tim Gubner, Viktor Leis, http://link.springer-ny. and Peter Boncz. Optimisti- com/link/service/series/ cally compressed hash ta- 0558/bibs/2433/24330075. bles & strings in the USSR. htm; http://link.springer- SIGMOD Record (ACM Spe- ny.com/link/service/series/ cial Interest Group on Man- 0558/papers/2433/24330075. agement of Data), 50(1): pdf. REFERENCES 231

Garcia:2011:CPH 419–436, 2010. CODEN LNCSD9. ISSN 0302-9743 [GLHL11] Ismael Garc´ıa, Sylvain Lefeb- (print), 1611-3349 (elec- vre, Samuel Hornus, and tronic). URL http://link. Anass Lasram. Coherent springer.com/content/pdf/ parallel hashing. ACM 10.1007/978-3-642-12678- Transactions on Graphics, 9_25. 30(6):161:1–161:??, Decem- ber 2011. CODEN AT- Graefe:1991:SVH GRDF. ISSN 0730-0301 (print), 1557-7368 (elec- [GLS91] G. Graefe, A. Linville, and tronic). L. D. Shapiro. Sort versus hash revisited. Technical re- Goodman:2011:SHS port CU-CS-534-91, Univer- [GLJ11] Eric Goodman, M. Nicole sity of Colorado at Boulder, Lemaster, and Edward Jimenez. July 1991. 25 pp. Scalable hashing for shared memory supercomputers. In Graefe:1994:SVH Lathrop et al. [LCK11], pages 41:1–41:11. ISBN 1- [GLS94] G. Graefe, A. Linville, and 4503-0771-X. LCCN ???? L. D. Shapiro. Sort vs. hash revisited. IEEE Transactions Gong:2017:TMR on Knowledge and Data En- [GLLL17] Wei Gong, Jiangchuan Liu, gineering, 6(6):934–??, De- Kebin Liu, and Yunhao Liu. cember 1, 1994. CODEN IT- Toward more rigorous and KEEH. ISSN 1041-4347. practical cardinality estima- Gonnet:1977:AIH tion for large-scale RFID systems. IEEE/ACM Transac- [GM77] G. Gonnet and I. Munro. tions on Networking, 25(3): The analysis of an improved 1347–1358, June 2017. CO- hashing technique. In ACM- DEN IEANEP. ISSN 1063- TOC’77 [ACM77b], pages 6692 (print), 1558-2566 (elec- 113–121. tronic). Rehak:2008:IAD Gonnet:1979:EOH [GLM+10] Praveen Gauravaram, Ga¨etan [GM79] Gaston H. Gonnet and J. Ian Leurent, Florian Mendel, Munro. Eﬃcient ordering of Mar´ıa Naya-Plasencia, and hash tables. SIAM Jour- Thomas Peyrin. Cryptanal- nal on Computing, 8(3):463– ysis of the 10-round hash 478, ???? 1979. CO- and full compression func- DEN SMJCAT. ISSN 0097- tion of SHAvite-3-512. Lec- 5397 (print), 1095-7111 (elec- ture Notes in CS, 6055: tronic). REFERENCES 232

Gil:1991:FHP j/gcc.2018.10.issue-1/ gcc-2018-0002/gcc-2018- [GM91] Joseph Gil and Yossi Matias. 0002.xml. Fast hashing on a PRAM – Garcia-Molina:1990:ASI designing by expectation. In SDA’91 [SDA91], pages 271– [GMJ90] Hector Garcia-Molina and 280. LCCN QA76.9.A43 A34 H. V. Jagadish, editors. Pro- 199. Symposium held Jan. ceedings of the 1990 ACM 28–30, 1991, San Francisco, SIGMOD International Con- CA, USA. ference on Management of Data, May 23–25, 1990, At- Gil:1994:SFP lantic City, NJ. ACM Press, [GM94] J. Gil and Y. Matias. Sim- New York, NY 10036, USA, ple fast parallel hashing. 1990. ISBN 0-89791-365-5. Lecture Notes in CS, 820: LCCN QA 76.9 D3 S53 v.19 239–??, 1994. CODEN no.2 1990. LNCSD9. ISSN 0302-9743 Gardarin:1995:OFE (print), 1611-3349 (electronic). [GMP95] Georges Gardarin, Fernando Machuca, and Philippe Gil:1998:SFP Pucheral. OFL: a functional execution model for [GM98] Joseph Gil and Yossi Matias. object query languages. SIG- Simple fast parallel hashing MOD Record (ACM Spe- by oblivious execution. SIAM cial Interest Group on Man- Journal on Computing,27 agement of Data), 24(2): (5):1348–1375, October 1998. 59–70, May 1995. CO- CODEN SMJCAT. ISSN DEN SRECD8. ISSN 0163- 0097-5397 (print), 1095-7111 5808 (print), 1943-5835 (elec- (electronic). URL http:/ tronic). /epubs.siam.org/sam-bin/ dbq/article/29158. Gil:1990:AKC Ghaﬀari:2018:MSV [GMW90] Joseph Gil, Friedhelm Meyer auf der Heide, and Avi [GM18] Mohammad Hossein Ghaf- Wigderson. Not all keys can fari and Zohreh Mostaghim. be hashed in constant time. More secure version of a Cay- In ACM-TOC’90 [ACM90], ley hash function. Groups. pages 244–253. ISBN 0- Complexity. Cryptology,10 89791-361-2. LCCN ???? (1):29–??, May 2018. CO- Gall:1980:SIA DEN ???? ISSN 1867- 1144 (print), 1869-6104 (elec- [GN80] R. Gall and Manfred Nagl. tronic). URL https:// Software-implementation as- www.degruyter.com/view/ soziativer speicher. Technical REFERENCES 233

report, ????, Koblenz, Ger- 2015. CODEN ???? ISSN many, 1980. ?? pp. 1084-6654.

Gutmann:2005:WHC Goble:1975:FTR [Gob75] C. E. Goble. A free- [GNP05] P. Gutmann, D. Naccache, text retrieval system using and C. C. Palmer. When hash codes. The Com- hashes collide [applied cryp- puter Journal, 18(1):18– tography]. IEEE Secu- 20, February 1975. CO- rity & Privacy, 3(3):68– DEN CMPJA6. ISSN 71, May/June 2005. CO- 0010-4620 (print), 1460-2067 DEN ???? ISSN 1540- (electronic). URL http: 7993 (print), 1558-4046 //comjnl.oxfordjournals. (electronic). URL http: org/content/18/1/18.full. //ieeexplore.ieee.org/ pdf+html; http://www3. iel5/8013/31002/01439506. oup.co.uk/computer_journal/ pdf; http://ieeexplore. hdb/Volume_18/Issue_01/ ieee.org/xpls/abs_all. tiff/18.tif; http:// jsp?isnumber=31002&arnumber= www3.oup.co.uk/computer_ 1439506&count=20&index= journal/hdb/Volume_18/ 13. Issue_01/tiff/19.tif; Gauravaram:2007:USC http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [GO07] Praveen Gauravaram and 18/Issue_01/tiff/20.tif. Katsuyuki Okeya. An update on the side channel Golshani:1992:EIC cryptanalysis of MACs based [Gol92] Forouzan Golshani, editor. on cryptographic hash func- Eighth International Con- tions. Lecture Notes in CS, ference on Data Engineer- 4859:393–403, 2007. CO- ing: February 2–3, 1992, DEN LNCSD9. ISSN 0302- Tempe, Arizona. IEEE Com- 9743 (print), 1611-3349 (elec- puter Society Press, 1109 tronic). URL http://link. Spring Street, Suite 300, springer.com/content/pdf/ Silver Spring, MD 20910, 10.1007/978-3-540-77026- USA, 1992. ISBN 0- 8_31. 8186-2545-7 (paper) 0-8186- Grossi:2015:FCT 2546-5 (microﬁche) 0-8186- 2547-3 (hardcover). LCCN [GO15] Roberto Grossi and Giuseppe QA76.9.D3 I5582 1992. Ottaviano. Fast compressed Goldwasser:1994:P tries through path decompositions. ACM Journal of [Gol94] Shaﬁ Goldwasser, editor. Experimental Algorithmics, Proceedings: 35th Annual 19(??):1.8:1–1.8:??, February Symposium on Foundations REFERENCES 234

of Computer Science, Novem- unequal-probability keys. ber 20–22, 1994, Santa Fe, Journal of Computer and New Mexico. IEEE Com- System Sciences, 21(??):??, puter Society Press, 1109 1980. CODEN JCSSBM. Spring Street, Suite 300, Sil- ISSN 0022-0000 (print), ver Spring, MD 20910, USA, 1090-2724 (electronic). 1994. CODEN ASFPDV. ISBN 0-8186-6582-3. ISSN Gonnet:1981:ELL 0272-5428. LCCN QA 76 [Gon81] Gaston H. Gonnet. Ex- S979 1994. IEEE catalog pected length of the longest number 94CH35717. IEEE probe sequence in hash code Computer Society Press Or- searching. Journal of the der Number 6580-02. Association for Computing Gollmann:1996:FSE Machinery, 28(2):289–304, April 1981. CODEN JA- [Gol96] Dieter Gollmann, editor. Fast COAH. ISSN 0004-5411 software encryption: third in- (print), 1557-735X (elec- ternational workshop Cam- tronic). bridge, UK, February 21– 23, 1996: proceedings,vol- Gonnet:1983:UDB ume 1039 of Lecture Notes [Gon83] Gaston H. Gonnet. Un- in Computer Science. Spring- structured data bases or er-Verlag, Berlin, Germany / very eﬃcient text search- Heidelberg, Germany / Lon- ing. In ACM-PODS’83 don, UK / etc., 1996. CO- [ACM83b], pages 117–124. DEN LNCSD9. ISBN 3-540- ISBN 0-89791-097-4. LCCN 60865-6 (paperback). ISSN QA76.9.D3 A15 1983. US$25.00. 0302-9743 (print), 1611- 3349 (electronic). LCCN Gonnet:1984:HAD QA76.9.A25 F38 1996. [Gon84] Gaston H. Gonnet. Hand- Gonnet:1977:ALB book of Algorithms and Data Structures. International [Gon77] Gaston H. Gonnet. Aver- Computer Science Series. Ed- age lower bounds for open- itors: A. D. McGettrick and addressing hash coding. In J. van Leeuwen. Addison- Proceedings of a Conference Wesley, Reading, MA, USA, on Theoretical Computer Sci- 1984. ISBN 0-201-14218-X. ence, page ?? ????, ????, xi + 286 pp. LCCN QA76.6 1977. Is this [TWW77]???? .G636 1984. US$12.95. Gonnet:1980:OAH Gong:1995:CKH

[Gon80] Gaston H. Gonnet. Open- [Gon95] Li Gong. Collisionful keyed addressing hashing with hash functions with se- REFERENCES 235

lectable collisions. Infor- tronic). URL http://dlib. mation Processing Letters, computer.org/cs/books/ 55(3):167–170, August 11, cs1997/pdf/c4029.pdf; 1995. CODEN IFPLAT. http://www.computer.org/ ISSN 0020-0190 (print), cse/cs1998/c4029abs.htm. 1872-6119 (electronic). Gomez-Perez:2016:CCT Goto:1983:RSS [GPGO16] Domingo Gómez-Pérez, Jaime [Got83] Eiichi Goto, editor. RIMS Gutierrez, and Alina Ostafe. Symposia on Software Sci- Common composites of tri- ence and Engineering. Pro- angular polynomial systems ceedings of the Symposia. and hash functions. Jour- (Kyoto, Japan, 1982),vol- nal of Symbolic Computa- ume 147 of Lecture Notes in tion, 72(??):182–195, Jan- Computer Science. Springer- uary/February 2016. CO- Verlag, Berlin, Germany / DEN JSYCEH. ISSN 0747- Heidelberg, Germany / Lon- 7171 (print), 1095-855X don, UK / etc., 1983. ISBN (electronic). URL http: 0-387-11980-9 (New York), 3- //www.sciencedirect.com/ 540-11980-9 (Berlin). LCCN science/article/pii/S0747717115000140. QA76.6 .R55 1983. Gentry:2008:THL Gollapudi:2008:PTM [GPV08] Craig Gentry, Chris Peik- [GP08] Sreenivas Gollapudi and Rina ert, and Vinod Vaikun- Panigrahy. The power of tanathan. Trapdoors for two min-hashes for similar- hard lattices and new cryp- ity search among hierarchi- tographic constructions. In cal data objects. In Lenzerini ACM [ACM08b], pages 197– and Lembo [LL08], pages 206. ISBN 1-60558-047-3. 211–220. ISBN 1-59593-685- LCCN QA76.6 .A152 2008. X. LCCN ???? Greene:1994:MIHa Gueziec:1997:MIR [GPY94a] D. Greene, M. Parnas, and [GPA97] AndréP.Guéziec, Xavier F. Yao. Multi-index hash- Pennec, and Nicholas Ay- ing for information retrieval. ache. Medical image reg- In Goldwasser [Gol94], pages istration using geometric 722–731. CODEN ASFPDV. hashing. IEEE Computa- ISBN 0-8186-6582-3. ISSN tional Science & Engineer- 0272-5428. LCCN QA 76 ing, 4(4):29–41, October/ S979 1994. IEEE catalog December 1997. CODEN number 94CH35717. IEEE ISCEE4. ISSN 1070-9924 Computer Society Press Or- (print), 1558-190X (elec- der Number 6580-02. REFERENCES 236

Greene:1994:MIHb Graefe:1989:RDF

[GPY94b] D. Greene, M. Parnas, and [Gra89] Goetz Graefe. Relational F. Yao. Multi-index hash- division: Four algorithms ing for information retrieval. and their performance. In Annual Symposium on Foun- Proceedings of the Fifth In- dations of Computer Science ternational Conference on [papers], 35(??):722–??, 1994. Data Engineering, pages 94– ISSN 0272-5428. 101. IEEE Computer Soci- ety Press, 1109 Spring Street, Guillou:1995:ACE Suite 300, Silver Spring, MD [GQ95] L. C. Guillou and J.-J. 20910, USA, February 1989. Quisquater, editors. Ad- ISBN 0-8186-1915-5. LCCN vances in cryptology: EU- QA 76.9 D3 I5582 1989. ROCRYPT ’95: Workshop Available from IEEE Service on the theory and applica- Cent. Piscataway. tion of cryptographic tech- Graefe:1992:QPT niques — May 1995, Saint- Malo, France, number 921 [Gra92] G. Graefe. Query pro- in Lecture Notes in Com- cessing techniques for large puter Science. Springer-Ver- databases. Technical Report lag, Berlin, Germany / Hei- CU-CS-579-92, Department delberg, Germany / London, of Computer Science, Univer- UK / etc., 1995. ISBN 3- sity of Colorado at Boulder, 540-59409-4. ISSN 0302- January 1992. 87 pp. 9743 (print), 1611-3349 (electronic). LCCN QA76.9.A25 Graefe:1993:PEHa C794 1995. [Gra93a] G. Graefe. Performance en- Gray:1986:IJH hancements for hybrid hash join. Technical report, ????, [Gra86] P. M. D. Gray. Implement- 1993. ?? pp. ing joins by hashing on Co- dasyl DBMS. In Oxbor- Graefe:1993:PEHb row [Oxb86], pages 187–199. ISBN 0-521-33260-5. LCCN [Gra93b] G. Graefe. A performance QA76.9.D3 B75 1986. evaluation of histogram- driven recursive hybrid hash Graefe:1988:RDF join. Technical report, ????, August 1993. ?? pp. [Gra88] Goetz Graefe. Relational division: Four algorithms and Graefe:1993:QET their performance. Technical report, ????, Beaverton, OR, [Gra93c] Goetz Graefe. Query eval- USA, 1988. ?? pp. uation techniques for large REFERENCES 237

databases. ACM Com- Garcia-Retuerta:2019:CTV puting Surveys, 25(2):73– 170, June 1993. CODEN [GRBCC19] David Garc´ıa-Retuerta, Alvaro´ CMSVAN. ISSN 0360- Bartolom´e, Pablo Chamoso, 0300 (print), 1557-7341 (elec- and Juan Manuel Cor- tronic). chado. Counter-terrorism video analysis using hash- Graefe:1994:DAE based algorithms. Algo- rithms (Basel), 12(5), May [Gra94a] G. Graefe. Disk arrays for 2019. CODEN ALGOCH. external sorting and hybrid ISSN 1999-4893 (electronic). hash join. Technical report, URL https://www.mdpi. ????, 1994. ?? pp. com/1999-4893/12/5/110. Graefe:1994:SIW Gregg:1995:HFT [Gre95] X. Gregg. Hashing Forth: [Gra94b] G. Graefe. Sort-merge-join: It’s a topic discussed so non- An idea whose time has(h) chalantly that neophytes hes- passed? In IEEE [IEE94a], itate to ask how it works. pages 406–417. ISBN 0- Forth Dimensions, 17(4):13– 8186-5402-3, 0-8186-5400- ??, 1995. CODEN FODMD5. 7, 0-8186-5401-5. LCCN ISSN 0884-0822. QA76.9.D3 I5582 1994. Green:2021:HSH Graefe:1994:VEP [Gre21] Oded Green. HashGraph [Gra94c] G. Graefe. Volcano, an ex- — scalable hash tables us- tensible and parallel dataﬂow ing a sparse graph data struc- query processing system. ture. ACM Transactions on IEEE Transactions on Knowl- Parallel Computing (TOPC), edge and Data Engineering 8(2):11:1–11:17, June 2021. (to appear), ??(??):??, 1994. CODEN ???? ISSN 2329- 4949 (print), 2329-4957 (elec- Graefe:1999:VMJ tronic). URL https:// dl.acm.org/doi/10.1145/ [Gra99] Goetz Graefe. The value 3460872. of merge-join and hash-join Grech:2011:JGE in SQL server. In Atkin- son et al. [AOV+99], pages [GRF11] Neville Grech, Julian Rathke, 250–253. ISBN 1-55860- and Bernd Fischer. JEqual- 615-7. LCCN QA76.9.D3 ityGen: generating equality I559 1999. URL http: and hashing methods. SIG- //www.vldb.org/dblp/db/ PLAN Notices, 46(2):177– conf/vldb/Graefe99.html. 186, February 2011. CODEN Also known as VLDB’99. SINODQ. ISSN 0362-1340 REFERENCES 238

(print), 1523-2867 (print), Grosshans:1986:FSD 1558-1160 (electronic). [Gro86] Daniel Grosshans. File Sys- Grimson:1974:PSS tems: Design and Implemen- tation. Prentice-Hall, En- [Gri74] J. B. Grimson. A per- glewood Cliffs, NJ 07632, formance study of some di- USA, 1986. ISBN 0-13- rectory structures for large 314568-9. xiv + 482 pp. data files. Information Stor- LCCN QA76.9.F5 G76 1986. age and Retrieval, 10(11):??, US$38.95. 1974. Gopal:1993:CCH Griss:1977:EEE [GRZ93] R. D. Gopal, R. Ramesh, and S. Zionts. Criss-cross [Gri77] Martin L. Griss. Efficient expression evaluation in sparse hashing by page map zoning: An efficient system for bi- minor expansion, using hash- nary view generation. Tech- ing and deferred evalua- nical Report Working Paper tion. In Sprague and Chat- 851, SUNY Buffalo School tergy [SC77], pages 169–172. LCCN ?? of Management, Buffalo, NY, USA, March 1993. ?? pp. Griss:1979:HKR Guibas:1976:ADH

[Gri79] M. L. Griss. Hashing—the [GS76] L. J. Guibas and E. Sze- key to rapid pattern match- merédi. The analysis of dou- ing. Technical Report UUCS- ble hashing. In Guibas & Sze- 79-108, Computer Science meredi [ACM76], pages 187– Department, University of 191. Extended abstract. Utah, 1979. ?? pp. Guibas:1978:ADH Griebel:1998:ASG [GS78] L. J. Guibas and E. Sze- [Gri98] M. Griebel. Adaptive sparse merédi. The analysis of dou- grid multilevel methods for ble hashing. Journal of Com- elliptic PDEs based on fi- puter and System Sciences, nite differences. Comput- 16(2):226–274, April 1978. ing, 61(2):151–179, 1998. CODEN JCSSBM. ISSN CODEN CMPTA2. ISSN 0022-0000 (print), 1090-2724 0010-485X (print), 1436- (electronic). 5057 (electronic). URL Gori:1989:AAC http://www.springer.at/ journals/pdf/3571.pdf; [GS89] M. Gori and G. Soda. An http://www.springer.at/ algebraic approach to Ci- journals/pdf/3815.pdf. chelli’s perfect hashing. BIT REFERENCES 239

(Nordisk tidskrift for infor- http://link.springer-ny. mationsbehandling), 29(1):2– com/link/service/series/ 13, March 1989. CODEN 0558/bibs/2247/22470050. BITTEL, NBITAB. ISSN htm; http://link.springer- 0006-3835 (print), 1572- ny.com/link/service/series/ 9125 (electronic). URL 0558/papers/2247/22470050. http://www.springerlink. pdf. com/openurl.asp?genre= article&issn=0006-3835& Goto:1982:DLM volume=29&issue=1&spage= [GSI+82] E. Goto, T. Soma, N. In- . 2 ada, M. Idesawa, K. Hi- Girault:1994:LCH raki, M. Suzuki, K. Shimizu, and B. Philipov. Design of [GS94] M. Girault and J. Stern. On a Lisp machine – FLATS. the length of cryptographic In LFP82 [LFP82], pages hash-values used in identi- 208–215. ISBN 0-89791-082- ﬁcation schemes. Lecture 6. LCCN QA76.73.L23 A26 Notes in CS, 839:202–215, 1982. US$26.00. The pa- 1994. CODEN LNCSD9. pers were not formally refer- ISSN 0302-9743 (print), eed but were accepted on the 1611-3349 (electronic). bases of extended abstracts. Gupta:1994:RSD Gope:2017:ASS

[GSB94] Rajiv Gupta, Scott A. [GSL17] Dibakar Gope, David J. Smolka, and Shaji Bhaskar. Schlais, and Mikko H. Li- On randomization in sequen- pasti. Architectural support tial and distributed algo- for server-side PHP process- rithms. ACM Computing ing. ACM SIGARCH Com- Surveys, 26(1):7–86, March puter Architecture News,45 1994. CODEN CMSVAN. (2):507–520, May 2017. CO- ISSN 0360-0300 (print), DEN CANED2. ISSN 0163- 1557-7341 (electronic). 5964 (print), 1943-5851 (electronic). Goi:2001:IHF Galli:2001:THO [GSC01] B.-M. Goi, M. U. Siddiqi, and H.-T. Chuah. Incre- [GSS01] N. Galli, B. Seybold, and mental hash function based K. Simon. Tetris-hashing or on pair chaining & modular optimal table compression. arithmetic combining. Lec- Discrete Applied Mathemat- ture Notes in CS, 2247:50– ics, 110(1):41–58, June 1, ??, 2001. CODEN LNCSD9. 2001. CODEN DAMADU. ISSN 0302-9743 (print), ISSN 0166-218X (print), 1611-3349 (electronic). URL 1872-6771 (electronic). REFERENCES 240

Ganguly:1990:FPP ing — 3. MTAC — Math- ematical Tabulative Auto- [GST90] Sumit Ganguly, Avi Silber- matic Computing. Journal schatz, and Shalom Tsur. of the Information Process- A framework for the par- ing Society of Japan, 3(1): allel processing of Datalog 23–30, ???? 1980. CODEN queries. SIGMOD Record JIPRDE. ISSN 0387-6101. (ACM Special Interest Group on Management of Data),19 Griswold:1993:DID (2):143–152, June 1990. CO- [GT93] William G. Griswold and DEN SRECD8. ISSN 0163- Gregg M. Townsend. The de- 5808 (print), 1943-5835 (elec- sign and implementation of tronic). dynamic hashing for sets and Gupta:1998:PTF tables in Icon. Software— Practice and Experience, [GSW98] Ashish Gupta, Oded Shmueli, 23(4):351–367, April 1993. and Jennifer Widom, ed- CODEN SPEXBL. ISSN itors. Proceedings of the 0038-0644 (print), 1097-024X Twenty-fourth International (electronic). Conference on Very Large Databases, New York, NY, Guerraoui:2016:OCO USA, 24–27 August, 1998. [GT16] Rachid Guerraoui and Vasileios Morgan Kaufmann Publish- Trigonakis. Optimistic con- ers, San Francisco, CA, 1998. currency with OPTIK. SIG- ISBN 1-55860-566-5. LCCN PLAN Notices, 51(8):18:1– QA76.9.D3 I559 1998. Also 18:??, August 2016. CODEN known as VLDB. SINODQ. ISSN 0362-1340 Greniewski:1963:ELK (print), 1523-2867 (print), 1558-1160 (electronic). [GT63] M. Greniewski and W. Turski. The external language KLIPA Guibas:1975:HTE for the URAL-2 digital computer. Communications of [Gui75] Leo J. Guibas. Hashing tech- the Association for Com- niques that exhibit secondary puting Machinery, 6(6):322– or tertiary clustering. In 324, June 1963. CODEN USA-Jpn Comput Conf, 2nd, CACMA2. ISSN 0001- Proc, pages 324–328. AFIPS, 0782 (print), 1557-7317 (elec- Montvale, NJ, 1975. tronic). Early work on Guibas:1976:AHAa derivation of hash functions. Goto:1980:SHM [Gui76a] Leo J. Guibas. The Anal- ysis of Hashing Algorithms. [GT80] Eiichi Goto and Motoaki PhD thesis, Stanford Univer- Terashima. Studies on hash- sity, Stanford, CA, USA, Au- REFERENCES 241

gust 1976. ?? pp. See in the 1990’s. Proceedings [Gui76b]. 1989 ACM Seventeenth An- nual Computer Science Con- Guibas:1976:AHAb ference (Feb 21–23 1989: [Gui76b] Leo J. Guibas. The analysis Louisville, KY, USA), pages of hashing algorithms. Tech- 409–?? ACM Press, New nical Report TR STAN-CS- York, NY 10036, USA, 1989. 76-556, Stanford University, ISBN 0-89791-299-3. LCCN Stanford, CA, USA, August ???? 1976. ?? pp. This is the au- Gurski:1973:NAK thor’s Ph.D. thesis, [Gui76a]. [Gur73] Aaron Gurski. A note Guibas:1976:AHAc on analysis of keys for use [Gui76c] Leo J. Guibas. The anal- in hashing. BIT (Nordisk ysis of hashing algorithms tidskrift for informations- that exhibit k-ary clustering. behandling), 13(1):120–122, In IEEE-FOCS’76 [IEE76], 1973. CODEN BITTEL, pages 183–196. NBITAB. ISSN 0006-3835 (print), 1572-9125 (elec- Guibas:1978:AHT tronic).

[Gui78] Leo J. Guibas. The anal- Garcia:2008:SCC ysis of hashing techniques that exhibit k-ary clustering. [GvR08] Flavio D. Garcia and Peter Journal of the Association van Rossum. Sound and com- for Computing Machinery,25 plete computational interpre- (4):544–555, October 1978. tation of symbolic hashes in CODEN JACOAH. ISSN the standard model. Theoret. 0004-5411 (print), 1557-735X Comput. Sci., 394(1–2):112– (electronic). 133, March 31, 2008. CO- DEN TCSCDI. ISSN 0304- Guinier:1989:FUA 3975 (print), 1879-2294 (elec- [Gui89] Daniel Guinier. A fast uni- tronic). form ‘astronomical’ random Goldreich:1994:TFF number generator. SIGSAC Review, 7(1):1–13, Spring [GW94] O. Goldreich and A. Wigder- 1989. CODEN SSARE7. son. Tiny families of func- ISSN 0277-920X (print), tions with random proper- 1558-0261 (electronic). ties: a quality-size trade-oﬀ Gupta:1989:SHI for hashing. Proceedings of the ... annual ACM Sym- [Gup89] Govind Gupta. Sort- posium on Theory of Com- ing by hashing and insert- puting, 26(??):574–??, 1994. ing. In Computing Trends ISSN 0737-8017. REFERENCES 242

Gadia:1991:IIT 25(11):2794–2803, Novem- ber 2014. CODEN ITD- [GY91] Shashi K. Gadia and Chuen- SEO. ISSN 1045-9219 Sing Yeung. Inadequacy of (print), 1558-2183 (elec- interval timestamps in tem- tronic). URL http://www. poral databases. Information computer.org/csdl/trans/ sciences, 54(1/2):1–??, 1991. td/2014/11/06654169-abs. CODEN ISIJBC. ISSN 0020- html. 0255 (print), 1872-6291 (elec- Hachem:1993:AAP tronic).

Guo:2019:EER [Hac93] Nabil I. Hachem. An approximate analysis of the per- [GYW+19] Y. Guo, X. Yuan, X. Wang, formance of extendible hash- C. Wang, B. Li, and X. Jia. ing with elastic buckets. In- Enabling encrypted rich formation Processing Letters, queries in distributed key– 48(1):13–20, October 1993. value stores. IEEE Trans- CODEN IFPLAT. ISSN actions on Parallel and Dis- 0020-0190 (print), 1872-6119 tributed Systems, 30(6):1283– (electronic). 1297, June 2019. CO- Harbi:2016:ASQ DEN ITDSEO. ISSN 1045- 9219 (print), 1558-2183 (elec- [HAK+16] Razen Harbi, Ibrahim Ab- tronic). delaziz, Panos Kalnis, Nikos Griebel:1999:PMA Mamoulis, Yasser Ebrahim, and Majed Sahli. Acceler- [GZ99] M. Griebel and G. Zum- ating SPARQL queries by busch. Parallel multigrid exploiting hash-based local- in an adaptive PDE solver ity and adaptive partition- based on hashing and space- ing. VLDB Journal: Very ﬁlling curves. Parallel Com- Large Data Bases, 25(3):355– puting, 25(7):827–843, July 380, June 2016. CODEN 1999. CODEN PACOEJ. VLDBFR. ISSN 1066-8888 ISSN 0167-8191 (print), (print), 0949-877X (elec- 1872-7336 (electronic). tronic).

Guo:2014:CHS Harbi:2015:ESQ

[GZX14] Song Guo, Deze Zeng, and [HAKM15] Razen Harbi, Ibrahim Ab- Yang Xiang. Chameleon delaziz, Panos Kalnis, and hashing for secure and Nikos Mamoulis. Evaluat- privacy-preserving vehicu- ing SPARQL queries on mas- lar communications. IEEE sive RDF datasets. Pro- Transactions on Parallel ceedings of the VLDB En- and Distributed Systems, dowment, 8(12):1848–1851, REFERENCES 243

August 2015. CODEN (electronic). URL http: VLDBFR. ISSN 2150-8097. //www.sciencedirect.com/ Halunen:2012:MGB science/article/pii/S0020019017301266.

[Hal12] Kimmo Halunen. Multicolli- Harrison:1971:IST sions and graph-based hash [Har71a] M. C. Harrison. Implementa- functions. Lecture Notes in tion of the substring test by CS, 7222:156–167, 2012. CO- hashing. Communications of DEN LNCSD9. ISSN 0302- the Association for Comput- 9743 (print), 1611-3349 (elec- ing Machinery, 14(12):777– tronic). URL http://link. 779, December 1971. CO- springer.com/chapter/10. DEN CACMA2. ISSN 0001- 1007/978-3-642-32298-3_ 0782 (print), 1557-7317 (elec- 11/. tronic). See also [TT82]. Hamer:2002:HR Harrison:1971:DSP [Ham02] John Hamer. Hashing revisited. SIGCSE Bul- [Har71b] Malcolm C. Harrison. Data letin (ACM Special Inter- Structures and Programming. est Group on Computer Sci- Courant Institute of Mathe- ence Education), 34(3):80– matical Sciences, New York 83, September 2002. CO- University, New York, NY, DEN SIGSD3. ISSN 0097- USA, April 1971. xii + 381 8418 (print), 2331-3927 (elec- pp. LCCN QA76.5 .H37. See tronic). also [Har73].

Hanson:1990:PMAa Harrison:1973:DSP

[Han90] E. N. Hanson. A predi- [Har73] Malcolm C. Harrison. Data- cate matching algorithm for structures and Programming. database rule systems. Tech- Scott, Foresman and Com- nical Report WSU-CS-90-01, pany, Glenview, IL, USA, Washington State University, 1973. ISBN 0-673-05964-2. 1990. ?? pp. 322 pp. LCCN QA76.6 .H37. See [Har71b]. Han:2017:CPW Harris:1985:INL [Han17] Yijie Han. Construct a perfect word hash function [Har85] Mary Dee Harris. Intro- in time independent of the duction to Natural Language size of integers. Informa- Processing. Reston Publish- tion Processing Letters, 128 ing Co. Inc., Reston, VA, (??):5–10, December 2017. USA, 1985. ISBN 0-8359- CODEN IFPLAT. ISSN 3254-0. xv + 368 pp. 0020-0190 (print), 1872-6119 LCCN QA76.9.I58 H37 1985. REFERENCES 244

US$27.95. Hashing is dis- files derived from linear hash- cussed in Part II. ing. In FIFTH INTERNA- Harbron:1988:FSS TIONAL CONFERENCE ON DATA ENGINEERING [Har88] Thomas R. Harbron. File (Feb 6–10 1989: Los Ange- Systems: Structures and Al- les, CA, USA), pages 305– gorithms. Prentice-Hall, En- 2. IEEE Computer Society glewood Cliffs, NJ 07632, Press, 1109 Spring Street, USA, 1988. ISBN 0-13- Suite 300, Silver Spring, MD 314709-6. xv + 254 pp. 20910, USA, 1989. ISBN LCCN QA76.9.F5 H37 1988. 0-8186-1915-5. LCCN ???? US$33.00. Available from IEEE Service Harari:1997:HHF Cent. Piscataway. Hecker:1989:IGH [Har97] S. Harari. HCC: a hash function using error correct- [HB89c] Yaron C. Hecker and Ruud M. ing codes. Lecture Notes in Bolle. Is Geometric Hashing CS, 1355:110–??, 1997. CO- a Hough Transform? Techni- DEN LNCSD9. ISSN 0302- cal Report RC 15202(#67767), 9743 (print), 1611-3349 (elec- IBM Research Division, T. tronic). J. Watson Research Center, 1989. ?? pp. Hashida:1972:AM Hachem:1992:NOP [Has72] O. Hashida. Analysis of multiqueue. Rev. of the El. Com- [HB92] N. I. Hachem and P. B. mun. Lab., 20(??):189–199, Berra. New order preserv- 1972. ing access methods for very Hachem:1989:KSA large files derived from linear hashing. IEEE Transactions [HB89a] N. I. Hachem and B. P. on Knowledge and Data En- Berra. Key-sequential ac- gineering, 4(1):68–82, Febru- cess methods for very large ary 1, 1992. CODEN IT- files derived from linear hash- KEEH. ISSN 1041-4347. ing. In Proceedings of the Hariri:1993:PIC Fifth International Confer- ence on Data Engineering, [HB93] Salim Hariri and P. Bruce pages 305–312. ????, Los An- Berra, editors. Proceedings of geles,CA,USA,February the 1993 International Con- 1989. ference on Parallel Process- Hachem:1989:KAM ing, August 16–20, 1993/ sponsored by the Pennsylva- [HB89b] Nabil I. Hachem and P. Bruce nia State University. Boca Berra. Key-sequential ac- Raton, FL,volume3.Al- cess methods for very large gorithms and applications. REFERENCES 245

CRC Press, 2000 N.W. Cor- Horspool:1987:HCT porate Blvd., Boca Raton, FL 33431-9868, USA, 1993. [HC87] R. Nigel Horspool and Gor- ISBN 0-8493-8983-6 (set), 0- don V. Cormack. Hashing as 8493-8984-4 (vol. 1), 0-8493- a compaction technique for 8985-2 (vol. 2), 0-8493-8986-0 LR parser tables. Software— (vol. 3). LCCN QA76.58 .I55 Practice and Experience, 1993. 17(6):413–416, June 1987. CODEN SPEXBL. ISSN Hecker:1994:GHG 0038-0644 (print), 1097-024X (electronic). [HB94] Y. C. Hecker and R. M. Bolle. On geometric hashing and Holt:2002:MAR the generalized Hough trans- [HC02] John D. Holt and Soon M. form. IEEE Trans. Systems, Chung. Mining association Man, and Cybernetics, 24(9): rules using inverted hashing 1328–??, September 1, 1994. and pruning. Information CODEN ISYMAW. ISSN Processing Letters, 83(4): 0018-9472, 1083-4427. 211–220, August 31, 2002. Hulsing:2017:XEH CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 [HBG+17] A. H¨ulsing, D. Butin, (electronic). S. Gazdag, J. Rijneveld, Holt:2007:PMA and A. Mohaisen. XMSS: Extended hash-based sig- [HC07] John D. Holt and Soon M. natures. Web document, Chung. Parallel mining July 24, 2017. URL of association rules from http://datatracker.ietf. text databases. The Jour- org/doc/draft-irtf-cfrg- nal of Supercomputing,39 xmss-hash-based-signature. (3):273–299, March 2007. CODEN JOSUED. ISSN Hoang:2010:CAN 0920-8542 (print), 1573- 0484 (electronic). URL [HBL+10] Giang Hoang, Chang Bae, http://www.springerlink. John Lange, Lide Zhang, Pe- com/openurl.asp?genre= ter Dinda, and Russ Joseph. article&issn=0920-8542& A case for alternative nested volume=39&issue=3&spage= paging models for virtualized 273. systems. IEEE Computer Hedayatpour:2011:HFB Architecture Letters, 9(1):17– 20, January/June 2010. CO- [HC11] S. Hedayatpour and S. Chuprat. DEN ???? ISSN 1556- Hash functions-based ran- 6056 (print), 1556-6064 (elec- dom number generator with tronic). image data source. In 2011 REFERENCES 246

IEEE Conference on Open [Ano95c], page ???? ISBN Systems (ICOS), pages 69– ???? LCCN ???? 73. IEEE Computer Society Hasan:2006:CSE Press, 1109 Spring Street, Suite 300, Silver Spring, MD [HCJC06] Jahangir Hasan, Srihari 20910, USA, 2011. URL Cadambi, Venkatta Jakkula, http://ieeexplore.ieee. and Srimat Chakradhar. org/stamp/stamp.jsp?tp=& Chisel: a storage-eﬃcient, arnumber=6079248. collision-free hash-based network processing architec- Hsiao:2013:SLB ture. ACM SIGARCH Com- [HC13] Hung-Chang Hsiao and Che- puter Architecture News,34 Wei Chang. A symmet- (2):203–215, 2006. CO- ric load balancing algorithm DEN CANED2. ISSN 0163- with performance guaran- 5964 (print), 1943-5851 (elec- tees for distributed hash ta- tronic). bles. IEEE Transactions Hanson:1990:PMAb on Computers, 62(4):662– 675, April 2013. CO- [HCKW90] Eric N. Hanson, Moez DEN ITCOB4. ISSN 0018- Chaabouni, Chang-Ho Kim, 9340 (print), 1557-9956 (elec- and Yu-Wang Wang. A pred- tronic). icate matching algorithm for database rule systems. SIG- Healy:2014:AKM MOD Record (ACM Spe- cial Interest Group on Man- [HC14] John Healy and Desmond agement of Data), 19(2): Chambers. Approximate k- 271–280, June 1990. CO- mer matching using fuzzy DEN SRECD8. ISSN 0163- hash maps. IEEE/ACM 5808 (print), 1943-5835 (elec- Transactions on Computa- tronic). URL http://www. tional Biology and Bioin- acm.org/pubs/articles/ formatics, 11(1):258–264, proceedings/mod/93597/ January 2014. CODEN p271-hanson/p271-hanson. ITCBCY. ISSN 1545-5963 pdf; http://www.acm. (print), 1557-9964 (elec- org/pubs/citations/proceedings/ tronic). mod/93597/p271-hanson/. Hart:1995:SHC Hernandez-Castro:2012:AFH [HCF95] John C. Hart, Wayne O. [HCPLSB12] Julio Cesar Hernandez- Cochran, and Patrick J. Castro, Pedro Peris-Lopez, Flynn. Similarity hashing: a Masoumeh Safkhani, and Na- computer vision solution to sour Bagheri. Another fallen the inverse problem of lin- hash-based RFID authentica- ear fractals. In Anonymous tion protocol. Lecture Notes REFERENCES 247

in CS, 7322:29–37, 2012. CO- 9219 (print), 1558-2183 (elec- DEN LNCSD9. ISSN 0302- tronic). URL http://dlib. 9743 (print), 1611-3349 (elec- computer.org/td/books/ tronic). URL http://link. td1997/pdf/l0872.pdf; springer.com/chapter/10. http://www.computer.org/ 1007/978-3-642-30955-7_ tpds/td1997/l0872abs.htm. 4/. Hopgood:1972:QHM Hu:2021:PMH [HCW+21] Daokun Hu, Zhiwen Chen, [HD72] F. R. A. Hopgood and Jianbing Wu, Jianhua Sun, J. Davenport. The quadratic and Hao Chen. Per- hash method when the ta- sistent memory hash in- blesizeisapowerof2. dexes: an experimental eval- The Computer Journal,15 uation. Proceedings of the (4):314–315, November 1972. VLDB Endowment, 14(5): CODEN CMPJA6. ISSN 785–798, January 2021. CO- 0010-4620 (print), 1460-2067 DEN ???? ISSN 2150- (electronic). URL http:// 8097. URL https:// www3.oup.co.uk/computer_ dl.acm.org/doi/10.14778/ journal/hdb/Volume_15/ 3446095.3446101. Issue_04/150314.sgm.abs. Hsiao:1994:PEM html; http://www3.oup. co.uk/computer_journal/ [HCY94] Hui-I Hsiao, Ming-Syan hdb/Volume_15/Issue_04/ Chen, and Philip S. Yu. On tiff/314.tif; http:// parallel execution of mul- www3.oup.co.uk/computer_ tiple pipelined hash joins. journal/hdb/Volume_15/ SIGMOD Record (ACM Spe- Issue_04/tiff/315.tif.See cial Interest Group on Man- correspondence [PH73]. agement of Data), 23(2): 185–196, June 1994. CO- Hanna:2009:CEE DEN SRECD8. ISSN 0163- 5808 (print), 1943-5835 (elec- [HDCM09] Michel Hanna, Socrates tronic). Demetriades, Sangyeun Cho, and Rami Melhem. CHAP: Hsiao:1997:PEH Enabling eﬃcient hardware- [HCY97] Hui-I Hsiao, Ming-Syan based multiple hash schemes Chen, and P. S. Yu. Par- for IP lookup. Lec- allel execution of hash joins ture Notes in CS, 5550: in parallel databases. IEEE 756–769, 2009. CODEN Transactions on Parallel and LNCSD9. ISSN 0302-9743 Distributed Systems, 8(8): (print), 1611-3349 (elec- 872–883, August 1997. CO- tronic). URL http://link. DEN ITDSEO. ISSN 1045- springer.com/content/pdf/ REFERENCES 248

10.1007/978-3-642-01399- Decision Sciences, 2:401–??, 7_59. 1982. CODEN PAMSED. Hanna:2011:AHS Hejlsberg:1989:COT

[HDCM11] Michel Hanna, Socrates [Hej89] Anders Hejlsberg. Container Demetriades, Sangyeun Cho, object types in Turbo Pascal. and Rami Melhem. Ad- Dr. Dobbs Journal, 14(11): vanced hashing schemes for 56–??, November 1, 1989. packet forwarding using set CODEN DDJOEB. ISSN associative memory architec- 1044-789X. tures. Journal of Parallel and Hekmatpour:1989:LPI Distributed Computing,71 (1):1–15, January 2011. CO- [Hek89] Sharam Hekmatpour. LISP: DEN JPDCER. ISSN 0743- a Portable Implementation. 7315 (print), 1096-0848 (elec- Prentice-Hall, Englewood tronic). Cliﬀs, NJ 07632, USA, 1989. ISBN 0-13-537490-1. viii + He:1987:PAS 177 pp. LCCN QA 76.73 L23 H47 1989. US$54.80. De- [He87] Guo He. Pipelined Array Sys- scribes a hashed symbol ta- tem for Relational Database ble. Operations. IEEE Com- puter Society Press, 1109 Heller:1989:EH Spring Street, Suite 300, Sil- [Hel89] Steve Heller. Extensible ver Spring, MD 20910, USA, hashing. Dr. Dobbs Journal, 1987. ISBN 0-8186-0780-7. 14(11):66, 69–70, 116, 118, 795–801 pp. LCCN QA75.5 120–121, November 1, 1989. .I5761 1987. IEEE Service CODEN DDJOEB. ISSN Cent. Piscataway, NJ, USA. 1044-789X. Healey:1972:CEP Heller:1991:MHY [Hea72] M. J. R. Healey. Check- [Hel91] Steve Heller. Making a hash ing the execution of programs of your data. Computer Lan- by hashing. IBM Technical guage Magazine, 8(8):47–??, Disclosure Bulletin, 15(7):??, August 1, 1991. CODEN December 1972. CODEN COMLEF. ISSN 0749-2839. IBMTAA. ISSN 0018-8689. Helleseth:1994:ACE Headrick:1982:HRS [Hel94] Tor Helleseth, editor. Ad- [Hea82] R. Wayne Headrick. Hash- vances in Cryptology, EURO- ing routine selection: a quan- CRYPT ’93: Workshop on titative methodology. Pro- the Theory and Application ceedings — Annual Meeting of Cryptographic Techniques, of the American Institute for Lofthus, Norway, May 1993: REFERENCES 249

Proceedings, volume 765 ACM SIGMOD international of Lecture Notes in Com- conference on management of puter Science. Springer-Ver- data, and SIGMOD/PODS lag, Berlin, Germany / Hei- 2013 PhD symposium: June delberg, Germany / London, 22–27, 2013, New York, New UK / etc., 1994. ISBN 0-387- York, USA. ACM Press, 57600-2 (New York), 3-540- New York, NY 10036, USA, 57600-2 (Berlin). ISSN 0302- 2013. ISBN 1-4503-2066-X, 9743 (print), 1611-3349 (elec- 1-4503-2037-6. LCCN ???? tronic). LCCN QA76.9.A25 URL http://dl.acm.org/ E964 1993. citation.cfm?id=2463664; Herbert:2007:WHP http://www.sigmod.org/ 2013/. [Her07] Andrew Herbert. What hap- Huang:2017:QAL pened to Pastry. Operat- ing Systems Review, 41(2): [HFF+17] Qiang Huang, Jianlin Feng, 10–16, April 2007. CODEN Qiong Fang, Wilfred Ng, OSRED8. ISSN 0163-5980 and Wei Wang. Query- (print), 1943-586X (elec- aware locality-sensitive hash- tronic). ing scheme for lp norm. VLDB Journal: Very Large Heuer:1987:WRD Data Bases, 26(5):683–708, [Heu87] Andreas Heuer, editor. Work- October 2017. CODEN shop on Relational Databases VLDBFR. ISSN 1066-8888 and Their Extensions. ??, (print), 0949-877X (elec- Clausthal-Zellerfeld, 1987. tronic). Herrin:1991:ADF Huang:2015:QAL

[HF91] Erin H. Herrin II and [HFZ+15] Qiang Huang, Jianlin Feng, Raphael Finkel. An ASCII Yikai Zhang, Qiong Fang, database for fast queries of and Wilfred Ng. Query-aware relatively stable data. Com- locality-sensitive hashing for puting Systems, 4(2):127– approximate nearest neigh- 155, Spring 1991. CODEN bor search. Proceedings of CMSYE2. ISSN 0895-6340. the VLDB Endowment, 9(1): 1–12, September 2015. CO- Hull:2013:SPC DEN ???? ISSN 2150-8097. [HF13] Richard Hull and Wen- Hikita:1977:AFP fei Fan, editors. SIG- MOD/PODS’13: compila- [HG77] R. Hikita and E. Goto. An tion proceedings of the 2013 O(N) algorithm for ﬁnd- ACM Symposium on Prin- ing periodicity of a sequence ciples of Database Systems, using hash coding. In- REFERENCES 250

formation Processing Let- Harn:2010:ELL ters, 6(2):69–71, 1977. CO- DEN IFPLAT. ISSN 0020- [HHL10] Lein Harn, Wen-Jung Hsin, 0190 (print), 1872-6119 (elec- and Changlu Lin. Ef- tronic). ficient on-line/off-line signature schemes based on Lai:2009:CCD multiple-collision trapdoor hash families. The Com- [HGH+12] Jiao Hui, Xiongzi Ge, Xi- puter Journal, 53(9):1478– aoxia Huang, Yi Liu, and 1484, November 2010. CO- Qiangjun Ran. E-HASH: DEN CMPJA6. ISSN an energy-efficient hybrid 0010-4620 (print), 1460-2067 storage system composed (electronic). URL http: of one SSD and multiple //comjnl.oxfordjournals. HDDs. Lecture Notes in CS, org/content/53/9/1478. 7332:527–534, 2012. CO- full.pdf+html. DEN LNCSD9. ISSN 0302- Haitner:2010:UOW 9743 (print), 1611-3349 (electronic). URL http://link. [HHR+10] Iftach Haitner, Thomas springer.com/content/pdf/ Holenstein, Omer Reingold, 10.1007/978-3-642-31020- Salil Vadhan, and Hoeteck 1_63. Wee. Universal one-way hash functions via inaccessible en- Hendricks:2007:LOB tropy. Lecture Notes in CS, [HGR07] James Hendricks, Gregory R. 6110:616–637, 2010. CO- Ganger, and Michael K. Re- DEN LNCSD9. ISSN 0302- iter. Low-overhead Byzantine 9743 (print), 1611-3349 (elec- fault-tolerant storage. Op- tronic). URL http://link. erating Systems Review,41 springer.com/content/pdf/ (6):73–86, December 2007. 10.1007/978-3-642-13190- CODEN OSRED8. ISSN 5_31. 0163-5980 (print), 1943-586X Hill:1978:CSVb (electronic). [Hil78a] Edward Hill, Jr. ACom- Hester:1985:SOL parative Study of Very Large Data Bases. Springer-Ver- [HH85] J. H. Hester and D. S. lag, Berlin, Germany / Hei- Hirschberg. Self-organizing delberg, Germany / London, linear search. ACM Com- UK / etc., 1978. ISBN 0-387- puting Surveys, 17(3):295, 08653-6. x + 140 pp. LCCN September 1985. CODEN QA76.9.D3 H54 1978. A re- CMSVAN. ISSN 0360- vision of the author’s thesis, 0300 (print), 1557-7341 (elec- George Washington Univer- tronic). sity, 1977. REFERENCES 251

Hill:1978:CSVa Hinsen:2020:MCA

[Hil78b] Edward Hill.Jr. A compara- [Hin20] K. Hinsen. The magic tive study of very large data of content-addressable stor- bases. Technical report, ????, age. Computing in Sci- Berlin, Germany, 1978. ?? ence and Engineering,22 pp. (3):113–119, 2020. CODEN CSENFA. ISSN 1521-9615 Hildebrandt:1982:VBD (print), 1558-366X (electronic). [Hil82] F. Hildebrandt. Ver- gleichende bewertung dy- Herschel:1975:WHC namischer hash-verfahren [HJ75] R. Herschel and B. Jonsson. durch simulation. Mas- Was ist Hash-coding? (Ger- ter’s thesis, Technischen Uni- man) [what is hash-coding?]. versit¨at Carolo-Wilhelmina Elektronische Rechenanlagen zu Braunschweig, Braun- mit Computer Praxis, 17(4): schweig, Germany, 1982. ?? 131–138, June 1975. CODEN pp. ERCPDJ. Hille:1988:DAP Helleseth:1996:UHF

[Hil88] Reinhold F. Hille. Data Ab- [HJ96] T. Helleseth and T. Johans- straction and Program Devel- son. Universal hash func- opment using Pascal.Ad- tions from exponential sums vances in Computer Science over finite fields and Galois Series. Prentice-Hall, En- rings. Lecture Notes in CS, glewood Cliffs, NJ 07632, 1109:31–??, ???? 1996. CO- USA, 1988. ISBN 0-13- DEN LNCSD9. ISSN 0302- 196552-2. xi + 259 pp. 9743 (print), 1611-3349 (elec- LCCN QA76.9.A23 H55 tronic). 1988. US$42.00. Chapter 6 discusses hash tables. Hopcroft:1983:HCG Hilley:2005:CRM [HK83] J. E. Hopcroft and M. S. Kr- ishnamoorthy. On the har- [Hil05] Sarah Hilley. Crypto race monious coloring of graphs. for mathematical infinity. SIAM Journal of Algebraic Network Security, 2005(4): Discrete Methods, 4(3):306– 10–11, April 2005. CO- 311, September 1983. CO- DEN NTSCF5. ISSN DEN SJAMDU. ISSN 1353-4858 (print), 1872-9371 0196-5212 (print), 2168-345X (electronic). URL http: (electronic). Work related to //www.sciencedirect.com/ minimal perfect hash func- science/article/pii/S1353485805702233. tions. REFERENCES 252

Haggard:1986:FMP volume=25&issue=1&spage= 158. [HK86] Gary Haggard and Kevin Karplus. Finding min- Hofheinz:2012:PHF imal perfect hash func- [HK12b] Dennis Hofheinz and Eike tions. In Little and Cas- Kiltz. Programmable hash sel [LC86b], pages 191– functions and their applica- 193. ISBN 0-89791-178- tions. Journal of Cryptology, 4. LCCN QA76.27.A79 v.18 25(3):484–527, July 2012. no.1. US$28.00. CODEN JOCREQ. ISSN Hofri:1987:PLR 0933-2790 (print), 1432- 1378 (electronic). URL [HK87] Micha Hofri and Alan G. Konheim. Padded lists http://www.springerlink. revisited. SIAM Journal com/openurl.asp?genre= on Computing, 16(6):1073– article&issn=0933-2790& 1114, December 1987. CO- volume=25&issue=3&spage= . DEN SMJCAT. ISSN 0097- 484 5397 (print), 1095-7111 (elec- Hong:2010:PAR tronic). [HKKK10] Deukjo Hong, Bonwook Koo, Hagerup:1995:FPP Woo-Hwan Kim, and Dae- [HK95] Torben Hagerup and J¨org sung Kwon. Preimage Keller. Fast parallel permu- attacks on reduced steps tation algorithms. Parallel of ARIRANG and PKC98- Processing Letters, 5(2):139– hash. Lecture Notes in CS, 148, June 1995. CODEN 5984:315–331, 2010. CO- PPLTEE. ISSN 0129-6264 DEN LNCSD9. ISSN 0302- (print), 1793-642X (elec- 9743 (print), 1611-3349 (electronic). tronic). URL http://link. springer.com/content/pdf/ Halevi:2012:SPH 10.1007/978-3-642-14423- . [HK12a] Shai Halevi and Yael Tau- 3_21 man Kalai. Smooth pro- Hong:2013:HOE jective hashing and two- message oblivious transfer. [HKKK13] Deukjo Hong, Dong-Chan Journal of Cryptology,25 Kim, Woo-Hwan Kim, and (1):158–193, January 2012. Jongsung Kim. Higher or- CODEN JOCREQ. ISSN der eTCR hash functions. 0933-2790 (print), 1432- Computers and Mathemat- 1378 (electronic). URL ics with Applications,65 http://www.springerlink. (9):1396–1402, May 2013. com/openurl.asp?genre= CODEN CMAPDK. ISSN article&issn=0933-2790& 0898-1221 (print), 1873-7668 REFERENCES 253

(electronic). URL http: Hromkovic:2007:SAF //www.sciencedirect.com/ science/article/pii/S0898122112000430[HKNW07]. Juraj Hromkoviˇc, Richard Královic, Marc Nunkesser, Hao:2004:ARF and Peter Widmayer, editors. Stochastic algorithms: [HKL04] Fang Hao, Murali Kodi- foundations and applications: alam, and T. V. Laksh- 4th international symposium, man. ACCEL-RATE: a SAGA 2007, Zurich, Switzer- faster mechanism for memory land, September 13–14, 2007: efficient per-flow traffic esti- proceedings, volume 4665 mation. ACM SIGMETRICS of Lecture Notes in Com- Performance Evaluation Re- puter Science. Springer-Ver- view, 32(1):155–166, June lag, Berlin, Germany / Hei- 2004. CODEN ???? ISSN delberg, Germany / London, 0163-5999 (print), 1557-9484 UK / etc., 2007. ISBN 3-540- (electronic). 74870-9 (paperback). ISSN 0302-9743 (print), 1611- Hao:2007:BHA 3349 (electronic). LCCN QA9.58 .S24 2007. URL [HKL07] Fang Hao, Murali Kodialam, http://www.springerlink. andT.V.Lakshman.Build- com/content/978-3-540- ing high accuracy Bloom fil- 74870-0; http://www. ters using partitioned hash- springerlink.com/openurl. ing. ACM SIGMETRICS asp?genre=issue\%26issn= Performance Evaluation Re- 0302-9743\%26volume=4665. view, 35(1):277–288, June Hsiao:2005:TMD 2007. CODEN ???? ISSN 0163-5999 (print), 1557-9484 [HKW05] Hung-Chang Hsiao, Chung- (electronic). Ta King, and Chia-Wei Wang. TYPHOON: mo- Hao:2012:FDM bile distributed hash tables. Journal of Parallel and Dis- [HKLS12] Fang Hao, Murali Kodialam, tributed Computing, 65(2): T. V. Lakshman, and Haoyu 191–206, February 2005. CO- Song. Fast dynamic multiple- DEN JPDCER. ISSN 0743- set membership testing us- 7315 (print), 1096-0848 (elec- ing combinatorial Bloom fil- tronic). ters. IEEE/ACM Transac- Hirose:2012:CFU tions on Networking, 20(1): 295–304, February 2012. CO- [HKY12] Shoichi Hirose, Hidenori DEN IEANEP. ISSN 1063- Kuwakado, and Hirotaka 6692 (print), 1558-2566 (elec- Yoshida. Compression func- tronic). tions using a dedicated block- REFERENCES 254

cipher for lightweight hash- Journal of Discrete Mathe- ing. Lecture Notes in CS, matical Sciences and Cryp- 7259:346–364, 2012. CO- tography, 7(1):111–120, 2003. DEN LNCSD9. ISSN 0302- CODEN ???? ISSN 0972- 9743 (print), 1611-3349 (elec- 0529. tronic). URL http://link. Heileman:2005:HCA springer.com/content/pdf/ 10.1007/978-3-642-31912- [HL05] Gregory L. Heileman and 9_23. Wenbin Luo. How caching Hsu:1991:IAI aﬀects hashing. In Camil Demetrescu, Robert Sedgewick, [HL91] W. L. Hsu and R. C. T. and Roberto Tamassia, edi- Lee, editors. ISA ’91 Al- tors, Proceedings of the Sev- gorithms: 2nd International enth Workshop on Algo- Symposium on Algorithms, rithm Engineering and Ex- Taipei, Republic of China, periments and the Second December 16–18, 1991: pro- Workshop on Analytic Algo- ceedings, volume 557 of Lec- rithmics and Combinatorics, ture Notes in Computer Sci- ALENEX/ANALCO 2005, ence. Springer-Verlag, Berlin, Sheraton Vancouver Wall Germany / Heidelberg, Ger- Center Hotel, Vancouver, many / London, UK / etc., British Columbia, Canada, 1991. ISBN 0-387-54945-5 22 January 2005, pages (New York), 3-540-54945-5 141–154. Society for Indus- (Berlin). LCCN QA76.9.A43 trial and Applied Mathemat- I57 1991. ics, Philadelphia, PA, USA, Horton:1994:MLS 2005. ISBN 0-89871-596- 2. LCCN QA76.9.A43.W69 [HL94] Graham Horton and Scott T. 2005. URL http://www. Leutenegger. A multi- siam.org/meetings/alenex05/ level solution algorithm for papers/13gheileman.pdf. steady-state Markov chains. ACM SIGMETRICS Perfor- Hsieh:2012:EHF mance Evaluation Review,22 (1):191–200, May 1994. CO- [HL12] Wen-Bin Hsieh and Jenq- DEN ???? ISSN 0163- Shiou Leu. Exploiting 5999 (print), 1557-9484 (elec- hash functions to inten- tronic). sify the remote user authentication scheme. Com- Hsu:2003:NCS puters and Security, 31(6): [HL03] Ching-Hung Hsu and Ming- 791–798, September 2012. Chih Lai. A new cipher CODEN CPSEDU. ISSN scheme based on one-way 0167-4048 (print), 1872-6208 hash function and IDEA. (electronic). URL https: REFERENCES 255

//www.sciencedirect.com/ 1022 (print), 1573-7586 (elec- science/article/pii/S0167404812000910. tronic). URL https://link. springer.com/article/10. Huang:2010:DHT 1007/s10623-017-0404-y. [HLC10] Chung-Ming Huang, Jian- Han:2018:NRA Wei Li, and Chun-Ta Chen. Distributed hash table-based [HLL18b] Zhijie Han, Yaqiong Li, interrogating-call session con- and Jie Li. A novel trol function network in routing algorithm for IoT the Internet protocol mul- cloud based on hash oﬀ- timedia subsystem for eﬃ- set tree. Future Generation cient query services. The Computer Systems, 86(??): Computer Journal, 53(7): 456–463, September 2018. 918–933, September 2010. CODEN FGSEVI. ISSN CODEN CMPJA6. ISSN 0167-739X (print), 1872-7115 0010-4620 (print), 1460-2067 (electronic). URL https: (electronic). URL http: //www.sciencedirect.com/ //comjnl.oxfordjournals. science/article/pii/S0167739X17324512. org/cgi/content/abstract/ Hohl:1993:SIH 53/7/918; http://comjnl. oxfordjournals.org/cgi/ [HLMW93] W. Hohl, X. Lai, T. Meier, reprint/53/7/918. and C. Waldvogel. Secu- rity of iterated hash functions He:2013:RCP based on block ciphers. In Stinson [Sti93], pages 379– [HLH13] Jiong He, Mian Lu, and 390. ISBN 0-387-57766-1 Bingsheng He. Revisiting co- (New York), 3-540-57766-1 processing for hash joins on (Berlin). LCCN QA76.9.A25 the coupled CPU–GPU ar- C79 1993. chitecture. Proceedings of the VLDB Endowment,6 Havas:1993:GTO (10):889–900, August 2013. [HM93] George Havas and Bohdan CODEN ???? ISSN 2150- Majewski. Graph theoretic 8097. obstacles to perfect hash- Han:2018:SSR ing. Congressus Numeran- tium, 98:81–??, 1993. ISSN [HLL18a] Shuai Han, Shengli Liu, and 0384-9864. Lin Lyu. Super-strong RKA Halevi:1996:PPS secure MAC, PKE and SE from tag-based hash proof [HM96] S. Halevi and S. Micali. Prac- system. Designs, Codes, tical and provably-secure and Cryptography, 86(7): commitment schemes from 1411–1449, July 2018. CO- collision-free hashing. Lec- DEN DCCREC. ISSN 0925- ture Notes in CS, 1109: REFERENCES 256

201–??, ???? 1996. CO- content/978-3-540-87743- DEN LNCSD9. ISSN 1/. 0302-9743 (print), 1611- Hanaoka:2012:ICE 3349 (electronic). URL http://link.springer-ny. [HM12] Goichiro Hanaoka and Takahiro com/link/service/series/ Matsuda. On the impos- 0558/bibs/1109/11090201. sibility of constructing eﬃ- htm; http://link.springer- cient key encapsulation and ny.com/link/service/series/ programmable hash func- 0558/papers/1109/11090201. tions in prime order groups. pdf. Lecture Notes in CS, 7417: 812–831, 2012. CODEN Helmer:2003:PSF LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [HM03] Sven Helmer and Guido Mo- tronic). URL http://link. erkotte. A performance study springer.com/content/pdf/ of four index structures for 10.1007/978-3-642-32009- set-valued attributes of low 5_47. cardinality. VLDB Journal: Very Large Data Bases,12 Hwang:2019:BBR (3):244–261, October 2003. [HM19] S. O. Hwang and A. Mehmood. CODEN VLDBFR. ISSN Blockchain-based resource 1066-8888 (print), 0949-877X syndicate. Computer,52 (electronic). (5):58–66, May 2019. CO- Halperin:2008:AEA DEN CPTRB4. ISSN 0018- 9162 (print), 1558-0814 (elec- [HM08] Dan Halperin and Kurt tronic). Mehlhorn, editors. Algo- Ha:2007:SAE rithms — ESA 2008: 16th annual European sympo- [HMNB07] JeaCheol Ha, SangJae Moon, sium, Karlsruhe, Germany, Juan Manuel Gonzalez Ni- September 15–17, 2008, pro- eto, and Colin Boyd. Se- ceedings, volume 5193 of Lec- curity analysis and enhance- ture Notes in Computer Sci- ment of One-Way Hash ence. Springer-Verlag, Berlin, Based Low-Cost Authenti- Germany / Heidelberg, Ger- cation Protocol (OHLCAP). many / London, UK / Lecture Notes in CS, 4819: etc., 2008. ISBN 3-540- 574–583, 2007. CODEN 87744-4, 3-540-87743-6 (soft- LNCSD9. ISSN 0302-9743 cover). ISSN 0302-9743 (print), 1611-3349 (elec- (print), 1611-3349 (electronic). URL http://link. tronic). LCCN QA76.9.A43 springer.com/content/pdf/ E83 2008. URL http: 10.1007/978-3-540-77018- //www.springerlink.com/ 3_57. REFERENCES 257

Hagerup:2001:DD 1045-9219 (print), 1558-2183 (electronic). [HMP01] T. Hagerup, P. B. Miltersen, and R. Pagh. Determin- Hiraki:1984:EAM istic dictionaries. Jour- [HNS84] Kei Hiraki, Kenji Nishida, nal of Algorithms, 41(1):69– and Toshio Shimada. Eval- 85, ???? 2001. CO- uation of associative mem- DEN JOALDV. ISSN 0196- ory using parallel chained 6774 (print), 1090-2678 (elec- hashing. IEEE Transactions tronic). URL ????. on Computers, C-33(9):851– Havas:1994:GHH 855, September 1984. CO- DEN ITCOB4. ISSN 0018- [HMWC94] G. Havas, B. S. Majewski, 9340 (print), 1557-9956 (elec- N. C. Wormald, and Z. J. tronic). Czech. Graphs, hypergraphs and hashing. In van Leeuwen Hashida:1972:LAC [vL94], pages 153–165. CO- [HO72] O. Hashida and K. Ohara. DEN LNCSD9. ISBN 0- Line accommodation capac- 86636-292-4 (New York), 3- ity of a communication con- 540-57899-4 (Berlin). ISSN trol unit. Rev. of the El. 0302-9743 (print), 1611- Commun. Lab., 20(??):231– 3349 (electronic). LCCN 239, 1972. QA75.5 .I647 1993. URL http://link.springer-ny. Holub:1987:NHE com/link/service/series/ 0558/tocs/t0790.htm; [Hol87] Allen Holub. Nroff: Hashing, http://www.springerlink. expressions, and roman nu- com/content/978-0-86636- merals. Dr. Dobbs Journal, 292-4; http://www.springerlink. 12(2):90–??, February 1987. com/openurl.asp?genre= CODEN DDJTEQ. ISSN issue&issn=0302-9743&volume= 0888-3076. 790. Holden:2013:GHF Hassanzadeh-Nazarabadi:2020:DUL [Hol13] Joshua Holden. A good [HNKO20] Y. Hassanzadeh-Nazarabadi, hash function is hard to find, A. Küp¸cü, and O. Ozkasap. and vice versa. Cryptologia, Decentralized utility- and 37(2):107–119, 2013. CO- locality-aware replication for DEN CRYPE6. ISSN 0161- heterogeneous DHT-based 1194 (print), 1558-1586 (elec- P2P cloud storage systems. tronic). IEEE Transactions on Paral- Hopgood:1968:xxx lel and Distributed Systems, 31(5):1183–1193, May 2020. [Hop68a] F. R. A. Hopgood. ??? The CODEN ITDSEO. ISSN Computer Bulletin, 11(??): REFERENCES 258

297–300, 1968. Presents al- 1611-3349 (electronic). URL gorithms for expanding and http://link.springer-ny. rehashing nearly full hash ta- com/link/service/series/ bles. 0558/bibs/2365/23650252. Hopgood:1968:STO htm; http://link.springer- ny.com/link/service/series/ [Hop68b] F. R. A. Hopgood. A so- 0558/papers/2365/23650252. lution for the table overflow pdf. problem for hash tables. The Harris:1993:ODM Computer Bulletin, ??(??): ??, March 1968. [HR93] Evan P. Harris and Kota- giri Ramamohanarao. Opti- Hanan:1963:ACT mal dynamic multi-attribute [HP63] M. Hanan and F. P. Palermo. hashing for range queries. An application of coding the- BIT (Nordisk tidskrift for ory to a file address prob- informationsbehandling),33 lem. IBM Journal of Re- (4):561–579, 1993. CODEN search and Development,7 BITTEL, NBITAB. ISSN (2):127–129, April 1963. CO- 0006-3835 (print), 1572- DEN IBMJAE. ISSN 0018- 9125 (electronic). URL 8646 (print), 2151-8556 (elec- http://www.mai.liu.se/ tronic). BIT/contents/bit33.html. Harris:1996:JAC Halatsis:1978:PHT [HR96] Evan P. Harris and Kotagiri [HP78] Constantine Halatsis and Ramamohanarao. Join algo- George Philokyprou. Pseu- rithm costs revisited. VLDB dochaining in hash tables. Journal: Very Large Data Communications of the As- Bases, 5(1):64–84, January sociation for Computing Ma- 1996. CODEN VLDBFR. chinery, 21(7):554–557, July ISSN 1066-8888 (print), 1978. CODEN CACMA2. 0949-877X (electronic). URL ISSN 0001-0782 (print), http://ftp.informatik. 1557-7317 (electronic). rwth-aachen.de/dblp/db/ Han:2002:CMV indices/a-tree/h/Harris: Evan_P=.html; http:// [HPC02] Daewan Han, Sangwoo Park, ftp.informatik.rwth-aachen. and Seongtaek Chee. Crypt- de/dblp/db/indices/a-tree/ analysis of the modified ver- r/Ramamohanarao:Kotagiri. sion of the hash function html; http://link.springer. proposed at PKC’98. Lec- de/link/service/journals/ ture Notes in CS, 2365:252– 00778/bibs/6005001/60050064. ??, 2002. CODEN LNCSD9. htm; http://link.springer. ISSN 0302-9743 (print), de/link/service/journals/ REFERENCES 259

00778/papers/6005001/60050064. Hulsing:2013:OPX pdf; http://link.springer. de/link/service/journals/ [HRB13] Andreas H¨ulsing, Lea Rausch, 00778/papers/6005001/60050064. and Johannes Buchman. ps.gz. Electronic edition. Optimal parameters for XMSSMT . Lecture Notes in Hsiao:2004:FCP CS, 8128:194–208, 2013. CO- [HR04] Chun-Yuan Hsiao and Leonid DEN LNCSD9. ISSN 0302- Reyzin. Finding colli- 9743 (print), 1611-3349 (elec- sions on a public road, or tronic). URL https://link. do secure hash functions springer.com/chapter/10. need secret coins? In 1007/978-3-642-40588-4_ Franklin [Fra04], pages 92– 14. ?? CODEN LNCSD9. Hulsing:2016:MMT ISBN 3-540-22668-0. ISSN 0302-9743 (print), 1611-3349 [HRS16] Andreas H¨ulsing, Joost Ri- (electronic). URL http: jneveld, and Fang Song. //www.springerlink.com/ Mitigating multi-target at- openurl.asp?genre=issue& tacks in hash-based signa- issn=0302-9743&volume= tures. Lecture Notes in CS, 3152; http://www.springerlink. 9614:387–416, 2016. CO- com/openurl.asp?genre= DEN LNCSD9. ISSN 0302- volume&id=doi:10.1007/ 9743 (print), 1611-3349 (elec- b99099. tronic). URL https://link. springer.com/chapter/10. Haitner:2007:SHC 1007/978-3-662-49384-7_ [HR07] Iftach Haitner and Omer 15. Reingold. Statistically-hiding Horowitz:1978:FCA commitment from any one- way function. In ACM [HS78] Ellis Horowitz and Sartaj [ACM07], pages 1–10. ISBN Sahni. Fundamentals of 1-59593-631-9. LCCN ???? Computer Algorithms.Com- puter Science Press, 11 Taft Haitner:2014:NIH Court, Rockville, MD 20850, [HR14] Iftach Haitner and Omer USA, 1978. ISBN 0-914894- Reingold. A new interac- 22-6. xiv + 626 pp. LCCN tive hashing theorem. Jour- QA76.6 .H67 1978. A nal of Cryptology, 27(1):109– standard textbook treatment 138, January 2014. CO- of well-known hashing algo- DEN JOCREQ. ISSN 0933- rithms appears on pp. 82–93. 2790 (print), 1432-1378 (elec- Horowitz:1984:FDS tronic). URL http://link. springer.com/article/10. [HS84] Ellis Horowitz and Sartaj 1007/s00145-012-9139-0. Sahni. Fundamentals of REFERENCES 260

Data Structures in Pascal. (electronic). URL http: Computer Science Press, 11 //www.springerlink.com/ Taft Court, Rockville, MD content/0pa8nj982jewn9ev/ 20850, USA, 1984. ISBN . 0-914894-94-3. xiv + 542 Hoshi:1988:AHF pp. LCCN QA76.9.D35 H67 1984. US$29.95. Textbook [HSK88] Mamoru Hoshi, Hajime Sato, treatment of hashing algo- and Kingo Kobayashi. Arith- rithms. metic hash functions. In IEEE 1988 International Hoch:2008:SCH Symposium on Information [HS08] Jonathan J. Hoch and Adi Theory — Abstracts of pa- Shamir. On the strength pers, volume 25 n 13, pages of the concatenated hash 156–157. IEEE Computer combiner when all the hash Society Press, 1109 Spring functions are weak. Lec- Street, Suite 300, Silver ture Notes in CS, 5126: Spring, MD 20910, USA, 616–630, 2008. CODEN 1988. Available from IEEE LNCSD9. ISSN 0302-9743 Service Cent (catalog num- (print), 1611-3349 (elec- ber 88CH2621-1). Piscat- tronic). URL http://link. away, NJ, USA. springer.com/content/pdf/ Hirano:1995:IEH 10.1007/978-3-540-70583- 3_50. [HSM95] Yasuhiro Hirano, Tetsuji Satoh, and Fumiaki Miura. Hsiao:1983:ADM Improved extendible hashing with high concurrency. [Hsi83] David K. Hsiao. Advanced Systems and computers in Database Machine Architec- Japan, 26(13):1–??, 1995. ture. Prentice-Hall, Engle- CODEN SCJAEP. ISSN wood Cliﬀs, NJ 07632, USA, 0882-1666 (print), 1520-684X 1983. ISBN 0-13-011262- (electronic). 3. xxii + 394 pp. LCCN QA76.9.D3 A343 1983. Hiranandani:1991:PHC

Hernandez:2002:GCT [HSMB91] Seema Hiranandani, Joel Saltz, Piyush Mehrotra, and [HSIR02] Julio César Hernández, JoséMar´ıa Harry Berryman. Perfor- Sierra, Pedro Isasi, and Ar- mance of hashed cache data turo Ribagorda. Genetic migration schemes on multi- cryptoanalysis of two rounds computers. Journal of Par- TEA. Lecture Notes in allel and Distributed Com- CS, 2331:1024–1031, 2002. puting, 12(4):415–422, Au- CODEN LNCSD9. ISSN gust 1991. CODEN JPD- 0302-9743 (print), 1611-3349 CER. ISSN 0743-7315 REFERENCES 261

(print), 1096-0848 (elec- and Moran Tzafrir. Hop- tronic). scotch hashing. Lecture Notes in CS, 5218:350–364, 2008. Hafiane:2008:RIH CODEN LNCSD9. ISSN [HSPZ08] Adel Hafiane, Guna Seethara- 0302-9743 (print), 1611-3349 man, Kannappan Palaniap- (electronic). URL http:// pan, and Bertrand Zavi- link.springer.com/content/ dovique. Rotationally invari- pdf/10.1007/978-3-540- ant hashing of median binary 87779-0_24. patterns for texture classi- Hutflesz:1988:GOP fication. Lecture Notes in CS, 5112:619–629, 2008. CO- [HSW88] Andreas Hutflesz, Hans- DEN LNCSD9. ISSN 0302- Werner Six, and Peter Wid- 9743 (print), 1611-3349 (elec- mayer. Globally order pre- tronic). URL http://link. serving multidimensional lin- springer.com/content/pdf/ ear hashing. In ICDE’88 10.1007/978-3-540-69812- [ICD88], pages 572–579. 8_61. ISBN 0-8186-0827-7 (paperback), 0-8186-8827-0 (hard- Hernandez:2001:DTR cover), 0-8186-4827-9 (mi- [HSR+01] Julio César Hernández, JoséMar´ıa crofiche). LCCN QA76.9.D3 Sierra, Arturo Ribagorda, I5582 1988. IEEE Service Benjam´ın Ramos, and J. C. Cent. Piscataway, NJ, USA. Mex-Perera. Distinguishing Hsiao:1988:AH TEA from a random permutation: Reduced round ver- [HT88] Yeong-Shiou S. Hsiao and sions of TEA do not have the Alan L. Tharp. Adaptive SAC or do not generate ran- hashing. Information system, dom numbers. Lecture Notes 13(1):111–127, 1988. CO- in CS, 2260:374–377, 2001. DEN INSYD6. ISSN 0306- CODEN LNCSD9. ISSN 4379 (print), 1873-6076 (elec- 0302-9743 (print), 1611- tronic). 3349 (electronic). URL http://link.springer-ny. Hagerup:2001:EMP com/link/service/series/ [HT01] Torben Hagerup and Torsten 0558/bibs/2260/22600374. Tholey. Efficient minimal htm; http://link.springer- perfect hashing in nearly ny.com/link/service/series/ minimal space. Lecture Notes 0558/papers/2260/22600374. in CS, 2010:317–??, 2001. pdf. CODEN LNCSD9. ISSN Herlihy:2008:HH 0302-9743 (print), 1611- 3349 (electronic). URL [HST08] Maurice Herlihy, Nir Shavit, http://link.springer-ny. REFERENCES 262

com/link/service/series/ 1985. CODEN IJCIAH. 0558/bibs/2010/20100317. ISSN 0091-7036. htm; http://link.springer- Hughes:1985:LMF ny.com/link/service/series/ 0558/papers/2010/20100317.[Hug85] John Hughes. Lazy memo- pdf. functions. In Jouannaud [Jou85], pages 129–146. Hsu:1990:COL ISBN 0-387-15975-4. LCCN [HTY90] Meichun Hsu, Shang-Sheng QA76.7 .F861 1985. Uses Tung, and Wei-Pang Yang. hashing in the implemen- Concurrent operations in lin- tation of memo functions, ear hashing. Information sci- which keep track of all their ences, 51(2):193–??, July 1, past arguments and corre- 1990. CODEN ISIJBC. ISSN sponding results. 0020-0255 (print), 1872-6291 Huisman:1990:SEM (electronic). [Hui90] Leendert M. Huisman. Sim- Hua:1982:INT ulation of embedded mem- [Hua82] Lo-Keng Hua. Introduction ories by defective hashing. to number theory. Spring- IBM Journal of Research er-Verlag, Berlin, Germany / and Development, 34(2/3): Heidelberg, Germany / Lon- 289–298, March/May 1990. don, UK / etc., 1982. ISBN CODEN IBMJAE. ISSN 0-387-10818-1. xviii + 572 0018-8646 (print), 2151-8556 pp. LCCN QA241 .H7513 (electronic). 1982. Translated from the Hulsing:2013:WOS 1975 Chinese edition Shu lun tao yin by Peter Shiu. [H¨ul13] Andreas H¨ulsing. W-OTS+ This is the English edition of — shorter signatures for Ref. 6 of [Cha84c], the book hash-based signature scheme. that contains the fundamen- Lecture Notes in CS, 7918: tal prime number functions 173–188, 2013. CODEN needed for Chang’s ordered LNCSD9. ISSN 0302-9743 minimal perfect hash func- (print), 1611-3349 (elections. tronic). URL https://link. Huang:1985:MEH springer.com/chapter/10. 1007/978-3-642-38553-7_ [Hua85] S.-H. S. Huang. Multidimen- 10. sional extendible hashing for Hong:1988:IMB partial-match queries. In- ternational Journal of Com- [HW88] Jiawei Hong and Haim Wolf- puter and Information Sci- son. Improved model-based ences, 14(2):73–82, April matching method using foot- REFERENCES 263

prints. Proceedings — Inter- 657–666, March 2013. CO- national Conference on Pat- DEN JNCAF3. ISSN tern Recognition, pages 72– 1084-8045 (print), 1095-8592 78, 1988. CODEN PICREG. (electronic). URL http: ISBN 0-8186-0878-1. Avail- //www.sciencedirect.com/ able from IEEE Service Cent science/article/pii/S1084804513000088. (catalog number 88CH2614- 6). Piscataway, NJ, USA. Hohl:1994:SIH He:2008:FED [HXMW94] Walter Hohl, Lai Xuejia, Thomas Meier, and Christian [HW08] Zhoucan He and Qing Wang. Waldvogel. Security of iter- A fast and eﬀective di- ated hash functions based on chotomy based hash al- block ciphers. Lecture Notes gorithm for image match- in CS, 773:379–390, 1994. ing. Lecture Notes in CS, CODEN LNCSD9. ISSN 5358:328–337, 2008. CO- 0302-9743 (print), 1611-3349 DEN LNCSD9. ISSN 0302- (electronic). 9743 (print), 1611-3349 (electronic). URL http://link. Hsu:1986:COE springer.com/content/pdf/ [HY86] Meichun Hsu and Wei-Pang 10.1007/978-3-540-89639- Yang. Concurrent operations 5_32. in extendible hashing. In He:2018:MBF Chu et al. [CGO86], pages [HWZP18] Jingsha He, Jianan Wu, 241–247. ISBN 0-934613-18- Nafei Zhu, and Muham- 4. LCCN QA 76.9 D3 I61 mad Salman Pathan. MinHash- 1986. based fuzzy keyword search Ho:1989:COM of encrypted data across multiple cloud servers. Future [HYH89] P. Ho, W. Yang, and M. Hsu. Internet, 10(5):38, May 01, Concurrent operations in 2018. CODEN ???? ISSN multi-dimensional extendible 1999-5903. URL https:/ hashing. Journal of Informa- /www.mdpi.com/1999-5903/ tion and Engineering, 5(??): 10/5/38. 51–72, 1989. Huang:2013:FDH Ho:1993:COM [HXLX13] Kun Huang, Gaogang Xie, [HYH93] Pao-Chung Ho, Wei-Pang Rui Li, and Shuai Xiong. Yang, and Meichun Hsu. Fast and deterministic hash Concurrent operations in table lookup using discrimi- multi-attribute linear hash- native Bloom ﬁlters. Jour- ing. Information sciences,74 nal of Network and Com- (1 / 2):29–??, October 15, puter Applications, 36(2): 1993. CODEN ISIJBC. ISSN REFERENCES 264

0020-0255 (print), 1872-6291 2 (hardcover), 0-8186-6123- (electronic). 2 (microfiche). xi + 139 pp. LCCN QA76.9.A43 C66 Hadjieleftheriou:2008:HSS 1991. [HYKS08] Marios Hadjieleftheriou, Xi- Aoe:1994:CAS aohui Yu, Nick Koudas, and Divesh Srivastava. Hashed [iA94] Jun ichi Aoe. Computer samples: selectivity estima- Algorithms: String Pattern tors for set similarity selec- Matching Strategies. IEEE tion queries. Proceedings of Computer Society Press, the VLDB Endowment, 1(1): 1109 Spring Street, Suite 300, 201–212, August 2008. CO- Silver Spring, MD 20910, DEN ???? ISSN 2150-8097. USA, 1994. ISBN 0-8186- 5461-9 (microfiche), 0-8186- Hsieh:1999:OWH 5462-7 (hardcover), 0-8186- [HYLT99] T.-M. Hsieh, Y.-S. Yeh, C.- 5460-0 (paperback). ix + 281 H. Lin, and S.-H. Tuan. pp. LCCN QA76.9.A43 C67 One-way hash functions with 1994. US$56.00. changeable parameters. In- Istvan:2015:HTL formation sciences, 118(1): 223–239, September 1999. [IABV15] Zsolt István, Gustavo Alonso, CODEN ISIJBC. ISSN 0020- Michaela Blott, and Kees 0255 (print), 1872-6291 (elec- Vissers. A hash table for line- tronic). rate data processing. ACM Transactions on Reconfig- Hill:1986:ESD urable Technology and Sys- [HZ86] L. Owen Hill and David A. tems, 8(2):13:1–13:??, April Zein. Extracting statisti- 2015. CODEN ???? ISSN cal data from free-form text. 1936-7406 (print), 1936-7414 IEEE Circuits and Devices (electronic). Magazine, 2(3):18–24, May IEEE:1986:ICD 1986. CODEN ICDMEN. ISSN 8755-3996. [ICD86] International Conference on Aoe:1991:CAK Data Engineering (2nd), February 5–7, 1986, Bonaven- [iA91] Jun ichi Aoe. Computer Al- ture Hotel, Los Angeles, Cal- gorithms: Key Search Strate- ifornia, USA. IEEE Com- gies. IEEE Computer So- puter Society Press, 1109 ciety Press, 1109 Spring Spring Street, Suite 300, Sil- Street, Suite 300, Silver ver Spring, MD 20910, USA, Spring, MD 20910, USA, 1986. ISBN 0-8186-0655- 1991. ISBN 0-8186-2123- X (paperback), 0-8186-8655- 0 (paperback), 0-8186-2123- 3 (hardcover), 0-8186-4655-1 REFERENCES 265

(microfiche). LCCN QA 76.9 Silver Spring, MD 20910, D3 I5582 1986. USA, 1990. ISBN 0-8186- IEEE:1987:DEP 2025-0 (paperback), 0-8186- 9025-9 (hardcover), 0-8186- [ICD87] Data Engineering: Pro- 6025-2 (microfiche). LCCN ceedings/Third International QA76.9.D3 I5582 1990. Conference on Data Engi- neering, February 3–5, 1987, IEEE:1991:PSI Pacifica Hotel, Los Angeles, [ICD91] Proceedings/Seventh Inter- California, USA. IEEE Com- national Conference on Data puter Society Press, 1109 Engineering, April 8–12, Spring Street, Suite 300, Sil- 1991, Kobe, Japan. IEEE ver Spring, MD 20910, USA, Computer Society Press, 1987. ISBN 0-8186-0762- 1109 Spring Street, Suite 9 (paperback) 0-8186-8762- 300, Silver Spring, MD 2 (hard) 0-8186-4762-0 (mi- 20910, USA, 1991. ISBN 0- crofiche). LCCN QA76.9.D3 8186-2138-9 (paper), 0-8186- I5582 1987. 6138-0 (microfiche), 0-8186- IEEE:1988:PFI 9138-7 (hardcover). LCCN QA76.9.D3 I5582 1991. [ICD88] Proceedings, Fourth Interna- tional Conference on Data IEEE:1993:ICD Engineering: February 1–5, 1988, Los Angeles Airport [ICD93] Proceedings/Ninth Interna- Hilton and Towers, Los An- tional Conference on Data geles, California, USA. IEEE Engineering, April 19–23, Computer Society Press, 1993, Vienna, Austria. IEEE 1109 Spring Street, Suite 300, Computer Society Press, Silver Spring, MD 20910, 1109 Spring Street, Suite 300, USA, 1988. ISBN 0-8186- Silver Spring, MD 20910, 0827-7 (paperback), 0-8186- USA, 1993. ISBN 0-8186- 8827-0 (hardcover), 0-8186- 3572-X (hardcover), 0-8186- 4827-9 (microfiche). LCCN 3570-3 (paperback), 0-8186- QA76.9.D3 I5582 1988. 3571-1 (microfiche). LCCN QA76.9.D3I57 1993. IEEE:1990:PSI IEEE:1974:ASS [ICD90] Proceedings, Sixth Interna- tional Conference on Data [IEE74] IEEE, editor. 15th Annual Engineering: February 5–9, Symposium on Switching and 1990, Los Angeles Airport Automata Theory, October Hilton and Towers, Los An- 14–16, 1974, the University geles, California, USA. IEEE of New Orleans. IEEE Com- Computer Society Press, puter Society Press, 1109 1109 Spring Street, Suite 300, Spring Street, Suite 300, Sil- REFERENCES 266

ver Spring, MD 20910, USA, Computer Society Press, 1974. 1109 Spring Street, Suite 300, IEEE:1976:ASF Silver Spring, MD 20910, USA, 1982. LCCN QA76.6 [IEE76] 17th Annual Symposium on .S95 1982. Foundations of Computer IEEE:1984:ISL Science, October 25–27, 1976, Houston, Texas. IEEE [IEE84] 1984 International Sympo- Computer Society Press, sium on Logic Programming, 1109 Spring Street, Suite 300, February 6–9, 1984, Bally’s Silver Spring, MD 20910, Park Place Casino, Atlantic USA, 1976. City, New Jersey/sponsored by IEEE Computer Soci- IEEE:1980:PCI ety, Technical Committee on [IEE80a] Proceedings 4, COMPSAC Computer Languages. IEEE 80, the IEEE Computer So- Computer Society Press, ciety’s Fourth International 1109 Spring Street, Suite 300, Computer Software and Ap- Silver Spring, MD 20910, plications Conference, Octo- USA, 1984. ISBN 0-8186- ber 27–31, 1980, the Palmer 0522-7 (paperback), 0-8186- House, Chicago. IEEE Com- 8522-0 (hardcover), 0-8186- puter Society Press, 1109 4522-9 (microﬁche). LCCN Spring Street, Suite 300, Sil- QA76.6 .I5735 1984. ver Spring, MD 20910, USA, IEEE:1985:FOC 1980. LCCN QA 75.5 C586 1980. [IEE85a] 26th annual Symposium on Foundations of Computer IEEE:1980:ASF Science, October 21–23, [IEE80b] 21st Annual Symposium on 1985, Portland, OR. IEEE Foundations of Computer Computer Society Press, Science: Oct. 13–15, 1980, 1109 Spring Street, Suite 300, Syracuse, NY. IEEE Com- Silver Spring, MD 20910, puter Society Press, 1109 USA, 1985. ISBN 0-8186- Spring Street, Suite 300, Sil- 0644-4 (paperback), 0-8186- ver Spring, MD 20910, USA, 4644-6 (microﬁche), 0-8186- 1980. 8644-8 (hardcover). LCCN QA 76 S979 1985. IEEE:1982:SFC IEEE:1985:PFD [IEE82] Symposium on Foundations of Computer Science (23rd: [IEE85b] Proceedings: Foundations 1982: Chicago, IL) 23rd An- of Data Organization, Ky- nual Symposium on Founda- oto ’85, Japan, Interna- tions of Computer Science, tional Conference on Foun- November 3–5, 1982. IEEE dations of Data Organiza- REFERENCES 267

tion, May 21–24, 1985, Ky- NY. IEEE Computer Soci- oto, Japan. IEEE Computer ety Press, 1109 Spring Street, Society Press, 1109 Spring Suite 300, Silver Spring, MD Street, Suite 300, Silver 20910, USA, 1988. ISBN Spring, MD 20910, USA, 0-8186-0877-3 (paperback), 1985. 0-8186-4877-5 (microfiche), IEEE:1988:DPI 0-8186-8877-7 (hardcover). LCCN QA 76 S979 1988. [IEE88a] Digest of papers: intellectual leverage/COMPCON Spring IEEE:1988:ICP 88, February 29-March 4, [IEE88d] 9th International Confer- 1988, Thirty-Third IEEE ence on Pattern Recogni- Computer Society Interna- tion: 14–17 November 1988, tional Conference, Cathe- Ergife Palace Hotel, Rome, dral Hill Hotel, San Fran- Italy. IEEE Computer Soci- cisco, California. IEEE Com- ety Press, 1109 Spring Street, puter Society Press, 1109 Suite 300, Silver Spring, MD Spring Street, Suite 300, Sil- 20910, USA, 1988. ISBN ver Spring, MD 20910, USA, 0-8186-0878-1 (paperback), 1988. ISBN 0-8186-0828- 0-8186-4878-3 (microfiche), 5 (paperback), 0-8186-4828- 0-8186-8878-5 (hardcover). 7 (microfiche), 0-8186-8828-9 LCCN TK7882.P3 I58 1988 (hardcover). LCCN QA75.5 v. 1-2 (1988). .C58 1988. IEEE:1988:SIC IEEE:1989:ASF [IEE88b] Second International Con- [IEE89] 30th Annual Symposium ference on Computer Vi- on Foundations of Com- sion: December 5–8, 1988, puter Science, October 30– Innesbrook Resort, Tampa, November 1, 1989, Research Florida, USA. IEEE Com- Triangle Park, NC. IEEE puter Society Press, 1109 Computer Society Press, Spring Street, Suite 300, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, Silver Spring, MD 20910, USA, 1988. ISBN 0-8186- USA, 1989. CODEN ASF- 8883-1, 0-8186-0883-8 (pa- PDV. ISBN 0-8186-1982- perback). LCCN TA1632 1 (hardcover), 0-8186-5982- .I5485 1988. 3 (microfiche). ISSN 0272- 5428. LCCN QA 76 S979 IEEE:1988:ASF 1989. [IEE88c] 29th Annual Symposium IEEE:1990:PSN on Foundations of Com- puter Science, October 24– [IEE90] IEEE, editor. Proceed- 26, 1988, White Plains, ings, Supercomputing ’90: REFERENCES 268

November 12–16, 1990, New ver Spring, MD 20910, USA, York Hilton at Rockefeller 1991. ISBN 0-8186-2445-0 Center, New York, New (paperback), 0-8186-2447-7 York. IEEE Computer Soci- (hardcover). LCCN QA 76 ety Press, 1109 Spring Street, S979 1991. Suite 300, Silver Spring, MD IEEE:1992:PII 20910, USA, 1990. ISBN 0-8186-2056-0 (paperback: [IEE92a] IEEE, editor. Proceedings: IEEE Computer Society), IEEE Infocom ’92, the con- 0-89791-412-0 (paperback: ference on computer commu- ACM). LCCN QA 76.88 nications, one world through S87 1990. ACM order num- communications, eleventh ber 415903. IEEE Computer annual joint conference of the Society Press order number IEEE Computer and Com- 2056. IEEE catalog number munications Societies, Flo- 90CH2916-5. rence, Italy. IEEE Com- puter Society Press, 1109 IEEE:1991:PSA Spring Street, Suite 300, [IEE91a] IEEE, editor. Proceed- Silver Spring, MD 20910, ings, Supercomputing ’91: USA, 1992. Three volumes. Albuquerque, New Mexico, IEEE Computer Society or- November 18–22, 1991. IEEE der number 2860. IEEE cat- Computer Society Press, alog number 92CH3133-6. 1109 Spring Street, Suite 300, IEEE:1992:PAS Silver Spring, MD 20910, USA, 1991. ISBN 0-8186- [IEE92b] Proceedings, 33rd Annual 9158-1 (IEEE case), 0-8186- Symposium on Foundations 2158-3 (IEEE paper), 0-8186- of Computer Science: Octo- 6158-5 (IEEE microﬁche), 0- ber 24–27, 1992, Pittsburgh, 89791-459-7 (ACM). LCCN Pennsylvania. IEEE Com- QA76.5 .S894 1991. ACM puter Society Press, 1109 order number 415913. IEEE Spring Street, Suite 300, Sil- Computer Society Press or- ver Spring, MD 20910, USA, der number 2158. IEEE cat- 1992. ISBN 0-8186-2900-2. alog number 91CH3058-5. LCCN QA 76 S979 1992. IEEE:1991:PAS IEEE:1993:PSP [IEE91b] Proceedings, 32nd Annual [IEE93] IEEE, editor. Proceedings, Symposium on Foundations Supercomputing ’93: Port- of Computer Science: Oc- land, Oregon, November 15– tober 1–4, 1991, San Juan, 19, 1993. IEEE Computer Puerto Rico. IEEE Com- Society Press, 1109 Spring puter Society Press, 1109 Street, Suite 300, Silver Spring Street, Suite 300, Sil- Spring, MD 20910, USA, REFERENCES 269

1993. ISBN 0-8186-4340- Performance Computing Con- 4 (paperback), 0-8186-4341- ference, May 23–25, 1994, 2 (microﬁche), 0-8186-4342- Knoxville, Tennessee. IEEE 0 (hardback), 0-8186-4346-3 Computer Society Press, (CD-ROM). ISSN 1063-9535. 1109 Spring Street, Suite LCCN QA76.5 .S96 1993. 300, Silver Spring, MD 20910, USA, 1994. ISBN 0- IEEE:1994:DEI 8186-5680-8, 0-8186-5681-6. [IEE94a] IEEE, editor. Data engi- LCCN QA76.58.S32 1994. neering: 10th International conference — February 1994, IEEE:1995:PNA Houston, TX, INTERNA- TIONAL CONFERENCE [IEE95] IEEE, editor. Proceedings: ON DATA ENGINEERING the nineteenth annual In- 1994; 10th. IEEE Computer ternational Computer Soft- Society Press, 1109 Spring ware and Applications Con- Street, Suite 300, Silver ference (COMPSAC ’95): Spring, MD 20910, USA, August 9–11, 1995, Dallas, 1994. ISBN 0-8186-5402-3, Texas. IEEE Computer Soci- 0-8186-5400-7, 0-8186-5401- ety Press, 1109 Spring Street, 5. LCCN QA76.9.D3 I5582 Suite 300, Silver Spring, MD 1994. 20910, USA, 1995. ISBN 0- IEEE:1994:NAE 8186-7119-X. LCCN QA76.6 .I5 1995. IEEE Catalog No. [IEE94b] IEEE, editor. National 95CB35838. aerospace and electronics conference: – May 1994, IEEE:1999:ASF Dayton, OH,volume1 of PROCEEDINGS OF [IEE99] IEEE, editor. 40th Annual THE IEEE NATIONAL Symposium on Foundations AEROSPACE AND ELEC- of Computer Science: Octo- TRONICS CONFERENCE ber 17–19, 1999, New York 1994. IEEE Computer Soci- City, New York,. IEEE Com- ety Press, 1109 Spring Street, puter Society Press, 1109 Suite 300, Silver Spring, MD Spring Street, Suite 300, 20910, USA, 1994. ISBN 0- Silver Spring, MD 20910, 7803-1893-5, 0-7803-1894-3, USA, 1999. CODEN ASF- 0-7803-1895-1. ISSN 0547- PDV. ISBN 0-7695-0409- 3578. LCCN TL 693 N37 4 (softbound), 0-7803-5955- 1994. Two volumes. 0 (casebound), 0-7695-0411- IEEE:1994:PSH 6 (microﬁche). ISSN 0272- 5428. LCCN TK7885.A1 S92 [IEE94c] IEEE, editor. Proceed- 1999. IEEE Catalog Number ings of the Scalable High- 99CB37039. REFERENCES 270

IEEE:2001:PII sachusetts, USA. IEEE Com- puter Society Press, 1109 [IEE01] IEEE, editor. Proceedings Spring Street, Suite 300, Sil- IEEE INFOCOM 2001: the ver Spring, MD 20910, USA, conference on computer com- 2005. ISBN ???? LCCN ???? munications: proceedings: IEEE:2006:AIS Twentieth annual joint conference of the IEEE Com- [IEE06] IEEE, editor. 47th Annual puter and Communications IEEE Symposium on Foun- Societies: twenty years into dations of Computer Science: the communications odyssey: FOCS 2006: 21–24 Octo- 22–26 April 2001, Hilton ber, 2006, Berkeley, Califor- Anchorage Hotel, Anchor- nia. IEEE Computer Soci- age, Alaska USA. IEEE ety Press, 1109 Spring Street, Computer Society Press, Suite 300, Silver Spring, 1109 Spring Street, Suite MD 20910, USA, 2006. 300, Silver Spring, MD ISBN 0-7695-2720-5, 0-7695- 20910, USA, 2001. ISBN 2362-5. ISSN 0272-5428. 0-7803-7016-3 (softbound), LCCN QA76 .S974 2006. 0-7803-7017-1 (microﬁche), URL http://ieeexplore. 0-7803-7018-X (CD-ROM). ieee.org/servlet/opac? LCCN TK5105.5 .I48 2001. punumber=4031329. IEEE URL http://ieeexplore. Computer Society Order ieee.org/servlet/opac? Number P2720. punumber=7321. IEEE:2007:PAI IEEE:2002:STI [IEE07] IEEE, editor. Proceed- [IEE02] IEEE, editor. SC2002: From ings of the 48th Annual Terabytes to Insight. Proceed- IEEE Symposium on Foun- ings of the IEEE ACM SC dations of Computer Sci- 2002 Conference, November ence: [FOCS 2007]: Octo- 16–22, 2002, Baltimore, MD, ber 20–23, 2007, Providence, USA. IEEE Computer Soci- Rhode Island. IEEE Com- ety Press, 1109 Spring Street, puter Society Press, 1109 Suite 300, Silver Spring, MD Spring Street, Suite 300, 20910, USA, 2002. ISBN 0- Silver Spring, MD 20910, 7695-1524-X. LCCN ???? USA, 2007. ISBN 0-7695- IEEE:2005:PIS 3010-9. ISSN 0272-5428. LCCN QA76 .S974 2007. [IEE05] IEEE, editor. Proceedings URL http://ieeexplore. of the 17th IEEE Sympo- ieee.org/servlet/opac? sium on Computer Arith- punumber=4389466. IEEE metic, ARITH-17, June 27– Computer Society order 29, 2005, Cape Cod, Mas- number P3010. REFERENCES 271

IEEE:2010:PIA USA. IEEE Computer Soci- ety Press, 1109 Spring Street, [IEE10] IEEE, editor. Proceedings: Suite 300, Silver Spring, MD 2010 IEEE 51st Annual Sym- 20910, USA, 2011. ISBN 1- posium on Foundations of 4577-1843-X. LCCN ???? Computer Science: 23–26 October 2010, Las Vegas, IEEE:2013:PIA Nevada, USA. IEEE Com- [IEE13] IEEE, editor. Proceedings of puter Society Press, 1109 the 2012 IEEE 54th Annual Spring Street, Suite 300, Symposium on Foundations Silver Spring, MD 20910, of Computer Science: 26–29 USA, 2010. ISBN 1- October 2013, Berkeley, CA, 4244-8525-8. LCCN ???? USA. IEEE Computer Soci- URL http://ieeexplore. ety Press, 1109 Spring Street, ieee.org/servlet/opac? Suite 300, Silver Spring, MD punumber=5669376. IEEE 20910, USA, 2013. ISBN Computer Society Order 0-7695-5135-1. ISSN 0272- Number P4244. 5428. LCCN QA76 .S95 IEEE:2011:ICI 2012. URL http://dimacs. rutgers.edu/FOCS13/; [IEE11a] IEEE, editor. Interna- http://theory.stanford. tional Conference on Intel- edu/~tim/focs13/. IEEE ligent Computation Technol- Computer Society order ogy and Automation (ICI- number P????. CTA), 2011: 28–29 March 2011, Shenzhen, Guangdong, Ida:1977:PPH China; proceedings. IEEE Computer Society Press, [IG77] Tetsuo Ida and Eiichi Goto. 1109 Spring Street, Suite Performance of a parallel 300, Silver Spring, MD hash hardware with key dele- 20910, USA, 2011. ISBN 0- tion. In Gilchrist [Gil77], 7695-4353-7, 1-61284-289-5. pages 643–647. ISBN 0-7204- LCCN ???? URL http: 0755-9. LCCN ???? //ieeexplore.ieee.org/ Ihlenfeldt:1994:HCI servlet/opac?punumber= 5750113. [IG94] Wolf Dietrich Ihlenfeldt and IEEE:2011:PIA Johann Gasteiger. Hash codes for the identiﬁcation [IEE11b] IEEE, editor. Proceedings: and classiﬁcation of molecu- 2011 IEEE 52nd Annual lar structure elements. Jour- IEEE Symposium on Foun- nal of Computational Chem- dations of Computer Sci- istry, 15(8):793–813, Au- ence: 22–25 October 2011, gust 1994. CODEN JC- Palm Springs, California, CHDD. ISSN 0192-8651 REFERENCES 272

(print), 1096-987X (elec- Software—Practice and Ex- tronic). perience, 47(10):1299–1323, October 2017. CODEN Ioannidis:2005:ADS SPEXBL. ISSN 0038-0644 [IGA05] Ioannis Ioannidis, Ananth (print), 1097-024X (elec- Grama, and Mikhail Atal- tronic). lah. Adaptive data structures Ikeda:2013:CEM for IP lookups. ACM Jour- nal of Experimental Algorith- [IJK13] S. Ikeda, M. Jibiki, and mics, 10:1.1:1–1.1:??, ???? Y. Kuno. Coverage es- 2005. CODEN ???? ISSN timation in model check- 1084-6654. ing with bitstate hashing. IEEE Transactions Ichikawa:1983:ARD on Software Engineering, [IH83] T. Ichikawa and M. Hi- 39(4):477–486, April 2013. rakawa. ARES: a rela- CODEN IESEDJ. ISSN tional database, responsible 0098-5589 (print), 1939-3520 for data semantics. Tech- (electronic). URL http: nical Report TR.CSG 8, //ieeexplore.ieee.org/ Hiroshima University, Hi- stamp/stamp.jsp?arnumber= roshima, Japan, August 6226428. 1983. ?? pp. ACM:1989:PIJ Itoh:1995:ANS [IJW89] Proceedings of 4th Interna- tional Joint Workshop on [IH95] Toshiya Itoh and Kei Hayashi. Computer Communications: Alternative necessary and at the University of Tokyo, suﬃcient conditions for colli- Tokyo, Japan, July 13–15, sion intractable hashing. IE- 1989. ACM Press, New York, ICE Transactions on Funda- NY 10036, USA, 1989. LCCN mentals of Electronics Com- TK5105.5 .I574 1989. munications and Computer Sciences, 78(1):19–??, Jan- Ichiyoshi:1992:ALB uary 1, 1995. CODEN [IK92] Nobuyuki Ichiyoshi and IFESEX. ISSN 0916-8508 Kouichi Kimura. Asymp- (print), 1745-1337 (elec- totic load balance of dis- tronic). tributed hash tables. In Moto-oka [Mo92b], pages Ivanchykhin:2017:RAU 869–876. ISBN 0-444-86440- [IIL17] Dmytro Ivanchykhin, Sergey 7. LCCN QA76.5 .I545 1981. Ignatchenko, and Daniel Ishai:2005:SCC Lemire. Regular and almost universal hashing: [IKO05] Yuval Ishai, Eyal Kushile- an eﬃcient implementation. vitz, and Rafail Ostro- REFERENCES 273

vsky. Sufficient conditions Locality-preserving hashing for collision-resistant hash- in multidimensional spaces. ing. In Kilian [Kil05], In ACM [ACM97b], pages pages 445–?? CODEN 618–625. ISBN 0-89791-888- LNCSD9. ISBN 3-540-24573- 6. LCCN QA76.5 .A849 1 (softcover). ISSN 0302- 1997. URL http://www. 9743 (print), 1611-3349 (elec- acm.org/pubs/articles/ tronic). LCCN QA76.9.A25 proceedings/stoc/258533/ T44 2005. URL http: p618-indyk/p618-indyk. //www.springerlink.com/ pdf; http://www.acm. openurl.asp?genre=issue& org/pubs/citations/proceedings/ issn=0302-9743&volume= stoc/258533/p618-indyk/. 3378; http://www.springerlink. ACM order no. 508970. com/openurl.asp?genre= Impagliazzo:1989:ECS volume&id=doi:10.1007/ b106171. [IN89] Russell Impagliazzo and Ishai:2008:CCC Moni Naor. Efficient cryptographic schemes provably as [IKOS08] Yuval Ishai, Eyal Kushile- secure as subset sum. An- vitz, Rafail Ostrovsky, and nual Symposium on Founda- Amit Sahai. Cryptogra- tions of Computer Science phy with constant computa- (Proceedings), pages 236– tional overhead. In ACM 241, November 1989. CO- [ACM08b], pages 433–442. DEN ASFPDV. ISBN 0- ISBN 1-60558-047-3. LCCN 8186-1982-1. ISSN 0272- QA76.6 .A152 2008. 5428. IEEE catalog number 89CH2808-4. Ivanov:1990:HSO Ince:1981:IFS [IL90] M. B. Ivanov and V. A. Litvinov. Hash-sequential [Inc81] D. C. Ince. The implementa- organization of data sets. tion of file structures in some Programming and Computer high level languages. SIG- Software; translation of Pro- PLAN Notices, 16(11):49–55, grammirovaniye, (Moscow, November 1981. CODEN USSR) Plenum, 15(2):70–75 SINODQ. ISSN 0362-1340 (or 70–76??), January 1990. (print), 1523-2867 (print), CODEN PCSODA. ISSN 1558-1160 (electronic). 0361-7688 (print), 1608-3261 Indyk:2001:SAM (electronic). [Ind01] P. Indyk. A small ap- Indyk:1997:LPH proximately min-wise inde- [IMRV97] Piotr Indyk, Rajeev Mot- pendent family of hash func- wani, Prabhakar Ragha- tions. Journal of Algorithms, van, and Santosh Vempala. 38(1):84–90, January 2001. REFERENCES 274

CODEN JOALDV. ISSN Irby:19xx:MRH 0196-6774 (print), 1090-2678 (electronic). [Irbxx] Thomas C. Irby. Minimal retrieval hash codes. Proceed- Indyk:2013:SHH ings of the Texas Conference on Computing Systems,?? [Ind13] Piotr Indyk. Sketching via (??):8.1–8.5, ???? 19xx. CO- hashing: from heavy hit- DEN PTCSDR. IEEE Com- ters to compressed sensing to put Soc. Long Beach, Ca. Sparse Fourier Transform. In Hull and Fan [HF13], pages Imai:1993:ACA 87–90. ISBN 1-4503-2066-X, 1-4503-2037-6. LCCN ???? [IRM93] Hideki Imai, Ronald L. URL http://dl.acm.org/ Rivest, and Tsutomu Mat- citation.cfm?id=2463664; sumoto, editors. Advances http://www.sigmod.org/ in Cryptology, ASIACRYPT 2013/. ’91: International Confer- Indesteege:2008:CRH ence on the Theory and Ap- plication of Cryptology, Fu- [IP08] Sebastiaan Indesteege and jiyoshida, Japan, Novem- Bart Preneel. Collisions for ber 11–14, 1991: Proceed- RC4-hash. Lecture Notes in ings, volume 739 of Lec- CS, 5222:355–366, 2008. CO- ture Notes in Computer Sci- DEN LNCSD9. ISSN 0302- ence. Springer-Verlag, Berlin, 9743 (print), 1611-3349 (elec- Germany / Heidelberg, Ger- tronic). URL http://link. many / London, UK / etc., springer.com/content/pdf/ 1993. ISBN 0-387-57332-1 10.1007/978-3-540-85886- (New York), 3-540-57332-1 7_25. (Berlin). LCCN QA76.9.A25 I555 1991. DM96.00. Indesteege:2011:PCE Inoue:1991:RRD [IP11] Sebastiaan Indesteege and Bart Preneel. Practical col- [ISH+91] Ushio Inoue, Tetsuji Satoh, lisions for EnRUPT. Jour- Haruo Hayami, Hideaki nal of Cryptology, 24(1):1– Takeda, Toshio Nakamura, 23, January 2011. CO- and Hideki Fukuoka. Rinda: DEN JOCREQ. ISSN a relational database proces- 0933-2790 (print), 1432- sor with hardware specialized 1378 (electronic). URL for searching and sorting. http://www.springerlink. IEEE Micro, 11(6):61–70, com/openurl.asp?genre= November/December 1991. article&issn=0933-2790& CODEN IEMIDZ. ISSN volume=24&issue=1&spage= 0272-1732 (print), 1937-4143 1. (electronic). REFERENCES 275

Itano:1988:IPM curity techniques — theory; distributed databases; [ISHY88] Kozo Itano, Yutaka Sato, hash ﬁlters; hash join Hash- Hidemi Hirai, and Tomoyoshi functions, Part 1: General Yamagata. An incremen- (IS, 1994); Part 2: Hash- tal pattern matching algo- functions using an n-bit block rithm for the pipelined lexical cipher algorithm, (IS, 1994); scanner. Information Pro- Part 3: Dedicated hash- cessing Letters, 27(5):253– functions (IS, 1997); Part 4: 258, April 28, 1988. CO- Hash-functions using modu- DEN IFPLAT. ISSN 0020- lar arithmetic, (FCD, 1997). 0190 (print), 1872-6119 (elec- International Organization tronic). for Standardization, Geneva, Ishikawa:1993:MLI Switzerland, 1997. ?? pp.

[ISK+93] Hiroshi Ishikawa, Fumio ISO:2004:IIIb Suzuki, Fumihiko Kozakura, [ISO04] ISO. ISO/IEC 10118- Akifumi Makinouchi, Mika 3:2004: Information tech- Miyagishima, Yoshio Izu- nology — Security tech- mida, Masaaki Aoshima, niques — Hash-functions — and Yasuo Yamane. The Part 3: Dedicated hash- model, language, and im- functions. International Or- plementation of an object- ganization for Standardiza- oriented multimedia knowl- tion, Geneva, Switzerland, edge base management sys- February 2004. 94 pp. URL tem. ACM Transactions on Database Systems, 18(1): http://www.iso.org/iso/ 1–50, March 1993. CO- en/CatalogueDetailPage. DEN ATDSD3. ISSN 0362- CatalogueDetail?CSNUMBER= . 5915 (print), 1557-4644 (elec- 39876 tronic). URL http://www. Itoh:1993:SCF acm.org/pubs/articles/ journals/tods/1993-18-1/ [IT93] Toshiya Itoh and Makoto p1-ishikawa/p1-ishikawa. Takeda. A simple construc- pdf; http://www.acm. tion for a family of colli- org/pubs/citations/journals/ sion intractable hash func- tods/1993-18-1/p1-ishikawa/ tions. Electronics and com- ; http://www.acm.org/ munications in Japan. Part pubs/toc/Abstracts/tods/ 3, Fundamental electronic 151285.html. science, 76(12):77–84, De- ISO:1997:ITS cember 1, 1993. CO- DEN ECJSER. ISSN 1042- [ISO97] ISO and IEC 10118. In- 0967 (print), 1520-6440 (elec- formation technology — Se- tronic). REFERENCES 276

Ideguchi:2014:IDC are considered. Though the existence of h is guaranteed, [ITP14] Kota Ideguchi, Elmar Tis- theschemesuﬀersfrommany chhauser, and Bart Pre- practical problems because neel. Internal diﬀeren- of exhaustive nature of the tial collision attacks on the search for h. reduced-round Grøstl-0 hash Jagannathan:1991:OPM function. Designs, Codes, and Cryptography, 70(3): [Jag91] Raj Jagannathan. Optimal 251–271, March 2014. CO- partial-match hashing de- DEN DCCREC. ISSN 0925- sign. ORSA Journal on Com- 1022 (print), 1573-7586 (elec- puting, 3(2):86–??, Spring tronic). URL http://link. 1991. CODEN OJCOE3. springer.com/article/10. ISSN 0899-1499. 1007/s10623-012-9674-6. Jain:1989:CHS Jacobson:1992:ETH [Jai89] Raj Jain. A comparison [Jac92] David Jacobson. Engi- of hashing schemes for ad- neer’s toolbox: Hashing in dress lookup in computer Mathematica. Mathemat- networks. Technical Report ica Journal, 2(4):??, Fall DEC-TR-593, Digital Equip- 1992. CODEN ???? ISSN ment Corporation, February 1047-5974 (print), 1097- 1989. ?? pp. 1610 (electronic). URL Jain:1992:CHSa http://www.mathematica- journal.com/issue/v2i4/ [Jai92a] R. Jain. A compari- tutorials/toolbox/index. son of hashing schemes for html. address lookup in computer networks. Tech- Jaeschke:1981:RHM nical report, DEC, 1992. [Jae81] G. Jaeschke. Reciprocal 17 pp. URL http:// hashing: a method for www.cis.ohio-state.edu/~ generating minimal perfect jain/papers/hash_ps.htm. hashing functions. Com- Jain:1992:CHSb munications of the Associ- ation for Computing Ma- [Jai92b] R. Jain. A comparison chinery, 24(12):829–833, De- of hashing schemes for ad- cember 1981. CODEN dress lookup in computer CACMA2. ISSN 0001- networks. IEEE Trans. 0782 (print), 1557-7317 (elec- Comm., 40(10):1570–1573, tronic). Hash functions, for October 1, 1992. CO- akeyx in a set S of pos- DEN IECMBT. ISSN 0090- itive integers, of the form 6778 (print), 1558-0857 (elec- h(x)=(C/(Dx+E)) mod N tronic). URL http:// REFERENCES 277

www.cis.ohio-state.edu/ 1(2):177–213, October 2005. ~jain/papers/hash_ieee_ CODEN ???? ISSN 1549- 2col.htm. 6325 (print), 1549-6333 (electronic). Jain:19xx:CHS Janson:2008:IDH [Jaixx] Raj Jain. A comparison of hashing schemes for ad- [Jan08] Svante Janson. Individ- dress lookup in computer ual displacements in hash- networks. Technical Report ing with coalesced chains. DEC-TR-566, Digital Equip- Combinatorics, Probability ment Corporation, 19xx. ?? and Computing, 17(6):799– pp. URL jain%erlang.dec@ 814, November 2008. CO- decwrl.dec.com. DEN CPCOFG. ISSN 0963- Jaja:1990:SFM 5483 (print), 1469-2163 (electronic). [Jáj90] Joseph Jájá, editor. The 3rd Symposium on the Frontiers Jarke:1994:ADT of Massively Parallel Compu- tation: Proceedings, Held at [JBJ94] Matthias Jarke, Janis Bubenko, the University of Maryland, and Keith Jeffery, editors. College Park, Maryland, Oc- Advances in database tech- tober 8–10, 1990. IEEE Com- nology — EDBT ’94: 4th puter Society Press, 1109 International Conference on Spring Street, Suite 300, Sil- Extending Database Tech- ver Spring, MD 20910, USA, nology, Cambridge, United 1990. ISBN 0-8186-9053-4. Kingdom, March 28–31, LCCN QA76.58 .S95 1990. 1994: proceedings,volume 779 of Lecture Notes in Com- Jakobsson:1985:SRL puter Science. Springer-Ver- lag, Berlin, Germany / Hei- [Jak85] Matti Jakobsson. Sampling delberg, Germany / London, without replacement in linear UK / etc., 1994. ISBN 0-387- time. The Computer Journal, 57818-8 (New York), 3-540- 28(4):412–413, August 1985. 57818-8 (Berlin). ISSN 0302- CODEN CMPJA6. ISSN 9743 (print), 1611-3349 (elec- 0010-4620 (print), 1460-2067 tronic). LCCN QA76.9.D3 (electronic). I55844 1994. DM80.00. Janson:2005:IDL Jiang:2011:GBM

[Jan05] Svante Janson. Individ- [JBWK11] Xiaoyi Jiang, Klaus Broele- ual displacements for linear mann, Steffen Wachenfeld, probing hashing with differ- and Antonio Krüger. Graph- ent insertion policies. ACM based markerless registra- Transactions on Algorithms, tion of city maps using ge- REFERENCES 278

ometric hashing. Com- 0169-023X (print), 1872-6933 puter vision and image un- (electronic). derstanding: CVIU, 115 (7):1032–1043, July 2011. Jun:2018:RBD CODEN CVIUF4. ISSN [JCK+18] Jaeyung Jun, Kyu Hyun 1077-3142 (print), 1090-235X Choi, Hokwon Kim, Sang Ho (electronic). URL http: Yu, Seon Wook Kim, and //www.sciencedirect.com/ Youngsun Han. Recovering science/article/pii/S1077314211000828. from biased distribution of Jan:1988:ALO faulty cells in memory by reorganizing replacement re- [JC88a] Jinn-Ke Jan and Chin-Chen gions through universal hash- Chang. Addressing for ing. ACM Transactions on letter-oriented keys. Chung- Design Automation of Elec- kuo Kung Ch’eng Hsueh tronic Systems., 23(2):16:1– K’an/Journal of the Chinese 16:??, January 2018. CO- Institute of Engineers, 11(3): DEN ATASFO. ISSN 1084- 279–284, May 1988. CODEN 4309 (print), 1557-7309 (elec- JCIEEZ, CKCKDZ. ISSN tronic). 0253-3839. Chang:2012:TRR Jones:1988:FTV [jCPB+12] Shu jen Chang, Ray Perl- [JC88b] Russell K. Jones and Tracy ner, William E. Burr, Crabtree. FORTRAN tools Meltem S¨onmez Turan, for VAX/VMS and MS- John M. Kelsey, Souradyuti DOS. John Wiley, New Paul, and Lawrence E. York, NY, USA, 1988. ISBN Bassham. Third-round re- 0-471-61976-0. xii + 447 port of the SHA-3 Cryp- pp. LCCN QA76.73.F25 J66 tographic Hash Algorithm 1988. US$29.95. Hash tables Competition. Technical Re- areusedintheimplementa- port NISTIR 7896, Na- tion of a FORTRAN prepro- tional Institute for Standards cessor for macro statements. and Technology, Gaithers- burg, MD 20899-8900, USA, Jiang:2000:CSM November 2012. 84 pp. URL [JCC00] J.-H. Jiang, C.-C. Chang, http://nvlpubs.nist.gov/ and T.-S. Chen. A com- nistpubs/ir/2012/NIST. pact sparse matrix represen- IR.7896.pdf. tation using random hash Junczys-Dowmunt:2012:SEP functions. Data and Knowl- edge Engineering, 32(1):29– [JD12] Marcin Junczys-Dowmunt. 49, January 2000. CO- A space-eﬃcient phrase ta- DEN DKENEW. ISSN ble implementation using REFERENCES 279

minimal perfect hash func- is much better at produc- tions. Lecture Notes in CS, ing uniform key distributions 7499:320–327, 2012. CO- than others commonly used, DEN LNCSD9. ISSN 0302- yet remains acceptably fast. 9743 (print), 1611-3349 (elec- See [Boy98] for comparison tronic). URL http://link. with a related algorithm. springer.com/content/pdf/ 10.1007/978-3-642-32790- Janzadeh:2009:SCB 2_39. [JFDF09] Hamed Janzadeh, Kaveh Jia:2019:ETS Fayazbakhsh, Mehdi De- hghan, and Mehran S. Fal- [JDW+19] Ruoxi Jia, David Dao, Boxin lah. A secure credit-based co- Wang, Frances Ann Hubis, operation stimulating mecha- Nezihe Merve Gurel, Bo Li, nism for MANETs using hash Ce Zhang, Costas Spanos, chains. Future Generation and Dawn Song. Eﬃcient Computer Systems, 25(8): task-speciﬁc data valuation 926–934, September 2009. for nearest neighbor algo- CODEN FGSEVI. ISSN rithms. Proceedings of the 0167-739X (print), 1872-7115 VLDB Endowment, 12(11): (electronic). 1610–1623, July 2019. CO- DEN ???? ISSN 2150-8097. Joux:1995:PAA Jenks:1976:SPA [JG95] A. Joux and L. Granboulan. A practical attack against [Jen76] Richard D. Jenks, editor. knapsack based hash func- Symsac ’76: proceedings of tions. In De Santis [De 95], the 1976 ACM Symposium pages 58–66. ISBN 3- on Symbolic and Algebraic 540-60176-7. ISSN 0302- Computation, August 10– 9743 (print), 1611-3349 (elec- 12, 1976, Yorktown Heights, tronic). LCCN QA76.9.A25 New York. ACM Press, New E965 1995. York, NY 10036, USA, 1976. LCCN QA155.7.E4 Jha:2015:IMM A15 1976. US$20.00. [JHL+15] Saurabh Jha, Bingsheng He, Jenkins:1997:AAH Mian Lu, Xuntao Cheng, and Huynh Phung Huynh. Im- [Jen97] Bob Jenkins. Algorithm al- proving main memory hash ley: Hash functions. Dr. joins on Intel Xeon Phi Dobbs Journal, 22(9):107– processors: an experimen- 109, 115–116, September tal approach. Proceedings of 1997. CODEN DDJOEB. the VLDB Endowment, 8(6): ISSN 1044-789X. Describes 642–653, February 2015. CO- a new hash function which DEN ???? ISSN 2150-8097. REFERENCES 280

Jung:2011:SHB 10.1007/978-3-540-89524- 4_56. [JK11] Hyunhee Jung and Hyun Sung Jin:2020:HAH Kim. Secure hash-based password authentication pro- [JLL+20] H. Jin, Z. Li, H. Liu, X. Liao, tocol using Smartcards. Lec- and Y. Zhang. Hotspot- ture Notes in CS, 6786: aware hybrid memory man- 593–606, 2011. CODEN agement for in-memory key– LNCSD9. ISSN 0302-9743 value stores. IEEE Trans- (print), 1611-3349 (elec- actions on Parallel and Dis- tronic). URL http://link. tributed Systems, 31(4):779– springer.com/content/pdf/ 792, April 2020. CO- 10.1007/978-3-642-21934- DEN ITDSEO. ISSN 1045- 4_48. 9219 (print), 1558-2183 (electronic). Jeong:2014:ITP Jovanov:2002:ANO [JL14] EunHee Jeong and ByungK- wan Lee. An IP Trace- [JMH02] E. Jovanov, V. Milutinovic, back Protocol using a com- and A. R. Hurson. Acceler- pressed hash table, a sinkhole ation of nonnumeric opera- router and data mining based tions using hardware support on network forensics against for the Ordered Table Hash- network attacks. Future Gen- ing algorithms. IEEE Trans- eration Computer Systems, actions on Computers, 51(9): 33(??):42–52, April 2014. 1026–1040, September 2002. CODEN FGSEVI. ISSN CODEN ITCOB4. ISSN 0167-739X (print), 1872-7115 0018-9340 (print), 1557- (electronic). URL http: 9956 (electronic). URL //www.sciencedirect.com/ http://ieeexplore.ieee. science/article/pii/S0167739X13002410. org/stamp/stamp.jsp?tp=& arnumber=1032623. Jeong:2008:PBH Jean:2014:ICA [JLH08] JongMin Jeong, GooYeon [JNPP14] J´er´emy Jean, Mar´ıa Naya- Lee, and Zygmunt J. Haas. Plasencia, and Thomas Prevention of black-hole at- Peyrin. Improved cryptanal- tack using one-way hash ysis of AES-like permutations. chain scheme in ad-hoc net- Journal of Cryptology, 27(4): works. Lecture Notes in CS, 772–798, October 2014. CO- 5200:564–573, 2008. CO- DEN JOCREQ. ISSN 0933- DEN LNCSD9. ISSN 0302- 2790 (print), 1432-1378 (elec- 9743 (print), 1611-3349 (electronic). URL http://link. tronic). URL http://link. springer.com/article/10. springer.com/content/pdf/ 1007/s00145-013-9156-7. REFERENCES 281

Jaeschke:1980:CMP France, Sept. 1985). Spring- er-Verlag, Berlin, Germany / [JO80] G. Jaeschke and G. Oster- Heidelberg, Germany / Lon- burg. On Cichelli’s mini- don, UK / etc., 1985. ISBN 0- mal perfect hash functions 387-15975-4. LCCN QA76.7 method. Communications of .F861 1985. the Association for Comput- Joux:2004:MIH ing Machinery, 23(12):728– 729, December 1980. CO- [Jou04] Antoine Joux. Multicolli- DEN CACMA2. ISSN 0001- sions in iterated hash func- 0782 (print), 1557-7317 (elections. application to cas- tronic). This letter to the caded constructions. In editor contains comments on Franklin [Fra04], pages 306– [Cic80b], together with a re- ?? CODEN LNCSD9. sponse from R. J. Cichelli ISBN 3-540-22668-0. ISSN [Cic80a]. 0302-9743 (print), 1611-3349 (electronic). URL http: Johnson:1961:ICM //www.springerlink.com/ [Joh61] L. R. Johnson. An indirect openurl.asp?genre=issue& chaining method for address- issn=0302-9743&volume= ing on secondary keys. Com- 3152; http://www.springerlink. munications of the Associa- com/openurl.asp?genre= tion for Computing Machin- volume&id=doi:10.1007/ ery, 4(5):218–222, May 1961. b99099. CODEN CACMA2. ISSN Joye:2003:TCC 0001-0782 (print), 1557-7317 (electronic). [Joy03] Marc Joye, editor. Topics in cryptology, CT-RSA 2003: Johansson:1997:BHS the Cryptographers’ Track at the RSA Conference 2003, [Joh97] T. Johansson. Bucket San Francisco, CA, USA, hashing with a small key April 13–17, 2003: Proceed- size. Lecture Notes in CS, ings, volume 2612 of Lec- 1233:149–??, 1997. CO- ture Notes in Computer Sci- DEN LNCSD9. ISSN 0302- ence. Springer-Verlag, Berlin, 9743 (print), 1611-3349 (elec- Germany / Heidelberg, Ger- tronic). many / London, UK / etc., Jouannaud:1985:FPL 2003. CODEN LNCSD9. ISBN 3-540-00847-0. ISSN [Jou85] Jean-Pierre Jouannaud, ed- 0302-9743 (print), 1611- itor. Functional Program- 3349 (electronic). LCCN ming Languages and Com- QA76.9.A25 C822 2003. URL puter Architecture. Proceed- http://link.springer-ny. ings of a Conference (Nancy, com/link/service/series/ REFERENCES 282

0558/tocs/t2612.htm; 9743 (print), 1611-3349 (elec- http://www.springerlink. tronic). URL http://link. com/openurl.asp?genre= springer.com/content/pdf/ issue&issn=0302-9743&volume= 10.1007/978-3-540-74472- 2612. 6_51. Jutla:2007:PGC Jin:2009:SMB

[JP07] Charanjit S. Jutla and [JTOT09] Zhe Jin, Andrew Beng Jin Anindya C. Patthak. Prov- Teoh, Thian Song Ong, and ably good codes for hash Connie Tee. Secure minutiae- function design. Lec- based ﬁngerprint templates ture Notes in CS, 4356: using random triangle hash- 376–393, 2007. CODEN ing. Lecture Notes in CS, LNCSD9. ISSN 0302-9743 5857:521–531, 2009. CO- (print), 1611-3349 (elec- DEN LNCSD9. ISSN 0302- tronic). URL http://link. 9743 (print), 1611-3349 (elec- springer.com/content/pdf/ tronic). URL http://link. 10.1007/978-3-540-74462- springer.com/content/pdf/ 7_26. 10.1007/978-3-642-05036- Jensen:2008:OEM 7_49. [JP08] Morten Skaarup Jensen and Jung:1987:IRC Rasmus Pagh. Optimality [Jun87] Achim Jung. Implementing in external memory hash- the RSA cryptosystem. Com- ing. Algorithmica, 52(3): puters and Security, 6(4): 403–411, November 2008. 342–350, August 1987. CO- CODEN ALGOEJ. ISSN DEN CPSEDU. ISSN 0167- 0178-4617 (print), 1432- 4048. 0541 (electronic). URL http://www.springerlink. Jacobs:1986:TRT com/openurl.asp?genre= [Jv86] Christiaan T. M. Jacobs and article&issn=0178-4617& Peter van Emde Boas. Two volume=52&issue=3&spage= results on tables. Infor- 403. mation Processing Letters, Jeon:2007:SAP 22(1):43–48, January 1986. [JRPK07] Jin-Oh Jeon, Su-Bong Ryu, CODEN IFPLAT. ISSN Sang-Jo Park, and Min- 0020-0190 (print), 1872-6119 Sup Kang. Strong authen- (electronic). tication protocol for RFID Janson:2016:UAL tag using SHA-1 hash algorithm. Lecture Notes in CS, [JV16] Svante Janson and Alfredo 4705:634–643, 2007. CO- Viola. A uniﬁed approach to DEN LNCSD9. ISSN 0302- linear probing hashing with REFERENCES 283

buckets. Algorithmica, 75(4): Conference, Montr´eal, QC, 724–781, August 2016. CO- Canada, August 14–15, 2014: DEN ALGOEJ. ISSN 0178- revised selected papers,vol- 4617 (print), 1432-0541 (elec- ume 8781 of Lecture notes tronic). URL http://link. in computer science: LNCS springer.com/article/10. sublibrary. SL 4, Security 1007/s00453-015-0111-x. and cryptology. Springer-Ver- lag, Berlin, Germany / Hei- Jia:2018:PPH delberg, Germany / London, [JWM+18] C. J. Jia, Y. Wang, C. B. UK / etc., 2014. ISBN 3-319- Mendl,B.Moritz,andT.P. 13050-1 (print), 3-319-13051- Devereaux. Paradeisos: a X (e-book). ISSN 0302- perfect hashing algorithm for 9743 (print), 1611-3349 (elec- many-body eigenvalue prob- tronic). LCCN QA76.9.A25. lems. Computer Physics Communications, 224(??): Kabe:1987:RRT 81–89, March 2018. CO- [Kab87] D. G. Kabe. Reducing the re- DEN CPHCBZ. ISSN 0010- trieval time of hashing meth- 4655 (print), 1879-2944 (elec- ods by using bucket size. In- tronic). URL https:/ dustrial Mathematics, 37(pt /www.sciencedirect.com/ 1):93–102, 1987. CODEN science/article/pii/S0010465517303946. IMTHAI. ISSN 0019-8528. Jiang:2007:DHT Kahrs:1992:UUL [JXY07] Yi Jiang, Guangtao Xue, and Jinyuan You. Dis- [Kah92] S. Kahrs. Unlimp, unique- tributed hash table based ness as a leitmotiv for im- peer-to-peer version con- plementation. In Bruynooghe trol system for collabora- and Wirsing [BW92], pages tion. Lecture Notes in CS, 115–129. ISBN 0-387-55844- 4402:489–498, 2007. CO- 6 (New York), 3-540-55844- DEN LNCSD9. ISSN 0302- 6 (Berlin). LCCN QA76.7 9743 (print), 1611-3349 (elec- .I5773 1992. tronic). URL http://link. Kak:1983:EMP springer.com/content/pdf/ 10.1007/978-3-540-72863- [Kak83] Subhash C. Kak. Expo- 4_50. nentiation modulo a polyno- Joux:2014:SAC mial for data security. In- ternational Journal of Com- [JY14] Antoine Joux and Amr puter and Information Sci- Youssef, editors. Selected ar- ences, 12(5):337–346, Octo- eas in cryptography — SAC ber 1983. CODEN IJCIAH. 2014: 21st International ISSN 0091-7036. REFERENCES 284

Kak:1993:NNA several sorting algorithms. In Proceedings — Parbase- [Kak93] Subhash Kak. Neural net- 90 International Conference works and artificial intel- on Databases, Parallel Archi- ligence. Information sci- tectures, and Their Applica- ences, 70(1/2):1, 1993. CO- tions (Mar 7–9 1990: Miami DEN ISIJBC. ISSN 0020- Beach, FL, USA), pages 147– 0255 (print), 1872-6291 (elec- 151. IEEE Computer Soci- tronic). ety Press, 1109 Spring Street, Kaliski:1993:SES Suite 300, Silver Spring, MD 20910, USA, 1990. IEEE cat- [Kal93] Burt Kaliski. A survey of alog number 90CH2728-4. encryption standards. IEEE Micro, 13(6):74–81, Novem- Kanada:1991:MVP ber/December 1993. CO- DEN IEMIDZ. ISSN 0272- [Kan91] Y. Kanada. A method of 1732 (print), 1937-4143 (elec- vector processing for shared tronic). symbolic data. In IEEE [IEE91a], pages 722–731. Kaliski:2001:HFF ISBN 0-8186-9158-1 (IEEE case), 0-8186-2158-3 (IEEE [Kal01] Burton S. Kaliski Jr. On paper), 0-8186-6158-5 (IEEE hash function firewalls in microfiche), 0-89791-459-7 signature schemes. Lecture (ACM). LCCN QA76.5 .S894 Notes in CS, 2271:1–??, 2001. 1991. ACM order num- CODEN LNCSD9. ISSN ber 415913. IEEE Computer 0302-9743 (print), 1611- Society Press order number 3349 (electronic). URL 2158. IEEE catalog number http://link.springer-ny. 91CH3058-5. com/link/service/series/ 0558/bibs/2271/22710001. Kanada:1993:MVP htm; http://link.springer- ny.com/link/service/series/[Kan93] Y. Kanada. A method 0558/papers/2271/22710001. of vector processing for pdf. shared symbolic data. Paral- lel Computing, 19(10):1155– Kaman:1974:HC 1175, October 1993. CO- [Kam74] Charles H. Kaman. Hash DEN PACOEJ. ISSN 0167- coding. Polimery, ??(??): 8191 (print), 1872-7336 (elec- 229–232, ???? 1974. tronic). Kanada:1990:VTH Karlsson:1982:ACR [Kan90] Yasusi Kanada. Vector- [Kar82] K. Karlsson. Les Arbres Cou- ization technique of hash- vrants Reduits: Une Methode ing and its application to D’acces Compacte Pour Don- REFERENCES 285

nees Dynamiques.PhDthe- 236–250, February 2018. CO- sis, ????, Paris, France, 1982. DEN JCOBEM. ISSN 1066- ?? pp. 5277 (print), 1557-8666 (electronic). URL https://www. Karloff:1998:PNA liebertpub.com/doi/abs/ [Kar98] Howard Karloff, editor. Pro- 10.1089/cmb.2017.0113; ceedings of the ninth an- https://www.liebertpub. nual ACM-SIAM sympo- com/doi/pdf/10.1089/cmb. sium on Discrete algorithms, 2017.0113. San Francisco, California, Krause:1981:PHF January 25–27, 1998,volume 95 of Proceedings in Ap- [KCB81] Max Krause, Nick Cercone, plied Mathematics Ser. ACM and John Boates. Perfect Press, New York, NY 10036, hash function search with USA, 1998. ISBN 0-89871- application to natural lan- 410-9. LCCN QA76.6 .A278 guage systems. Technical Re- 1998. URL http://dl. port CMPT TR 81-6, Simon acm.org/citation.cfm?id= Fraser University, 1981. ?? 314613. pp. (email [email protected]. ca). Kawagoe:1985:MDH Ku:2005:WYR [Kaw85] Kyoji Kawagoe. Modified dynamic hashing. In Na- [KCC05] Wei-Chi Ku, Min-Hung Chi- vathe [Nav85], pages 201– ang, and Shen-Tien Chang. 213. ISBN 0-89791-160-1. Weaknesses of Yoon–Ryu– LCCN QA 76.9 D3 I59 1985. Yoo’s hash-based password authentication scheme. Op- Kawamoto:2015:LSH erating Systems Review,39 [Kaw15] Junpei Kawamoto. A local- (1):85–89, January 2005. ity sensitive hashing filter for CODEN OSRED8. ISSN encrypted vector databases. 0163-5980 (print), 1943-586X Fundamenta Informaticae, (electronic). 137(2):291–304, April 2015. Kirk:1984:CMI CODEN FUMAAJ. ISSN 0169-2968 (print), 1875-8681 [KCF84] M. Kirk, R. J. Chignell, (electronic). and J. Finnie. Computer model to indentify incom- Kanj:2018:SNN patibilities between the FM [KBG18] Sawsan Kanj, Thomas Brüls, sound broadcasting and aero- and Stéphane Gazut. Shared nautical bands. IERE Con- nearest neighbor clustering in ference Proceedings, 60, 1984. a locality sensitive hashing CODEN IERCB6. ISBN framework. Journal of Com- 0-903748-56-8. ISSN 0538- putational Biology, 25(2): 0006. REFERENCES 286

Ku:2003:WLL 20–34, March 1989. CO- DEN JOALDV. ISSN [KCL03] Wei-Chi Ku, Chien-Ming 0196-6774 (print), 1090-2678 Chen, and Hui-Lung Lee. (electronic). URL http: Weaknesses of Lee–Li–Hwang’s //www.sciencedirect.com/ hash-based password authen- science/article/pii/0196677489900217. tication scheme. Operating Systems Review, 37(4):19– Keller:1993:HRP 25, October 2003. CODEN [Kel93] Joerg Keller. Hashing and OSRED8. ISSN 0163-5980 rehashing in PRAM emula- (print), 1943-586X (elections. In Proceedings of the tronic). 3rd Workshop on Parallel Al- Kim:2011:SSE gorithms (WOPA), page ?? ????, ????, May 1993. [KCR11] Changhoon Kim, Matthew Caesar, and Jennifer Rex- Keller:1996:FRP ford. SEATTLE: a Scal- [Kel96] J. Keller. Fast rehashing able Ethernet Architec- in PRAM emulations. The- ture for Large Enterprises. oret. Comput. Sci., 155(2): ACM Transactions on Com- 349–363, March 11, 1996. puter Systems, 29(1):1:1– CODEN TCSCDI. ISSN 1:35, February 2011. CO- 0304-3975 (print), 1879-2294 DEN ACSYEC. ISSN 0734- (electronic). 2071 (print), 1557-7333 (electronic). Kennedy:1973:RSU

Koushik:1992:LDH [Ken73] Ken Kennedy. Reduction in strength using hashed tem- [KD92] Murlidhar Koushik and poraries. Technical Re- George Diehr. Linear- port SETL Newsletter #102, density hashing with dy- Courant Inst. of Math. Sci- namic overﬂow sharing. In- ences, New York University, formation system, 17(5):359– New York, March 1973. ?? 380, September 1992. CO- pp. DEN INSYD6. ISSN 0306- 4379 (print), 1873-6076 (elec- Kerr:1975:PIC tronic). [Ker75] Douglas S. Kerr, editor. Pro- Knott:1989:HTC ceedings of the International Conference on Very Large [KdlT89] Gary D. Knott and Pilar Data Bases, Framingham, de la Torre. Hash ta- MA, USA, September 22– ble collision resolution with 24, 1975. ACM Press, New direct chaining. Jour- York, NY 10036, USA, 1975. nal of Algorithms, 10(1): ISBN ???? ISSN 0278-2596. REFERENCES 287

LCCN QA76.9.D3 I55 1975. H. Øverby. HashTag erasure US$15.00. codes: From theory to prac- Kocberber:2015:AMA tice. IEEE Transactions on Big Data, 4(4):516–529, De- [KFG15] Onur Kocberber, Babak Fal- cember 2018. ISSN 2332- safi, and Boris Grot. Asyn- 7790. chronous memory access Karplus:1984:FMP chaining. Proceedings of the VLDB Endowment,9[KH84] K. Karplus and G. Hag- (4):252–263, December 2015. gard. Finding minimal per- CODEN ???? ISSN 2150- fect hash functions. Technical 8097. Report 84-637, Cornell Uni- Kak:1995:ILM versity, September 1984. ?? pp. (email [email protected]. [KG95] Avinash C. Kak and Lynne edu). Grewe. Interactive learning of a multiple-attribute hash Khan:1995:PDH table classifier for fast object [Kha95] Zahira S. Khan. Performance recognition. Computer vi- of the distributed hash join sion and image understand- algorithms in a distributed ing: CVIU, 61(3):387–??, heterogeneous supercomput- May 1, 1995. CODEN ing environment.Thesis CVIUF4. ISSN 1077-3142 (Ph.D.), Temple University, (print), 1090-235X (elec- Philadelphia, PA, USA, 1995. tronic). xxii + 220 pp. Kaushik:2012:MGH Kuo:1989:DSF [KGJG12] Vandana Dixit Kaushik, Amit K. Gupta, Umarani [KHH89] Y. S. Kuo, S.-Y. Hwang, and Jayaraman, and Phalguni H. F. Hu. Data structure for Gupta. Modified geomet- fast region searches. IEEE ric hashing for face database Design & Test of Computers, indexing. Lecture Notes in 6(5):20–28, October 1989. CS, 6839:608–613, 2012. CO- CODEN IDTCEC. ISSN DEN LNCSD9. ISSN 0302- 0740-7475 (print), 1558-1918 9743 (print), 1611-3349 (elec- (electronic). tronic). URL http://link. Kortelainen:2010:MAG springer.com/content/pdf/ 10.1007/978-3-642-25944- [KHK10] Juha Kortelainen, Kimmo 9_79. Halunen, and Tuomas Ko- rtelainen. Multicollision at- Kralevska:2018:HEC tacks and generalized iter- [KGJØ18] K. Kralevska, D. Glig- ated hash functions. Journal oroski, R. E. Jensen, and of Mathematical Cryptology, REFERENCES 288

4(3):239–270, 2010. CODEN Kim:1991:ISSa ???? ISSN 1862-2976 (print), 1862-2984 (electronic). [KHW91a] Yul H. Kim, Mark D. Hill, and David A. Wood. Im- Kanizo:2012:HTF plementing stack simulation [KHK12] Yossi Kanizo, David Hay, and for highly-associative mem- Isaac Keslassy. Hash ta- ories. Technical Report bles with ﬁnite buckets are TR 997, Computer Sciences less resistant to deletions. Department, University of Computer Networks (Ams- Wisconsin–Madison, Febru- terdam, Netherlands: 1999), ary 1991. ?? pp. 56(4):1376–1389, March 16, Kim:1991:ISSb 2012. CODEN ???? ISSN 1389-1286 (print), 1872-7069 [KHW91b] Yul H. Kim, Mark D. Hill, (electronic). URL http: and David A. Wood. Imple- //www.sciencedirect.com/ menting stack simulation for science/article/pii/S1389128611004476. highly-associative memories. ACM SIGMETRICS Perfor- Kanizo:2015:MTH mance Evaluation Review,19 [KHK15] Yossi Kanizo, David Hay, (1):212–213, May 1991. CO- and Isaac Keslassy. Max- DEN ???? ISSN 0163- imizing the throughput of 5999 (print), 1557-9484 (elec- hash tables in network de- tronic). vices with combined SRAM/ Kak:1994:CVW DRAM memory. IEEE Transactions on Parallel and [KI94] A. C. Kak and K. Ikeuchi, ed- Distributed Systems, 26(3): itors. 2ndCAD-basedvision 796–809, March 2015. CO- workshop: – February 1994, DEN ITDSEO. ISSN 1045- Champion, PA, PROCEED- 9219 (print), 1558-2183 (elec- INGS OF THE CAD BASED tronic). URL http://www. VISION WORKSHOP 1994; computer.org/csdl/trans/ 2nd. IEEE Computer Soci- td/2015/03/06781627-abs. ety Press, 1109 Spring Street, html. Suite 300, Silver Spring, MD Kitsuregawa:1989:JSK 20910, USA, 1994. ISBN 0-8186-5310-8, 0-8186-5311- [KHT89] M. Kitsuregawa, L. Harada, 6. LCCN TA1632 .C33 1994. and M. Takagi. Join strate- Kiessling:1985:DFU gies on KD-tree indexed relations. In Proceedings of [Kie85] W. Kiessling. Dynamic ﬁl- the Fifth International Con- ters: a uniform concept for ference on Data Engineering, query optimization in set- pages 85–93. ????, Los Ange- oriented database architec- les, CA, USA, February 1989. tures. Technical report, Tech- REFERENCES 289

nical University ofMunchen, volume&id=doi:10.1007/ 1985. ?? pp. b106171.

Kiltz:2001:PPS Kim:1980:QOR [Kim80] W. Kim. Query Optimization [Kil01] Eike Kiltz. A primitive for for Relational Database Sys- proving the security of ev- tems. PhD thesis, University ery bit and about univer- of Illinois, Urbana, October sal hash functions & hard 1980. ?? pp. core bits. Lecture Notes in CS, 2138:388–??, 2001. Kim:1999:NSP CODEN LNCSD9. ISSN [Kim99] Sun Kim. A new string- 0302-9743 (print), 1611- pattern matching algorithm 3349 (electronic). URL using partitioning and hash- http://link.springer-ny. ing efficiently. ACM Jour- com/link/service/series/ nal of Experimental Algorith- 0558/bibs/2138/21380388. mics, 4:2:1–2:??, ???? 1999. htm; http://link.springer- ISSN 1084-6654. ny.com/link/service/series/ 0558/papers/2138/21380388. Kim:2011:EHB pdf. [KJC11] Nam-Uk Kim, Sung-Min Kilian:2005:TCS Jung, and Tai-Myoung Chung. An efficient hash-based load [Kil05] Joe Kilian, editor. Theory of balancing scheme to sup- cryptography: Second theory port parallel NIDS. Lec- of cryptography conference, ture Notes in CS, 6782: TCC 2005, Cambridge, MA, 537–549, 2011. CODEN USA, February 10–12, 2005, LNCSD9. ISSN 0302-9743 proceedings, volume 3378 (print), 1611-3349 (elec- of Lecture Notes in Com- tronic). URL http://link. puter Science. Springer-Ver- springer.com/content/pdf/ lag, Berlin, Germany / Hei- 10.1007/978-3-642-21928- delberg, Germany / London, 3_39. UK / etc., 2005. CODEN Kim:2017:MES LNCSD9. ISBN 3-540-24573- 1 (softcover). ISSN 0302- [KJS17] Minchul Kim, Younghoon 9743 (print), 1611-3349 (elec- Jung, and Junghwan Song. tronic). LCCN QA76.9.A25 A modified exhaustive search T44 2005. URL http: on a password system using //www.springerlink.com/ SHA-1. International Jour- openurl.asp?genre=issue& nal of Information Security, issn=0302-9743&volume= 16(3):263–269, June 2017. 3378; http://www.springerlink. CODEN ???? ISSN 1615- com/openurl.asp?genre= 5262 (print), 1615-5270 (elec- REFERENCES 290

tronic). URL http://link. proofs for full domain hash, springer.com/article/10. revisited. Lecture Notes in 1007/s10207-016-0332-2. CS, 7237:537–553, 2012. CO- DEN LNCSD9. ISSN 0302- Kojima:1985:HFO 9743 (print), 1611-3349 (elec- [KK85] Isao Kojima and Yahiko tronic). URL http://link. Kambayashi. Hash-based ﬁle springer.com/accesspage/ organization utilizing large chapter/10.1007/978-3- capacity main memory. In 642-29011-4_31; http:/ Proceedings — Foundations /link.springer.com/chapter/ of Data Organization., pages 10.1007/978-3-642-29011- 41–50. Organizing Commit- 4_32/; http://link.springer. tee of the Int Conference on com/content/pdf/10.1007/ Foundations of Data Orga- 978-3-642-29011-4_32. nization, Jpn, 1985. Kyoto Kakvi:2018:OSP Sangyo Univ. Computer Sci- ence Inst, Kyoto, Jpn. [KK18] Saqib A. Kakvi and Eike Kiltz. Optimal secu- Khan:1996:PCI rity proofs for full domain [KK96] Z. S. Khan and E. Kwatny. hash, revisited. Journal Performance comparison of of Cryptology, 31(1):276– interprocessor communica- 306, January 2018. CO- tion schemes for a hashing DEN JOCREQ. ISSN 0933- technique on the Connection 2790 (print), 1432-1378 (elec- Machine. International Jour- tronic). URL https://link. nal of Computer Systems Sci- springer.com/article/10. ence and Engineering, 11(4): 1007/s00145-017-9257-9. 189–??, ???? 1996. CODEN Kim:2012:SSL CSSEEI. ISSN 0267-6192. [KKC12] Saehoon Kim, Yoonseop Kelsey:2006:HHF Kang, and Seungjin Choi. [KK06] J. Kelsey and T. Kohno. Sequential spectral learning Herding hash functions and to hash with multiple repre- the Nostradamus attack. In sentations. Lecture Notes in Vaudenay [Vau06], pages CS, 7576:538–551, 2012. CO- 183–200. ISBN 3-540-34547- DEN LNCSD9. ISSN 0302- 7. LCCN ???? URL http: 9743 (print), 1611-3349 (elec- //www.springerlink.com/ tronic). URL http://link. content/978-3-540-34547- springer.com/content/pdf/ 3. 10.1007/978-3-642-33715- . Kakvi:2012:OSP 4_39 Kim:2009:SVH [KK12] Saqib A. Kakvi and Eike Kiltz. Optimal security [KKL+09] Changkyu Kim, Tim Kaldewey, REFERENCES 291

Victor W. Lee, Eric Sed- tors. Database systems for lar, Anthony D. Nguyen, Na- next-generation applications: dathur Satish, Jatin Chhugani, principles and practice,vol- Andrea Di Blas, and Pradeep ume 1 of Advanced Database Dubey. Sort vs. Hash re- Research and Development visited: fast join imple- Series. World Scientific Pub- mentationonmodernmulti- lishing Co. Pte. Ltd., P. O. core CPUs. Proceedings of Box 128, Farrer Road, Singa- the VLDB Endowment,2 pore 9128, 1992. ISBN 981- (2):1378–1389, August 2009. 02-1315-8. LCCN QA76.9.D3 CODEN ???? ISSN 2150- D3589 1992. 8097. Kabiljo:2017:SHP Lioma:2008:AHT [KKP+17] Igor Kabiljo, Brian Kar- [KKMS10] Shahram Khazaei, Simon rer, Mayank Pundir, Sergey Knellwolf, Willi Meier, and Pupyrev, and Alon Shalita. Deian Stefan. Improved lin- Social hash partitioner: a ear differential attacks on scalable distributed hyper- CubeHash. Lecture Notes in graph partitioner. Proceed- CS, 6055:407–418, 2010. CO- ings of the VLDB Endow- DEN LNCSD9. ISSN 0302- ment, 10(11):1418–1429, Au- 9743 (print), 1611-3349 (elec- gust 2017. CODEN ???? tronic). URL http://link. ISSN 2150-8097. springer.com/content/pdf/ Kim:2007:EIK 10.1007/978-3-642-12678- 9_24. [KKRJ07] Mooseop Kim, Youngse Kim, Jaecheol Ryou, and Sungik Kaski:2012:HHS Jun. Efficient implemen- [KKN12] Petteri Kaski, Mikko Koivisto, tation of the keyed-hash and Jesper Nederlof. Homo- message authentication code morphic hashing for sparse based on SHA-1 algorithm coefficient extraction. Lec- for mobile trusted comput- ture Notes in CS, 7535: ing. Lecture Notes in CS, 147–158, 2012. CODEN 4610:410–419, 2007. CO- LNCSD9. ISSN 0302-9743 DEN LNCSD9. ISSN 0302- (print), 1611-3349 (elec- 9743 (print), 1611-3349 (electronic). URL http://link. tronic). URL http://link. springer.com/chapter/10. springer.com/content/pdf/ 1007/978-3-642-33293-7_ 10.1007/978-3-540-73547- 15/. 2_42. Kim:1992:DSN Kurosawa:1991:CFH [KKP92] Won Kim, Y. Kambayashi, [KKT91] Kaoru Kurosawa, Hirofumi and In Sup Paik, edi- Kasai, and Shigeo Tsujii. REFERENCES 292

Collision free hash function of hash rate 1, including the based on the r-th residue parallel-DM. In De Santis cryptosystem. IEICE Trans- [De 95], pages 410–418. ISBN actions on Communications/ 3-540-60176-7. ISSN 0302- Electronics/Information and 9743 (print), 1611-3349 (elec- Systems, E74(8):2114–2117, tronic). LCCN QA76.9.A25 1991. CODEN IEITEF. E965 1995. ISSN 0917-1673. Katajainen:1996:EUH Kemper:1999:GHT [KL96] Jyrki Katajainen and Michael [KKW99] Alfons Kemper, Donald Lykke. Experiments with Kossmann, and Christian universal hashing. DIKU Re- Wiesner. Generalised hash port 96/8, Department of teams for join and group-by. Computer Science, Univer- In Atkinson et al. [AOV+99], sity of Copenhagen, Copen- pages 30–41. ISBN 1-55860- hagen, Denmark, ???? 1996. 615-7. LCCN QA76.9.D3 Kencl:2008:ALS I559 1999. URL http: //www.vldb.org/dblp/db/ [KL08] Lukas Kencl and Jean-Yves conf/vldb/KemperKW99.html. Le Boudec. Adaptive load Also known as VLDB’99. sharing for network processors. IEEE/ACM Transac- Kim:1987:ESJ tions on Networking, 16(2): [KL87] Chang D. Kim and Yoon J. 293–306, April 2008. CO- Lee. Execution strate- DEN IEANEP. ISSN 1063- gies for join operation in 6692 (print), 1558-2566 (elec- multi-processor main mem- tronic). ory based database system. Katz:2015:IMC In Proceedings — TENCON 87: 1987 IEEE Region 10 [KL15] Jonathan Katz and Yehuda Conference, ’Computers and Lindell. Introduction to mod- Communications Technology ern cryptography. Chapman Toward 2000’., pages 302– and hall/CRC cryptography 306. IEEE Computer Soci- and network security series. ety Press, 1109 Spring Street, Taylor and Francis, London, Suite 300, Silver Spring, MD UK and Boca Raton, FL, 20910, USA, 1987. IEEE Ser- USA, second edition, 2015. vice Cent. Piscataway, NJ, ISBN 1-4665-7026-1 (hard- USA. cover). 583 pp. LCCN Knudsen:1995:NAA QA76.9.A25 K36 2014. Karp:1993:EPS [KL95] L. R. Knudsen and X. Lai. New attacks on all double [KLadH93] R. Karp, M. Luby, and block length hash functions F. Meyer auf der Heide. Eﬃ- REFERENCES 293

cient PRAM simulation on a fast double block length hash distributed memory machine. functions. Journal of Cryp- Technical Report TR-93-040, tology, 11(1):59–72, Winter International Computer Sci- 1998. CODEN JOCREQ. ence Institute, Berkeley, CA, ISSN 0933-2790 (print), USA, August 1993. ?? pp. 1432-1378 (electronic). URL http://link.springer.de/ Karger:1997:CHR link/service/journals/ [KLL+97] David Karger, Eric Lehman, 00145/bibs/11n1p59.html; Tom Leighton, Rina Pani- http://link.springer. grahy, Matthew Levine, and de/link/service/journals/ Daniel Lewin. Consistent 00145/bibs/11n1p59.pdf; hashing and random trees: http://link.springer. distributed caching proto- de/link/service/journals/ cols for relieving hot spots 00145/bibs/11n1p59.tex; on the World Wide Web. http://link.springer. In ACM [ACM97b], pages de/link/service/journals/ . 654–663. ISBN 0-89791-888- 00145/tocs/01101.html 6. LCCN QA76.5 .A849 Kompella:2012:RSF 1997. URL http://www. [KLSV12] Ramana Rao Kompella, Kir- acm.org/pubs/articles/ ill Levchenko, Alex C. Sno- proceedings/stoc/258533/ eren, and George Vargh- p654-karger/p654-karger. ese. Router support for pdf; http://www.acm. ﬁne-grained latency measure- org/pubs/citations/proceedings/ ments. IEEE/ACM Transac- stoc/258533/p654-karger/ tions on Networking, 20(3): . ACM order no. 508970. 811–824, June 2012. CO- Karp:1996:EPS DEN IEANEP. ISSN 1063- 6692 (print), 1558-2566 (elec- [KLM96] Richard M. Karp, Michael tronic). Luby, and Friedhelm Meyer auf der Heide. Eﬃcient King:2007:CRP PRAM simulation on a dis- [KLSY07] Valerie King, Scott Lewis, tributed memory machine. Jared Saia, and Maxwell Algorithmica, 16(4–5):517– Young. Choosing a random 542, 1996. CODEN AL- peer in chord. Algorithmica, GOEJ. ISSN 0178-4617 49(2):147–169, October 2007. (print), 1432-0541 (elec- CODEN ALGOEJ. ISSN tronic). 0178-4617 (print), 1432- Knudsen:1998:AFD 0541 (electronic). URL http://www.springerlink. [KLP98] Lars R. Knudsen, Xuejia Lai, com/openurl.asp?genre= and Bart Preneel. Attacks on article&issn=0178-4617& REFERENCES 294

volume=49&issue=2&spage= Korner:1988:RAC 147. [KM88b] J. Korner and K. Marton. Koczkodaj:1992:IPF Random access communication and graph entropy. [KLT92] Waldemar W. Koczkodaj, IEEE Transactions on Infor- Peter E. Lauer, and Anestis A. mation Theory, 34(2):312– Toptsis, editors. ICCI ’92: 314, March 1988. CO- Proceedings, Fourth Interna- DEN IETTAW. ISSN 0018- tional Conference on Com- 9448 (print), 1557-9654 (elec- puting and Information, May tronic). 28–30, 1992, Toronto, On- tario. IEEE Computer Soci- Kato:1992:PCI ety Press, 1109 Spring Street, Suite 300, Silver Spring, MD [KM92] K. Kato and T. Masuda. 20910, USA, 1992. ISBN Persistent caching: An im- 0-8186-2812-X (hardcover), plementation technique for 0-8186-2811-1 (microﬁche). complex objects with object LCCN QA75.5 .I587 1992. identity. IEEE Transactions on Software Engineering, Koerner:1986:IFB 18(7):631–645, July 1992. CODEN IESEDJ. ISSN [KM86] J. Koerner and K. Mar- 0098-5589 (print), 1939-3520 ton. Improved Fredman- (electronic). URL http: Komlos bounds for perfect //ieeexplore.ieee.org/ hashing via information the- stamp/stamp.jsp?arnumber= ory. In 1986 IEEE Inter- 148481. national Symposium on In- formation Theory (ISIT)., Kirsch:2007:UQA pages 118–?? IEEE Com- puter Society Press, 1109 [KM07] A. Kirsch and M. Mitzen- Spring Street, Suite 300, Sil- macher. Using a queue to ver Spring, MD 20910, USA, de-amortize cuckoo hashing 1986. IEEE Service Cent. in hardware. In ????, edi- Piscataway, NJ, USA. tor, Proceedings of the 45th Annual Allerton Conference Korner:1988:NBP on Communication, Con- trol, and Computing 2007: [KM88a] J. Korner and K. Mar- September 26-28, 2007, Mon- ton. New bounds for per- ticello, Illinois, USA, pages fect hashing via information 751–758. Coordinated Sci- theory. European Journal of ence Laboratory, Univer- Combinatorics, 9(6):523–??, sity of Illinois at Urbana- November 1, 1988. CODEN Champaign, Urbana, IL, EJOCDI. ISSN 0195-6698. USA, 2007. ISBN 1-60560- REFERENCES 295

086-5. LCCN QA76 A434 Athanasios Milidonis, Costas E. 2007. URL ????. Goutis, and George Theodor- Kirsch:2008:SSH idis. High-speed FPGA implementation of secure hash [KM08] Adam Kirsch and Michael algorithm for IPSec and VPN Mitzenmacher. Simple sum- applications. The Jour- maries for hashing with nal of Supercomputing,37 choices. IEEE/ACM Trans- (2):179–195, August 2006. actions on Networking,16 CODEN JOSUED. ISSN (1):218–231, February 2008. 0920-8542 (print), 1573- CODEN IEANEP. ISSN 0484 (electronic). URL 1063-6692 (print), 1558-2566 http://www.springerlink. (electronic). com/openurl.asp?genre= article&issn=0920-8542& Karroumi:2009:HBK volume=37&issue=2&spage= [KM09] Mohamed Karroumi and Ay- 179. oub Massoudi. Hash-based Kirsch:2010:HBT key management schemes for MPEG4–FGS. Lec- [KMV10] Adam Kirsch, Michael Mitzen- ture Notes in CS, 5451: macher, and George Vargh- 245–256, 2009. CODEN ese. Hash-based techniques LNCSD9. ISSN 0302-9743 for high-speed packet pro- (print), 1611-3349 (elec- cessing. Part 2. In Cormode and Thottan [CT10], pages tronic). URL http://link. 181–218. ISBN 1-84882- springer.com/content/pdf/ 764-4. LCCN TK5105.5 10.1007/978-3-642-00843- .A39523 2010. URL 6_22. http: //www.springerlink.com/ Kirsch:2010:POM content/t607n8n626515k62/ . [KM10] Adam Kirsch and Michael Mitzenmacher. The power of Kirsch:2008:MRH one move: hashing schemes [KMW08] Adam Kirsch, Michael Mitzen- for hardware. IEEE/ACM macher, and Udi Wieder. Transactions on Network- More robust hashing: Cuckoo ing, 18(6):1752–1765, De- hashing with a stash. In cember 2010. CODEN Halperin and Mehlhorn IEANEP. ISSN 1063-6692 [HM08], pages 611–622. CO- (print), 1558-2566 (elec- DEN LNCSD9. ISBN 3- tronic). 540-87744-4, 3-540-87743-6 Kakarountas:2006:HSF (softcover). ISSN 0302- 9743 (print), 1611-3349 (elec- [KMM+06] Athanasios P. Kakaroun- tronic). LCCN QA76.9.A43 tas, Haralambos Michail, E83 2008. URL http:// REFERENCES 296

link.springer.com/content/ puter Journal, 18(3):265– pdf/10.1007/978-3-540- 278, August 1975. CO- 87744-8_51; http://www. DEN CMPJA6. ISSN springerlink.com/content/ 0010-4620 (print), 1460-2067 24620h6712831010/. (electronic). URL http: //comjnl.oxfordjournals. Kirsch:2010:MRH org/content/18/3/265.full. [KMW10] Adam Kirsch, Michael Mitzen- pdf+html; http://www3. macher, and Udi Wieder. oup.co.uk/computer_journal/ More robust hashing: Cuckoo hdb/Volume_18/Issue_03/ hashing with a stash. SIAM tiff/265.tif; http:// Journal on Computing,39 www3.oup.co.uk/computer_ (4):1543–1561, ???? 2010. journal/hdb/Volume_18/ CODEN SMJCAT. ISSN Issue_03/tiff/266.tif; 0097-5397 (print), 1095-7111 http://www3.oup.co.uk/ (electronic). computer_journal/hdb/Volume_ 18/Issue_03/tiff/267.tif; Knaﬂ:1989:PSC http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [Kna89] George J. Knaﬂ, editor. Pro- 18/Issue_03/tiff/268.tif; ceedings 13: September 20– http://www3.oup.co.uk/ 22, 1989: Compsac 89 / computer_journal/hdb/Volume_ the Thirteenth Annual Inter- 18/Issue_03/tiff/269.tif; national Computer Software http://www3.oup.co.uk/ and Applications Conference, computer_journal/hdb/Volume_ Hyatt Orlando Hotel, Or- 18/Issue_03/tiff/270.tif; lando, Florida. IEEE Com- http://www3.oup.co.uk/ puter Society Press, 1109 computer_journal/hdb/Volume_ Spring Street, Suite 300, Sil- 18/Issue_03/tiff/271.tif; ver Spring, MD 20910, USA, http://www3.oup.co.uk/ 1989. ISBN 0-8186-1964-3. computer_journal/hdb/Volume_ LCCN QA76.6 .C62951 1989. 18/Issue_03/tiff/272.tif; Knott:1971:EOA http://www3.oup.co.uk/ computer_journal/hdb/Volume_ [Kno71] G. D. Knott. Expandable 18/Issue_03/tiff/273.tif; open addressing hash table http://www3.oup.co.uk/ storage and retrieval. In computer_journal/hdb/Volume_ ACM SIGFIDET, Codd(ed), 18/Issue_03/tiff/274.tif; 1971, page ?? ????, ????, http://www3.oup.co.uk/ 1971. computer_journal/hdb/Volume_ Knott:1975:HF 18/Issue_03/tiff/275.tif; http://www3.oup.co.uk/ [Kno75] Gary D. Knott. Hash- computer_journal/hdb/Volume_ ing functions. The Com- 18/Issue_03/tiff/276.tif; REFERENCES 297

http://www3.oup.co.uk/ Kitsuregawa:1989:EBS computer_journal/hdb/Volume_ 18/Issue_03/tiff/277.tif; [KNT89] Masaru Kitsuregawa, Masaya http://www3.oup.co.uk/ Nakayama, and Mikio Tak- computer_journal/hdb/Volume_ agi. The eﬀect of bucket size 18/Issue_03/tiff/278.tif. tuning in the dynamic hybrid Also published in/as: Stan- GRACE hash join method. ford University Report, 1975. In Apers and Wiederhold Section 3, “A history of [AW89], pages 257–266. CO- hashing schemes”, and the DEN VLDBDP. ISBN 1- lengthy bibliography, are rec- 55860-101-5. LCCN QA 76.9 ommended and useful re- D3 I61 1989. sources. Knuth:1973:ACP Knott:1984:DCC [Knu73] D. E. Knuth. The Art of Computer Programming, [Kno84] Gary D. Knott. Direct- Sorting and Searching,vol- chaining with coalescing lists. ume 3. Addison-Wesley, Journal of Algorithms, 5(1): Reading, MA, USA, 1973. 7–21, March 1984. CO- ISBN 0-201-03803-X. xi + DEN JOALDV. ISSN 723 pp. LCCN QA76.5 .K74. 0196-6774 (print), 1090-2678 (electronic). URL http: Knuth:1974:CSR //www.sciencedirect.com/ science/article/pii/0196677484900361[Knu74]. Donald E. Knuth. Com- puter science and its rela- Knott:1988:LOA tion to mathematics. Amer- ican Mathematical Monthly, [Kno88] Gary D. Knott. Linear 81:323–343, April 1974. CO- open addressing and Pe- DEN AMMYAE. ISSN 0002- terson’s theorem rehashed. 9890 (print), 1930-0972 (elec- BIT (Copenhagen), 28(2): tronic). A shorter form of this 364–371, 1988. CODEN article appeared in Ameri- NBITAB. can Scientist 61 (1973), 707– Khovratovich:2010:RRA 713; reprinted in Comput- ers and People 23,9 (Septem- [KNR10] Dmitry Khovratovich, Ivica ber 1974), 8–11; and in Nikoli´c, and Christian Rech- Mathematics: People, Prob- berger. Rotational rebound lems, Results, ed. by Dou- attacks on reduced Skein. glas M. Campbell and John Report, University of Lux- C. Higgins, vol. 3 (Belmont, embourg, Luxembourg, Oc- Calif.: Wadsworth, 1984), tober 20, 2010. 20 pp. 37–47. Hungarian translation URL http://eprint.iacr. in Matematikai Lapok 24 org/2010/538. (1973, published 1975), 345– REFERENCES 298

363. Slovenian translation Knuth:1998:LPG in Obzornik za Matematiko in Fiziko 22 (1975), 129– [Knu98] Donald E. Knuth. Linear 138, 161–167. Slovak trans- probing and graphs. Al- lation (abridged) in Pokroky gorithmica, 22(4):561–568, Matematiky, Fiziky a As- December 1998. CODEN tronomie 21 (1976), 88–96. ALGOEJ. ISSN 0178- Russian translation by Na- 4617 (print), 1432-0541 (elec- tal’ıa G. Gurevich in Sovre- tronic). URL http:/ mennye Problemy Matem- /link.springer.de/link/ atiki 11,12 (Moscow: Znanie, service/journals/00453/ 1977), 4–32. bibs/22n4p561.html; http: //www.springerlink.com/ Knuth:1975:ACP openurl.asp?genre=article& issn=0178-4617&volume= 22&issue=4&spage=561. Average- [Knu75] D. E. Knuth. The Art case analysis of algorithms. of Computer Programming, Sorting and Searching.Ad- Knudsen:2019:LHA dison-Wesley, Reading, MA, [Knu19] Mathias Bæk Tejs Knud- USA, 2 edition, 1975. ISBN sen. Linear hashing is 0-201-03803-X. xi + 723 pp. awesome. SIAM Journal LCCN QA76.5 .K74. on Computing, 48(2):736– 741, ???? 2019. CO- Knuth:1977:DPR DEN SMJCAT. ISSN 0097- 5397 (print), 1095-7111 (elec- [Knu77] Donald E. Knuth. Deletions tronic). that preserve randomness. IEEE Transactions on Soft- Kitsuregawa:1990:BSP ware Engineering, SE-3(5): [KO90] M. Kitsuregawa and Y. Ogawa. 351–359, September 1977. Bucket spreading parallel CODEN IESEDJ. ISSN hash: a new, robust, parallel 0098-5589 (print), 1939-3520 hash join method for skew in (electronic). the super database computer (SDC). In McLeod et al. Knudsen:1992:CL [MSDS90], page 210. ISBN 1-55860-149-X. LCCN ??? [Knu92] Lars Ramkilde Knudsen. Koehler:1972:SDB Cryptanalysis of LOKI. Technical Report DAIMI PB- [Koe72] Ch. Koehler. Ein System 403, Computer Science De- zur Darstellung und Bear- partment, Aarhus University, beitung Assoziativer Daten- Arhus,˚ Denmark, July 1992. strukturen. (German) [a sys- 17 pp. tem for displaying and edit- REFERENCES 299

ing associative data struc- cember 2008. CODEN JA- tures]. Technical report, COAH. ISSN 0004-5411 ????, Bonn, Germany, 1972. (print), 1557-735X (elec- ?? pp. tronic). Kohonen:1980:CAM Koschke:2014:LSI [Koh80] Teuvo Kohonen. Content- addressable memories. Spring- [Kos14] Rainer Koschke. Large-scale er-Verlag, Berlin, Germany / inter-system clone detection Heidelberg, Germany / Lon- using suffix trees and hash- don, UK / etc., 1980. ISBN ing. Journal of Software: 0-387-09823-2 (New York), 3- Evolution and Process, 26(8): 540-09823-2 (Berlin). xi + 747–769, August 2014. CO- 368 pp. LCCN TK7895.M4 DEN ???? ISSN 2047- K63. US$39.00. Hash- 7473 (print), 2047-7481 (elec- ing is covered in the dis- tronic). cussion of software-based content-addressable memo- Koushik:1993:DHD ries in Chapter 2. Konheim:2010:HCS [Kou93] Murlidhar Koushik. Dy- namic hashing with dis- [Kon10] Alan G. Konheim. Hashing tributed overflow space: a in Computer Science: Fifty file organization with good Years of Slicing and Dicing. insertion performance. In- Wiley, New York, NY, USA, formation system, 18(5):299– 2010. ISBN 0-470-34473-3, 318, September 1993. CO- 0-470-63060-4. xvii + 386 DEN INSYD6. ISSN 0306- pp. LCCN QA76.9.H36 K65 4379 (print), 1873-6076 (elec- 2010. URL http://www. tronic). loc.gov/catdir/enhancements/ fy1106/2009052123-b.html; Kilov:1981:DMA http://www.loc.gov/catdir/ enhancements/fy1106/2009052123-[KP81] Kh. I. Kilov and I. A. d.html; http://www.loc. Popova. Data metabase gov/catdir/enhancements/ architecture for relational fy1106/2009052123-t.html. DBMS. Programming and Korf:2008:LTD Computer Software; translation of Programmirovaniye, [Kor08] Richard E. Korf. Linear-time (Moscow, USSR) Plenum,7 disk-based implicit graph (1):??, February 1981. CO- search. Journal of the Associ- DEN PCSODA. ISSN 0361- ation for Computing Machin- 7688 (print), 1608-3261 (elec- ery, 55(6):26:1–26:40, De- tronic). REFERENCES 300

Kedem:1992:OPA ny.com/link/service/series/ 0558/papers/1294/12940485. [KP92] Z. M. Kedem and K. V. pdf. Palem. Optimal parallel algorithms for forest and Katzenelson:1992:TMT term matching. Theoret. [KPS92] Jacob Katzenelson, Shlomit S. Comput. Sci., 93(2):245–264, Pinter, and Eugen Schen- February 17, 1992. CO- feld. Type matching, type- DEN TCSCDI. ISSN 0304- graphs, and the Schanuel 3975 (print), 1879-2294 (elec- conjecture. ACM Transac- tronic). tions on Programming Lan- Krichevskii:1994:CSE guages and Systems,14 (4):574–588, October 1992. [KP94] R. E. Krichevskii and V. N. CODEN ATPSDT. ISSN Potapov. Combinatorial 0164-0925 (print), 1558- source encoding and per- 4593 (electronic). URL fect hashing. IEEE Interna- http://www.acm.org/pubs/ tional Symposium on Infor- toc/Abstracts/0164-0925/ mation Theory, pages 319– 133247.html. ??, 1994. CODEN PISTFZ. Kohonen:1979:VFA ISSN 0271-4655. Knudsen:1996:HFB [KR79] Teuvo Kohonen and Erkki Reuhkala. Very fast as- [KP96] L. Knudsen and B. Pre- sociative method for the neel. Hash functions based recognition and correction on block ciphers and quater- of misspelt words, based nary codes. Lecture Notes in on redundant hash address- CS, 1163:77–??, 1996. CO- ing. IEEE Technical Pa- DEN LNCSD9. ISSN 0302- pers Presented at the Joint 9743 (print), 1611-3349 (elec- ASME/IEEE/AAR Railroad tronic). Conference (Association of American Railroads), ??(??): Knudsen:1997:FSH 807–809, ???? 1979. [KP97] Lars Ramkilde Knudsen and Karp:1981:ERP Bart Preneel. Fast and secure hashing based on codes. Lec- [KR81] R. M. Karp and M. O. Rabin. ture Notes in CS, 1294:485– Eﬃcient randomized pattern- ??, 1997. CODEN LNCSD9. matching algorithms. Tech- ISSN 0302-9743 (print), nical Report TR-31-81, Har- 1611-3349 (electronic). URL vard University, Cambridge, http://link.springer-ny. MA, USA, 1981. ?? pp. An com/link/service/series/ incremental hash function is 0558/bibs/1294/12940485. described for application to htm; http://link.springer- the string search problem. REFERENCES 301

Kelley:1986:IMK ISBN 0-8186-2295-4 (paperback), 0-8186-2296-2 (mi- [KR86a] K. L. Kelley and M. Rus- crofiche), 0-8186-2297-0 (hard- inkiewicz. Implementation cover). LCCN QA76.58 .I544 of multi-key extendible hash- 1991. ing as an access method Krovetz:2001:FUH for a relational DBMS. In ICDE’86 [ICD86], page ?? [KR01] Ted Krovetz and Phillip Ro- ISBN 0-8186-0655-X (paper- gaway. Fast universal hash- back), 0-8186-8655-3 (hard- ing with small keys and no cover), 0-8186-4655-1 (mi- preprocessing: The PolyR crofiche). LCCN QA 76.9 D3 construction. Lecture Notes I5582 1986. in CS, 2015:73–??, 2001. Kelley:1986:IME CODEN LNCSD9. ISSN 0302-9743 (print), 1611- [KR86b] Keith L. Kelley and Marek 3349 (electronic). URL Rusinkiewicz. Implementa- http://link.springer-ny. tion of multi-key extendible com/link/service/series/ hashing as an access method 0558/bibs/2015/20150073. for a relational DBMS. In htm; http://link.springer- ICDE’86 [ICD86], pages 124– ny.com/link/service/series/ 131. ISBN 0-8186-0655- 0558/papers/2015/20150073. X (paperback), 0-8186-8655- pdf. 3 (hardcover), 0-8186-4655-1 (microfiche). LCCN QA 76.9 Krovetz:2006:VUH D3 I5582 1986. IEEE Service [KR06] Ted Krovetz and Phillip Rog- Cent. Piscataway, NJ, USA. away. Variationally universal Kelley:1988:MEH hashing. Information Pro- cessing Letters, 100(1):36–39, [KR88] Keith L. Kelley and Marek October 16, 2006. CO- Rusinkiewicz. Multikey, ex- DEN IFPLAT. ISSN 0020- tensible hashing for relational 0190 (print), 1872-6119 (elec- databases. IEEE Software,5 tronic). (4):77–85, July 1988. CO- DEN IESOEG. ISSN 0740- Kishore:2019:PCH 7459 (print), 0740-7459 (elec- [KR19] Neha Kishore and Priya tronic). Raina. Parallel crypto- Keller:1991:APH graphic hashing: Devel- opments in the last 25 [KR91] A. Keller and S. Roy. Adap- years. Cryptologia, 43(6): tive parallel hash join in 504–535, 2019. CODEN main-memory databases. In CRYPE6. ISSN 0161-1194 PDIS’91 [PDI91], page ?? (print), 1558-1586 (elec- REFERENCES 302

tronic). URL http:// Krichevskii:1989:ADC www.tandfonline.com/doi/ full/10.1080/01611194. [Kri89] R. E. Krichevskii. Acceler- 2019.1609130. ated determination of codes and hash functions. So- Krause:1982:PHF viet Physics—Doklady, 34(4): [Kra82] M. Krause. Perfect hash 303–??, April 1, 1989. CO- function search. M.sc. thesis, DEN SPHDA9. ISSN 0038- Computing Science Depart- 5689. ment, Simon Fraser Univer- Kohonen:1980:TWR sity, Burnaby, BC, Canada, + 1982. 168 pp. Avail- [KRJ 80] T. Kohonen, H. Riittinen, able from National Library of M. Jalanko, E. Reuhkala, and Canada, Canadian theses on S. Haltsonen. Thousand- microﬁche, 62311 0227-3845. word recognition system based on the learning sub- Krawczyk:1994:LBH space method and redundant [Kra94] H. Krawczyk. LFSR-based hash addressing. NATO Con- hashing and authentication. ference Series, (Series) 4: Lecture Notes in CS, 839: Marine Sciences, 1(??):158– 129–139, 1994. CODEN 165, ???? 1980. LNCSD9. ISSN 0302-9743 Kawaguchi:2009:TBD (print), 1611-3349 (electronic). [KRJ09a] Ming Kawaguchi, Patrick Rondon, and Ranjit Jhala. Krawczyk:1995:NHF Type-based data structure [Kra95] H. Krawczyk. New hash veriﬁcation. SIGPLAN No- functions for message au- tices, 44(6):304–315, June thentication. In Guil- 2009. CODEN SINODQ. lou and Quisquater [GQ95], ISSN 0362-1340 (print), pages 301–310. ISBN 3- 1523-2867 (print), 1558-1160 540-59409-4. ISSN 0302- (electronic). 9743 (print), 1611-3349 (elec- Kim:2009:CIS tronic). LCCN QA76.9.A25 C794 1995. [KRJ09b] Mooseop Kim, Jaecheol Ryou, and Sungik Jun. Com- Krichevsky:1984:OH pact implementation of SHA- [Kri84] R. E. Krichevsky. Opti- 1 hash function for mo- mal hashing. Information bile trusted module. Lec- and Control, 62(1):64–92 (or ture Notes in CS, 5379: 64–84??), July 1984. CO- 292–304, 2009. CODEN DEN IFCNA4. ISSN 0019- LNCSD9. ISSN 0302-9743 9958 (print), 1878-2981 (elec- (print), 1611-3349 (electronic). tronic). URL http://link. REFERENCES 303

springer.com/content/pdf/ Kruse:1984:DSP 10.1007/978-3-642-00306- 6_22. [Kru84] Robert L. Kruse. Data Structures and Program De- Kwon:2009:FXD sign. Prentice-Hall Soft- ware Series, Editor: Brian [KRML09] Joonho Kwon, Praveen Rao, W. Kernighan. Prentice- Bongki Moon, and Sukho Hall, Englewood Cliffs, NJ Lee. Fast XML document 07632, USA, 1984. ISBN filtering by sequencing twig 0-13-196253-1. xxi + 486 patterns. ACM Transac- pp. LCCN QA76.6 .K77 tions on Internet Technol- 1984. US$28.95. A standard ogy (TOIT), 9(4):13:1–13:??, textbook treatment of well- September 2009. CODEN known hashing algorithms ???? ISSN 1533-5399 (print), appears on pp. 112–128. 1557-6051 (electronic). Kriegel:1986:EMD Kohonen:1984:ORS [KS86] H-P. Kriegel and Bernhard Seeger. Efficient multidi- [KRRH84] T. Kohonen, H. Riittinen, mensional dynamic hashing E. Reuhkala, and S. Halt- for uniform and non-uniform sonen. On-line recogni- record distributions. In tion of spoken words from Ausiello and Atzeni [AA86], a large vocabulary. Infor- page ?? ISBN 3-540-17187- mation sciences, 33(1/2):3– 8. LCCN QA76.9.D3 I55824 30, July–August 1984. CO- 1986. DEN ISIJBC. ISSN 0020- 0255 (print), 1872-6291 (elec- Kriegel:1987:MDH tronic). Application of hash [KS87a] H. P. Kriegel and B. Seeger. tables to recognition of spo- Multidimensional dynamic ken words. hashing is very efficient for Knudsen:2007:GFH nonuniform record distributions. In ICDE’87 [ICD87], [KRT07] L. Knudsen, C. Rechberger, page 10. ISBN 0-8186-0762- and S. Thomsen. Grindahl 9 (paperback) 0-8186-8762- — a family of hash func- 2 (hard) 0-8186-4762-0 (mi- tions. In Biryukov [Bir07], crofiche). LCCN QA76.9.D3 pages 39–47. ISBN 3-540- I5582 1987. 74617-X (softcover). LCCN Kriegel:1987:MDQ QA76.9.A25 F77 2007. URL http://www.springerlink. [KS87b] Hans-Peter Kriegel and com/openurl.asp?genre= Bernhard Seeger. Multi- book\%26isbn=978-3-540- dimensional dynamic quan- 74617-1. tile hashing is very effi- REFERENCES 304

cient for non-uniform record 1988. ISBN 0-8186-0827-7. distributions. In ICDE’87 369–376 pp. LCCN QA 76.9 [ICD87], pages 10–17. ISBN D3 I5582 1988. IEEE Service 0-8186-0762-9 (paperback) 0- Cent. Piscataway, NJ, USA. 8186-8762-2 (hard) 0-8186- 4762-0 (microfiche). LCCN Kelly:1989:POM QA76.9.D3 I5582 1987. IEEE [KS89a] Michael A. Kelly and Rudolph E. Service Cent. Piscataway, Seviora. Performance of NJ, USA. OPS5 matching on CUPID. Korner:1988:LDS Microprocessing and Micro- programming, 27(1-5):397– [KS88a] J. Korner and G. Simonyi. 404, August 1989. CO- Locally different sequences. DEN MMICDT. ISSN 0165- In IEEE 1988 International 6074 (print), 1878-7061 (elec- Symposium on Information tronic). Theory — Abstracts of papers, volume 25 n 13, pages Kriegel:1989:MQH 61–?? IEEE Computer Soci- ety Press, 1109 Spring Street, [KS89b] Hans-Peter Kriegel and Suite 300, Silver Spring, MD Bernhard Seeger. Multidi- 20910, USA, 1988. Avail- mensional quantile hashing able from IEEE Service Cent is very efficient for nonuni- (catalog number 88CH2621- form distributions. Infor- 1). Piscataway, NJ, USA. mation sciences, 48(2):99– 117, July 1, 1989. CO- Kriegel:1988:PHGa DEN ISIJBC. ISSN 0020- 0255 (print), 1872-6291 (elec- [KS88b] H. P. Kriegel and B. Seeger. tronic). PLOP-hashing: a grid file without directory. In Kniesburges:2012:BAH ICDE’88 [ICD88], page 369. ISBN 0-8186-0827-7 (paper- [KS12] Sebastian Kniesburges and back), 0-8186-8827-0 (hard- Christian Scheideler. Brief cover), 0-8186-4827-9 (mi- announcement: Hashed pre- crofiche). LCCN QA76.9.D3 decessor Patricia trie- a data I5582 1988. structure for efficient predecessor queries in peer-to-peer Kriegel:1988:PHGb systems. Lecture Notes in [KS88c] Hans-Peter Kriegel and CS, 7611:435–436, 2012. CO- Bernhard Seeger. PLOP- DEN LNCSD9. ISSN 0302- Hashing: a Grid File with- 9743 (print), 1611-3349 (elec- out Directory. IEEE Com- tronic). URL http://link. puter Society Press, 1109 springer.com/content/pdf/ Spring Street, Suite 300, Sil- 10.1007/978-3-642-33651- ver Spring, MD 20910, USA, 5_45. REFERENCES 305

Karger:1999:WCC 1532-0626 (print), 1532-0634 (electronic). [KSB+99] David Karger, Alex Sher- man, Andy Berkheimer, Bill Kalvin:1986:TDM Bogstad, Rizwan Dhanid- [KSSS86] Alan Kalvin, Edith Schon- ina, Ken Iwamoto, Brian berg, Jacob T. Schwartz, Kim, Luke Matkins, and and Micha Sharir. Two- Yoav Yerushalmi. Web dimensional, model-based, caching with consistent hash- boundary matching using ing. Computer Networks footprints. International (Amsterdam, Netherlands: Journal of Robotics Research, 1999), 31(11–16):1203–1213, 5(4):38–55, Winter 1986. May 17, 1999. CODEN CODEN IJRREL. ISSN ???? ISSN 1389-1286 (print), 0278-3649. 1872-7069 (electronic). URL http://www.elsevier.com/ Kim:1999:LEO cas/tree/store/comnet/ sub/1999/31/11-16/2181. [KST99] Jeong Han Kim, D. R. Si- pdf. mon, and P. Tetali. Lim- its on the efficiency of Kwak:2011:DIB one-way permutation-based hash functions. In IEEE [KSC11] Hukeun Kwak, Andrew [IEE99], pages 535–542. CO- Sohn, and Kyusik Chung. DEN ASFPDV. ISBN Dynamic information-based 0-7695-0409-4 (softbound), scalable hashing on a cluster 0-7803-5955-0 (casebound), of web cache servers. Con- 0-7695-0411-6 (microfiche). currency and Computation: ISSN 0272-5428. LCCN Practice and Experience,24 TK7885.A1 S92 1999. IEEE (3):322–340, March 10, 2011. Catalog Number 99CB37039. CODEN CCPEBO. ISSN 1532-0626 (print), 1532-0634 Kolbl:2020:TTC (electronic). [KTDB20] Stefan Kölbl, Elmar Tis- Kwak:2012:DIB chhauser, Patrick Derbez, and Andrey Bogdanov. Troika: [KSC12] Hukeun Kwak, Andrew a ternary cryptographic hash Sohn, and Kyusik Chung. function. Designs, Codes, Dynamic information-based and Cryptography, 88(1):91– scalable hashing on a cluster 117, January 2020. CO- of web cache servers. Con- DEN DCCREC. ISSN 0925- currency and Computation: 1022 (print), 1573-7586 (elec- Practice and Experience,24 tronic). URL https://link. (3):322–340, March 10, 2012. springer.com/article/10. CODEN CCPEBO. ISSN 1007/s10623-019-00673-2. REFERENCES 306

Kitsuregawa:1983:AHD ISBN 0-8186-2545-7 (paper) 0-8186-2546-5 (microfiche) [KTMo83a] M. Kitsuregawa, H. Tanaka, 0-8186-2547-3 (hardcover). and T. Moto-oka. Applica- LCCN QA76.9.D3 I5582 tion of hash to database ma- 1992. chine and its architecture. New Generation Comput- Karlin:1986:PHE ing, 1(1):63–74, 1983. CO- [KU86] A. R. Karlin and E. Up- DEN NGCOE5. ISSN 0288- fal. Parallel hashing — an 3635 (print), 1882-7055 (elec- efficient implementation of tronic). shared memory. In ACM- Kitsuregawa:1983:GRA TOC’86 [ACM86b], pages 160–168. ISBN 0-89791-193- [KTMO83b] Masaru Kitsuregawa, Hide- 8. LCCN QA76.6 .A14 198. hiko Tanaka, and Tohru Moto-Oka. GRACE: Rela- Karlin:1988:PHE tional algebra machine based [KU88] Anna R. Karlin and Eli on hash and sort — its de- Upfal. Parallel hashing: sign concepts. Journal of the An efficient implementation Information Processing Soci- of shared memory. Jour- ety of Japan, 6(3 (or 6??)): nal of the Association for 148–155, ???? 1983. CODEN Computing Machinery,35 JIPRDE. ISSN 0387-6101. (4):876–892, October 1988. Kitsuregawa:1983:RAM CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X [KTMo83c] Masaru Kitsuregawa, Hide- (electronic). hiko Tanaka, and Tohru Moto-oka. Relational alge- Ku:2004:HBS bra machine: GRACE. In Goto [Got83], pages 191– [Ku04] Wei-Chi Ku. A hash-based 214. ISBN 0-387-11980-9 strong-password authentica- (New York), 3-540-11980-9 tion scheme without using (Berlin). LCCN QA76.6 .R55 Smart Cards. Operating 1983. Systems Review, 38(1):29– 34, January 2004. CODEN Kitsuregawa:1992:PGH OSRED8. ISSN 0163-5980 [KTN92] M. Kitsuregawa, S.-I. Tsu- (print), 1943-586X (elec- daka, and M. Nakano. Par- tronic). allel GRACE hash join on Kuespert:1982:MLHa shared-everything multiprocessor: Implementation and [Kue82a] K. Kuespert. Modelle für performance evaluation on die Leistungsanalyse von symmetry S81. In Gol- Hashtabellen mit ‘separate shani [Gol92], pages 256–264. Chaining’. Technical report, REFERENCES 307

????, Kaiserslautern, Ger- Kuich:1992:ALP many, 1982. ?? pp. [Kui92] Werner Kuich, editor. Au- Kuespert:1982:MLHb tomata, Languages, and Pro- [Kue82b] Klaus Kuespert. Modelle gramming: 19th Interna- für die Leistungsanalyse von tional Colloquium, Wien, Hashtabellen mit ‘Separate Austria, July 13–17, 1992: Chaining’ [models for analyz- Proceedings. Springer-Verlag, ing the performance of hash Berlin, Germany / Heidel- tables with separate chain- berg, Germany / London, ing]. Angew.Inf.Appl.Inf., UK / etc., 1992. ISBN 0-387- V 24(N 9):456–462, Septem- 55719-9 (New York), 3-540- ber 1982. 55719-9 (Berlin). ISSN 0302- 9743 (print), 1611-3349 (elec- Kuespert:1983:VZO tronic). LCCN QA267.A1 [Kue83] K. Kuespert. Vorschlaege L43 no.623. zur Zeiteffizienten Online- Kulkarni:1984:CHF fehlererkennung in Spe- icherungsstrukturen von Daten-[Kul84] Vidyadhar G. Kulkarni. banksystemen. Technical re- Compact hash function for port, ????, Kaiserslautern, paths in Pert networks. Oper- Germany, 1983. ?? pp. ations Research Letters, 3(3): 137–140, August 1984. CO- Kuespert:1984:USO DEN ORLED5. ISSN 0167- [Kue84a] K. Kuespert. Uberlegungen¨ 6377. zur Schnellen Online-fehlerbehandlung Kumar:1989:CCM in Speicherstrukturen von Datenbanksystemen. Tech- [Kum89a] Vijay Kumar. A concurrency nical report, ????, Kaiser- control mechanism based on slautern, Germany, 1984. ?? extendible hashing for main pp. memory database systems. In Riehl [Rie89], pages 109–113. Kuespert:1984:EED ISBN 0-89791-299-3. LCCN [Kue84b] Klaus Kuespert. Efficient er- ???? US$36.00. ror detection techniques for Kumar:1989:CCE hash tables in database systems. Digest of Papers — [Kum89b] Vijay Kumar. Concur- FTCS (Fault-Tolerant Com- rency control on extendible puting Symposium), pages hashing. Information Pro- 198–203, 1984. CODEN cessing Letters, 31(1):35–41, DPFTDL. ISBN 0-8186- April 1989. CODEN IF- 0540-5. ISSN 0731-3071. PLAT. ISSN 0020-0190 IEEE Service Cent. Piscat- (print), 1872-6119 (elec- away, NJ, USA. tronic). REFERENCES 308

Kumar:1990:COE (electronic). URL http: //www.springerlink.com/ [Kum90] Vijay Kumar. Concur- content/jxq4q0274l625283/ rent operations on extensible ; http://www.springerlink. hashing and its performance. com/openurl.asp?genre= Communications of the As- article&issn=1661-8270& sociation for Computing Ma- volume=3&issue=1&spage= chinery, 33(6):681–694, June 47. 1990. CODEN CACMA2. Kenyon:1991:MQS ISSN 0001-0782 (print), 1557-7317 (electronic). URL [KV91] Claire M. Kenyon and Jef- http://www.acm.org/pubs/ frey Scott Vitter. Maximum toc/Abstracts/0001-0782/ queue size and hashing with 78979.html. lazy deletion. Algorithmica, Kutzelnigg:2006:BRG 6(4):597–619, 1991. CO- DEN ALGOEJ. ISSN 0178- [Kut06] Reinhard Kutzelnigg. Bi- 4617 (print), 1432-0541 (elec- partite random graphs and tronic). cuckoo hashing. Discrete Katz:2009:SPH Mathematics & Theoretical Computer Science, ??(??): [KV09] Jonathan Katz and Vinod 403–406, ???? 2006. ISSN Vaikuntanathan. Smooth 1365-8050 (print), 1462-7264 projective hashing and password- (electronic). URL http:// based authenticated key ex- www.dmtcs.org/dmtcs-ojs/ change from lattices. Lec- index.php/dmtcs/search; ture Notes in CS, 5912: http://www.dmtcs.org/ 636–652, 2009. CODEN dmtcs-ojs/index.php/proceedings/ LNCSD9. ISSN 0302-9743 article/download/dmAG0133/ (print), 1611-3349 (elec- 1710; http://www.dmtcs. tronic). URL http://link. org/dmtcs-ojs/index.php/ springer.com/content/pdf/ proceedings/issue/view/ 10.1007/978-3-642-10366- 84. 7_37. Kutzelnigg:2010:IVC Kortelainen:2012:GIH [Kut10] Reinhard Kutzelnigg. An [KVK12] Tuomas Kortelainen, Ari improved version of cuckoo Vesanen, and Juha Ko- hashing: Average case analy- rtelainen. Generalized it- sis of construction cost and erated hash functions research operations. Math- visited: New complexity ematics in Computer Sci- bounds for multicollision at- ence, 3(1):47–60, March tacks. Lecture Notes in CS, 2010. CODEN ???? ISSN 7668:172–190, 2012. CO- 1661-8270 (print), 1661-8289 DEN LNCSD9. ISSN 0302- REFERENCES 309

9743 (print), 1611-3349 (elec- Kjellberg:1984:CH tronic). URL http://link. springer.com/chapter/10. [KZ84] Peter Kjellberg and Tor- 1007/978-3-642-34931-7_ ben U. Zahle. Cascade 11/. hashing. In VLDB, pages 481–492. VLDB Endowment, Kroll:1994:DST Saratoga, CA, USA, August [KW94] Brigitte Kr¨oll and Peter Wid- 1984. mayer. Distributing a search Koslicki:2019:IMC tree among a growing number of processors. SIG- [KZ19] David Koslicki and Hooman MOD Record (ACM Spe- Zabeti. Improving Min- cial Interest Group on Man- Hash via the containment agement of Data), 23(2): index with applications to 265–276, June 1994. CO- metagenomic analysis. Ap- DEN SRECD8. ISSN 0163- plied Mathematics and Com- 5808 (print), 1943-5835 (elec- putation, 354(??):206–215, tronic). August 1, 2019. CO- DEN AMHCBQ. ISSN Klassen:2012:ITB 0096-3003 (print), 1873-5649 [KW12] Toryn Qwyllyn Klassen and (electronic). URL http: Philipp Woelfel. Indepen- //www.sciencedirect.com/ dence of tabulation-based science/article/pii/S009630031930116X. hash classes. Lecture Notes in Louati:2018:LCT CS, 7256:506–517, 2012. CO- DEN LNCSD9. ISSN 0302- [LACJ18] Thouraya Louati, Heithem 9743 (print), 1611-3349 (elec- Abbes, Christophe C´erin, tronic). URL http://link. and Mohamed Jemni. LXCloud- springer.com/content/pdf/ CR: Towards Linux con- 10.1007/978-3-642-29344- tainers distributed hash ta- 3_43. ble based checkpoint-restart. Journal of Parallel and Dis- Kaps:2005:ESU tributed Computing, 111(??): [KYS05] J.-P. Kaps, K. Yuksel, and 187–205, January 2018. CO- B. Sunar. Energy scalable DEN JPDCER. ISSN universal hashing. IEEE 0743-7315 (print), 1096-0848 Transactions on Computers, (electronic). URL http: 54(12):1484–1495, December //www.sciencedirect.com/ 2005. CODEN ITCOB4. science/article/pii/S0743731517302411. ISSN 0018-9340 (print), Lai:1992:DSB 1557-9956 (electronic). URL http://ieeexplore.ieee. [Lai92] Xuejia Lai. On the de- org/stamp/stamp.jsp?tp=& sign and security of block ci- arnumber=1524931. phers. Hartung-Gorre Ver- REFERENCES 310

lag, Konstanz, Switzerland, 10.1007/978-3-540-72830- 1992. ISBN 3-89191-573- 6_107. X. xii + 108 pp. LCCN ??? This is the author’s Lamport:1970:CBQ Ph.D. dissertation. “Secret- [Lam70] Leslie Lamport. Comment key block ciphers are the sub- on Bell’s quadratic quotient ject of this work. The design method for hash code search- and security of block ciphers, ing. Communications of together with their applica- the Association for Comput- tion in hashing techniques, ing Machinery, 13(9):573– are considered. In particular, 574, September 1970. CO- iterated block ciphers that DEN CACMA2. ISSN 0001- are based on iterating a weak 0782 (print), 1557-7317 (elec- round function several times tronic). are considered. Four basic constructions for the round Landau:2006:FMH function of an iterated cipher are studied.”. [Lan06] Susan Landau. Find me a hash. Notices of the Amer- LakshmanYN:1996:IPI ican Mathematical Society, 53(3):330–332, March 2006. [Lak96] Lakshman Y.N., editor. IS- CODEN AMNOAN. ISSN SAC ’96: Proceedings of the 0002-9920 (print), 1088-9477 1996 International Sympo- (electronic). URL http: sium on Symbolic and Alge- //www.ams.org/notices/ braic Computation, July 24– 200603/fea-landau.pdf. 26, 1996, Zurich, Switzer- land. ACM Press, New York, Larson:1978:DH NY 10036, USA, 1996. ISBN 0-89791-796-0. LCCN QA [Lar78] Per-Ake˚ Larson. Dynamic 76.95 I59 1996. hashing. BIT (Nordisk tidskrift for informations- Lee:2007:CFRa behandling), 18(2):184–201, 1978. CODEN BITTEL, [LAKW07] Younggyo Lee, Jeonghee NBITAB. ISSN 0006-3835 Ahn, Seungjoo Kim, and (print), 1572-9125 (elec- Dongho Won. A countermea- tronic). See also [Reg85]. sure of fake root key installation using one-time hash Larson:1980:ARH chain. Lecture Notes in CS, 4496:1007–1016, 2007. CO- [Lar80a] Per Ake Larson. Anal- DEN LNCSD9. ISSN 0302- ysis of repeated hashing. 9743 (print), 1611-3349 (elec- BIT (Copenhagen), 20(1):25– tronic). URL http://link. 32, ???? 1980. CODEN springer.com/content/pdf/ NBITAB. REFERENCES 311

Larson:1980:LHP 5915 (print), 1557-4644 (electronic). [Lar80b] Per-Ake˚ Larson. Linear hashing with partial expansions. Larson:1982:SFVa In Lochovsky and Taylor [Lar82c] Per-Ake˚ Larson. A single- [LT80], pages 224–232. ACM ﬁle version of linear hashing order no. 471800. IEEE cat- with partial expansions. In alog no. 80CH1534-7C. Long VLDB’82 [VLD82], page 300. Beach order no. 322. ISBN 0-934613-14-1. LCCN Larson:1980:PAL QA76.9.D3 I559 1982.

[Lar80c] Per-Ake˚ Larson. Perfor- Larson:1982:SFVb mance analysis of linear hashing with partial expan- [Lar82d] Per-Ake˚ Larson. Single-file sions. Technical report, ????, version of linear hashing with Abo, Finland, 1980. ?? pp. partial expansions. Very Large Data Bases, Interna- Larson:1981:EWC tional Conference on Very Large Data Bases, pages [Lar81] Per-Ake˚ Larson. Expected 300–309, 1982. CODEN worst-case performance of VLDBDP. hash files. Technical report, ????, Abo, Finland, 1981. ?? Larson:1983:AUH pp. [Lar83] Per-Ake˚ Larson. Analysis Larson:1982:EWC of uniform hashing. Jour- nal of the Association for [Lar82a] Per-Ake˚ Larson. Expected Computing Machinery,30 worst-case performance of (4):805–819, October 1983. hash files. The Com- CODEN JACOAH. ISSN puter Journal, 25(3):347– 0004-5411 (print), 1557-735X 352, August 1982. CO- (electronic). DEN CMPJA6. ISSN 0010- 4620 (print), 1460-2067 (elec- Larson:1984:AHC tronic). [Lar84] Per-Ake˚ Larson. Analy- Larson:1982:PAL sis of hashing with chaining in the prime area. Jour- [Lar82b] Per-Ake˚ Larson. Perfor- nal of Algorithms, 5(1):36– mance analysis of linear 47, March 1984. CO- hashing with partial expan- DEN JOALDV. ISSN sions. ACM Transactions on 0196-6774 (print), 1090-2678 Database Systems, 7(4):566– (electronic). URL http: 587, December 1982. CO- //www.sciencedirect.com/ DEN ATDSD3. ISSN 0362- science/article/pii/0196677484900385. REFERENCES 312

Larson:1985:HFS Larson:1988:LHS

[Lar85a] Per-Ake˚ Larson. Hash [Lar88b] Per-Ake˚ Larson. Lin- Files: Some Recent Develop- ear hashing with separa- ments. IEEE Computer Soci- tors — a dynamic hashing ety Press, 1109 Spring Street, scheme achieving one-access Suite 300, Silver Spring, MD retrieval. ACM Transactions 20910, USA, 1985. ISBN on Database Systems, 13(3): 0-8186-0654-1. 671–679 pp. 366–388, September 1988. LCCN QA76.5 .I5481 1985. CODEN ATDSD3. ISSN IEEE Service Cent. Piscat- 0362-5915 (print), 1557-4644 away, NJ, USA. (electronic).

Larson:1985:LHO Larson:19xx:LHP [Larxx] Per Ake Larson. Linear ˚ [Lar85b] Per-Ake Larson. Linear hash- hashing with partial expan- ing with overﬂow-handling sions. Very Large Data by linear probing. ACM Bases, International Confer- Transactions on Database ence on Very Large Data Systems, 10(1):75–89, March Bases, ??(??):224–232, ???? 1985. CODEN ATDSD3. 19xx. CODEN VLDBDP. ISSN 0362-5915 (print), ACM (Order n 471800). Bal- 1557-4644 (electronic). timore, Md. Larson:1985:PAS Lassez:1987:PFI

[Lar85c] Per-Ake˚ Larson. Perfor- [Las87] Jean-Louis Lassez, editor. mance analysis of a single- Proceedings of the Fourth ﬁle version of linear hashing. International Conference on The Computer Journal,28 Logic Programming,MIT (3):319–329, July 1985. CO- Press Series in Logic Pro- DEN CMPJA6. ISSN 0010- gramming. MIT Press, Cam- 4620 (print), 1460-2067 (elec- bridge, MA, USA, 1987. tronic). ISBN 0-262-12125-5 (ensemble) 0-262-12129-8 (vol. 2). Larson:1988:DHT LCCN QA76.6 .L589 1987 v. 1-2. ˚ [Lar88a] Per-Ake Larson. Dynamic Lopes:2007:IRQ hash tables. Communica- tions of the Association for [LB07] Nuno Lopes and Carlos Ba- Computing Machinery,31 quero. Implementing range (4):446–457, April 1988. CO- queries with a decentral- DEN CACMA2. ISSN 0001- ized balanced tree over dis- 0782 (print), 1557-7317 (elec- tributed hash tables. Lec- tronic). ture Notes in CS, 4658: REFERENCES 313

197–206, 2007. CODEN and static internal tables. LNCSD9. ISSN 0302-9743 Computer, 21(10):45–57 (or (print), 1611-3349 (elec- 45–56??), October 1988. CO- tronic). URL http://link. DEN CPTRB4. ISSN 0018- springer.com/content/pdf/ 9162 (print), 1558-0814 (elec- 10.1007/978-3-540-74573- tronic). The authors survey 0_21. the classical hashing function Li:2002:RBA approach to information retrieval and show how gen- [LBJ02] T. Li, R. Bhargava, and eral hashing techniques ex- L. K. John. Rehashable change speed for memory. It BTB: An adaptive branch is a tutorial paper that cov- target buﬀer to improve the ers, among other topics, dy- target predictability of Java namic and static hash tables, code. Lecture Notes in CS, perfect hashing, and minimal 2552:597–608, 2002. CO- perfect hashing. DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Lomas:1995:RBH tronic). [LC95] Mark Lomas and Bruce Lehman:1986:SIS Christianson. Remote booting in a hostile world: to [LC86a] T. J. Lehman and M. J. whom am I speaking? (com- Carey. A study of index puter security). Computer, structures for main memory 28(1):50–54, January 1995. database management sys- CODEN CPTRB4. ISSN tems. In Chu et al. [CGO86], 0018-9162 (print), 1558-0814 page ?? ISBN 0-934613-18-4. (electronic). LCCN QA76.9.D3 I559 1986. Liu:1996:HPS Little:1986:PSS [LC96] C. Liu and H. Chen. A [LC86b] Joyce Currie Little and Lil- hash partition strategy for lian N. Cassel, editors. The distributed query process- Papers of the Seventeenth ing. Lecture Notes in CS, SIGCSE Technical Sympo- 1057:373–??, 1996. CO- sium on Computer Science DEN LNCSD9. ISSN 0302- Education. ACM Press, New 9743 (print), 1611-3349 (elec- York, NY 10036, USA, tronic). 1986. ISBN 0-89791-178- 4. LCCN QA76.27.A79 v.18 Lai:2006:ACA no.1. US$28.00. [LC06] Xuejia Lai and Kefei Chen, Lewis:1988:HDS editors. Advances in Cryp- [LC88] Ted G. Lewis and Curtis R. tology — ASIACRYPT 2006: Cook. Hashing for dynamic 12th International Confer- REFERENCES 314

ence on the Theory and Ap- //www.sciencedirect.com/ plication of Cryptology and science/article/pii/S030439751300769X. Information Security, Shang- hai, China, December 3–7, Lessley:2020:DPH 2006. Proceedings,volume 4284 of Lecture Notes in [LC20] B. Lessley and H. Childs. Computer Science. Springer- Data-parallel hashing tech- Verlag, Berlin, Germany / niques for GPU architec- Heidelberg, Germany / Lon- tures. IEEE Transac- don, UK / etc., 2006. CO- tions on Parallel and Dis- DEN LNCSD9. ISBN 3- tributed Systems, 31(1):237– 540-49475-8 (print), 3-540- 250, January 2020. CO- 49476-6 (e-book). ISSN 0302- DEN ITDSEO. ISSN 1045- 9743 (print), 1611-3349 (elec- 9219 (print), 1558-2183 (electronic). LCCN ???? URL tronic). http://www.springerlink. Liu:2014:SLE com/content/978-3-540- 49476-8. [LCH+14] Yingfan Liu, Jiangtao Cui, Liu:2012:PIH Zi Huang, Hui Li, and Heng Tao Shen. SK–LSH: an [LC12] Fang Liu and Lee-Ming eﬃcient index structure for Cheng. Perceptual image approximate nearest neigh- hashing via wave atom trans- bor search. Proceedings of form. Lecture Notes in CS, the VLDB Endowment, 7(9): 7128:468–478, 2012. CO- 745–756, May 2014. CODEN DEN LNCSD9. ISSN 0302- ???? ISSN 2150-8097. 9743 (print), 1611-3349 (electronic). URL http://link. Lathrop:2011:SPI springer.com/content/pdf/ [LCK11] Scott Lathrop, Jim Costa, 10.1007/978-3-642-32205- and William Kramer, ed- 1_37. itors. SC’11: Proceed- Liu:2013:RBP ings of 2011 International Conference for High Per- [LC13] Jian Liu and Lusheng Chen. formance Computing, Net- On the relationships be- working, Storage and Anal- tween perfect nonlinear func- ysis, Seattle, WA, Novem- tions and universal hash ber 12–18 2011.ACMPress families. Theoret. Com- and IEEE Computer Society put. Sci., 513(??):85–95, Press, New York, NY 10036, November 18, 2013. CO- USA and 1109 Spring Street, DEN TCSCDI. ISSN Suite 300, Silver Spring, MD 0304-3975 (print), 1879-2294 20910, USA, 2011. ISBN 1- (electronic). URL http: 4503-0771-X. LCCN ???? REFERENCES 315

Liu:2020:FAD 9219 (print), 1558-2183 (electronic). [LCL+20] Xiulong Liu, Sheng Chen, JiaLiu,WenyuQu,Fengjun Liang:1994:OMK Xiao, Alex X. Liu, Jian- [LCML94] J. Liang, C.-C. Chang, R. G. nong Cao, and Jiangchuan McFadyen, and R. C. T. Liu. Fast and accu- Lee. Optimal multiple key rate detection of unknown hashing files for orthogonal tags for RFID systems — range queries. Information hash collisions are desir- sciences, 79(1):145–??, 1994. able. IEEE/ACM Transac- CODEN ISIJBC. ISSN 0020- tions on Networking, 28(1): 0255 (print), 1872-6291 (elec- 126–139, February 2020. CO- tronic). DEN IEANEP. ISSN 1063- 6692 (print), 1558-2566 (elec- Lo:1993:OPA tronic). URL https://dl. acm.org/doi/abs/10.1109/ [LCRY93] Ming-Ling Lo, Ming-Syan TNET.2019.2957239. Chen, C. V. Ravishankar, and Philip S. Yu. On op- Li:2019:EEU timal processor allocation to [LCLX19] Yongkun Li, Helen H. W. support pipelined hash joins. Chan, Patrick P. C. Lee, and SIGMOD Record (ACM Spe- Yinlong Xu. Enabling effi- cial Interest Group on Man- cient updates in KV storage agement of Data), 22(2):69– via hashing: Design and per- 78, June 1993. CODEN formance evaluation. ACM SRECD8. ISBN 0-89791-592- Transactions on Storage,15 5. ISSN 0163-5808 (print), (3):20:1–20:??, August 2019. 1943-5835 (electronic). CODEN ???? ISSN 1553- Lee:2012:OFL 3077 (print), 1553-3093 (electronic). URL https://dl. [LDK12] Myungjin Lee, Nick Duffield, acm.org/ft_gateway.cfm? and Ramana Rao Kompella. id=3340287. Opportunistic flow-level latency estimation using con- Lu:2020:NMS sistent netflow. IEEE/ACM [LCM+20] Z. Lu, Q. Cao, F. Mei, Transactions on Network- H. Jiang, and J. Li. A novel ing, 20(1):139–152, Febru- multi-stage forest-based key– ary 2012. CODEN IEANEP. value store for holistic perfor- ISSN 1063-6692 (print), mance improvement. IEEE 1558-2566 (electronic). Transactions on Parallel and Lieuwen:1992:PBJ Distributed Systems, 31(4): 856–870, April 2020. CO- [LDM92] Daniel F. Lieuwen, David J. DEN ITDSEO. ISSN 1045- DeWitt, and Manish Mehta. REFERENCES 316

Pointer-based join tech- pages 252–262. ISBN ???? niques for object-oriented LCCN ???? ACM order databases. Technical Re- number 475020. port TR 1099, Computer Sci- Leppanen:1998:BPS ences Department, Univer- sity of Wisconsin–Madison, [Lep98] V. Leppänen. Balanced July 1992. ?? pp. PRAM simulations via moving threads and hashing. Liu:2016:TRS J.UCS: Journal of Universal Computer Science, 4(8):675– [LDY+16] Wenping Liu, Tianping ??, August 28, 1998. ISSN Deng, Yang, Hongbo Jiang, 0948-6968. URL http:// Xiaofei Liao, Jiangchuan Liu, medoc.springer.de:8000/ Bo Li, and Guoyin Jiang. To- jucs/jucs_4_8/balanced_ wards robust surface skele- pram_simulations_via. ton extraction and its applications in 3D wireless Lesk:1988:GII sensor networks. IEEE/ ACM Transactions on Net- [Les88] Michael Lesk. GRAB— working, 24(6):3300–3313, inverted indexes with low December 2016. CODEN storage overhead. Computing IEANEP. ISSN 1063-6692 Systems, 1(3):207–220, Sum- (print), 1558-2566 (elec- mer 1988. CODEN CM- tronic). SYE2. ISSN 0895-6340. Levy:1989:LPT Lebedev:1987:EEU [Lev89] G. Levy. A language for [Leb87] G. V. Lebedev. Estimating the P-any trees — applica- the efficiency of a uniform- tions to the dynamic virtual grid two-dimensional hash- hashing methods. In Litwin ing algorithm for hidden line and Schek [LS89], page ?? and surface removal in com- ISBN 0-387-51295-0. LCCN puter graphics. Automation QA76.9.D3 F671 1989. and Remote Control (English Levelt:1995:IPI translation of Avtomatika i Telemekhanika), 48(7 pt 2): [Lev95] A. H. M. Levelt, editor. IS- 968–975, July 1987. CODEN SAC ’95: Proceedings of the AURCAT. ISSN 0005-1179. 1995 International Sympo- Luo:2002:SHR sium on Symbolic and Alge- braic Computation: July 10– [LEHN02] Gang Luo, Curt J. Ellmann, 12, 1995, Montréal, Canada, Peter J. Haas, and Jef- ISSAC -PROCEEDINGS- frey F. Naughton. A scalable 1995. ACM Press, New York, hash ripple join algorithm. NY 10036, USA, 1995. ISBN In Franklin et al. [FMA02], 0-89791-699-9. LCCN QA REFERENCES 317

76.95 I59 1995. ACM order New York, NY 10036, USA, number: 505950. August 1982. ISBN 0-89791- Lever:2000:LKH 082-6. LCCN QA76.73.L23 A26 1982. US$26.00. The pa- [Lev00] Chuck Lever. Linux kernel pers were not formally refer- hash table behavior: Anal- eed but were accepted on the ysis and improvements. In bases of extended abstracts. USENIX [USE00a], page ?? Louis-Gavet:1978:DAI ISBN 1-880446-17-0. LCCN ???? URL http://www. [LG78] Guy Louis-Gavet. Di- usenix.org/publications/ verses applications issues library/proceedings/als2000/ d’une fonction f de com- lever.html. pactage basée sur une étude Lewis:1982:SEA mathématique du langage naturel (compactage de [Lew82] T. G. Lewis. Software Engi- données, comparaison de neering: Analysis and Veri- textes, hash-coding). [vari- fication. Reston Publishing ous applications issued from Co. Inc., Reston, VA, USA, a compression function f 1982. ISBN 0-8359-7023-X. basedonamathematical x + 470 pp. LCCN QA76.6 study of the natural lan- .L477 1982. US$21.95. Hash- guage (data compression, ing is covered in Chapters 4– comparison of texts, hash- 7. coding)]. RAIRO Informa- Laborde:2017:WFH tique/Computer Science (Re- vue Fran¸caise d’Automatique, [LFD17] Pierre Laborde, Steven Feld- d’Informatique et de Recherche man, and Damian Dechev. Operationnelle), 12(1):47– A wait-free hash map. In- 71, ???? 1978. CODEN ternational Journal of Par- RSINDN. allel Programming, 45(3): Lamiroy:1996:ROI 421–448, June 2017. CO- DEN IJPPE5. ISSN 0885- [LG96] B. Lamiroy and P. Gros. 7458 (print), 1573-7640 (elec- Rapid object indexing and tronic). recognition using enhanced geometric hashing. Lecture ACM:1982:CRA Notes in CS, 1064:59–??, [LFP82] Conference Record of the 1996. CODEN LNCSD9. 1982 ACM Symposium on ISSN 0302-9743 (print), Lisp and Functional Pro- 1611-3349 (electronic). gramming: Papers Presented Li:2013:NCD at the Symposium, Pitts- burgh, Pennsylvania, August [LG13] Zhijun Li and Guang Gong. 15–18, 1982. ACM Press, Onthenodeclonedetec- REFERENCES 318

tion in wireless sensor net- 0301 (print), 1557-7368 (elec- works. IEEE/ACM Transac- tronic). tions on Networking, 21(6): 1799–1811, December 2013. Liu:2020:EIH CODEN IEANEP. ISSN [LH20] Shiguang Liu and Ziqing 1063-6692 (print), 1558-2566 Huang. Eﬃcient image hash- (electronic). ing with geometric invariant vector distance for copy de- Luo:2003:COA tection. ACM Transactions [LH03a] Wenbin Luo and Gregory L. on Multimedia Computing, Heileman. Characteriz- Communications, and Ap- ing open addressing hash plications, 15(4):1–22, Jan- functions. In Debnath uary 2020. ISSN 1551- [Deb03], pages 21–24. ISBN 6857 (print), 1551-6865 (elec- 1-880843-46-3 (paperback). tronic). URL https://dl. LCCN QA75.5 I76 2003; acm.org/doi/abs/10.1145/ QA76.76.A65 I83 2003. 3355394. Lin:2005:GPW Luo:2003:CDO [LHC05] Iuon-Chang Lin, Min-Shiang [LH03b] Wenbin Luo and Gregory L. Hwang, and Chin-Chen Heileman. Comparison of dif- Chang. The general pay- ferent open addressing hash- word: a micro-payment ing algorithms. In Deb- scheme based on n-dimension nath [Deb03], pages 1–4. one-way hash chain. De- ISBN 1-880843-46-3 (paper- signs, Codes, and Cryptogra- back). LCCN QA75.5 I76 phy, 36(1):53–67, July 2005. 2003; QA76.76.A65 I83 2003. CODEN DCCREC. ISSN 0925-1022 (print), 1573- Luo:2004:IEH 7586 (electronic). URL [LH04] Wenbin Luo and Gregory L. http://www.springerlink. Heileman. Improved expo- com/openurl.asp?genre= nential hashing. IEICE Elec- article&issn=0925-1022& tronics Express, 1(7):150– volume=36&issue=1&spage= . 155, ???? 2004. 53 Lu:2020:DSH Lefebvre:2006:PSH [LHWL20] Baotong Lu, Xiangpeng [LH06] Sylvain Lefebvre and Hugues Hao, Tianzheng Wang, and Hoppe. Perfect spatial Eric Lo. Dash: scal- hashing. ACM Transac- able hashing on persistent tions on Graphics, 25(3): memory. Proceedings of 579–588, July 2006. CO- the VLDB Endowment,13 DEN ATGRDF. ISSN 0730- (8):1147–1161, April 2020. REFERENCES 319

CODEN ???? ISSN compression functions. In 2150-8097. URL https:/ Yang [Yan10], pages 660– /dl.acm.org/doi/abs/10. 664. ISBN 1-4244-6942- 14778/3389133.3389134. 2. LCCN QA76.9.A25. URL http://ieeexplore. Lu:2021:SDH ieee.org/servlet/opac? [LHWL21] Baotong Lu, Xiangpeng Hao, punumber=5680738. Tianzheng Wang, and Eric Li:2015:RDS Lo. Scaling dynamic hash tables on real persistent mem- [Li15] Xuelong Li. Robust discrete ory. SIGMOD Record (ACM spectral hashing for large- Special Interest Group on scale image semantic index- Management of Data),50 ing. IEEE Transactions on (1):87–94, June 2021. CO- Big Data, 1(4):162–171, De- DEN SRECD8. ISSN 0163- cember 2015. CODEN ???? 5808 (print), 1943-5835 (elec- ISSN 2332-7790. tronic). URL https:// Liang:1995:PHF dl.acm.org/doi/10.1145/ 3471485.3471506. [Lia95] S. Liang. A perfect hashing function for exact di- Litvinov:1980:GHF agonalization of many-body [LI80] V. A. Litvinov and V. I. Iva- systems of identical parti- nenko. Generalized hash- cles. Computer Physics ing function and hashed Communications, 92(1):11– ﬁle organization. Program- ??, November 1, 1995. CO- ming and Computer Soft- DEN CPHCBZ. ISSN 0010- ware (English Translation 4655 (print), 1879-2944 (elec- of Programmirovanie), 6(5): tronic). 247–249, September–October Lien:1981:AIC 1980. CODEN PCSODA. Li:1995:CKH [Lie81] Y. Edmund Lien, editor. ACM-SIGMOD 1981 Inter- [Li95] G. Li. Collisionful keyed hash national Conference on Man- functions with selectable col- agement of Data: April lisions. Information Pro- 29–May 1, the University cessing Letters, 55(3):167– of Michigan, Ann Arbor, 170, August 11, 1995. CO- Michigan. ACM Press, New DEN IFPLAT. ISSN 0020- York, NY 10036, USA, 1981. 0190 (print), 1872-6119 (elec- ISBN 0-89791-040-0. LCCN tronic). QA76.9.D3 I59 1981. Li:2010:PAP Luhandjula:1992:FSI [Li10] Mengdong Li. Preimage [LII92] M. K. Luhandjula, H. Ichi- awareness proofs of two hashi, and M. Inuiguchi. REFERENCES 320

Fuzzy and semite-infinite htm; http://link.springer- mathematical programming. ny.com/link/service/series/ Information sciences, 61(3): 0558/papers/2433/24330357. 233, 1992. CODEN ISIJBC. pdf. ISSN 0020-0255 (print), 1872-6291 (electronic). Liskov:2007:CIH Lin:1953:xxx [Lis07] Moses Liskov. Construct- ing an ideal hash function [Lin53] A. D. Lin. ??? The year from weak ideal compression is uncertain (???). Extends functions. Lecture Notes in [Luh53] with an alterna- CS, 4356:358–375, 2007. CO- tive overflow handling tech- DEN LNCSD9. ISSN 0302- nique using “degenerative ad- 9743 (print), 1611-3349 (elec- dresses” [Knu73, p. 541]., tronic). URL http://link. 1953. springer.com/content/pdf/ Lin:1963:KAR 10.1007/978-3-540-74462- 7_25. [Lin63] A. D. Lin. Key addressing of random access mem- Litwin:1977:ASD ories by radix transformation. In AFIPS SJCC [Lit77a] W. Litwin. Auto-structuration ’63 [AFI63], pages 355–366. du fichier: Methodologie, or- LCCN TK7885.A1 J6 1963. ganisation d’acces, extension du hash-codering. Technical Lindner:1996:DSH report, ????, Paris, France, [Lin96] M. P. Lindner. Design- 1977. ?? pp. ing for safe hashing. implementing efficient dynamic Litwin:1977:MDP search structures. C++ Re- [Lit77b] Witold Litwin. Méthodes port, 8(10):36–41, November- d’acces par hash-coding December 1996. CODEN virtuel (VHAM): Modelisa- CRPTE7. ISSN 1040-6042. tion, applicationalagestion ` Lipmaa:2002:OHT de Mémoires. Technical report, University of Pierre et [Lip02] Helger Lipmaa. On opti- Marie Curie (Paris, France), mal hash tree traversal for Paris, France, November interval time-stamping. Lec- 1977. ?? pp. ture Notes in CS, 2433:357– ??, 2002. CODEN LNCSD9. Litwin:1978:VHD ISSN 0302-9743 (print), 1611-3349 (electronic). URL [Lit78] W. Litwin. Virtual hashing: http://link.springer-ny. a dynamically changing hash- com/link/service/series/ ing. In Yao [Yao78], pages 0558/bibs/2433/24330357. 517–523. REFERENCES 321

Litwin:1979:HVN — Foundations of Data Or- ganization., pages 51–60. Or- [Lit79a] W. Litwin. Hachage Virtuel: ganizing Committee of the Une Nouvelle Technique Int Conference on Founda- d’Adressage de Mémoires. tions of Data Organization, PhD thesis, ????, Paris, Jpn, 1985. Koyto Sangyo France, 1979. ?? pp. Univ. Computer Science Inst, Kyoto, Jpn. Litwin:1979:LVH Litvinov:1989:HSO [Lit79b] W. Litwin. Linear virtual hashing: a new tool for files [Lit89] V. A. Litvinov. Hash- and tables implementation. sequential organization of Technical report, ????, Le data sets. Programming and Chesnay, France, 1979. ?? Computer Software; transla- pp. tion of Programmirovaniye, (Moscow, USSR) Plenum,15 Litwin:1980:LHN (2):70–??, March 1, 1989. [Lit80] W. Litwin. Linear hashing: CODEN PCSODA. ISSN a new tool for file and table 0361-7688 (print), 1608-3261 addressing. In Lochovsky and (electronic). Taylor [LT80], pages 212–223 Litsios:1991:NFH (or 260–276??). Reprinted in [Sto88, p. 570–581]. [Lit91] James Litsios. Note on fast hashing of variable length Litwin:1981:TH text strings. Communi- cations of the Association [Lit81] W. Litwin. Trie hashing. for Computing Machinery, In Lien [Lie81], pages 19–29. 34(11):118–120, November ISBN 0-89791-040-0. LCCN 1991. CODEN CACMA2. QA76.9.D3 I59 1981. ISSN 0001-0782 (print), Litwin:1984:DAM 1557-7317 (electronic). Sug- gests a simple extension [Lit84] Witold Litwin. Data ac- of Pearson’s hashing algo- cess methods and structures rithm [Pea90] that supports to enhance performance. In- non-character data. See also foTech State-of-the-Art Re- comments in [Dit91, Sav91, port, Database Performance, Pea91], and early work in ??(??):??, 1984. [Dit76]. Litwin:1985:THF Litwin:19xx:LHN

[Lit85] Witold Litwin. Trie hash- [Litxxa] Witold Litwin. Linear hashing: Further properties and ing: a new tool for ﬁle performance. In Proceedings and table addressing. Very REFERENCES 322

Large Data Bases, Interna- Larson:1984:FOI tional Conference on Very Large Data Bases, ??(??): [LK84] Per-Ake˚ Larson and Aja Ka- 212–223, ???? 19xx. CO- jla. File organization: Im- DEN VLDBDP. ACM (Or- plementation of a method der number 471800). Balti- guaranteeing retrieval in one more, Md. access. Communications of the Association for Com- Litwin:19xx:VHD puting Machinery, 27(7): 670–677, July 1984. CO- [Litxxb] Witold Litwin. Virtual hash- DEN CACMA2. ISSN 0001- ing: a dynamically chang- 0782 (print), 1557-7317 (elec- ing hashing. IEEE Cement tronic). Industry Technical Confer- ence (Paper), ??(??):517– Lucchesi:1993:AFA 523, ???? 19xx. IEEE Com- put Soc. Long Beach, Ca. [LK93] Claudio L. Lucchesi and Tomasz Kowaltowski. Ap- Li:2019:IID plications of ﬁnite automata [LJF19] Rongjia Li, Chenhui Jin, and representing large vocabu- Ruya Fan. Improved inte- laries. Software—Practice gral distinguishers on com- and Experience, 23(1):15– pression function of GOST 30, January 1993. CODEN R hash function. The SPEXBL. ISSN 0038-0644 Computer Journal, 62(4): (print), 1097-024X (elec- 535–544, April 2019. CO- tronic). DEN CMPJA6. ISSN Lai:1994:ADB 0010-4620 (print), 1460- 2067 (electronic). URL [LK94] X. Lai and L. Knudsen. At- http://academic.oup.com/ tacks on double block length comjnl/article/62/4/535/ hash functions. In An- 5224765. derson [And94], pages 157– Lv:2017:IPL 165. ISBN 0-387-58108-1, 3-540-58108-1. ISSN 0302- [LJW+17] Qin Lv, William Josephson, 9743 (print), 1611-3349 (elec- Zhe Wang, Moses Charikar, tronic). LCCN QA76.9.A25 and Kai Li. Intelligent C36 1993. probing for locality sensi- Lagutin:2007:CIC tive hashing: multi-probe LSH and beyond. Proceed- [LK07] Dmitrij Lagutin and Hannu H. ings of the VLDB Endow- Kari. Controlling incom- ment, 10(12):2021–2024, Au- ing connections using certiﬁ- gust 2017. CODEN ???? cates and distributed hash ISSN 2150-8097. tables. Lecture Notes in CS, REFERENCES 323

4712:455–467, 2007. CO- article/10.1007/s13389- DEN LNCSD9. ISSN 0302- 015-0110-5; http://link. 9743 (print), 1611-3349 (elec- springer.com/article/10. tronic). URL http://link. 1007/s13389-015-0110-5. springer.com/content/pdf/ Lee:2010:PMH 10.1007/978-3-540-74833- 5_38. [LKI10] David C. Lee, Qifa Ke, and Michael Isard. Par- Li:2011:TAB tition min-hash for par- [LK11] Ping Li and Arnd Chris- tial duplicate image discov- tian K¨onig. Theory and ap- ery. Lecture Notes in CS, plications of b-bit minwise 6311:648–662, 2010. CO- hashing. Communications DEN LNCSD9. ISSN 0302- of the Association for Com- 9743 (print), 1611-3349 (elec- puting Machinery, 54(8):101– tronic). URL http://link. 109, August 2011. CO- springer.com/content/pdf/ DEN CACMA2. ISSN 0001- 10.1007/978-3-642-15549- 0782 (print), 1557-7317 (elec- 9_47. tronic). Lee:2004:CUA Lemire:2014:SUS [LKY04] Sung-Woon Lee, Hyun-Sung Kim, and Kee-Young Yoo. [LK14] Daniel Lemire and Owen Cryptanalysis of a user au- Kaser. Strongly universal thentication scheme using string hashing is fast. The hash functions. Operating Computer Journal, 57(11): Systems Review, 38(1):24– 1624–1638, November 2014. 28, January 2004. CODEN CODEN CMPJA6. ISSN OSRED8. ISSN 0163-5980 0010-4620 (print), 1460-2067 (print), 1943-586X (elec- (electronic). URL http: tronic). //comjnl.oxfordjournals. org/content/57/11/1624. Louchard:1983:PTC Lemire:2016:FBU [LL83] G. Louchard and G. La- touche. Probability Theory [LK16] Daniel Lemire and Owen and Computer Science.Aca- Kaser. Faster 64-bit universal demic Press, New York, NY, hashing using carry-less mul- USA, 1983. ISBN 0-12- tiplications. Journal of Cryp- 455820-8. xiii + 209 pp. tographic Engineering, 6(3): LCCN QA274 .P76 1983. 171–185, September 2016. Lodi:1985:SSH CODEN ???? ISSN 2190- 8508 (print), 2190-8516 (elec- [LL85] E. Lodi and F. Luccio. Split tronic). URL http://link. sequence hash search. Infor- springer.com/accesspage/ mation Processing Letters,20 REFERENCES 324

(3):131–136, April 1985. CO- 2/p346-leng/p346-leng. DEN IFPLAT. ISSN 0020- pdf; http://www.acm. 0190 (print), 1872-6119 (elec- org/pubs/citations/journals/ tronic). tods/1992-17-2/p346-leng/ ; http://www.acm.org/ Litwin:1986:BDA pubs/toc/Abstracts/tods/ . [LL86] Witold Litwin and David B. 128907.html Lomet. The bounded disor- Lenzerini:2008:PTS der access method. In Pro- ceedings of the International [LL08] Maurizio Lenzerini and Domenico Conference on Data Engi- Lembo, editors. Proceed- neering, pages 38–48 (or 38– ings of the Twenty-Seventh 47??). IEEE Computer Soci- ACM SIGMOD-SIGACT- ety Press, 1109 Spring Street, SIGART Symposium on Suite 300, Silver Spring, MD Principles of Database Sys- 20910, USA, February 1986. tems: PODS’08, Vancou- ISBN 0-8186-0655-X. LCCN ver, BC, Canada, June 9–11, QA 76.9 D3 I5582 1986. 2008. ACM Press, New York, IEEE Computer Society Or- NY 10036, USA, 2008. ISBN der Number 655. 1-59593-685-X. LCCN ???? Litwin:1987:NMF Lee:2013:SQB

[LL87] Witold Litwin and David B. [LL13] Kisung Lee and Ling Liu. Lomet. New method for Scaling queries over big RDF fast data searches with graphs with semantic hash keys. IEEE Software, 4(2): partitioning. Proceedings 16–24, March 1987. CO- of the VLDB Endowment, DEN IESOEG. ISSN 0740- 6(14):1894–1905, September 7459 (print), 0740-7459 (elec- 2013. CODEN ???? ISSN tronic). 2150-8097. Leng:1992:OWA Lowden:2015:DPA

[LL92] Chun-Wu Roger Leng and [LLA15] Jason Lowden, MarcinLukowiak, Dik Lun Lee. Optimal weight and Sonia Lopez Alarcon. assignment for signature gen- Design and performance eration. ACM Transactions analysis of eﬃcient Keccak on Database Systems, 17(2): tree hashing on GPU archi- 346–373, June 1992. CO- tectures. Journal of Com- DEN ATDSD3. ISSN 0362- puter Security, 23(5):541– 5915 (print), 1557-4644 (elec- 562, ???? 2015. CODEN tronic). URL http://www. JCSIET. ISSN 0926-227X acm.org/pubs/articles/ (print), 1875-8924 (elec- journals/tods/1992-17- tronic). REFERENCES 325

Leung:1989:LPA Liu, Keqiu Li, Song Guo, Alex X. Liu, Peng Li, Kun [LLC89] K. S. Leung, K. H. Lee, Wang, and Jie Wu. Top-k and S. M. Cheang. Lists queries for categorized RFID processing for artiﬁcial in- systems. IEEE/ACM Trans- telligence applications. Mi- actions on Networking,25 croprocessing and Micropro- (5):2587–2600, October 2017. gramming, 26(4):271–287, CODEN IEANEP. ISSN December 1989. CODEN 1063-6692 (print), 1558-2566 MMICDT. ISSN 0165- (electronic). 6074 (print), 1878-7061 (electronic). Lee:2002:RUA

Li:2018:SBI [LLH02] Cheng-Chi Lee, Li-Hua Li, and Min-Shiang Hwang. A [LLDZ18] Yihong Li, Fangzheng Liu, remote user authentication Zhenyu Du, and Dubing scheme using hash functions. Zhang. A Simhash-based in- Operating Systems Review, tegrative features extraction 36(4):23–29, October 2002. algorithm for malware detec- CODEN OSRED8. ISSN tion. Algorithms (Basel),11 0163-5980 (print), 1943-586X (8), August 2018. CODEN (electronic). ALGOCH. ISSN 1999-4893 (electronic). URL https:/ Luo:2015:ADL /www.mdpi.com/1999-4893/ 11/8/124. [LLJ15] Yiyuan Luo, Xuejia Lai, and Tiejun Jia. Attacks on a dou- Luo:2012:IDE ble length blockcipher-based [LLG12] Yiyuan Luo, Xuejia Lai, and hash proposal. Cryptography Zheng Gong. Indiﬀeren- and Communications, 7(3): tiability of domain exten- 289–295, September 2015. sion modes for hash func- CODEN ???? ISSN 1936- tions. Lecture Notes in CS, 2447 (print), 1936-2455 (elec- 7222:138–155, 2012. CO- tronic). URL http://link. DEN LNCSD9. ISSN 0302- springer.com/accesspage/ 9743 (print), 1611-3349 (elec- article/10.1007/s12095- tronic). URL http://link. 014-0117-2. springer.com/chapter/10. Lim:2009:SPE 1007/978-3-642-32298-3_ 10/. [LLL09] Tong-Lee Lim, Tieyan Li, Liu:2017:TQC and Yingjiu Li. A security and performance evaluation [LLG+17] Xiulong Liu, Keqiu Li, Song of hash-based RFID proto- Guo, Alex X. Liu, Peng Li, cols. Lecture Notes in CS, Kun Wang, Jie Wu, Xiulong 5487:406–424, 2009. CO- REFERENCES 326

DEN LNCSD9. ISSN 0302- rithms for multiple string 9743 (print), 1611-3349 (elec- matching on graphic process- tronic). URL http://link. ing units. IEEE Transac- springer.com/content/pdf/ tions on Parallel and Dis- 10.1007/978-3-642-01440- tributed Systems, 28(9):2639– 6_30. 2650, September 2017. CO- DEN ITDSEO. ISSN 1045- Lin:2011:HAB 9219 (print), 1558-2183 (elec- [LLL11] Po-Ching Lin, Ying-Dar Lin, tronic). URL https://www. and Yuan-Cheng Lai. A computer.org/csdl/trans/ hybrid algorithm of back- td/2017/09/07864442-abs. ward hashing and automa- html. ton tracking for virus scan- Lloyd:1981:ICI ning. IEEE Transactions on Computers, 60(4):594– [Llo81] J. W. Lloyd. Implementing 601, April 2011. CO- clause indexing in deductive DEN ITCOB4. ISSN 0018- database systems. Technical 9340 (print), 1557-9956 (elec- Report 81/4, Dept. of Com- tronic). puter Science, University of Melbourne, Australia, 1981. Li:2016:FSA ?? pp. [LLL+16] Sheng Li, Hyeontaek Lim, Liu:2010:MPI Victor W. Lee, Jung Ho Ahn, Anuj Kalia, Michael [LLW10] Xiaowen Liu, Jinyan Li, and Kaminsky, David G. An- Lusheng Wang. Modeling dersen, Seongil O., Sukhan protein interacting groups Lee, and Pradeep Dubey. by quasi-bicliques: Complex- Full-stack architecting to ity, algorithm, and applica- achieve a billion-requests- tion. IEEE/ACM Transac- per-second throughput on a tions on Computational Bi- single key–value store server ology and Bioinformatics,7 platform. ACM Transactions (2):354–364, April 2010. CO- on Computer Systems, 34(2): DEN ITCBCY. ISSN 1545- 5:1–5:??, May 2016. CO- 5963 (print), 1557-9964 (elec- DEN ACSYEC. ISSN 0734- tronic). 2071 (print), 1557-7333 (electronic). Liang:2010:LVB

Lin:2017:PHB [LLZ10] Yingyu Liang, Jianmin Li, and Bo Zhang. Learn- [LLLC17] Cheng-Hung Lin, Jin-Cheng ing vocabulary-based hash- Li, Chen-Hsiung Liu, and ing with AdaBoost. Lec- Shih-Chieh Chang. Perfect ture Notes in CS, 5916: hashing based parallel algo- 545–555, 2010. CODEN REFERENCES 327

LNCSD9. ISSN 0302-9743 Leighton:1995:LPF (print), 1611-3349 (electronic). URL http://link. [LM95] F. T. Leighton and S. Mi- springer.com/content/pdf/ cali. Large provably fast 10.1007/978-3-642-11301- and secure digital signa- 7_54. ture schemes from secure hash functions. US Patent Lueker:1988:MAD 5,432,852., 1995.

[LM88] G. S. Lueker and M. Molodow- Lee:2007:FDF itch. More analysis of double [LMC07] Sungju Lee, Daesung Moon, hashing. In ACM-TOC’88 and Yongwha Chung. Fea- [ACM88b], pages 354–359. ture distribution of the ﬁn- ISBN 0-89791-264-0. LCCN gerprint template generated QA 76.6 A13 1988. by the geometric hashing- Lai:1993:HFBa based fuzzy vault. Lec- ture Notes in CS, 4693: [LM93a] X. Lai and J. L. Massey. 816–823, 2007. CODEN Hash functions based on LNCSD9. ISSN 0302-9743 block ciphers. In Rueppel (print), 1611-3349 (elec- [Rue93], pages 53–66. ISBN tronic). URL http://link. 0-387-56413-6 (New York), 3- springer.com/content/pdf/ 540-56413-6 (Berlin). LCCN 10.1007/978-3-540-74827- QA76.9.A25 E964 1992. 4_103. Li:2012:SPS Lai:1993:HFBb [LMD+12] Boduo Li, Edward Mazur, [LM93b] X. Lai and J. L. Massey. Yanlei Diao, Andrew McGre- Hash functions based on gor, and Prashant Shenoy. block ciphers. Lecture Notes SCALLA: a platform for in CS, 658:55–70, 1993. CO- scalable one-pass analytics DEN LNCSD9. ISSN 0302- using MapReduce. ACM 9743 (print), 1611-3349 (elec- Transactions on Database tronic). Systems, 37(4):27:1–27:??, December 2012. CODEN Lueker:1993:MAD ATDSD3. ISSN 0362-5915 (print), 1557-4644 (elec- [LM93c] G. S. Lueker and Mariko tronic). Molodowitch. More analysis of double hashing. Combi- Lee:2007:PSK natorica, 13(1):83–96, 1993. CODEN COMBDI. ISSN [LMJC07] Sungju Lee, Daesung Moon, 0209-9683 (print), 1439-6912 Seunghwan Jung, and Yong- (electronic). wha Chung. Protecting se- REFERENCES 328

cret keys with fuzzy fin- based hashing with binary gerprint vault based on mixing. Journal of Math- a 3D geometric hash ta- ematical Cryptology, 9(3): ble. Lecture Notes in CS, 139–150, 2015. CODEN 4432:432–439, 2007. CO- ???? ISSN 1862-2976 (print), DEN LNCSD9. ISSN 0302- 1862-2984 (electronic). 9743 (print), 1611-3349 (electronic). URL http://link. Lynch:2002:ADA springer.com/content/pdf/ [LMR02] Nancy Lynch, Dahlia Malkhi, 10.1007/978-3-540-71629- and David Ratajczak. Atomic 7_49. data access in distributed Liu:2014:MIK hash tables. Lecture Notes in CS, 2429:295–??, 2002. [LMLC14] Xianglong Liu, Yadong CODEN LNCSD9. ISSN Mu, Bo Lang, and Shih- 0302-9743 (print), 1611-3349 Fu Chang. Mixed image- (electronic). URL http: keyword query adaptive //link.springer.de/link/ hashing over multilabel im- service/series/0558/bibs/ ages. ACM Transactions 2429/24290295.htm; http: on Multimedia Computing, //link.springer.de/link/ Communications, and Ap- service/series/0558/papers/ plications, 10(2):22:1–22:??, 2429/24290295.pdf. February 2014. CODEN ???? ISSN 1551-6857 (print), Lin:1989:PIB 1551-6865 (electronic). [LMSF89] Chih-Chen Lin, Leo Mark, Lu:2008:CBN Timos Sellis, and Christos Faloutsos. Performance is- [LMP+08] Yi Lu, Andrea Montanari, sues in the binary relation- Balaji Prabhakar, Sarang ship model. Data and Knowl- Dharmapurikar, and Abdul edge Engineering, 4(3):195– Kabbani. Counter braids: a 221, September 1989. CO- novel counter architecture for DEN DKENEW. ISSN per-flow measurement. ACM 0169-023X (print), 1872-6933 SIGMETRICS Performance (electronic). Evaluation Review, 36(1): 121–132, June 2008. CODEN Legtchenko:2009:CRR ???? ISSN 0163-5999 (print), [LMSM09] Sergey Legtchenko, Sébastien 1557-9484 (electronic). Monnet, Pierre Sens, and Luykx:2015:TPB Gilles Muller. Churn-resilient replication strategy for peer- [LMPW15] Atul Luykx, Bart Mennink, to-peer distributed hash- Bart Preneel, and Laura tables. Lecture Notes in CS, Winnen. Two-permutation- 5873:485–499, 2009. CO- REFERENCES 329

DEN LNCSD9. ISSN 0302- Litwin:1993:LLH 9743 (print), 1611-3349 (electronic). URL http://link. [LNS93] Witold Litwin, Marie-Anne A. springer.com/content/pdf/ Neimat, and Donovan A. 10.1007/978-3-642-05118- Schneider. LH∗ — linear 0_34. hashing for distributed ﬁles. SIGMOD Record (ACM Spe- Legtchenko:2012:RCR cial Interest Group on Man- agement of Data), 22(2):327– [LMSM12] Sergey Legtchenko, S´ebastien 336, June 1993. CODEN Monnet, Pierre Sens, and SRECD8. ISBN 0-89791-592- Gilles Muller. RelaxDHT: 5. ISSN 0163-5808 (print), a churn-resilient replica- 1943-5835 (electronic). tion strategy for peer-to- peer distributed hash-tables. Litwin:1996:LSD ACM Transactions on Au- tonomous and Adaptive Sys- [LNS96] Witold Litwin, Marie-Anna tems (TAAS), 7(2):28:1– Neimat, and Donovan A. 28:??, July 2012. CODEN Schneider. LH* — a ???? ISSN 1556-4665 (print), scalable, distributed data 1556-4703 (electronic). structure. ACM Trans- actions on Database Sys- Lipton:1993:CAH tems, 21(4):480–525, De- cember 1996. CODEN [LN93] Richard J. Lipton and Jef- ATDSD3. ISSN 0362-5915 frey F. Naughton. Clocked (print), 1557-4644 (elec- adversaries for hashing. Al- tronic). URL http://www. gorithmica, 9(3):239–252, acm.org/pubs/articles/ March 1993. CODEN AL- journals/tods/1996-21-4/ GOEJ. ISSN 0178-4617 p480-litwin/p480-litwin. (print), 1432-0541 (elec- pdf; http://www.acm. tronic). org/pubs/citations/journals/ tods/1996-21-4/p480-litwin/ Liu:2008:GBK . Lee:2011:SJS [LND08] Donggang Liu, Peng Ning, and Wenliang Du. Group- [LNS11] Hongrae Lee, Raymond T. based key predistribution Ng, and Kyuseok Shim. Sim- for wireless sensor networks. ilarity join size estimation us- ACM Transactions on Sen- ing locality sensitive hash- sor Networks, 4(2):11:1– ing. Proceedings of the VLDB 11:??, March 2008. CODEN Endowment, 4(6):338–349, ???? ISSN 1550-4859 (print), March 2011. CODEN ???? 1550-4867 (electronic). ISSN 2150-8097. REFERENCES 330

Lohman:1989:IQO 0-387-57301-1 (New York), 3- 540-57301-1 (Berlin). LCCN [Loh89] Guy Lohman. Is query op- QA76.9.D3 I5535 1993. timization a ‘solved’ problem? In ODBF ’89 [ODB89], Lin:2001:EHM page ?? ISBN ?? LCCN ¨ ¨ ?? Technical Report CS/E [LOON01] Shu Lin, M. Tamer Ozsu, 89-005. Vincent Oria, and Ray- mond T. Ng. An ex- Lomet:1983:BIE tendible hash for multi- precision similarity query- [Lom83] David B. Lomet. Bounded ing of image databases. In index exponential hash- Apers et al. [AAC+01], pages ing. ACM Transactions 221–230. ISBN 1-55860-804- on Database Systems, 8(1): 4. LCCN QA76.9.D3 I559 136–165, March 1983. CO- 2001. URL http://www. DEN ATDSD3. ISSN 0362- vldb.org/conf/2001/P221. 5915 (print), 1557-4644 (elec- pdf. tronic). Liang:2000:OMD Lomet:1988:SBD [LOY00] Weifa Liang, Maria E. Or- [Lom88] David B. Lomet. A sim- lowska, and Jeﬀrey X. Yu. ple bounded disorder ﬁle or- Optimizing multiple dimen- ganization with good perfor- sional queries simultane- mance. ACM Transactions ously in multidimensional on Database Systems, 13(4): databases. VLDB Journal: ??, December 1988. CO- Very Large Data Bases,8(3– DEN ATDSD3. ISSN 0362- 4):319–338, February 2000. 5915 (print), 1557-4644 (elec- CODEN VLDBFR. ISSN tronic). 1066-8888 (print), 0949- Lomet:1993:FDO 877X (electronic). URL http://ftp.informatik. [Lom93] David B. Lomet, editor. rwth-aachen.de/dblp/db/ Foundations of Data Or- indices/a-tree/l/Liang: ganization and Algorithms: Weifa.html; http://ftp. 4th International Confer- informatik.rwth-aachen. ence, FODO ’93, Chicago, de/dblp/db/indices/a-tree/ Illinois, USA, October 13– o/Orlowska:Maria_E=.html; 15, 1993: Proceedings,vol- http://ftp.informatik. ume 730 of Lecture Notes in rwth-aachen.de/dblp/db/ Computer Science. Springer- indices/a-tree/y/Yu:Jeffrey_ Verlag, Berlin, Germany / X=.html; http://link. Heidelberg, Germany / Lon- springer.de/link/service/ don, UK / etc., 1993. ISBN journals/00778/bibs/0008003/ REFERENCES 331

00080319.htm; http:// puting Machinery, 62(1):5:1– link.springer.de/link/ 5:??, February 2015. CODEN service/journals/00778/ JACOAH. ISSN 0004-5411 papers/0008003/00080319. (print), 1557-735X (elec- pdf. Electronic edition. tronic). Li:2012:OPH Landelle:2016:CFR

[LOZ12] Ping Li, Art B. Owen, and [LP16] Franck Landelle and Thomas Cun-Hui Zhang. One permu- Peyrin. Cryptanalysis of tation hashing. In F. Pereira, full RIPEMD-128. Jour- C. J. C. Burges, L. Bot- nal of Cryptology, 29(4):927– tou,andK.Q.Weinberger, 951, October 2016. CO- editors, 25th Annual Con- DEN JOCREQ. ISSN 0933- ference on Neural Infor- 2790 (print), 1432-1378 (elec- mation Processing Systems tronic). URL http://link. 2011. December 12–15, 2011, springer.com/accesspage/ Granada, Spain, pages 3122– article/10.1007/s00145- 3130. Curran Associates, 015-9213-5; http://link. Inc., Red Hook, NY, USA, springer.com/article/10. 2012. ISBN 1-61839-599- 1007/s00145-015-9213-5. 8. LCCN QP363.3 A244 v. Luccio:1991:APU 24. URL https://papers. nips.cc/paper/4778-one- [LPP91] Fabrizio Luccio, Andrea permutation-hashing. Pietracaprina, and Geppino Leung:2004:LPD Pucci. Analysis of parallel uniform hashing. Informa- [LP04] Hing Leung and Viktor tion Processing Letters,37 Podolskiy. The limited- (2):67–69, January 31, 1991. ness problem on distance CODEN IFPLAT. ISSN automata: Hashiguchi’s 0020-0190 (print), 1872-6119 method revisited. Theoret. (electronic). Comput. Sci., 310(1–3):147– 158, January 1, 2004. CO- Luccio:1992:AIP DEN TCSCDI. ISSN 0304- [LPP92] F. Luccio, A. Pietracaprina, 3975 (print), 1879-2294 (elec- and G. Pucci. Analysis tronic). and implementation of paral- Lin:2015:CRN lel uniform hashing. Inter- national Journal of Founda- [LP15] Huijia Lin and Rafael Pass. tions of Computer Science,3 Constant-round nonmalleable (1):55–64, March 1992. CO- commitments from any one- DEN IFCSEN. ISSN 0129- way function. Journal of 0541 (print), 1793-6373 (elec- the Association for Com- tronic). REFERENCES 332

Leifer:2003:GAS Li:2018:LLP

[LQH18] Kai Li, Guo-Jun Qi, and [LPSW03] James J. Leifer, Gilles Pe- Kien A. Hua. Learning la- skine, Peter Sewell, and bel preserving binary codes Keith Wansbrough. Global for multimedia retrieval: a abstraction-safe marshalling general approach. ACM with hash types. SIG- Transactions on Multime- PLAN Notices, 38(9):87–98, dia Computing, Communica- September 2003. CODEN tions, and Applications,14 SINODQ. ISSN 0362-1340 (1):2:1–2:??, January 2018. (print), 1523-2867 (print), CODEN ???? ISSN 1551- 1558-1160 (electronic). 6857 (print), 1551-6865 (electronic). Li:2012:WHT Lei:2014:FND [LPT12] Yinan Li, Jignesh M. Patel, [LQZH14] Yanqiang Lei, Guoping Qiu, and Allison Terrell. WHAM: Ligang Zheng, and Jiwu a high-throughput sequence Huang. Fast near-duplicate alignment method. ACM image detection using uni- Transactions on Database form randomized trees. ACM Systems, 37(4):28:1–28:??, Transactions on Multime- December 2012. CODEN dia Computing, Communica- ATDSD3. ISSN 0362-5915 tions, and Applications,10 (print), 1557-4644 (elec- (4):35:1–35:??, June 2014. tronic). ISSN 1551-6857 (print), 1551-6865 (electronic). Long:2006:GCA Larson:1985:EPH [LPWW06] Shoulun Long, Josef Piep- ˚ rzyk, Huaxiong Wang, and [LR85] Per-Ake Larson and M. V. Duncan S. Wong. Gen- Ramakrishna. External eralised cumulative arrays perfect hashing. In Na- in secret sharing. Designs, vathe [Nav85], pages 190– Codes, and Cryptography,40 200. ISBN 0-89791-160-1. (2):191–209, August 2006. LCCN QA 76.9 D3 I59 1985. CODEN DCCREC. ISSN Lee:1996:DRW 0925-1022 (print), 1573- 7586 (electronic). URL [LR96a] Dik Lun Lee and Liming http://www.springerlink. Ren. Document ranking com/openurl.asp?genre= on weight-partitioned signa- article&issn=0925-1022& ture ﬁles. ACM Transac- volume=40&issue=2&spage= tions on Information Sys- 191. tems, 14(2):109–137, April REFERENCES 333

1996. CODEN ATISET. load. IEEE Transactions ISSN 1046-8188. URL http: on Software Engineering, //www.acm.org:80/tois/ 17(7):678–691, July 1991. abstracts/lee.html. CODEN IESEDJ. ISSN 0098-5589 (print), 1939-3520 Lo:1996:SHJ (electronic). URL http: [LR96b] Ming-Ling Lo and Chinya V. //ieeexplore.ieee.org/ Ravishankar. Spatial hash- stamp/stamp.jsp?arnumber= joins. SIGMOD Record 83904. (ACM Special Interest Group Litwin:1989:THC on Management of Data),25 (2):247–258, June 1996. CO- [LRLW89] W. Litwin, N. Roussopou- DEN SRECD8. ISSN 0163- los, G. Levy, and H. Wang. 5808 (print), 1943-5835 (elec- Trie hashing with controlled tronic). load. Technical Report UMIACS-TR-89-11, CS-TR- Li:1999:FJU 2189, SRC-TR-89-13, IN- RIA; Institute for Advanced [LR99] Zhe Li and Kenneth A. Ross. Computer Studies and Sys- Fast joins using join indices. tems Research Center, De- VLDB Journal: Very Large partment of Computer Sci- Data Bases, 8(1):1–24, April ence, 78150 Le Chesnay 1999. CODEN VLDBFR. France; University of Mary- ISSN 1066-8888 (print), land, College Park, MD 0949-877X (electronic). URL 20742, February 1989. 1–29 http://ftp.informatik. pp. rwth-aachen.de/dblp/db/ indices/a-tree/l/Li:Zhe. Leskovec:2014:MMD html; http://ftp.informatik.[LRU14] Jurij Leskovec, Anand Ra- rwth-aachen.de/dblp/db/ jaraman, and Jeﬀrey D. Ull- indices/a-tree/r/Ross: man. Mining of massive Kenneth_A=.html; http: datasets. Cambridge Univer- //link.springer.de/link/ sity Press, Cambridge, UK, service/journals/00778/ second edition, 2014. ISBN bibs/9008001/90080001. 1-107-07723-0 (hardcover), 1- htm; http://link.springer. 316-14731-2 (e-book), 1-139- de/link/service/journals/ 92480-X (e-book). xii + 467 00778/papers/9008001/90080001. pp. LCCN QA76.9.D343 R35 pdf. Electronic edition. 2014eb. Litwin:1991:THC Lipton:1978:EHS [LRLH91] W. A. Litwin, N. Roussopou- [LRY78] R. J. Lipton, A. Rosenberg, los, G. Levy, and W. Hong. and A. C. Yao. Exter- Trie hashing with controlled nal hashing schemes for col- REFERENCES 334

lections of data structures. Litwin:1989:FDO Technical Report Dep. Re- port STA, Stanford Univer- [LS89] W. Litwin and H.-J. Schek, sity, December 1978. ?? pp. editors. Foundations of Data Organization and Al- Lipton:1980:EHS gorithms: 3rd International Conference, FODO 1989, Paris, France, June 21–23, [LRY80] Richard J. Lipton, Arnold L. 1989: Proceedings,volume Rosenberg, and Andrew C. 367 of Lecture Notes in Com- Yao. External hashing puter Science. Springer-Ver- schemes for collections of lag, Berlin, Germany / Hei- data structures. Journal delberg, Germany / London, of the Association for Com- UK / etc., 1989. ISBN 0-387- puting Machinery, 27(1):81– 51295-0. LCCN QA76.9.D3 95, January 1980. CODEN F671 1989. JACOAH. ISSN 0004-5411 (print), 1557-735X (elec- Linial:1996:NEH tronic). [LS96] Nathan Linial and Ori Sas- son. Non-expansive hash- Liu:2015:MDT ing. In ACM [ACM96], pages 509–518. ISBN 0-89791-785- [LRY+15] Chang Liu, R. Ranjan, Chi 5. LCCN QA 76.6 A13 Yang, Xuyun Zhang, Lizhe 1996. URL http://www. Wang, and Jinjun Chen. acm.org/pubs/articles/ MuR-DPA: Top-down lev- proceedings/stoc/237814/ elled multi-replica Merkle p509-linial/p509-linial. hash tree based secure pub- pdf; http://www.acm. lic auditing for dynamic big org/pubs/citations/proceedings/ data storage on cloud. IEEE stoc/237814/p509-linial/ Transactions on Computers, . ACM order no. 508960. Also 64(9):2609–2622, ???? 2015. known as Federated Com- CODEN ITCOB4. ISSN puting Research Conference 0018-9340 (print), 1557-9956 (FCRS ’96). (electronic). Liu:2006:ECS Lange:1985:DS [LS06] Lihua Liu and Hao Shen. Ex- plicit constructions of sep- [LS85] O. Lange and G. Stege- arating hash families from mann. Datenstrukturen und algebraic curves over ﬁnite Speichertechniken. Friedrich ﬁelds. Designs, Codes, Vieweg und Sohn, Braun- and Cryptography, 41(2): schweig, Germany, 1985. 221–233, November 2006. ISBN 3-528-04314-8. ?? pp. CODEN DCCREC. ISSN REFERENCES 335

0925-1022 (print), 1573- Lohman:1991:VLD 7586 (electronic). URL http://www.springerlink. [LSC91] Guy M. Lohman, Am´ailcar com/openurl.asp?genre= Sernadas, and Rafael Camps, article&issn=0925-1022& editors. Very Large Data volume=41&issue=2&spage= Bases Proceedings: Proceed- 221. ings of the Seventeenth Inter- Laccetti:2007:BFA national Conference on Very Large Data Bases, September [LS07a] G. Laccetti and G. Schmid. 3–6, 1991, Barcelona (Cat- Brute force attacks on alonia, Spain). Morgan Kauf- hash functions. Jour- mann Publishers, San Fran- nal of Discrete Mathemat- cisco, CA, 1991. ISBN 1- ical Sciences and Cryptog- 55860-150-3. LCCN QA 76.9 raphy, 10(3):439–460, June D3 I61 1991. 2007. CODEN ???? ISSN 0972-0529. URL http:// Litwin:1989:CTH www.connectjournals.com/ achivestoc.php?bookmark= [LSV89] W. Litwin, Y. Sagiv, and CJ-003072&volume=10&issue_ K. Vidyasankar. Con- id=03. currency and trie hash- Lu:2007:MPC ing. Acta Informatica,26 (7):597–614, 1989. CO- [LS07b] Haibin Lu and Sartaj Sahni. DEN AINFA2. ISSN 0001- O(log W ) multidimensional 5903 (print), 1432-0525 (elec- packet classiﬁcation. IEEE/ tronic). ACM Transactions on Net- working, 15(2):462–472, April Luo:2021:NMH 2007. CODEN IEANEP. ISSN 1063-6692 (print), [LSZ+21] Ye Luo, Zehai Su, Wei Zheng, 1558-2566 (electronic). Zhaobin Chen, Fuqin Wang, Lee:2015:MFA Zhemin Zhang, and Jinjun Chen. A novel memory-hard [LS15] Jooyoung Lee and Martijn password hashing scheme Stam. MJH: a faster al- for blockchain-based cyber- ternative to MDC-2. De- physical systems. ACM signs, Codes, and Cryptog- Transactions on Internet raphy, 76(2):179–205, Au- Technology (TOIT), 21(2): gust 2015. CODEN DC- 42:1–42:21, June 2021. CO- CREC. ISSN 0925-1022 DEN ???? ISSN 1533- (print), 1573-7586 (elec- 5399 (print), 1557-6051 (electronic). URL http://link. tronic). URL https:// springer.com/article/10. dl.acm.org/doi/10.1145/ 1007/s10623-014-9936-6. 3408310. REFERENCES 336

Lochovsky:1980:SIC non-programmable security proof for the full domain [LT80] Frederick H. Lochovsky and hash in the random oracle ?. Taylor, editors. Sixth model. Lecture Notes in CS, International Conference on 7690:124–143, 2012. CO- Very Large Data Bases: DEN LNCSD9. ISSN 0302- reprinted from Very large 9743 (print), 1611-3349 (elec- data bases. IEEE Computer tronic). URL http://link. Society Press, 1109 Spring springer.com/chapter/10. Street, Suite 300, Silver 1007/978-3-642-35416-8_ Spring, MD 20910, USA, 10/. 1980. ACM order no. 471800. IEEE catalog no. 80CH1534- Lu:1990:HBJ 7C. Long Beach order no. [LTS90] H. Lu, K. L. Tan, and 322. M. C. Shan. Hash-based Lipski:1985:PFD join algorithms for multipro- [LT85] W. Lipski and K. Tanaka, cessors with shared memory. editors. Proceedings: Foun- In McLeod et al. [MSDS90], dations of Data Organiza- page 198. ISBN 1-55860-149- tion: May 21–24, 1985, Ky- X. LCCN ??? oto, Japan. FODO’85, Com- Luccio:1972:WIL puter Science Institute, Ky- oto Sangyo University, Ky- [Luc72] Fabrizio Luccio. Weighted oto, Japan, 1985. increment linear search for scatter tables. Commu- Lehmann:2009:MDH nications of the Associa- [LT09] Anja Lehmann and Ste- tion for Computing Ma- fano Tessaro. A modular chinery, 15(12):1045–1047, design for hash functions: December 1972. CODEN Towards making the mix- CACMA2. ISSN 0001- compress-mix approach prac- 0782 (print), 1557-7317 (elec- tical. Lecture Notes in CS, tronic). 5912:364–381, 2009. CO- Luhn:1953:xxx DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [Luh53] Hans Peter Luhn. ??? In- tronic). URL http://link. ternal IBM memo that ﬁrst springer.com/content/pdf/ suggested the idea of hash- 10.1007/978-3-642-10366- ing, and one of the ﬁrst 7_22. applications of linked linear Larangeira:2012:RCN lists. Luhn is also the in- ventor of KWIC indexing, in [LT12] Mario Larangeira and Keisuke 1960 [Knu73, p. 437]. See also Tanaka. Reduction-centric [Lin53]., January 1953. REFERENCES 337

Luhn:1958:BIS Raicu. Exploring distributed hash tables in HighEnd com- [Luh58] Hans Peter Luhn. A puting. ACM SIGMETRICS business intelligence sys- Performance Evaluation Re- tem. IBM Journal of Re- view, 39(3):128–130, Decem- search and Development,2 ber 2011. CODEN ???? ISSN (4):314–319, ???? 1958. 0163-5999 (print), 1557-9484 CODEN IBMJAE. ISSN (electronic). 0018-8646 (print), 2151- 8556 (electronic). URL Lamdan:1988:GHG http://ieeexplore.ieee. [LW88] Yehezkel Lamdan and Haim J. org/stamp/stamp.jsp?tp=& Wolfson. Geometric hashing: arnumber=5392644. a general and eﬃcient model- Lum:1973:GPA based recognition scheme. [Lum73] Vincent Y. Lum. Gen- In IEEE-CV’88 [IEE88b], eral performance analysis of pages 238–249. ISBN 0-8186- key-to-address transforma- 8883-1, 0-8186-0883-8 (pa- tion methods using an ab- perback). LCCN TA1632 stract ﬁle concept. Commu- .I5485 1988. Available from nications of the Association IEEE Service Cent (catalog for Computing Machinery,16 number 88CH2664-1). Pis- (10):603–612, October 1973. cataway, NJ, USA. CODEN CACMA2. ISSN Lee:2004:IAK 0001-0782 (print), 1557-7317 (electronic). [LW04] Narn-Yih Lee and Chien- Nan Wu. Improved authen- Lutterbach:1988:NSD tication key exchange pro- [Lut88] Herbert Lutterbach, edi- tocol without using one-way tor. Non-standard Daten- hash function. Operating banken fuer Anwendungen Systems Review, 38(2):85– der Graphischen Datenver- 92, April 2004. CODEN arbeitung: GI-Fachgesprach, OSRED8. ISSN 0163-5980 Dortmund, 21./22. Marz (print), 1943-586X (elec- 1988: proceedings. Springer- tronic). Verlag, Berlin, Germany / Lenstra:2017:TPR Heidelberg, Germany / Lon- don, UK / etc., 1988. ISBN [LW17] Arjen K. Lenstra and Ben- 0-387-19175-5. LCCN T385 jamin Wesolowski. Trustwor- .N66 1988. thy public randomness with Li:2011:EDH sloth, unicorn, and trx. In- ternational Journal of Ap- [LVD+11] Tonglin Li, Raman Verma, plied Cryptography. IJACT, Xi Duan, Hui Jin, and Ioan 3(4):330–343, 2017. CO- REFERENCES 338

DEN ???? ISSN 1753- virtual hypersphere parti- 0563 (print), 1753-0571 (elec- tioning. Proceedings of tronic). URL https://www. the VLDB Endowment,13 inderscienceonline.com/ (9):1443–1455, May 2020. /doi/pdf/10.1504/IJACT. CODEN ???? ISSN 2017.089354. 2150-8097. URL https:/ /dl.acm.org/doi/abs/10. Lin:2011:EVO 14778/3397230.3397240. [LWG11] Dai-Rui Lin, Chih-I Wang, Lin:2008:AZH andD.J.Guan.Eﬃcient vehicle ownership identiﬁca- [LWWQ08] Pin Lin, Wenling Wu, tion scheme based on triple- Chuankun Wu, and Tian trapdoor chameleon hash Qiu. Analysis of Zipper function. Journal of Network as a hash function. Lec- and Computer Applications, ture Notes in CS, 4991: 34(1):12–19, January 2011. 392–403, 2008. CODEN CODEN JNCAF3. ISSN LNCSD9. ISSN 0302-9743 1084-8045 (print), 1095-8592 (print), 1611-3349 (elec- (electronic). URL http: tronic). URL http://link. //www.sciencedirect.com/ springer.com/content/pdf/ science/article/pii/S1084804510001232. 10.1007/978-3-540-79104- 1_28. Wu:1991:PIC Lu:2018:WLS [lWSS91] Chuan lin Wu (v.1), Her- bert D. Schwetman (v.2), [LWXS18] Kejing Lu, Hongya Wang, and Kimming So (v.3), edi- Yingyuan Xiao, and Hui tors. Proceedings of the 1991 Song. Why locality sensi- International Conference on tive hashing works: A prac- Parallel Processing, August tical perspective. Infor- 12–16, 1991. CRC Press, mation Processing Letters, 2000 N.W. Corporate Blvd., 136(??):49–58, August 2018. Boca Raton, FL 33431-9868, CODEN IFPLAT. ISSN USA, 1991. ISBN 0-8493- 0020-0190 (print), 1872-6119 0190-4 (set), 0-8493-0191-2 (electronic). URL http: (v. 1), 0-8493-0192-0 (v. 2), //www.sciencedirect.com/ 0-8493-0193-9 (v. 3). LCCN science/article/pii/S0020019018300796. QA76.58 .I55 1991. ???? Liu:2018:MCM Lu:2020:VAN [LWZ+18] R. Liu, S. Wei, Y. Zhao, [LWWK20] Kejing Lu, Hongya Wang, Z. Zhu, and J. Wang. Mul- Wei Wang, and Mineichi tiview cross-media hashing Kudo. VHP: approximate with semantic consistency. nearest neighbor search via IEEE MultiMedia, 25(2):71– REFERENCES 339

86, April/June 2018. CO- 1971. CODEN CACMA2. DEN IEMUE4. ISSN 1070- ISSN 0001-0782 (print), 986x (print), 1941-0166 (elec- 1557-7317 (electronic). Sur- tronic). vey of several hash functions, with performance results. Liu:2019:EPB

[LXL+19] Jia Liu, Bin Xiao, Xuan Lin:2019:TTS Liu, Kai Bu, Lijun Chen, and Changhai Nie. Effi- [LYDA19] Qiongzheng Lin, Lei Yang, cient polling-based informa- Chunhui Duan, and Zhenlin tion collection in RFID sys- An. Tash: Toward selective tems. IEEE/ACM Transac- reading as hash primitives for tions on Networking, 27(3): Gen2 RFIDs. IEEE/ACM 948–961, June 2019. CO- Transactions on Networking, DEN IEANEP. ISSN 1063- 27(2):819–834, April 2019. 6692 (print), 1558-2566 (elec- CODEN IEANEP. ISSN tronic). 1063-6692 (print), 1558-2566 (electronic). Lum:1972:ARK Liu:2013:IRQ [LY72] VincentY.LumandP.S.T. Yuen. Additional results [LYJ+13] Dong Liu, Shuicheng Yan, on key-to-address trans- Rong-Rong Ji, Xian-Sheng form techniques: a funda- Hua, and Hong-Jiang Zhang. mental performance study Image retrieval with query- on large existing formatted adaptive hashing. ACM files. Communications of Transactions on Multime- the Association for Comput- dia Computing, Communi- ing Machinery, 15(11):996– cations, and Applications,9 997, November 1972. CO- (1):2:1–2:??, February 2013. DEN CACMA2. ISSN 0001- CODEN ???? ISSN 1551- 0782 (print), 1557-7317 (elec- 6857 (print), 1551-6865 (electronic). tronic). Lum:1971:KAT Lyon:1978:HLP [LYD71] V. Y. Lum, P. S. T. Yuen, and M. Dodd. Key- [Lyo78a] Gordon Lyon. Hashing with to-address transform tech- linear probing and frequency niques: a fundamental per- ordering. Journal of Re- formance study on large ex- search of the National Bureau isting formatted files. Com- of Standards (United States), munications of the Associ- 83(5):445–447, September– ation for Computing Ma- October 1978. CODEN JRN- chinery, 14(4):228–239, April BAG. REFERENCES 340

Lyon:1978:PST Xi Chen, Linxiao Jin, Haoyu Song, and Bin Liu. Low [Lyo78b] Gordon Lyon. Packed scatter computational cost Bloom tables. Communications of filters. IEEE/ACM Trans- the Association for Comput- actions on Networking,26 ing Machinery, 21(10):857– (5):2254–2267, October 2018. 865, October 1978. CO- CODEN IEANEP. ISSN DEN CACMA2. ISSN 0001- 1063-6692 (print), 1558-2566 0782 (print), 1557-7317 (elec- (electronic). tronic). Lai:2019:NIB Lyon:1979:BSS + [Lyo79] Gordon Lyon. Batch schedul- [LYX 19] Qiqi Lai, Bo Yang, Zhe Xia, ing from short lists. Infor- Yannan Li, Yuan Chen, and mation Processing Letters,8 Zhenlong Li. Novel identity- (2):57–59, February 15, 1979. based hash proof system with CODEN IFPLAT. ISSN compact master public key 0020-0190 (print), 1872-6119 from lattices in the standard (electronic). model. International Jour- nal of Foundations of Com- Lyon:1983:PCC puter Science, 30(4):589–606, June 2019. ISSN 0129- [Lyo83] Gordon Lyon. Performance 0541. URL https://www. and cost characterization of worldscientific.com/doi/ A-tree (real-time) hashing. In 10.1142/S0129054119400148. Proceedings of the 17th An- nual Conference on Informa- Lai:2018:NSH tion Sciences and Systems., pages 477–?? Johns Hopkins [LYY+18] Qiqi Lai, Bo Yang, Yong Univ, Baltimore, Md, USA, Yu, Yuan Chen, and Jian 1983. Bai. Novel smooth hash proof systems based on lattices. Lyon:1985:AHT The Computer Journal,61 [Lyo85] Gordon Lyon. Achieving (4):561–574, April 1, 2018. hash table searches in one CODEN CMPJA6. ISSN or two bucket probes. The 0010-4620 (print), 1460- Computer Journal, 28(3): 2067 (electronic). URL 313–318, July 1985. CO- http://academic.oup.com/ DEN CMPJA6. ISSN 0010- comjnl/article/61/4/561/ 4620 (print), 1460-2067 (elec- 4725104. tronic). Li:2006:FSS Lu:2018:LCC [LZ06] Kang Li and Zhenyu Zhong. [LYW+18] Jianyuan Lu, Tong Yang, Fast statistical spam filter by Yi Wang, Huichen Dai, approximate classifications. REFERENCES 341

ACM SIGMETRICS Perfor- 0626 (print), 1532-0634 (elec- mance Evaluation Review,34 tronic). (1):347–358, June 2006. CO- DEN ???? ISSN 0163- Macii:1995:ECP 5999 (print), 1557-9484 (elec- [Mac95] Enrico Macii. The effect tronic). of clustering on the per- Liu:2016:MHN formance of hashing algorithms. Conference proceed- [LZ16] Wei Liu and Tongtao Zhang. ings / IEEE Pacific Rim Multimedia hashing and net- Conference on Communica- working. IEEE Multi- tions, Computers and Sig- Media, 23(3):75–79, July/ nal Processing; sponsored by September 2016. CODEN IEEE Victoria Section . . . IEMUE4. ISSN 1070-986X [et al.], pages 149–152, May (print), 1941-0166 (elec- 1995. ISSN 0893-4266. tronic). URL https://www. computer.org/csdl/mags/ Maddison:1980:FLH mu/2016/03/mmu2016030075- [Mad80] J. A. T. Maddison. Fast abs.html. lookup in hash tables with Litwin:1988:MTH direct rehashing. The Com- puter Journal, 23(2):188– [LZL88] W. Litwin, D. Zegour, and 189, May 1980. CODEN G. Levy. Multilevel trie CMPJA6. ISSN 0010- hashing. Lecture Notes in 4620 (print), 1460-2067 (elec- CS, 303:309–??, April 1988. tronic). CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349 Mairson:1983:PCS (electronic). Also published in/as: Institut National de la [Mai83] Harry G. Mairson. Pro- Recherche en Informatique et gram complexity of searching Automatique, TR-723, Aug. a table. Annual Symposium 1987. on Foundations of Computer Science (Proceedings), pages Monnerat:2015:ESH 40–47, 1983. CODEN ASF- [MA15] Luiz Monnerat and Clau- PDV. ISBN 0-8186-0508-1. dio L. Amorim. An ef- ISSN 0272-5428. IEEE Ser- fective single-hop distributed vice Cent. Piscataway, NJ, hash table with high lookup USA. performance and low traf- Mairson:1992:ETE fic overhead. Concurrency and Computation: Practice [Mai92] Harry G. Mairson. The ef- and Experience, 27(7):1767– fect of table expansion on 1788, May 2015. CO- the program complexity of DEN CCPEBO. ISSN 1532- perfect hash functions. BIT REFERENCES 342

(Nordisk tidskrift for infor- content/g271t221n70h4p87/ mationsbehandling), 32(3): . 430–440, 1992. CODEN BIT- Martin:1964:HCF TEL, NBITAB. ISSN 0006- 3835 (print), 1572-9125 (elec- [Mar64] William A. Martin. Hash- tronic). coding functions of a complex Michail:2012:EHT variable. Report A. I. MEMO 70 and MAC-M-165, Mas- [MAK+12] Harris E. Michail, George S. sachusetts Institute of Tech- Athanasiou, Vasilis Kele- nology, A. I. Lab., Cam- fouras, George Theodoridis, bridge, Massachusetts, June and Costas E. Goutis. On 1964. ?? pp. the exploitation of a high- throughput SHA-256 FPGA Martin:1971:DEA design for HMAC. ACM Transactions on Reconfig- [Mar71] William A. Martin. Deter- urable Technology and Sys- mining the equivalence of al- tems, 5(1):2:1–2:??, March gebraic expressions by hash 2012. CODEN ???? ISSN coding. Journal of the As- 1936-7406 (print), 1936-7414 sociation for Computing Ma- (electronic). chinery, 18(4):549–558, Oc- tober 1971. CODEN JA- Mallach:1977:SST COAH. ISSN 0004-5411 (print), 1557-735X (elec- [Mal77] E. G. Mallach. Scatter tronic). storage techniques: a uniform viewpoint and a method Martin:1975:CDB for reducing retrieval times. The Computer Journal,20 [Mar75] James Martin. Com- (2):137–140, May 1977. CO- puter Data-base Organiza- DEN CMPJA6. ISSN 0010- tion. Prentice-Hall, Engle- 4620 (print), 1460-2067 (elec- wood Cliffs, NJ 07632, USA, tronic). 1975. ISBN 0-13-165506-X. xviii + 558 pp. LCCN QA76 Mandelbrod:2012:LHA .M324. [Man12] Matan Mandelbrod. Lay- Martin:1977:CDB ered hashing algorithm for real-time systems. The- [Mar77] James Martin. Com- ory of Computing Systems, puter Data-base Organiza- 50(2):279–295, ???? 2012. tion. Prentice-Hall, Engle- CODEN TCSYFI. ISSN wood Cliffs, NJ 07632, USA, 1432-4350 (print), 1433-0490 2 edition, 1977. ISBN 0-13- (electronic). URL http: 165423-3. xviii + 713 pp. //www.springerlink.com/ LCCN QA76.9.D3 M36 1977. REFERENCES 343

Matias:1993:HPR puting Machinery, 26(1):36– 38, January 1983. CO- [Mat93] Yossi Matias. Highly parallel DEN CACMA2. ISSN 0001- randomized algorithmics. In 0782 (print), 1557-7317 (elec- Proceedings of the 3rd Work- tronic). shop on Parallel Algorithms (WOPA), page ?? ????, ????, Martini:2003:DHM May 1993. [MB03] Paul M. Martini and Wal- Mathieu:2009:PTA ter A. Burkhard. Double hashing with multiple pass- [Mat09] Claire Mathieu, editor. Pro- bits. International Jour- ceedings of the Twentieth nal of Foundations of Com- Annual ACM–SIAM Sympo- puter Science, 14(6):1165– sium on Discrete Algorithms, ??, December 2003. CO- New York, NY, January 4– DEN IFCSEN. ISSN 0129- 6, 2009, Proceedings of the 0541 (print), 1793-6373 (elec- annual ACM-SIAM Sympo- tronic). sium on Discrete Algorithms, 1071-9040. ACM Press, New Marton:2012:OCC York, NY 10036, USA, [MBBS12] Zoltan-Csaba Marton, Fer- 2009. ISBN 0-89871-680-2. enc Balint-Benczedi, and LCCN QA76.6 A849 2009. Florian Seidel. Object cat- URL http://www.siam. egorization in clutter us- org/proceedings/soda/2009/ ing additive features and soda09.php. hashing of part-graph de- Maurer:1968:PTI scriptors. Lecture Notes in CS, 7463:17–33, 2012. CO- [Mau68] Ward Douglas Maurer. Pro- DEN LNCSD9. ISSN 0302- gramming technique: An im- 9743 (print), 1611-3349 (elec- proved hash code for scat- tronic). URL http://link. ter storage. Communications springer.com/chapter/10. of the Association for Com- 1007/978-3-642-32732-2_ puting Machinery, 11(1):35– 2/. 38, January 1968. CO- DEN CACMA2. ISSN 0001- Manegold:2000:ODA 0782 (print), 1557-7317 (elec- [MBK00] Stefan Manegold, Peter A. tronic). Boncz, and Martin L. Ker- Maurer:1983:IHC sten. Optimizing database architecture for the new bot- [Mau83] W. D. Maurer. An im- tleneck: memory access. proved hash code for scat- VLDB Journal: Very Large ter storage. Communications Data Bases, 9(3):231–246, of the Association for Com- December 2000. CODEN REFERENCES 344

VLDBFR. ISSN 1066-8888 McCarney:1979:LLH (print), 0949-877X (electronic). [McC79] Gary McCarney. Learn the Mazeika:2007:ESA lingo and hash your way into faster data base manage- [MBKS07] Arturas Mazeika, Michael H. ment. Electronic Design,27 B¨ohlen, Nick Koudas, and (11):146–149, May 1979. CO- Divesh Srivastava. Estimat- DEN ELODAW. ISSN 0013- ing the selectivity of approx- 4872. imate string queries. ACM Transactions on Database McDonell:1977:III Systems, 32(2):12:1–12:??, June 2007. CODEN ATDSD3. ISSN 0362-5915 (print), [McD77] K. J. McDonell. An in- 1557-4644 (electronic). verted index implementation. The Computer Journal, Munro:1986:TCR 20(2):116–123, May 1977. CODEN CMPJA6. ISSN [MC86] J. Ian Munro and Pedro 0010-4620 (print), 1460-2067 Celis. Techniques for Col- (electronic). URL http:// lision Resolution in Hash www3.oup.co.uk/computer_ Tables with Open Address- journal/hdb/Volume_20/ ing. IEEE Computer Soci- Issue_02/tiff/116.tif; ety Press, 1109 Spring Street, http://www3.oup.co.uk/ Suite 300, Silver Spring, MD computer_journal/hdb/Volume_ 20910, USA, 1986. ISBN 20/Issue_02/tiff/117.tif; 0-8186-0743-2. 601–610 pp. http://www3.oup.co.uk/ LCCN QA75.5 .F35 1986. computer_journal/hdb/Volume_ IEEE Service Cent. Piscat- 20/Issue_02/tiff/118.tif; away, NJ, USA. http://www3.oup.co.uk/ McMillan:1989:RRU computer_journal/hdb/Volume_ 20/Issue_02/tiff/119.tif; [MC89] Thomas McMillan and William http://www3.oup.co.uk/ Collins. Recurrence relation computer_journal/hdb/Volume_ in uniform hashing. In Com- 20/Issue_02/tiff/120.tif; puting Trends in the 1990’s. http://www3.oup.co.uk/ Proceedings 1989 ACM Sev- computer_journal/hdb/Volume_ enteenth Annual Computer 20/Issue_02/tiff/121.tif; Science Conference (Feb 21– http://www3.oup.co.uk/ 23 1989: Louisville, KY, computer_journal/hdb/Volume_ USA), pages 410–?? ACM 20/Issue_02/tiff/122.tif; Press, New York, NY 10036, http://www3.oup.co.uk/ USA, 1989. ISBN 0-89791- computer_journal/hdb/Volume_ 299-3. LCCN ???? 20/Issue_02/tiff/123.tif. REFERENCES 345

McGrew:2017:IDH classiﬁcation using a dictionary hash technique. Pro- [MCF17] Danile McGrew, M. Cur- ceedings of the International cio, and Scott Fluhrer. Conference on Parallel Pro- Internet-draft: Hash-based cessing, 3:71–75, 1989. CO- signatures. Internet Engi- DEN PCPADL. ISSN 0190- neering Task Force docu- 3918. IEEE catalog number ment., 2017. URL http: 89CH2701-1. //datatracker.ietf.org/ McNichol:2003:HTM doc/draft-mcgrew-hash- sigs. [McN03] Tom McNichol. How two McIlroy:1963:VMF math geeks with a lava lamp and a webcam are [McI63] M. D. McIlroy. A vari- about to unleash chaos on ant method of ﬁle searching. the Internet. Wired,11 Communications of the As- (8):??, August 2003. CO- sociation for Computing Ma- DEN WREDEM. ISSN chinery, 6(3):101, 1963. CO- 1059-1028 (print), 1078-3148 DEN CACMA2. ISSN 0001- (electronic). URL http:// 0782 (print), 1557-7317 (elec- www.lavarnd.org; http: tronic). //www.wired.com/wired/ archive/11.08/random.html. McIlroy:1982:DSL Markowsky:1978:AUC [McI82] M. Douglas McIlroy. De- velopment of a spelling list. [MCW78] G. Markowsky, J. L. Carter, IEEE Trans. Comm.,COM- andM.N.Wegman.Anal- 30(1 pt 1):91–99, January ysis of a universal class of 1982. CODEN IECMBT. hash functions. In Winkowski ISSN 0096-1965. [Win78], pages 345–354. ISBN 0-387-08917-9. LCCN McKenney:1989:HSEa QC770 .I55 1978.

[McK89a] P. McKenney. High-speed Mahapatra:1997:SGL event counting and classiﬁca- tion using a dictionary hash [MD97] Nihar R. Mahapatra and technique. In McAuliﬀe and Shantanu Dutt. Scalable Kogge [MK89], pages 71–75. global and local hashing ISBN 0-271-00686-2. LCCN strategies for duplicate prun- QA76.6 .I548 1989. Three ing in parallel A∗ graph volumes. search. IEEE Transac- McKenney:1989:HSEb tions on Parallel and Dis- tributed Systems, 8(7):738– [McK89b] Paul E. McKenney. High- 756, July 1997. CODEN speed event counting and ITDSEO. ISSN 1045-9219 REFERENCES 346

(print), 1558-2183 (elec- 387-13302-X. xiv + 336 pp. tronic). URL http://dlib. LCCN QA76.9 .D35 M43. computer.org/td/books/ td1997/pdf/l0738.pdf; Mehlhorn:1986:DEA http://www.computer.org/ [Meh86] K. Mehlhorn. Datenstruk- tpds/td1997/l0738abs.htm. turen und Effiziente Algorith- men Band 1: Suchen und Macchetti:2005:QPH Sortieren. B. G. Teubner, [MD05] Marco Macchetti and Luigi Stuttgart, Germany, 1986. Dadda. Quasi-pipelined ISBN 3-519-02255-9. ?? pp. hash circuits. In Mon- Meijer:1995:HFB tuschi and Schwarz [MS05], page ?? ISBN 0-7695- [Mei95] A. R. Meijer. Hash functions 2366-8. LCCN QA76.9.C62 based on modular squaring. .S95 2005. URL http:// Transactions — The South arith17.polito.it/final/ African Institute of Elec- paper-149.pdf. trical Engineers. Handelinge — Die Suid-Afrikaanse In- Mehlhorn:1977:EA stituut van Elektriese Inge- nieurs, 86(2):91–??, 1995. [Meh77] K. Mehlhorn. Effiziente Al- CODEN TSAEA9. ISSN gorithmen. B. G. Teubner, 0038-2221. Stuttgart, Germany, 1977. ISBN 3-519-02343-1. 240 pp. Mekouar:1983:EPD LCCN QA76.6 .M43. [Mek83] Faical Mekouar. Etude des Mehlhorn:1982:PSP performances du hachage digital. Technical report, In- [Meh82] Kurt Mehlhorn. On the stitut National de Recherche program size of perfect and en Informatique et Automa- universal hash functions. tique, June 1983. ?? pp. In IEEE-FOCS’82 [IEE82], pages 170–175. CODEN Miranda:2014:RSE ASFPDV. ISSN 0272-5428. [MEK+14] Alberto Miranda, Sascha LCCN QA76.6 .S95 1982. Effert, Yangwook Kang, IEEE Serv Cent. Piscataway, Ethan L. Miller, Ivan Popov, NJ, USA. Andre Brinkmann, Tom Mehlhorn:1984:SS Friedetzky, and Toni Cortes. Random slicing: Efficient [Meh84] Kurt Mehlhorn. Sorting and and scalable data placement Searching. Springer-Verlag, for large-scale storage sys- Berlin, Germany / Heidel- tems. ACM Transactions on berg, Germany / London, Storage, 10(3):9:1–9:??, July UK / etc., 1984. ISBN 0- 2014. CODEN ???? ISSN REFERENCES 347

1553-3077 (print), 1553-3093 Mergenthaler:1972:HCT (electronic). [Mer72] Erhard Mergenthaler. Hash- Mendelson:1982:AEH code-techniken, uebersicht. Technical report, ????, Stuttgart, [Men82] Haim Mendelson. Analy- Germany, 1972. ?? pp. sis of extendible hashing. Merkle:1990:FSO IEEE Transactions on Soft- ware Engineering, SE-8(6): [Mer90a] Ralph C. Merkle. A fast 611–619, November 1982. software one-way hash func- CODEN IESEDJ. ISSN tion. Journal of Cryptology, 0098-5589 (print), 1939-3520 3(1):43–58, ???? 1990. CO- (electronic). DEN JOCREQ. ISSN 0933- 2790 (print), 1432-1378 (elec- Mennink:2012:OCS tronic). Merkle:1990:OWH [Men12] Bart Mennink. Optimal collision security in double block [Mer90b] Ralph C. Merkle. One way length hashing with single hash functions and DES. In length key. Lecture Notes in Brassard [Bra90], pages 428– CS, 7658:526–543, 2012. CO- 446 (or 428–466??). CO- DEN LNCSD9. ISSN 0302- DEN LNCSD9. ISBN 0-387- 9743 (print), 1611-3349 (elec- 97317-6, 3-540-97317-6. ISSN tronic). URL http://link. 0302-9743 (print), 1611- springer.com/content/pdf/ 3349 (electronic). LCCN 10.1007/978-3-642-34961- QA76.9.A25 C79 1989. URL 4_32. http://link.springer-ny. com/link/service/series/ Mennink:2017:OCS 0558/tocs/t0435.htm; http://www.springerlink. [Men17] Bart Mennink. Optimal com/content/978-0-387- collision security in double 97317-3; http://www. block length hashing with springerlink.com/openurl. single length key. Designs, asp?genre=issue&issn=0302- Codes, and Cryptography,83 9743&volume=435. Based on (2):357–406, May 2017. CO- unpublished paper from 1979 DEN DCCREC. ISSN 0925- and his Ph.D thesis, Stan- 1022 (print), 1573-7586 (elec- ford, 1979. tronic). URL http://link. MeyerAufDerHeide:1993:HSS springer.com/accesspage/ article/10.1007/s10623- [Mey93] Friedhelm Meyer Auf Der 016-0227-2; http://link. Heide. Hashing strategies springer.com/article/10. for simulating shared mem- 1007/s10623-016-0227-2. ory on distributed memory REFERENCES 348

machines. Lecture Notes in Mueller:2006:SMG CS, 678:20–29, 1993. CO- + DEN LNCSD9. ISSN 0302- [MFK 06] Maik Mueller, Michael Frei- 9743 (print), 1611-3349 (elec- drich, Klaus Kiefer, Ralf tronic). Miko, and Juergen Schnei- der. System and method for Mor:1982:HCM generating pseudo-random numbers. United States [MF82] M. Mor and A. S. Fraenkel. A Patent 7,894,602., March hash code method for detect- 31, 2006. URL http: ing and correcting spelling www.google.com/patents/ errors. Communications of US7894602. the Association for Com- puting Machinery, 25(12): Mochizuki:2000:ERA 935–940 (or 935–938??), De- [MH00] H. Mochizuki and Y. Hayashi. cember 1982. CODEN An efficient retrieval algo- CACMA2. ISSN 0001- rithm of compound words us- 0782 (print), 1557-7317 (elec- ing extendible hashing. In- tronic). ternational Journal of Com- Manolopoulos:1992:AHF puter Processing of Oriental Languages (IJCPOL), 13(1): [MF92] Y. Manolopoulos and N. Fis- 15–??, 2000. CODEN ???? tas. Algorithms for a ISSN 0219-4279. hashed file with variable- McKenzie:1990:SHA length records. Information sciences, 63(3):229, 1992. [MHB90] Bruce J. McKenzie, R. Har- CODEN ISIJBC. ISSN 0020- ries, and Timothy C. Bell. 0255 (print), 1872-6291 (elec- Selecting a hashing algo- tronic). rithm. Software—Practice and Experience, 20(2):209– Munoz:2004:CRS 224, February 1, 1990. CO- [MFES04] Jose L. Muñoz, Jordi Forne, DEN SPEXBL. ISSN 0038- Oscar Esparza, and Miguel 0644 (print), 1097-024X Soriano. Certificate revoca- (electronic). tion system implementation Mou:2013:CBC based on the Merkle hash tree. International Journal [MHT+13] Luntian Mou, Tiejun Huang, of Information Security,2 Yonghong Tian, Menglin (2):110–124, January 2004. Jiang, and Wen Gao. Content- CODEN ???? ISSN 1615- based copy detection through 5262 (print), 1615-5270 (elec- multimodal feature represen- tronic). URL http://link. tation and temporal pyramid springer.com/article/10. matching. ACM Transac- 1007/s10207-003-0026-4. tions on Multimedia Comput- REFERENCES 349

ing, Communications, and Miller:1985:PHF Applications, 10(1):5:1–5:??, December 2013. CODEN [Mil85] L. L. Miller. Performance of ???? ISSN 1551-6857 (print), hash files in a microcomputer 1551-6865 (electronic). based parallel file system. In ACM-CONF’85’ [ACM85a], Machii:1984:HMF pages 29–34. ISBN 0-89791- 170-9. LCCN QA 76 R36 [MI84] M. Machii and Y. Igarashi. 1985. A hashing method of finding themaximaofasetofvec- Miller:1987:STS tors. Technical Report CS- [Mil87] Webb Miller. A Software 84-2, Department of Com- Tools Sampler. Prentice- puter Science, Gunma Uni- Hall, Englewood Cliffs, NJ versity, Gunma, Japan, 1984. 07632, USA, 1987. ISBN 0- ?? pp. 13-822305-X. viii + 344 pp. LCCN QA76.754 M55 1987. Micciancio:2002:ICH US$24.95. [Mic02] Daniele Micciancio. Im- Miller:1995:RAC proved cryptographic hash functions with worst-case/ [Mil95] J. W. Miller. Random access average-case connection. In from compressed datasets ACM [ACM02], pages 609– with perfect value hashing. 618. ISBN 1-58113-495-9. IEEE International Sympo- LCCN QA75.5 .A22 2002. sium on Information Theory, ACM order number 508020. pages 454–??, 1995. CODEN PISTFZ. ISSN 0271-4655. Maabreh:2018:MHT Miltersen:1998:ECC [MIGA18] Majdi Maabreh, Hafez Ir- shid, Ajay Gupta, and Iz- [Mil98] Peter Bro Miltersen. Er- zat Alasmadi. A multi- ror correcting codes, perfect threading and hashing tech- hashing circuits, and deter- nique for indexing Target– ministic dynamic dictionar- Decoy peptides databases. ies. In Karloff [Kar98], pages Concurrency and Computa- 556–563. ISBN 0-89871-410- tion: Practice and Experi- 9. LCCN QA76.6 .A278 1998. ence, 30(9), May 10, 2018. URL http://dl.acm.org/ CODEN CCPEBO. ISSN citation.cfm?id=314613. 1532-0626 (print), 1532-0634 Miltersen:1999:CPC (electronic). URL https: //onlinelibrary.wiley. [Mil99] P. B. Miltersen. Cell com/doi/abs/10.1002/cpe. probe complexity — a sur- 4371. vey. In Raman et al. REFERENCES 350

[RRR99], page ?? CO- Performance Evaluation Re- DEN LNCSD9. ISBN 3-540- view, 45(1):47–48, June 2017. 66836-5 (softcover). ISSN CODEN ???? ISSN 0163- 0302-9743 (print), 1611- 5999 (print), 1557-9484 (elec- 3349 (electronic). LCCN tronic). QA267.A1 L43 no.1738. URL http://link.springer-ny. Mitra:1973:SHP com/link/service/series/ [Mit73] Debasis Mitra. Solution 0558/tocs/t1738.htm; to the hashing problem for http://www.springerlink. code length 3. Informa- com/content/978-3-540- tion and Control, 23(3):205– 66836-7; http://www. 220, October 1973. CO- springerlink.com/openurl. DEN IFCNA4. ISSN 0019- asp?genre=issue&issn=0302- 9958 (print), 1878-2981 (elec- 9743&volume=1738. tronic). Miyaguchi:1989:NHF Mitzenmacher:2002:GHT [MIO89] S. Miyaguchi, M. Iwata, and K. Ohta. New 128-bit [Mit02] Michael Mitzenmacher. Good hash function. In IJWCC’89 hash tables and multiple hash [IJW89], pages 279–288. functions. Dr. Dobbs Jour- LCCN TK5105.5 .I574 1989. nal, 27(5):28, 30–32, May 2002. CODEN DDJOEB. Mironov:2001:HFM ISSN 1044-789X. URL http: [Mir01] Ilya Mironov. Hash func- //www.ddj.com/ftp/2002/ tions: From Merkle-Damg˚ard 2002_05/hash.txt. to Shoup. Lecture Notes Mitzenmacher:2009:SOQ in CS, 2045:166–??, 2001. CODEN LNCSD9. ISSN [Mit09] Michael Mitzenmacher. Some 0302-9743 (print), 1611- open questions related to 3349 (electronic). URL cuckoo hashing. In Fiat and http://link.springer-ny. Sanders [FS09], pages 1–10. com/link/service/series/ CODEN LNCSD9. ISBN 0558/bibs/2045/20450166. 3-642-04127-2. ISSN 0302- htm; http://link.springer- 9743 (print), 1611-3349 (elec- ny.com/link/service/series/ tronic). LCCN QA76.9.A43 0558/papers/2045/20450166. E83 2009. URL http: pdf. //www.springerlink.com/ content/xmk215105743x3p9/ Mirrokni:2017:OOM . [Mir17] Vahab Mirrokni. Online op- Mittelbach:2012:HCS timization for markets and the cloud: Theory and prac- [Mit12] Arno Mittelbach. Hash tice. ACM SIGMETRICS combiners for second pre- REFERENCES 351

image resistance, target colli- free content-based publish/ sion resistance and pre-image subscribe. IEEE/ACM resistance have Long out- Transactions on Network- put. Lecture Notes in CS, ing, 22(5):1516–1530, Octo- 7485:522–539, 2012. CO- ber 2014. CODEN IEANEP. DEN LNCSD9. ISSN 0302- ISSN 1063-6692 (print), 9743 (print), 1611-3349 (elec- 1558-2566 (electronic). tronic). URL http://link. springer.com/content/pdf/ Michelogiannakis:2011:PCE 10.1007/978-3-642-32928- [MJBD11] George Michelogiannakis, 9_29. Nan Jiang, Daniel U. Becker, Mitzenmacher:2017:BBH and William J. Dally. Packet chaining: Efficient single- [Mit17] Michael Mitzenmacher. Build- cycle allocation for on-chip ing a better hash function: networks. IEEE Computer technical perspective. Com- Architecture Letters, 10(2): munications of the Associa- 33–36, July/December 2011. tion for Computing Machin- CODEN ???? ISSN 1556- ery, 60(7):93, July 2017. CO- 6056 (print), 1556-6064 (elec- DEN CACMA2. ISSN 0001- tronic). 0782 (print), 1557-7317 (electronic). URL http://cacm. Mukherjee:2002:ECV acm.org/magazines/2017/ + 7/218877/fulltext. [MJT 02] R. Mukherjee, J. Jain, K.Takayama,J.A.Abra- Mathew:2008:JBH ham, D. S. Fussell, and [MJ08] S. Mathew and K. P. Ja- M. Fujita. Efficient com- cob. JERIM-320: a 320- binational verification using bit hash function with dual overlapping local BDDs and applications — a statisti- a hash table. Formal Meth- cal analysis. Journal of ods in System Design, 21(1): Discrete Mathematical Sci- 95–101, July 2002. CODEN ences and Cryptography,11 FMSDE6. ISSN 0925-9856. (4):471–482, August 2008. McAuliffe:1989:PIC CODEN ???? ISSN 0972-0529. URL http:// [MK89] Kevin P. McAuliffe and Pe- www.connectjournals.com/ ter M. Kogge, editors. Pro- achivestoc.php?bookmark= ceedings of the 1989 Interna- CJ-003072&volume=11&issue_ tional Conference on Paral- id=04. lel Processing, August 8–12, Muthusamy:2014:IFC 1989, volume 1. IEEE Com- puter Society Press, 1109 [MJ14] Vinod Muthusamy and Hans- Spring Street, Suite 300, Sil- Arno Jacobsen. Infrastructure- ver Spring, MD 20910, USA, REFERENCES 352

1989. ISBN 0-271-00686-2. post-quantum cryptographic LCCN QA76.6 .I548 1989. stateless hash-based secure Three volumes. signatures benchmarked on Miller:1993:RFS ASIC. ACM Transactions on Embedded Computing Sys- [MK93] Ethan L. Miller and Randy H. tems, 16(2):59:1–59:??, April Katz. RAMA: a file system 2017. CODEN ???? ISSN for massively-parallel com- 1539-9087 (print), 1558-3465 puters. In Coleman [Col93], (electronic). pages 163–168. ISBN 0-8186- 3462-6. LCCN TK7895.M4 Mozaffari-Kermani:2018:ERE I5 1993. [MKASJ18] Mehran Mozaffari-Kermani, Manoharan:2011:PAM Reza Azarderakhsh, Ausmita Sarker, and Amir Jalali. Ef- [MK11] Arun Manoharan and Am- ficient and reliable error de- masi Krishnan. Power tection architectures of hash- analysis of multiple hash- counter-hash tweakable en- ing Bloom filter architec- ciphering schemes. ACM ture for network applica- Transactions on Embedded tions. International Journal Computing Systems, 17(2): of Computer Applications, 54:1–54:??, April 2018. CO- 33(4):316–322, 2011. ISSN DEN ???? ISSN 1539- 1206-212X (print), 1925-7074 9087 (print), 1558-3465 (elec- (electronic). URL https:// tronic). www.tandfonline.com/doi/ full/10.2316/Journal.202. McGrew:2016:SMH 2011.4.202-3052. [MKF+16] Daniel McGrew, Panos Kam- Miliaraki:2012:FDS panakis, Scott Fluhrer, Stefan-Lukas Gazdag, De- [MK12] Iris Miliaraki and Manolis nis Butin, and Johannes Koubarakis. FoXtrot: Dis- Buchmann. State manage- tributed structural and value ment for hash-based signa- XML filtering. ACM Trans- tures. Lecture Notes in CS, actions on the Web (TWEB), 10074:244–260, 2016. CO- 6(3):12:1–12:??, September DEN LNCSD9. ISSN 0302- 2012. CODEN ???? ISSN 9743 (print), 1611-3349 (elec- 1559-1131 (print), 1559-114X tronic). URL https://link. (electronic). springer.com/chapter/10. Mozaffari-Kermani:2017:FDA 1007/978-3-319-49100-4_ 11. [MKAA17] Mehran Mozaffari-Kermani, Varalakshmi:2021:HPI Reza Azarderakhsh, and Anita Aghaie. Fault de- [MKL21] Varalakshmi M, Amit P. Ke- tection architectures for sarkar, and Daphne Lopez. REFERENCES 353

High-performance implemen- hashing schemes for primary tation of a two-bit geohash key retrieval. Information coding technique for near- system, 19(5):433–??, 1994. est neighbor search. Con- CODEN INSYD6. ISSN currency and Computation: 0306-4379 (print), 1873-6076 Practice and Experience,33 (electronic). (5):e6029:1–e6029:??, March 10, 2021. CODEN CCPEBO. Myllymaki:1995:DTJ ISSN 1532-0626 (print), [ML95] Jussi Myllymaki and Miron 1532-0634 (electronic). Livny. Disk-tape joins: syn- Mochizuki:1998:SSA chronizing disk and tape access. ACM SIGMETRICS [MKSiA98] H. Mochizuki, M. Koyama, Performance Evaluation Re- M. Shishibori, and J. i. Aoe. view, 23(1):279–290, May A substring search algorithm 1995. CODEN ???? ISSN in extendible hashing. In- 0163-5999 (print), 1557-9484 formation sciences, 108(1): (electronic). 13–30, July 1998. CO- DEN ISIJBC. ISSN 0020- Martin:19xx:ETJ 0255 (print), 1872-6291 (elec- [MLxx] T. P. Martin and P. A. Lar- tronic). son. An evaluation of three Maurer:1975:HTM join algorithms for a shared- memory multiprocessor envi- [ML75] W. D. Maurer and T. G. ronment. ???, ??(??):????, Lewis. Hash table methods. 19xx. ACM Computing Surveys,7 Ma:2015:TDH (1):5–19, March 1975. CO- DEN CMSVAN. ISSN 0010- [ML15] Chao Ma and Chuancai Liu. 4892. Two dimensional hashing Mackert:1986:ROV for visual tracking. Com- puter vision and image un- [ML86] L. F. Mackert and G. M. derstanding: CVIU, 135(??): Lohman. R* optimizer 83–94, June 2015. CO- validation and performance DEN CVIUF4. ISSN 1077- evaluation for distributed 3142 (print), 1090-235X queries. In Chu et al. (electronic). URL http: [CGO86], pages 149–159. //www.sciencedirect.com/ ISBN 0-934613-18-4. LCCN science/article/pii/S107731421500017X. QA76.9.D3 I559 1986. Martin:1994:PHB Manolopoulos:1994:PLH [MLD94] T. P. Martin, P.-A. Larson, [ML94] Y. Manolopoulos and N. Lorent- and V. Deshpande. Parallel zos. Performance of linear hash-based join algorithms REFERENCES 354

for a shared-everything envi- using nested transactions and ronment. IEEE Transactions I/O automata. Data and on Knowledge and Data En- Knowledge Engineering,37 gineering, 6(5):750–??, Octo- (2):139–176, May 2001. CO- ber 1, 1994. CODEN IT- DEN DKENEW. ISSN KEEH. ISSN 1041-4347. 0169-023X (print), 1872-6933 Ma:2017:NDC (electronic). [MLHK17] Dekui Ma, Jian Liang, Mehrotra:2010:RII RanHe,andXiangwei [MMG10] Hunny Mehrotra, Banshid- Kong. Nonlinear dis- har Majhi, and Phalguni crete cross-modal hashing for Gupta. Robust iris index- visual-textual data. IEEE ing scheme using geomet- MultiMedia, 24(2):56–65, ric hashing of SIFT key- April/June 2017. CODEN points. Journal of Network IEMUE4. ISSN 1070-986X and Computer Applications, (print), 1941-0166 (elec- 33(3):300–313, May 2010. tronic). URL https://www. CODEN JNCAF3. ISSN computer.org/csdl/mags/ 1084-8045 (print), 1095-8592 mu/2017/02/mmu2017020056- (electronic). URL http: abs.html. //www.sciencedirect.com/ Martinez:2007:OXH science/article/pii/S1084804509001416. [MLP07] Christopher J. Martinez, McEvoy:2009:IWH Wei-Ming Lin, and Parimal Patel. Optimal XOR hash- [MMMT09] Robert P. McEvoy, Colin C. ing for non-uniformly dis- Murphy, William P. Mar- tributed address lookup in nane, and Michael Tunstall. computer networks. Jour- Isolated WDDL: a hiding nal of Network and Com- countermeasure for diﬀeren- puter Applications, 30(4): tial power analysis on FP- 1397–1427, November 2007. GAs. ACM Transactions CODEN JNCAF3. ISSN on Reconﬁgurable Technol- 1084-8045 (print), 1095-8592 ogy and Systems, 2(1):3:1– (electronic). URL http: 3:??, March 2009. CODEN //www.sciencedirect.com/ ???? ISSN 1936-7406 (print), science/article/pii/S1084804506000786. 1936-7414 (electronic). Madria:2001:FCC Mourad:1994:LPH [MMC01] S. Kumar Madria, S. N. [MMSY94] A.N.Mourad,R.J.T.Mor- Maheshwari, and B. Chan- ris, A. Swami, and H. C. dra. Formalization and cor- Young. Limits of parallelism rectness of a concurrent lin- in hash join algorithms. Per- ear hash structure algorithm formance evaluation, 20(1 REFERENCES 355

/ 3):301–??, May 1, 1994. Moran:2007:DHI CODEN PEEVD9. ISSN 0166-5316 (print), 1872-745X [MNS07] Tal Moran, Moni Naor, and (electronic). Gil Segev. Deterministic history-independent strate- Mehlhorn:1990:BOD gies for storing information on write-once memo- [MN90] Kurt Mehlhorn and Stefan ries. In Arge et al. [ACJT07], Naeher. Bounded ordered pages 303–315. ISBN 3- dictionaries in O(log log n) 540-73419-8. ISSN 0302- time and O(n) space. In- 9743 (print), 1611-3349 (elec- formation Processing Letters, tronic). LCCN QA267 35(4):183–189, August 1990. .I55 2007. URL http: CODEN IFPLAT. ISSN //www.springerlink.com/ 0020-0190 (print), 1872-6119 content/b28632551tt5657q/ (electronic). ; http://www.wisdom. Mehlhorn:1999:LPC weizmann.ac.il/~naor/PAPERS/ writeonce.pdf. [MN99] Kurt Mehlhorn and Ste- fan Näher. LEDA: a Mendel:2012:CAR platform for combinatorial and geometric computing. [MNS12] Florian Mendel, Tomislav Cambridge University Press, Nad, and Martin Schläffer. Cambridge, UK, 1999. ISBN Collision attacks on the re- 0-521-56329-1 (hardcover). duced dual-stream hash func- xvi + 1018 pp. LCCN tion RIPEMD-128. Lec- QA76.73.C153 M44 1999. ture Notes in CS, 7549: URL http://www.loc.gov/ 226–243, 2012. CODEN catdir/description/cam0210/ LNCSD9. ISSN 0302-9743 99024952.html; http:/ (print), 1611-3349 (elec- /www.loc.gov/catdir/toc/ tronic). URL http://link. cam027/99024952.html. springer.com/chapter/10. 1007/978-3-642-34047-5_ Motwani:2008:LBL 14/.

[MNP08] Rajeev Motwani, Assaf Naor, Mansour:1990:CCU and Rina Panigrahy. Lower bounds on locality sensitive [MNT90] Yishay Mansour, Noam hashing. SIAM Journal on Nisan, and Prasoon Tiwari. Discrete Mathematics, 21(4): The computational complex- 930–935, ???? 2008. CO- ity of universal hashing. DEN SJDMEC. ISSN 0895- In ACM-TOC’90 [ACM90], 4801 (print), 1095-7146 (elec- pages 235–243. ISBN 0- tronic). 89791-361-2. LCCN ???? REFERENCES 356

Mansour:1993:CCU symposium held at the Freie Universit¨at Berlin, Sept. 23– [MNT93] Y. Mansour, N. Nisan, and 26, 1991. P. Tiwari. The computational complexity of uni- Moto-oka:1992:FGC versal hashing. Theoret. [Mo92b] Toru Moto-oka, editor. Fifth Comput. Sci., 107(1):121– generation computer sys- 133, January 4, 1993. CO- tems: proceedings of the In- DEN TCSCDI. ISSN 0304- ternational Conference on 3975 (print), 1879-2294 (elec- Fifth Generation Computer tronic). Systems, Tokyo, Japan, Oc- Matsumoto:1981:NCM tober 19–22, 1981.ACM Press, New York, NY 10036, [MNY81] K. Matsumoto, M. Naka, USA, 1992. ISBN 0-444- and H. Yamamoto. New 86440-7. LCCN QA76.5 .I545 clustering method for Land- 1981. sat images using local maximums of a multi-dimensional Mohan:1990:ACC histogram. In 7th Inter- [Moh90] C. Mohan. ARIES/LHS: a national Symposium — Ma- concurrency control and re- chine Processing of Remotely covery method using write- Sensed Data with Special ahead logging for linear hash- Emphasis on Range, Forest, ing with separators. Techni- and Wetlands Assessment., cal report, IBM Corporation, pages 321–326. Purdue Res San Jose, CA, USA, March Found, West Lafayette, Indi- 1990. ?? pp. ana, USA, 1981. IEEE. Pis- cataway, NJ, USA. Mohan:1993:ACC

Monien:1992:DSE [Moh93] C. Mohan. ARIES/LHS: a [MO92a] B. Monien and Th. Ottmann, concurrency control and re- editors. Data Structures and covery method using write- Eﬃcient Algorithms: Final ahead logging for linear Report on the DFG Special hashing with separators. Joint Initiative, volume 594 In ICDE’93 [ICD93], page of Lecture Notes in Com- 243. ISBN 0-8186-3572- puter Science. Springer-Ver- X (hardcover), 0-8186-3570- lag, Berlin, Germany / Hei- 3 (paperback), 0-8186-3571- delberg, Germany / London, 1 (microﬁche). LCCN UK / etc., 1992. ISBN 0-387- QA76.9.D3I57 1993. 55488-2 (New York), 3-540- Mohassel:2011:OTS 55488-2 (Berlin). viii + 389 pp. LCCN QA76.9.D35D36 [Moh11] Payman Mohassel. One-time 1992. Papers presented at a signatures and Chameleon REFERENCES 357

hash functions. Lecture Notes thesis, Dept. of Information in CS, 6544:302–319, 2011. and Computer Science, Uni- CODEN LNCSD9. ISSN versity of California, Irvine, 0302-9743 (print), 1611-3349 Irvine, CA, USA, 1990. xiii (electronic). URL http:// + 164 pp. link.springer.com/content/ Molodowitch:1990:ADAb pdf/10.1007/978-3-642- 19574-7_21. [Mol90b] Mariko Molodowitch. Analy- Miyaguchi:1990:CSH sis and design of algorithms: double hashing and parallel [MOI90] S. Miyaguchi, K. Ohta, and graph searching. Technical M. Iwata. Confirmation Report TR 90-43, Dept. of that some hash functions Information and Computer are not collision free. In Science, University of Cali- Damg˚ard [Dam90a], pages fornia, Irvine, 1990. xii + 112 293–308. ISBN 0-387- pp. Originally presented as 53587-X (New York), 3-540- the author’s Ph.D. thesis. 53587-X (Berlin). LCCN Monico:2019:CHF QA76.9.A25 E964 1990. DM69.00. [Mon19] Chris Monico. Cryptanalysis Miyaguchi:1991:CSH of a hash function, and the modular subset sum prob- [MOI91] Shoji Miyaguchi, Kazuo lem. Groups. Complexity. Ohta, and Masahiko Iwata. Cryptology, 11(1):17–??, May Confirmation that some hash 2019. CODEN ???? ISSN functions are not collision 1867-1144 (print), 1869-6104 free. Lecture Notes in CS, (electronic). URL https:/ 473:326–??, 1991. CO- /www.degruyter.com/view/ DEN LNCSD9. ISSN j/gcc.2019.11.issue-1/ 0302-9743 (print), 1611- gcc-2019-2001/gcc-2019- 3349 (electronic). URL 2001.xml. http://link.springer-ny. Morris:1968:SST com/link/service/series/ 0558/bibs/0473/04730326. [Mor68] Robert Morris. Scatter stor- htm; http://link.springer- age techniques. Commu- ny.com/link/service/series/ nications of the Association 0558/papers/0473/04730326. for Computing Machinery, pdf. 11(1):38–44, January 1968. CODEN CACMA2. ISSN Molodowitch:1990:ADAa 0001-0782 (print), 1557-7317 [Mol90a] Mariko Molodowitch. Analy- (electronic). Influential sur- sis and design of algorithms: vey of the subject of hashing, double hashing and paral- and first introduction of ran- lel graph searching.PhD dom probing with secondary REFERENCES 358

clustering. Appears to be the compile-time optimization of ﬁrst publication where the parallel programs. Techni- word ‘hashing’ appeared, al- cal Report CSRD 993, Uni- though it was in common use versity of Illinois at Urbana- at the time. Knuth [Knu73, Champaign, Center for Su- p. 542] found only one earlier percomputing Research and printed use of the word, in a Development, Urbana, IL 1961 unpublished memoran- 61801, USA, May 1990. 26 dum by W. W. Peterson. pp. Moran:1983:CDO Mennink:2012:HFB

[Mor83a] Shlamo Moran. On the com- [MP12] Bart Mennink and Bart plexity of designing optimal Preneel. Hash functions partial match retrieval sys- based on three permuta- tems. ACM Transactions on tions: a generic security anal- Database Systems, 8(4):543– ysis. Lecture Notes in CS, 551, December 1983. CO- 7417:330–347, 2012. CO- DEN ATDSD3. ISSN 0362- DEN LNCSD9. ISSN 0302- 5915 (print), 1557-4644 (elec- 9743 (print), 1611-3349 (electronic). tronic). URL http://link. springer.com/chapter/10. Morris:1983:SST 1007/978-3-642-32009-5_ 20/. [Mor83b] Morris. Scatter storage techniques. Communications of Mennink:2016:EPH the Association for Com- [MP16] Bart Mennink and Bart Pre- puting Machinery, 26(??): neel. Efficient paralleliz- ??, ???? 1983. CO- able hashing using small non- DEN CACMA2. ISSN 0001- compressing primitives. In- 0782 (print), 1557-7317 (elec- ternational Journal of In- tronic). formation Security, 15(3): Motoyoshi:1984:HAC 285–300, June 2016. CO- DEN ???? ISSN 1615- [Mot84] Fumio Motoyoshi. Hash ad- 5262 (print), 1615-5270 (elec- dressing chip. Denshi Gijutsu tronic). URL http://link. Sogo Kenkyusho Iho/Bulletin springer.com/article/10. of the Electrotechnical Lab- 1007/s10207-015-0288-7. oratory, 48(8):736–738, ???? Martinez:2009:DFN 1984. CODEN DGSKAR. ISSN 0366-9092. [MPL09] Christopher J. Martinez, De- Midkiff:1990:ICO vang K. Pandya, and Wei- Ming Lin. On design- [MP90] Samuel P. Midkiff and ing fast nonuniformly dis- David A. Padua. Issues in the tributed IP address lookup REFERENCES 359

hashing algorithms. IEEE/ MedeirosDuarte:2019:CPC ACM Transactions on Net- working, 17(6):1916–1925, [MRL+19] Rodrigo Medeiros Duarte, December 2009. CODEN André Rauber Du Bois, IEANEP. ISSN 1063-6692 Maur´ıcio Lima Pilla, Ger- (print), 1558-2566 (elec- son Geraldo H. Cavalheiro, tronic). and Renata Hax Sander Reiser. Comparing the Malensek:2014:EGG performance of concurrent [MPP14] Matthew Malensek, Sangmi hash tables implemented in Pallickara, and Shrideep Pal- Haskell. Science of Com- lickara. Evaluating geospa- puter Programming, 173(??): tial geometry and proxim- 56–70, March 15, 2019. ity queries using distributed CODEN SCPGD4. ISSN hash tables. Computing in 0167-6423 (print), 1872-7964 Science and Engineering,16 (electronic). URL http: (4):53–61, July/August 2014. //www.sciencedirect.com/ CODEN CSENFA. ISSN science/article/pii/S0167642318302491. 1521-9615. Mendel:2010:RAR Moody:2016:ISF [MPST16] Dustin Moody, Souradyuti [MRST10] Florian Mendel, Christian Paul, and Daniel Smith- Rechberger, Martin Schläffer, Tone. Indifferentiability se- and Søren S. Thomsen. Re- curity of the fast wide pipe bound attacks on the re- hash: breaking the birthday duced Grøstl hash func- barrier. Journal of Math- tion. Lecture Notes in CS, ematical Cryptology, 10(2): 5985:350–365, 2010. CO- 101–133, 2016. CODEN DEN LNCSD9. ISSN 0302- ???? ISSN 1862-2976 (print), 9743 (print), 1611-3349 (elec- 1862-2984 (electronic). tronic). URL http://link. springer.com/content/pdf/ Mendel:2007:CTH 10.1007/978-3-642-11925- 5_24. [MR07] Florian Mendel and Vin- cent Rijmen. Cryptanaly- Mitchell:1989:RHF sis of the Tiger hash function. Lecture Notes in CS, [MRW89] Chris Mitchell, Dave Rush, 4833:536–550, 2007. CO- and Michael Walker. A DEN LNCSD9. ISSN 0302- remark on hash functions 9743 (print), 1611-3349 (elec- for message authentication. tronic). URL http://link. Computers and Security,8 springer.com/content/pdf/ (1):55–58, February 1, 1989. 10.1007/978-3-540-76900- CODEN CPSEDU. ISSN 2_33. 0167-4048. REFERENCES 360

Mikkilineni:1988:ERJ Cape Cod, Massachusetts, USA. IEEE Computer So- [MS88a] Krishna P. Mikkilineni and ciety Press, 1109 Spring Stanley Y. W. Su. An Street, Suite 300, Silver evaluation of relational join Spring, MD 20910, USA, algorithms in a pipelined 2005. ISBN 0-7695-2366- query processing environ- 8. LCCN QA76.9.C62 .S95 ment. IEEE Transactions 2005. on Software Engineering, 14(6):838–848, June 1988. Mashatan:2009:ITC CODEN IESEDJ. ISSN [MS09] Atefeh Mashatan and Dou- 0098-5589 (print), 1939-3520 glas R. Stinson. Inter- (electronic). URL http: active two-channel message //ieeexplore.ieee.org/ authentication based on stamp/stamp.jsp?arnumber= Interactive–Collision Resis- 6162. tant hash functions. In- Murthy:1988:SSC ternational Journal of In- formation Security, 8(1):49– [MS88b] D. Murthy and Pradip K. Srimani. Split sequence 60, February 2009. CO- DEN ???? ISSN 1615- coalesced hashing. Infor- mation system, 13(2):211– 5262 (print), 1615-5270 (elec- 218, May 1988. CODEN tronic). URL http://link. INSYD6. ISSN 0306-4379 springer.com/article/10. (print), 1873-6076 (elec- 1007/s10207-008-0063-0. tronic). Makrushin:2012:IRB

Malard:2002:DDH [MS12] Andrey Makrushin and To- [MS02] J. M. Malard and R. D. Stew- bias Scheidat. Improving art. Distributed dynamic reliability of biometric hash hash tables using IBM LAPI. generation through the selec- In IEEE [IEE02], page ?? tion of dynamic handwriting ISBN 0-7695-1524-X. LCCN features. Lecture Notes in ???? URL http://www.sc- CS, 7228:19–41, 2012. CO- 2002.org/paperpdfs/pap. DEN LNCSD9. ISSN 0302- pap247.pdf. 9743 (print), 1611-3349 (electronic). URL http://link. Montuschi:2005:PIS springer.com/chapter/10. [MS05] Paolo Montuschi and Eric 1007/978-3-642-31971-6_ (Eric Mark) Schwarz, edi- 2/. tors. Proceedings of the 17th Morawiecki:2013:SBP IEEE Symposium on Com- puter Arithmetic, ARITH- [MS13] Pawel Morawiecki and Mar- 17 2005, June 27–29, 2005, ian Srebrny. A SAT-based REFERENCES 361

preimage analysis of re- Brisbane, Australia. Morgan duced Keccak hash func- Kaufmann Publishers, San tions. Information Pro- Francisco, CA, 1990. ISBN cessing Letters, 113(10–11): 1-55860-149-X. LCCN ??? 392–397, May/June 2013. Malhotra:1996:SED CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 [MSK96] Vishv M. Malhotra, Bala (electronic). URL http: Srinivasan, and Santosh //www.sciencedirect.com/ Kulkarni. Storage-eﬃcient science/article/pii/S0020019013000811. data structure for large lookup dictionaries. Infor- Maier:2016:CHT mation Processing Letters,58 (4):201–206, May 27, 1996. [MSD16] Tobias Maier, Peter Sanders, CODEN IFPLAT. ISSN and Roman Dementiev. Con- 0020-0190 (print), 1872-6119 current hash tables: fast and (electronic). general?(!). SIGPLAN No- tices, 51(8):34:1–34:??, Au- Mouha:2012:CIR gust 2016. CODEN SIN- ODQ. ISSN 0362-1340 [MSP12] Nicky Mouha, Gautham (print), 1523-2867 (print), Sekar, and Bart Preneel. 1558-1160 (electronic). Challenging the increased resistance of regular hash func- Maier:2019:CHT tions against birthday attacks. Journal of Math- [MSD19] Tobias Maier, Peter Sanders, ematical Cryptology,6(3– and Roman Dementiev. Con- 4):229–248, 2012. CO- current hash tables: Fast and DEN ???? ISSN 1862- general(?)! ACM Trans- 2976 (print), 1862-2984 (elec- actions on Parallel Com- tronic). URL https:// puting (TOPC), 5(4):16:1– www.degruyter.com/view/ 16:??, March 2019. CO- j/jmc.2012.6.issue-3-4/ DEN ???? ISSN 2329- jmc-2011-0010/jmc-2011- 4949 (print), 2329-4957 (elec- 0010.xml. tronic). URL https://dl. MeyeraufderHeide:1996:ESR acm.org/ft_gateway.cfm? id=3309206. [MSS96] F. Meyer auf der Heide, McCleod:1990:VLD C. Scheideler, and V. Ste- mann. Exploiting storage re- [MSDS90] Dennis McLeod, Ron Sacks- dundancy to speed up ran- Davis, and Hans Schek, edi- domized shared memory sim- tors. Very Large Data Bases: ulations. Theoret. Com- 16th International Confer- put. Sci., 162(2):245–281, ence on Very Large Data August 20, 1996. CO- Bases, August 13–16, 1990, DEN TCSCDI. ISSN 0304- REFERENCES 362

3975 (print), 1879-2294 (elec- 3162–3185, August 2019. tronic). CODEN ALGOEJ. ISSN 0178-4617 (print), 1432-0541 Meichun:1990:COL (electronic). [MSSWP90] Hs Meichun, Tung Shang- Ma:2020:TDE Sheng, and Yang Wei-Pang. Concurrent operations in lin- [MSZ+20] Zhulin Ma, Edwin H.-M. ear hashing. Information sci- Sha, Qingfeng Zhuge, Wei- ences, 51(2):193–212, 1990. wen Jiang, Runyu Zhang, CODEN ISIJBC. ISSN 0020- and Shouzhen Gu. Towards 0255 (print), 1872-6291 (elec- the design of eﬃcient hash- tronic). based indexing scheme for growing databases on non- Maitin-Shepard:2017:ECM volatile memory. Future Gen- [MSTA17] Jeremy Maitin-Shepard, Mehdi eration Computer Systems, Tibouchi, and Diego F. 105(??):1–12, April 2020. Aranha. Elliptic curve mul- CODEN FGSEVI. ISSN tiset hash. The Com- 0167-739X (print), 1872-7115 puter Journal, 60(4):476– (electronic). URL http: 490, March 23, 2017. CO- //www.sciencedirect.com/ DEN CMPJA6. ISSN 0010- science/article/pii/S0167739X18331005. 4620 (print), 1460-2067 (elec- March:2011:ROD tronic). URL https:// academic.oup.com/comjnl/ [MT11] Verdi March and Yong Meng article/60/4/476/2608055. Teo. A read-only distributed Morrison:1987:QAH hash table. Journal of Grid Computing, 9(4):501–529, [MSV87] John A. Morrison, Larry A. December 2011. CODEN Shepp, and Christopher J. ???? ISSN 1570-7873 (print), Van Wyk. A queueing anal- 1572-9184 (electronic). URL ysis of hashing with lazy http://www.springerlink. deletion. SIAM Journal com/openurl.asp?genre= on Computing, 16(6):1155– article&issn=1570-7873& 1164, December 1987. CO- volume=9&issue=4&spage= DEN SMJCAT. ISSN 0097- 501. 5397 (print), 1095-7111 (elec- Mullan:2016:HHF tronic). Maier:2019:DSE [MT16] Ciaran Mullan and Boaz Tsaban. SL2 homomor- [MSW19] Tobias Maier, Peter Sanders, phic hash functions: worst and Stefan Walzer. Dy- case to average case re- namic space eﬃcient hash- duction and short collision ing. Algorithmica, 81(8): search. Designs, Codes, REFERENCES 363

and Cryptography, 81(1):83– 301–307, May 1972. CO- 107, October 2016. CO- DEN CACMA2. ISSN 0001- DEN DCCREC. ISSN 0925- 0782 (print), 1557-7317 (elec- 1022 (print), 1573-7586 (electronic). tronic). URL http://link. springer.com/accesspage/ Mullin:1981:TCL article/10.1007/s10623- 015-0129-8; http://link.[Mul81] James K. Mullin. Tightly springer.com/article/10. controlled linear hashing 1007/s10623-015-0129-8. without separate overflow Madria:2000:MLT storage. BIT (Nordisk tidskrift for informationsbehan- [MTB00] S. K. Madria, M. A. dling), 21(4):390–400, 1981. Tubaishat, and B. Bhar- CODEN BITTEL, NBITAB. gava. Multi-level transaction ISSN 0006-3835 (print), model for semantic concur- 1572-9125 (electronic). rency control in linear hash structures. Information and Mullen:1984:UDH Software Technology, 42(7): 445–464, May 1, 2000. CO- [Mul84a] J. Mullen. Unified dynamic DEN ISOTE7. ISSN 0950- hashing. In Dayal et al. 5849 (print), 1873-6025 (elec- [DSS84], pages 473–480. tronic). Mullin:1984:UDH Muehlbacher:2004:FHT [Mue04] Joerg R. Muehlbacher. Full [Mul84b] James K. Mullin. Uni- hash table search using prim- fied dynamic hashing. In itive roots of the prime Proceedings — Very Large residue group Z/p. J.UCS: Data Bases, Tenth Inter- Journal of Universal Com- national Conference., pages puter Science, 10(9):1239– 473–480. VLDB Endowment, 1249, September 28, 2004. Saratoga, CA, USA, 1984. CODEN ???? ISSN 0948- 6968. URL http://www. Mullin:1985:SSE jucs.org/jucs_10_9/full_ hash_table_search. [Mul85] James K. Mullin. Spi- ral storage: Efficient dy- Mullin:1972:IIS namic hashing with con- [Mul72] James K. Mullin. An im- stant performance. The proved indexed-sequential Computer Journal, 28(3): access method using hashed 330–334, July 1985. CO- overflow. Communications DEN CMPJA6. ISSN 0010- of the Association for Com- 4620 (print), 1460-2067 (elec- puting Machinery, 15(5): tronic). REFERENCES 364

Mullin:1991:CUC into nearly-constant time, with applications to parallel [Mul91] James K. Mullin. A caution hashing. In ACM-TOC’91 on universal classes of hash [ACM91e], pages 307–316. functions. Information Pro- ISBN 0-89791-397-3. LCCN cessing Letters, 37(5):247– QA 76.6 A13 1991. 256, March 14, 1991. CO- DEN IFPLAT. ISSN 0020- Matias:1991:PHI 0190 (print), 1872-6119 (elec- [MV91b] Yossi Matias and Uzi Vishkin. tronic). On parallel hashing and in- Mullin:1992:HFH teger sorting. Journal of Algorithms, 12(4):573–606, [Mul92] J. K. Mullin. Hash func- December 1, 1991. CO- tions for hash-based join DEN JOALDV. ISSN 0196- methods. The Computer 6774 (print), 1090-2678 (elec- Journal, 35(6):A499–A503, tronic). December 1992. CODEN CMPJA6. ISSN 0010- Menezes:1991:ACC 4620 (print), 1460-2067 (elec- [MV91c] Alfred J. Menezes and tronic). Scott A. Vanstone, editors. Mathieu:1988:MQS Advances in Cryptology– CRYPTO ’90: Proceedings, [MV88] Claire M. Mathieu and Jef- volume 537 of Lecture Notes frey Scott Vitter. Maxi- in Computer Science. Spring- mum queue size and hash- er-Verlag, Berlin, Germany / ing with lazy deletion. In Heidelberg, Germany / Lon- Wegman et al. [WGM88], don, UK / etc., 1991. ISBN pages 743–748. URL http: 0-387-54508-5 (New York), 3- //www.dtic.mil/dtic/tr/ 540-54508-5 (Berlin). LCCN fulltext/u2/a208838.pdf. QA76.9.A25 C79 1990. Con- Matias:1990:PHI ference held Aug. 11–15, 1990, at the University of [MV90] Y. Matias and U. Vishkin. California, Santa Barbara. On parallel hashing and in- Mihcak:2001:PAH teger sorting. In Paterson [Pat90], page ?? ISBN 0- [MV01] M. Kıvan¸c Mıh¸cak and Ra- 387-52826-1 (New York), 3- marathnam Venkatesan. A 540-52826-1 (Berlin). LCCN perceptual audio hashing al- QA267.A1 L43 no.443. gorithm: a tool for robust au- Matias:1991:CHP dio identiﬁcation and information hiding. Lecture Notes [MV91a] Yossi Matias and Uzi Vishkin. in CS, 2137:51–65, 2001. Converting high probability CODEN LNCSD9. ISSN REFERENCES 365

0302-9743 (print), 1611- AnchorHash: a scalable con- 3349 (electronic). URL sistent hash. IEEE/ACM http://link.springer-ny. Transactions on Networking, com/link/service/series/ 29(2):517–528, April 2021. 0558/bibs/2137/21370051. CODEN IEANEP. ISSN htm; http://link.springer- 1063-6692 (print), 1558-2566 ny.com/link/service/series/ (electronic). URL https:/ 0558/papers/2137/21370051. /dl.acm.org/doi/10.1109/ pdf. TNET.2020.3039547. Mihcak:2002:NIG Martirosyan:2008:ECP [MvT08] Sosina Martirosyan and Tran [MV02] M. Kivan¸c Mih¸cak and Ra- van Trung. Explicit con- marathnam Venkatesan. New structions for perfect hash iterative geometric methods families. Designs, Codes, for robust perceptual im- and Cryptography, 46(1):97– age hashing. Lecture Notes 112, January 2008. CO- in CS, 2320:13–??, 2002. DEN DCCREC. ISSN CODEN LNCSD9. ISSN 0925-1022 (print), 1573- 0302-9743 (print), 1611- 7586 (electronic). URL 3349 (electronic). URL http://www.springerlink. http://link.springer-ny. com/openurl.asp?genre= com/link/service/series/ article&issn=0925-1022& 0558/bibs/2320/23200013. volume=46&issue=1&spage= htm; http://link.springer- 97. ny.com/link/service/series/ 0558/papers/2320/23200013. Mittermeir:1995:AVS pdf. [MW95] R. T. Mittermeir and L. Wuerﬂ. Mitzenmacher:2008:WSH Abstract visualization of software. A basis for a com- [MV08] M. Mitzenmacher and S. Vad- plex hash-key? Lecture Notes han. Why simple hash func- in CS, 945:545–??, 1995. CO- tions work: Exploiting the DEN LNCSD9. ISSN 0302- entropy in a data stream. 9743 (print), 1611-3349 (elec- In ACM [ACM08a], pages tronic). 746–755. ISBN 0-89871-647- 0. LCCN QA76.9.A43 A34 Matsushita:2009:PCH 2008. [MW09] Yusuke Matsushita and Mendelson:2021:ASC Toshikazu Wada. Principal component hashing: an ac- [MVB+21] Gal Mendelson, Shay Var- celerated approximate near- gaftik, Katherine Barabash, est neighbor search. Lec- Dean H. Lorenz, Isaac ture Notes in CS, 5414: Keslassy, and Ariel Orda. 374–385, 2009. CODEN REFERENCES 366

LNCSD9. ISSN 0302-9743 (electronic). URL http:// (print), 1611-3349 (elec- www.oup.co.uk/jnls/list/ tronic). URL http://link. comjnl/hdb/Volume_39/Issue_ springer.com/content/pdf/ 06/390547.sgm.abs.html; 10.1007/978-3-540-92957- http://www3.oup.co.uk/ 4_33. computer_journal/Volume_ 39/Issue_06/Vol39_06.body. Mu:2012:ALS html#AbstractMajewski.This [MWC12] Yadong Mu, John Wright, paper claims the discovery and Shih-Fu Chang. Accel- of order-preserving perfect erated large scale optimiza- hashing methods that run in tion by concomitant hash- linear time. ing. Lecture Notes in CS, Ma:2012:HPO 7572:414–427, 2012. CO- [MXL+12] Yuan Ma, Luning Xia, DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Jingqiang Lin, Jiwu Jing, Zongbin Liu, and Xingjie tronic). URL http://link. Yu. Hardware performance springer.com/content/pdf/ optimization and evaluation 10.1007/978-3-642-33718- of SM3 hash algorithm on 5_30. FPGA. Lecture Notes in Majewski:1992:FGM CS, 7618:105–118, 2012. CO- DEN LNCSD9. ISSN 0302- [MWCH92] Bohdan S. Majewski, Nicholas C. 9743 (print), 1611-3349 (elec- Wormald, Zbigniew J. Czech, tronic). URL http://link. and George Havas. A family springer.com/chapter/10. of generators of minimal per- 1007/978-3-642-34129-8_ fect hash functions. Technical 10/. Report 92-16, Center for Dis- crete Mathematics and The- Mendelson:1979:PMO oretical Computer Science [MY79] H. Mendelson and U. Yechiali. (DIMACS) at Rutgers Uni- Performance measures for or- versity, New Jersey, 1992. ?? dered lists in random-access pp. ﬁles. Journal of the Asso- Majewski:1996:FPH ciation for Computing Ma- chinery, 26(4):654–677, Oc- [MWHC96] Bohdan S. Majewski, Nicholas C. tober 1979. CODEN JA- Wormald, George Havas, and COAH. ISSN 0004-5411 Zbigniew J. Czech. A fam- (print), 1557-735X (elec- ily of perfect hashing meth- tronic). ods. The Computer Journal, Mendelson:1980:NAA 39(6):547–554, ???? 1996. CODEN CMPJA6. ISSN [MY80] Haim Mendelson and Uri 0010-4620 (print), 1460-2067 Yechiali. A new approach to REFERENCES 367

the analysis of linear prob- fast one-way hash function ing schemes. Journal of suitable for hardware imple- the Association for Comput- mentation. Lecture Notes ing Machinery, 27(3):474– in CS, 1431:217–??, 1998. 483, July 1980. CODEN CODEN LNCSD9. ISSN JACOAH. ISSN 0004-5411 0302-9743 (print), 1611- (print), 1557-735X (elec- 3349 (electronic). URL tronic). http://link.springer-ny. com/link/service/series/ Mimaroglu:2012:ADC 0558/bibs/1431/14310217. [MYS12] Selim Mimaroglu, Murat htm; http://link.springer- Yagci, and Dan A. Simovici. ny.com/link/service/series/ Approximative distance com- 0558/papers/1431/14310217. putation by random hashing. pdf. The Journal of Supercomput- Metreveli:2012:CCP ing, 61(3):572–589, Septem- ber 2012. CODEN JOSUED. [MZK12] Zviad Metreveli, Nickolai ISSN 0920-8542 (print), Zeldovich, and M. Frans 1573-0484 (electronic). URL Kaashoek. CPHASH: a http://www.springerlink. cache-partitioned hash ta- com/openurl.asp?genre= ble. SIGPLAN Notices,47 article&issn=0920-8542& (8):319–320, August 2012. volume=61&issue=3&spage= CODEN SINODQ. ISSN 572. 0362-1340 (print), 1523-2867 (print), 1558-1160 (elec- Ma:2018:GEG tronic). PPOPP ’12 confer- [MZD+18] Jiacheng Ma, Xiao Zheng, ence proceedings. Yaozu Dong, Wentai Li, Ma:2019:BSB Zhengwei Qi, Bingsheng He, and Haibing Guan. gMig: [MZL+19] W. Ma, Y. Zhu, C. Li, Eﬃcient GPU live migration M. Guo, and Y. Bao. BiloKey optimized by software dirty : a scalable bi-index locality- page for full virtualization. aware in-memory key–value SIGPLAN Notices, 53(3):31– store. IEEE Transactions on 44, March 2018. CODEN Parallel and Distributed Sys- SINODQ. ISSN 0362-1340 tems, 30(7):1528–1540, July (print), 1523-2867 (print), 2019. CODEN ITDSEO. 1558-1160 (electronic). ISSN 1045-9219 (print), 1558-2183 (electronic). Mihaljevic:1998:CAB Namanya:2020:SHB [MZI98] Miodrag Mihaljevic, Yuliang Zheng, and Hideki Imai. [NADY20] Anitta Patience Namanya, A cellular automaton based Irfan U. Awan, Jules Pagna REFERENCES 368

Disso, and Muhammad Nakatani:2021:SAB Younas. Similarity hash based scoring of portable [Nak21] Y. Nakatani. Structured executable ﬁles for eﬃ- allocation-based consistent cient malware detection in hashing with improved bal- IoT. Future Generation ancing for cloud infras- Computer Systems, 110(??): tructure. IEEE Transac- 824–832, September 2020. tions on Parallel and Dis- CODEN FGSEVI. ISSN tributed Systems, 32(9):2248– 0167-739X (print), 1872-7115 2261, September 2021. CO- (electronic). URL http: DEN ITDSEO. ISSN 1045- //www.sciencedirect.com/ 9219 (print), 1558-2183 (elec- science/article/pii/S0167739X18325913. tronic).

Naeslund:1995:UHF Namba:1986:SIU

[Nae95] M. Naeslund. Universal hash [Nam86] K. Namba. Some improve- functions and hard core bits. ments on Utah standard In Guillou and Quisquater LISP. SIGSAM Bulletin [GQ95], pages 356–366. (ACM Special Interest Group ISBN 3-540-59409-4. ISSN on Symbolic and Algebraic 0302-9743 (print), 1611- Manipulation), 20(1/2):29– 3349 (electronic). LCCN 36, February/May 1986. CO- QA76.9.A25 C794 1995. URL DEN SIGSBZ. ISSN 0163- http://link.springer-ny. 5824 (print), 1557-9492 (elec- com/link/service/series/ tronic). 0558/bibs/0921/09210356. NIST:1992:PYA htm; http://link.springer- ny.com/link/service/series/[Nat92] National Institute of Stan- 0558/papers/0921/09210356. dards and Technology (NIST). pdf. Publication YY: Announce- ment and Speciﬁcations for a Nuida:2015:MPS Secure Hash Standard (SHS), [NAK+15] Koji Nuida, Takuro Abe, January 22 1992. ?? pp. Shizuo Kaji, Toshiaki Maeno, NIST:1995:FPSb and Yasuhide Numata. A mathematical problem for se- [Nat95] National Institute of Stan- curity analysis of hash func- dards and Technology. FIPS tions and pseudorandom gen- PUB 180-1: Secure Hash erators. International Jour- Standard. National Insti- nal of Foundations of Com- tute for Standards and Tech- puter Science, 26(2):169–??, nology, Gaithersburg, MD February 2015. CODEN IFC- 20899-8900, USA, April 17, SEN. ISSN 0129-0541. 1995. URL http://www. REFERENCES 369

itl.nist.gov/fipspubs/ Neeb:1979:ISO fip180-1.htm. Supersedes FIPS PUB 180 1993 May 11. [Nee79] V. Neeb. Implementierung- stechniken fuer satzueber- Navathe:1985:PAI greifende operationen in relationalen datenbanken. Mas- [Nav85] Sham Navathe, editor. Pro- ter’s thesis, Technischen Uni- ceedings of ACM-SIGMOD versit¨at Carolo-Wilhelmina 1985 International Confer- zu Braunschweig, Braun- ence on Management of schweig, Germany, 1979. ?? Data, May 28–31, 1985, pp. LaMansion Hotel, Austin, Texas. ACM Press, New Ng:1979:ESS York, NY 10036, USA, 1985. [Ng79] Edward W. Ng, editor. Sym- ISBN 0-89791-160-1. LCCN bolic and Algebraic Com- QA 76.9 D3 I59 1985. putation: EUROSAM ’79, an International Sympo- Nakano:2011:AMI sium on Symbolic and Al- gebraic Manipulation, Mar- [NCFK11] Yuto Nakano, Carlos Cid, seille, France, June 1979, Kazuhide Fukushima, and volume 72 of Lecture Notes Shinsaku Kiyomoto. Anal- in Computer Science. Spring- ysis of message injection er-Verlag, Berlin, Germany / in stream cipher-based hash Heidelberg, Germany / Lon- functions. Lecture Notes in don, UK / etc., 1979. CS, 6715:498–513, 2011. CO- ISBN 0-387-09519-5. LCCN DEN LNCSD9. ISSN 0302- QA155.7.E4 I57 1979. 9743 (print), 1611-3349 (electronic). URL http://link. Nguyen:2006:MDH springer.com/content/pdf/ 10.1007/978-3-642-21554- [Ngu06] Quan Son Nguyen. Multi- 4_29. dimensional hash chains and application to micropayment Narayanan:2008:DAQ schemes. In Ytrehus [Ytr06], pages 218–228. ISBN 3-540- [NDMR08] Dushyanth Narayanan, Austin 35481-6. LCCN QA76.9.A25 Donnelly, Richard Mortier, I557 2005. and Antony Rowstron. De- Nishihara:1974:FTQ lay aware querying with Sea- weed. VLDB Journal: Very [NH74] S. Nishihara and H. Hagi- Large Data Bases, 17(2):315– wara. A full table quadratic 331, March 2008. CODEN search method eliminating VLDBFR. ISSN 1066-8888 secondary clustering. In- (print), 0949-877X (elec- ternational Journal of Com- tronic). puter and Information Sci- REFERENCES 370

ences, 3(2):123–128, June hacked/; http://www. 1974. CODEN IJCIAH. theregister.co.uk/2017/ ISSN 0091-7036. 12/06/nicehash_diced_up_ Nievergelt:1984:GFA by_hackers_thousands_of_ bitcoin_pilfered/; http: [NHS84] J. Nievergelt, H. Hinter- //www.wsj.com/articles/ berger, and K. C. Sevcik. millions-may-be-missing- The grid file: An adapt- in-bitcoin-heist-1512625176. able symmetric multikey file Niemeyer:1975:DV structure. ACM Transactions on Database Systems, 9(1): [Nie75] Gerhard Niemeyer. Dateior- 38–71, March 1984. CO- ganisation und -verarbeitung. DEN ATDSD3. ISSN 0362- Franz Vahlen, München, 5915 (print), 1557-4644 (elec- Germany, 1975. ISBN 3- tronic). 8006-0528-7. 258 pp. LCCN QA76 .N52. DM24.80. Nishihara:1983:RRT Nilli:1994:PHP [NI83] Seiichi Nishihara and Kat- suo Ikeda. Reducing the [Nil94] A. Nilli. Perfect hashing retrieval time of hashing and probability. Combina- method by using predic- torics, Probability and Com- tors. Communications of puting, 3(3):407–409, 1994. the Association for Comput- CODEN CPCOFG. ISSN ing Machinery, 26(12):1082– 0963-5483 (print), 1469-2163 1088, December 1983. CO- (electronic). DEN CACMA2. ISSN 0001- NIST:1993:FPS 0782 (print), 1557-7317 (electronic). [NIS93] NIST. FIPS PUB 180: Se- cure Hash Standard (SHS). Nichols:2017:NDH National Institute of Stan- [Nic17] Shaun Nichols. Nice- dards and Technology, Gaithers- Hash diced up by hack- burg, MD, USA, May 11, ers, thousands of Bitcoin 1993. ?? pp. pilfered. Mining outfit says NIST:2015:SSP its entire wallet gone, estimated $62m. The Regis- [NIS15] NIST. SHA-3 standard: ter, ??(??):??, December 6, Permutation-based hash and 2017. URL http://www. extendable-output functions. bbc.com/news/technology- FIPS PUB 202, National In- 42275523; http://www. stitute for Standards and bleepingcomputer.com/news/ Technology, Gaithersburg, security/largest-cryptocurrency- MD 20899-8900, USA, 2015. mining-market-nicehash- viii + 29 pp. REFERENCES 371

Nielsen:2016:SLF project for CS2: combining key data structures and [NK16] Jesper Puge Nielsen and Sven algorithms into an inte- Karlsson. A scalable lock- grated Web browser and free hash table with open search engine. SIGCSE Bul- addressing. SIGPLAN No- letin (ACM Special Inter- tices, 51(8):33:1–33:??, Au- est Group on Computer Sci- gust 2016. CODEN SIN- ence Education), 34(1):386– ODQ. ISSN 0362-1340 390, March 2002. CO- (print), 1523-2867 (print), DEN SIGSD3. ISSN 0097- 1558-1160 (electronic). 8418 (print), 2331-3927 (electronic). Inroads: paving the Nakayama:1988:HPJ way towards excellence in [NKT88] M. Nakayama, M. Kitsure- computing education. gawa, and M. Takagi. Hash- Nakaike:2010:LER partitioned join method using dynamic destaging strat- [NM10] Takuya Nakaike and Maged M. egy. In Bancilhon and Michael. Lock elision for DeWitt [BD88], page 468. read-only critical sections in ISBN 0-934613-75-3. LCCN Java. SIGPLAN Notices, QA76.9.D3 I559 1988. 45(6):269–278, June 2010. CODEN SINODQ. ISSN Nakajima:2002:PAP 0362-1340 (print), 1523- [NM02a] Junko Nakajima and Mit- 2867 (print), 1558-1160 (elec- suru Matsui. Performance tronic). analysis and parallel imple- Nanevski:2008:YDT mentation of dedicated hash functions. Lecture Notes [NMS+08] Aleksandar Nanevski, Greg in CS, 2332:165–??, 2002. Morrisett, Avraham Shin- CODEN LNCSD9. ISSN nar, Paul Govereau, and 0302-9743 (print), 1611- Lars Birkedal. Ynot: de- 3349 (electronic). URL pendent types for imperative http://link.springer-ny. programs. SIGPLAN No- com/link/service/series/ tices, 43(9):229–240, Septem- 0558/bibs/2332/23320165. ber 2008. CODEN SIN- htm; http://link.springer- ODQ. ISSN 0362-1340 ny.com/link/service/series/ (print), 1523-2867 (print), 0558/papers/2332/23320165. 1558-1160 (electronic). pdf. Ntantogian:2019:EPH Newhall:2002:CPC [NMX19] Christoforos Ntantogian, Ste- [NM02b] Tia Newhall and Lisa Mee- fanos Malliaros, and Chris- den. A comprehensive tos Xenakis. Evaluation of REFERENCES 372

password hashing schemes in Noltemeier:1982:IIE open source web platforms. Computers and Security,84 [Nol82b] Hartmut Noltemeier. In- (??):206–224, July 2019. CO- formatik III: Einfuehrung DEN CPSEDU. ISSN 0167- in Datenstrukturen.Carl 4048 (print), 1872-6208 (elec- Hanser, München, Germany, tronic). URL https:/ 1982. ISBN 3-446-13570-7. ?? /www.sciencedirect.com/ pp. science/article/pii/S0167404818308332. Negri:1991:DJN Naor:1990:SPS [NP91] M. Negri and G. Pelagatti. [NN90] Joseph Naor and Moni Distributive join: a new Naor. Small-bias probability algorithm for joining rela- spaces. efficient constructions tions. ACM Transactions and applications. In Pro- on Database Systems,16 ceedings of the 22nd Annual (4):655–669, December 1991. ACM Symposium on Theory CODEN ATDSD3. ISSN of Computing (May 14–16 0362-5915 (print), 1557-4644 1990: Baltimore, MD, USA), (electronic). pages 213–223. ACM Press, Nevelsteen:1999:SPU New York, NY 10036, USA, 1990. ISBN 0-89791-361-2. [NP99] W. Nevelsteen and B. Pre- LCCN ???? neel. Software performance of universal hash func- Narita:2012:LJH tions. Lecture Notes in [NNA12] Kazuyo Narita, Shinji Nakadai, CS, 1592:24–??, 1999. CO- and Takuya Araki. Landmark- DEN LNCSD9. ISSN 0302- Join: Hash-join based string 9743 (print), 1611-3349 (elec- similarity joins with edit tronic). distance constraints. Lec- Nguyen:2012:SOU ture Notes in CS, 7448: 180–191, 2012. CODEN [NR12] Long Hoang Nguyen and LNCSD9. ISSN 0302-9743 A. W. Roscoe. Short- (print), 1611-3349 (elec- output universal hash func- tronic). URL http://link. tions and their use in fast springer.com/chapter/10. and secure data authentica- 1007/978-3-642-32584-7_ tion. Lecture Notes in CS, 15/. 7549:326–345, 2012. CO- DEN LNCSD9. ISSN 0302- Noltemeier:1982:I 9743 (print), 1611-3349 (elec- [Nol82a] Hartmut Noltemeier. In- tronic). URL http://link. formatik. Carl Hanser, springer.com/chapter/10. München, Germany, 1982. 1007/978-3-642-34047-5_ ISBN 3-446-13570-7. ?? pp. 19/. REFERENCES 373

Newman:1990:PHG with confinement for real- time per-flow measurement. [NRW90] Ilan Newman, Prabhakar IEEE/ACM Transactions Ragde, and Avi Wigderson. on Networking, 24(5):3191– Perfect hashing, graph en- 3203, October 2016. CO- tropy, and circuit complex- DEN IEANEP. ISSN 1063- ity. In CTCP ’90 [CTC90], 6692 (print), 1558-2566 (elec- pages 91–99. ISBN 0-8186- tronic). 2072-2 (paper), 0-8186-6072- 4 (microfiche), 0-8186-9072-0 Naito:2006:ICS

(case). LCCN QA267.7 .S75 + 1990. [NSS 06] Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Nielsen:1982:ALP Yajima, Noboru Kunihiro, [NS82] Mogens Nielsen and Erik Meineche and Kazuo Ohta. Im- Schmidt, editors. Automata, proved collision search for Languages, and Program- SHA-0. Lecture Notes in ming: Ninth Colloquium, CS, 4284:21–36, 2006. CO- Aarhus, Denmark, July 12– DEN LNCSD9. ISSN 0302- 16, 1982. Springer-Verlag, 9743 (print), 1611-3349 (elec- Berlin, Germany / Heidel- tronic). URL http://link. berg, Germany / London, springer.com/content/pdf/ UK / etc., 1982. ISBN 0-387- 10.1007/11935230_2.pdf. 11576-5. LCCN QA267.A1 Naor:2008:HIC L43 no.140. Neelima:2016:PHF [NSW08] Moni Naor, Gil Segev, and Udi Wieder. History- [NS16a] Arambam Neelima and Kh Man- independent cuckoo hashing. glem Singh. Perceptual In Aceto et al. [ADG+08], hash function based on pages 631–642. CODEN scale-invariant feature trans- LNCSD9. ISBN 3-540- form and singular value de- 70574-0 (softcover). LCCN composition. The Com- ???? URL http://link. puter Journal, 59(9):1275– springer.com/content/pdf/ 1281, September 2016. CO- 10.1007/978-3-540-70583- DEN CMPJA6. ISSN 3_51; http://www.wisdom. 0010-4620 (print), 1460-2067 weizmann.ac.il/~naor/PAPERS/ (electronic). URL http: cuckoo_hi_abs.html. //comjnl.oxfordjournals. Neven:2009:HFR org/content/59/9/1275. Nyang:2016:RCC [NSW09] Gregory Neven, Nigel P. Smart, and Bogdan Warin- [NS16b] DaeHun Nyang and DongOh schi. Hash function re- Shin. Recyclable counter quirements for Schnorr sig- REFERENCES 374

natures. Journal of Mathe- springer.com/chapter/10. matical Cryptology, 3(1):69– 1007/978-3-642-31448-3_ 87, 2009. CODEN ???? ISSN 16/. 1862-2976 (print), 1862-2984 (electronic). Naor:2007:NAP

Naor:2001:APH [NW07] Moni Naor and Udi Wieder. Novel architectures for P2P [NT01] Moni Naor and Vanessa applications: The continuous- Teague. Anti-persistence: discrete approach. ACM history independent data Transactions on Algorithms, structures. In ACM [ACM01], 3(3):34:1–34:??, August 2007. pages 492–501. ISBN 1- CODEN ???? ISSN 1549- 58113-349-9. LCCN QA76.6 6325 (print), 1549-6333 (elec- .A13 2001. URL http:/ tronic). /www.wisdom.weizmann.ac. il/%7Enaor/PAPERS/history. Nie:2013:CHB ps.gz. ACM order number 508010. [NXB13] Xuyun Nie, Zhaohu Xu, Ntarmos:2009:DHS and Johannes Buchmann. Cryptanalysis of hash-based [NTW09] N. Ntarmos, P. Triantaﬁllou, tamed transformation and and G. Weikum. Distributed minus signature scheme. Lec- hash sketches: Scalable, eﬃ- ture Notes in CS, 7932: cient, and accurate cardinal- 155–164, 2013. CODEN ity estimation for distributed LNCSD9. ISSN 0302-9743 multisets. ACM Transactions (print), 1611-3349 (elec- on Computer Systems, 27(1): tronic). URL http://link. 2:1–2:??, February 2009. CO- springer.com/chapter/10. DEN ACSYEC. ISSN 0734- 1007/978-3-642-38616-9_ 2071 (print), 1557-7333 (elec- 10/. tronic).

Nguyen:2012:LRS Norton:1985:PMO

[NTY12] Manh Ha Nguyen, Keisuke [NY85] R. M. Norton and D. P. Yea- Tanaka, and Kenji Yasunaga. ger. A probability model for Leakage-resilience of state- overﬂow suﬃciency in small less/stateful public-key en- hash tables. Communications cryption from hash proofs. of the Association for Com- Lecture Notes in CS, 7372: puting Machinery, 28(10): 208–222, 2012. CODEN 1068–1075, October 1985. LNCSD9. ISSN 0302-9743 CODEN CACMA2. ISSN (print), 1611-3349 (elec- 0001-0782 (print), 1557-7317 tronic). URL http://link. (electronic). REFERENCES 375

Naor:1989:UOW vs. hashmap. Java Report: The Source for Java Develop- [NY89a] M. Naor and M. Yung. Uni- ment, 3(??):??, August 1998. versal one-way hash func- CODEN JREPFI. ISSN tions and their cryptographic 1086-4660. applications. In ACM- Oligeri:2011:REA TOC’89 [ACM89c], pages 33–43. ISBN 0-89791-307-8. [OCDG11] Gabriele Oligeri, Stefano LCCN QA 76.6 A13 1989. Chessa, Roberto Di Pietro, Naor:1989:UOH and Gaetano Giunta. Robust and eﬃcient authentication [NY89b] Moni Naor and Moti Yung. of video stream broadcasting. Universal one-way hash func- ACM Transactions on Infor- tions and their cryptographic mation and System Security, applications. In Proceedings 14(1):5:1–5:??, May 2011. of the Twenty First Annual CODEN ATISBQ. ISSN ACM Symposium on Theory 1094-9224 (print), 1557-7406 of Computing. (May 15–17 (electronic). 1989: Seattle, WA, USA), pages 33–43. ACM Press, Anonymous:1989:DQO New York, NY 10036, USA, [ODB89] Database Query Optimiza- 1989. ISBN 0-89791-307-8. tion: Proceedings of the LCCN QA 76.6 A13 1989. ODBF Workshop, Beaver- Nyberg:1996:FAH ton, OR. Oregon Graduate Center, Portland, OR, USA, [Nyb96] K. Nyberg. Fast accumulated 1989. ISBN ?? LCCN ?? hashing. Lecture Notes in Technical Report CS/E 89- CS, 1039:83–??, 1996. CO- 005. DEN LNCSD9. ISSN 0302- Olagunju:1994:DPH 9743 (print), 1611-3349 (electronic). [OG94a] Amos Olagunju and Rashaunda Gourdine. A dynamic per- Ouksel:1989:CML fect hashing algorithm using [OA89] M. Ouksel and J. AbdulGhaf- prime numbers. Journal of far. Concurrency in mul- the Elisha Mitchell Scientiﬁc tidimensional linear hashing. Society, 110(2):68–??, Sum- In Litwin and Schek [LS89], mer 1994. CODEN JEMSA5. page ?? ISBN 0-387-51295- ISSN 0013-6220. 0. LCCN QA76.9.D3 F671 Olagunju:1994:ILS 1989. [OG94b] Amos Olagunju and Rashaunda Oaks:1998:BSH Gourdine. Innovative least [Oak98] Scott Oaks. The burden of squares algorithms for per- synchronization: Hashtable fect hashing. Journal of the REFERENCES 376

Elisha Mitchell Scientiﬁc So- algorithms for cube and ciety, 110(2):76–??, Summer ring connected multicom- 1994. CODEN JEMSA5. puters. IEEE Transac- ISSN 0013-6220. tions on Knowledge and Data Ordonez:2014:BVS Engineering, 1(3):329–343, September 1, 1989. CO- [OGAB14] Carlos Ordonez, Carlos DEN ITKEEH. ISSN 1041- Garcia-Alvarado, and Veer- 4347. See also September abhadaran Baladandayutha- 1991 TKDE. pani. Bayesian variable Omicinski:1991:AHJ selection in linear regression in one pass for large [OL91] E. Omicinski and E. T. Lin. datasets. ACM Transac- The adaptive-hash join algo- tions on Knowledge Discov- rithm for a hypercube mul- ery from Data (TKDD), 9(1): ticomputer. Technical re- 3:1–3:??, August 2014. CO- port, School of Information DEN ???? ISSN 1556-4681 and Computer Science, Geor- (print), 1556-472X (elec- gia Institute of Technology, tronic). 1991. 30 pp. Oberschelp:1980:IID Omiecinski:1992:AHJ [OL92] E. Omiecinski and E. T. Lin. [OK80] W. Oberschelp and H. Klocke. The adaptive-hash join algo- Informatik III (datenstruk- rithm for a hypercube mul- turen). Technical report, ticomputer. IEEE Transac- ????, Aachen, Germany, tions on Parallel and Dis- 1980. ?? pp. tributed Systems, 3(3):334– Okamoto:1988:DMS 349, May 1, 1992. CO- DEN ITDSEO. ISSN 1045- [Oka88] Tatsuaki Okamoto. Digi- 9219 (print), 1558-2183 (elec- tal multisignature scheme us- tronic). ing bijective public-key cryptosystems. ACM Trans- Ollmert:1989:DD actions on Computer Sys- [Oll89] Hans Joachim Ollmert. Daten- tems, 6(4):432–441, Novem- strukturen und Datenorgani- ber 1988. CODEN AC- sationen. R. Oldenbourg Ver- SYEC. ISSN 0734-2071 lag, Munich, Germany and (print), 1557-7333 (elec- Vienna, Austria, 1989. ISBN tronic). 3-486-20667-2. ?? pp. Omiecinski:1989:HBI Olsen:1969:RRF [OL89] Edward R. Omiecinski and [Ols69] Charles A. Olsen. Random Eileen Tien Lin. Hash- access ﬁle organization for in- based and index-based join directly accessed records. In REFERENCES 377

?? [??69], pages 539–549. Omiecinski:1991:PAL LCCN ?? Discusses practical considerations in the design [Omi91] E. Omiecinski. Perfor- of external scatter tables. mance analysis of a load balancing hash-jpoin algo- Omiecinski:1988:CSS rithm for a shared memory multiprocessor. In Lohman [Omi88] Edward Omiecinski. Concur- et al. [LSC91], pages 375– rent storage structure conver- 385. ISBN 1-55860-150-3. sion: From B+ tree to lin- LCCN QA 76.9 D3 I61 1991. ear hash file. In ICDE’88 [ICD88], pages 589–596. Omar:2012:HEC ISBN 0-8186-0827-7 (paper- [OOB12] Sami Omar, Raouf Ouni, back), 0-8186-8827-0 (hard- and Saber Bouanani. Hash- cover), 0-8186-4827-9 (mi- ing with elliptic curve L- crofiche). LCCN QA76.9.D3 functions. Lecture Notes in I5582 1988. IEEE Service CS, 7369:196–207, 2012. CO- Cent. Piscataway, NJ, USA. DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Omiecinski:1989:CFC tronic). URL http://link. springer.com/chapter/10. [Omi89a] Edward Omiecinski. Con- 1007/978-3-642-31662-3_ current file conversion be- 14/. tween B+-tree and linear hash files. Information sys- Omar:2017:DHS tem, 14(5):371–383, 1989. CODEN INSYD6. ISSN [OOB17] Yasser M. K. Omar, Hoda 0306-4379 (print), 1873-6076 Osama, and Amr Badr. Dou- (electronic). ble hashing sort algorithm. Computing in Science and Omiecinski:1989:HJP Engineering, 19(2):63–69, March/April 2017. CODEN [Omi89b] Edward R. Omiecinski. Heuris- CSENFA. ISSN 1521-9615 tics for join processing us- (print), 1558-366X (elec- ing nonclustered indexes. tronic). URL https://www. IEEE Transactions on Soft- computer.org/csdl/mags/ ware Engineering, 15(1):18– cs/2017/02/mcs2017020063- 25, January 1989. CO- abs.html. DEN IESEDJ. ISSN 0098- Odaira:2010:ERT 5589 (print), 1939-3520 (electronic). URL http: [OOK+10] Rei Odaira, Kazunori Ogata, //ieeexplore.ieee.org/ Kiyokuni Kawachiya, Tamiya stamp/stamp.jsp?arnumber= Onodera, and Toshio Nakatani. 21722. Efficient runtime tracking of REFERENCES 378

allocation sites in Java. SIG- LCCN QA76.9.D3 A15 1983. PLAN Notices, 45(7):109– US$25.00. 120, July 2010. CODEN Ouskel:1983:SMM SINODQ. ISSN 0362-1340 (print), 1523-2867 (print), [OS83b] M. Ouskel and P. Scheuer- 1558-1160 (electronic). mann. Storage mappings for multidimensional lin- Ostlin:2003:UHC ear dynamic hashing. In [OP03] Anna Ostlin and Rasmus ACM-PODS’83 [ACM83b], Pagh. Uniform hashing page 90. ISBN 0-89791-097-4. in constant time and linear LCCN QA76.9.D3 A15 1983. space. In ACM [ACM03a], US$25.00. pages 622–628. ISBN ???? Ouksel:1988:IDS LCCN QA75.5 .A22 2003. ACM order number 508030. [OS88] Mohamed Ouksel and Peter Scheuermann. Implicit data Orenstein:1983:DHF structures for linear hashing [Ore83] Jack A. Orenstein. A dy- schemes. Information Pro- namic hash ﬁle for ran- cessing Letters, 29(4):183– dom and sequential access- 189, November 1988. CO- ing. In Schkolnick and DEN IFPLAT. ISSN 0020- Thanos [ST83a], pages 132– 0190 (print), 1872-6119 (elec- 141. CODEN VLDBDP. tronic). Olken:1990:RSH Ostafe:2010:PNH [ORX90] Frank Olken, Doron Rotem, [OS10] Alina Ostafe and Igor E. and Ping Xu. Random sam- Shparlinski. Pseudorandom pling from hash ﬁles. SIG- numbers and hash functions MOD Record (ACM Spe- from iterations of multivari- cial Interest Group on Man- ate polynomials. Cryptogra- agement of Data), 19(2): phy and Communications,2 375–386, June 1990. CO- (1):49–67, April 2010. CO- DEN SRECD8. ISSN 0163- DEN ???? ISSN 1936- 5808 (print), 1943-5835 (elec- 2447 (print), 1936-2455 (electronic). tronic). URL http://link. Ouksel:1983:SMM springer.com/accesspage/ article/10.1007/s12095- [OS83a] Mohamed Ouksel and Pe- 009-0016-0. ter Scheuermann. Storage Omar:2014:FHF mappings for multidimensional linear dynamic hash- [OS14] Sami Omar and Houssem ing. In Ouksel & Scheuer- Sabri. Fast hash func- mann [ACM83b], pages 90– tions and convolution prod- 105. ISBN 0-89791-097-4. uct. Journal of Mathemati- REFERENCES 379

cal Cryptology, 8(2):169–187, Otken:1991:HF 2014. CODEN ???? ISSN 1862-2976 (print), 1862-2984 [Otk91] John Otken. Hashing func- (electronic). tions. Programmer’s Jour- nal, 9(3):69–??, May 1, 1991. Ou:2010:DIH ISSN 0747-5861. Ogawara:2011:DFP [OSR10] Yang Ou, Chul Sur, and Kyung Hyune Rhee. Dis- [OTKH11] Koichi Ogawara, Yasufumi criminative image hashing Tanabe, Ryo Kurazume, and based on region of inter- Tsutomu Hasegawa. Detect- est. Lecture Notes in CS, ing frequent patterns in video 5916:701–706, 2010. CO- using partly locality sensitive DEN LNCSD9. ISSN 0302- hashing. Lecture Notes in 9743 (print), 1611-3349 (elec- CS, 6468:287–296, 2011. CO- tronic). URL http://link. DEN LNCSD9. ISSN 0302- springer.com/content/pdf/ 9743 (print), 1611-3349 (elec- 10.1007/978-3-642-11301- tronic). URL http://link. 7_72. springer.com/content/pdf/ 10.1007/978-3-642-22822- Omiecinski:1989:HBJ 3_29. Otoo:1984:MFD [OT89] Edward Omiecinski and Eileen Tien. A hash- [Oto84] Ekow J. Otoo. A mapping based join algorithm for a function for the directory of a cube-connected parallel com- multidimensional extendible puter. Information Pro- hashing. In Dayal et al. cessing Letters, 30(5):269– [DSS84], pages 493–506. 275, March 13, 1989. CO- Otoo:1985:MDH DEN IFPLAT. ISSN 0020- 0190 (print), 1872-6119 (elec- [Oto85a] Ekow J. Otoo. A multidimen- tronic). sional digital hashing scheme for ﬁles with composite keys. Ou:1991:HSU In Navathe [Nav85], pages 214–229. ISBN 0-89791-160- [OT91] Seng Fat Ou and Alan L. 1. LCCN QA 76.9 D3 I59 Tharp. High storage utilisa- 1985. tion for single-probe retrieval Otoo:1985:SDI linear hashing. The Com- puter Journal, 34(5):455– [Oto85b] Ekow J. Otoo. Symmetric 468, October 1, 1991. CO- dynamic index maintenance DEN CMPJA6. ISSN 0010- scheme. In Proceedings — 4620 (print), 1460-2067 (elec- Foundations of Data Organi- tronic). zation., pages 283–296. Or- REFERENCES 380

ganizing Committee of the Ostrovsky:1994:IHSa Int Conference on Founda- tions of Data Organization, [OVY94a] R. Ostrovsky, R. Venkate- Jpn, 1985. Kyoto Sangyo san, and M. Yung. In- Univ. Computer Science Inst, teractive hashing simpliﬁes Kyoto, Jpn. zero-knowledge protocol design. Lecture Notes in CS, Otoo:1986:BME 765:267–273, 1994. CO- DEN LNCSD9. ISSN 0302- [Oto86] E. J. Otoo. Balanced 9743 (print), 1611-3349 (elec- multidimensional extendible tronic). hash tree. In ACM- PODS’86 [ACM86a], pages Ostrovsky:1994:IHSb 100–113. ISBN 0-89791-179- [OVY94b] R. Ostrovsky, R. Venkate- 2. LCCN QA76.9.D3 A296 san, and M. Yung. In- 1986. US$24.00. teractive hashing simpliﬁes Otoo:1988:LDG zero-knowledge protocol design. In Helleseth [Hel94], [Oto88a] Ekow J. Otoo. Linearizing page ?? ISBN 0-387- the directory growth in order 57600-2 (New York), 3-540- preserving extendible hash- 57600-2 (Berlin). ISSN 0302- ing. In ICDE’88 [ICD88], 9743 (print), 1611-3349 (elec- pages 580–588. ISBN 0- tronic). LCCN QA76.9.A25 8186-0827-7. LCCN ???? E964 1993. IEEE Service Cent. Piscat- ODonnell:2014:OLB away, NJ, USA. [OWZ14] Ryan O’Donnell, Yi Wu, and Otoo:1988:LBC Yuan Zhou. Optimal lower bounds for locality-sensitive [Oto88b] Ekow J. Otoo. Locally hashing (except when q is balanced compact trie hash- tiny). ACM Transactions on ing. In Beeri et al. [BDS88], Computation Theory, 6(1): page ?? ISBN 0-934613-95- 5:1–5:??, March 2014. CO- 8. LCCN QA76.9.D3 I5541 DEN ???? ISSN 1942- 1988. 3454 (print), 1942-3462 (elec- Ouksel:1983:OPD tronic). Oxborrow:1986:PFB [Ouk83] M. Ouksel. Order-preserving Dynamic Hashing Schemes [Oxb86] E. A. Oxborrow, editor. for Associative Searching in Proceedings of the Fifth Database Systems.PhDthe- British National Confer- sis, Northwestern University, ence on Databases (BN- Evanston, IL, USA, 1983. 212 COD 5): University of Kent pp. at Canterbury, 14–16 July, REFERENCES 381

1986. Cambridge University Pagh:1999:HDE Press, Cambridge, UK, 1986. ISBN 0-521-33260-5. LCCN [Pag99] R. Pagh. Hash and dis- QA76.9.D3 B75 1986. place: Eﬃcient evaluation of minimal perfect hash func- Pouchol:2009:HHS tions. Lecture Notes in CS, 1663:49–??, 1999. CO- [PACT09] Mickael Pouchol, Alexandre DEN LNCSD9. ISSN 0302- Ahmad, Benoit Crespin, and 9743 (print), 1611-3349 (elec- Olivier Terraz. A hierarchical tronic). hashing scheme for nearest neighbor search and broad- Pagh:2001:CPC phase collision detection. Journal of Graphics, GPU, [Pag01] Rasmus Pagh. On the cell and Game Tools, 14(2):45– probe complexity of member- 59, ???? 2009. CODEN ship and perfect hashing. In ???? ISSN 2151-237X. URL ACM [ACM01], pages 425– http://www.springerlink. 432. ISBN 1-58113-349-9. com/openurl.asp?genre= LCCN QA76.6 .A13 2001. article&issn=2151-237X& ACM order number 508010. volume=14&issue=2&spage= 45. Pagh:2006:CHU

Pramanik:1993:MDH [Pag06] Rasmus Pagh. Cuckoo hashing for undergradu- [PADHY93] Sakti Pramanik, Anasta- ates. Report, IT Univer- sia Analyti, Henry Davies, sity of Copenhagen, Copen- and Chou Hsiao-Yu. Multi- hagen, Denmark, March 27, directory hashing. Infor- 2006. URL http://www.it- mation system, 18(1):63– c.dk/people/pagh/papers/ 74, January 1993. CO- cuckoo-undergrad.pdf. DEN INSYD6. ISSN 0306- 4379 (print), 1873-6076 (elec- Pagh:2018:CLS tronic). [Pag18] Rasmus Pagh. CoveringLSH: Pagli:1985:SAH Locality-sensitive hashing without false negatives. ACM [Pag85] Linda Pagli. Self-adjusting Transactions on Algorithms, hash tables. Information 14(3):29:1–29:??, July 2018. Processing Letters, 21(1): CODEN ???? ISSN 1549- 23–25, July 1985. CO- 6325 (print), 1549-6333 (elec- DEN IFPLAT. ISSN 0020- tronic). URL https://dl. 0190 (print), 1872-6119 (elec- acm.org/ft_gateway.cfm? tronic). id=3155300. REFERENCES 382

Palem:1993:HEA This is a plagiarized article. See http://www.sics. [PAKR93] Krishna V. Palem, Yonathan se/europar95/plagiarism. Aumann, Zvi Kedem, and html for details. The original Michael Rabin. Highly effi- work from which the mate- cient asynchronous execution rial in this paper was stolen of large-grained parallel pro- is due to Thomas J. Sheffler grams. In Proceedings of the and Randal E. Bryant, CMU 3rd Workshop on Parallel Al- report MCU-CS-92-172. gorithms (WOPA), page ?? ????, ????, May 1993. Palma:2008:EPC Pal:1992:SPD [PAPV08] Wenceslao Palma, Reza Ak- barinia, Esther Pacitti, and [Pal92] Srimanta Pal. Search per- Patrick Valduriez. Efficient formance of double-linked co- processing of continuous join alesced hashing can not ex- queries using distributed ceed “bucketing”. Informa- hash tables. Lecture Notes in tion sciences, 65(1 / 2):123– CS, 5168:632–641, 2008. CO- 142, November 1, 1992. CO- DEN LNCSD9. ISSN 0302- DEN ISIJBC. ISSN 0020- 9743 (print), 1611-3349 (elec- 0255 (print), 1872-6291 (electronic). URL http://link. tronic). springer.com/content/pdf/ Panigrahy:2005:EHL 10.1007/978-3-540-85451- 7_67. [Pan05] Rina Panigrahy. Efficient hashing with lookups in Park:2018:OTP two memory accesses. In [Par18] Chang-Seop Park. One- ACM [ACM05], pages 830– time password based on hash 839. ISBN 0-89871-585-7. chain without shared secret LCCN QA76.6 A184p 2005. and re-registration. Com- URL http://dl.acm.org/ puters and Security, 75(??): citation.cfm?id=1070432. 138–146, June 2018. CO- Papadopoulos:1994:NHA DEN CPSEDU. ISSN 0167- [Pap94] Constantinos V. Papadopou- 4048 (print), 1872-6208 (elec- los. A new hashing algo- tronic). URL https:/ rithm for parallel processors. /www.sciencedirect.com/ Parallel Algorithms and Ap- science/article/pii/S0167404818301391. plications, 4(3–4):223–237, Paterson:1990:ALP November 1994. CODEN PAAPEC. ISSN 1063- [Pat90] Michael S. Paterson, editor. 7192. URL http://www. Automata, Languages, and informaworld.com/smpp/ Programming: 17th Inter- content~content=a777314733. national Colloquium, War- REFERENCES 383

wick University, England, ISSN 0164-0925 (print), July 16–20, 1990: Proceed- 1558-4593 (electronic). ings. Springer-Verlag, Berlin, Germany / Heidelberg, Ger- Purdom:1985:AA many / London, UK / etc., [PB85] Paul Walton Purdom, Jr. and 1990. ISBN 0-387-52826-1 Cynthia A. Brown. The (New York), 3-540-52826-1 Analysis of Algorithms.Holt, (Berlin). LCCN QA267.A1 Rinehart, and Winston, New L43 no.443. York, NY, USA, 1985. ISBN Patarin:1994:HFA 0-03-072044-3. xv + 540 pp. LCCN QA76.6 .P86 1985. [Pat94] J. Patarin. How to ﬁnd US$33.95. Chapter 4 dis- and avoid collisions for the cusses random hashing. knapsack hash function. In Helleseth [Hel94], pages 305– Prokopec:2012:CTE 317. ISBN 0-387-57600- [PBBO12] Aleksandar Prokopec, Nathan Grasso 2 (New York), 3-540-57600- Bronson, Phil Bagwell, and 2 (Berlin). ISSN 0302- Martin Odersky. Concur- 9743 (print), 1611-3349 (elec- rent tries with eﬃcient non- tronic). LCCN QA76.9.A25 blocking snapshots. SIG- E964 1993. PLAN Notices, 47(8):151– Patarin:1995:CID 160, August 2012. CO- DEN SINODQ. ISSN [Pat95] J. Patarin. Collisions and 0362-1340 (print), 1523-2867 inversions for Damgaard’s (print), 1558-1160 (elec- whole hash function. In tronic). PPOPP ’12 confer- Pieprzyk and Safavi-Naini ence proceedings. [PSN95], pages 307–321. ISBN 3-540-59339-X. ISSN Preneel:1997:CHF 0302-9743 (print), 1611- [PBD97] Bart Preneel, Antoon Bosse- 3349 (electronic). LCCN laers, and Hans Dobbertin. QA76.9.A25 I555 1994. The cryptographic hash function RIPEMD-160. Cryp- Papadimitriou:1980:PBH toBytes, 3(2):9–14, Autumn [PB80] Christos H. Papadimitriou 1997. URL ftp://ftp. and Philip A. Bernstein. On rsa.com/pub/cryptobytes/ the performance of balanced crypto3n2.pdf. hashing functions when the Pepper:1995:RSH keys are not equiprobable. ACM Transactions on Pro- [PBDD95] P. Pepper, R. Betschko, gramming Languages and S. Dick, and K. Didrich. Systems, 2(1):77–89, January Realizing sets by hash ta- 1980. CODEN ATPSDT. bles. Lecture Notes in CS, REFERENCES 384

1009:58–??, 1995. CO- Pang:1993:PPHb DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [PCL93b] HweeHwa H. Pang, Michael J. tronic). Carey, and Miron Livny. Partially preemptible hash Preneel:1989:CHB joins. In SIGMOD Record [PBGV89] Bart Preneel, Antoon Bosse- (ACM Special Interest Group laers, Rene Govaerts, and on Management of Data) Joos Vandewalle. Collision- [BJ93], pages 59–68. CO- free hashfunctions based on DEN SRECD8. ISBN 0- blockcipher algorithms. In 89791-592-5. ISSN 0163- Proceedings 1989 Interna- 5808 (print), 1943-5835 (elec- tional Carnahan Conference tronic). URL http://www. on Security Technology (Oct acm.org/pubs/articles/ 3–5 1989: Zurich, Switzer- proceedings/mod/170035/ land), pages 203–210. IEEE p59-pang/p59-pang.pdf; Computer Society Press, http://www.acm.org/pubs/ 1109 Spring Street, Suite 300, citations/proceedings/ Silver Spring, MD 20910, mod/170035/p59-pang/. USA, 1989. IEEE catalog Park:2015:NSH number 89CH2774-8. [PCM15] Yongjoo Park, Michael Ca- Park:1995:UPR farella, and Barzan Moza- [PCK95] U. K. Park, H. K. Choi, and fari. Neighbor-sensitive hash- T. G. Kim. Uniform parti- ing. Proceedings of the VLDB tioning of relations using his- Endowment, 9(3):144–155, togram equalization frame- November 2015. CODEN work: An eﬃcient parallel ???? ISSN 2150-8097. hash-based join. Information Patel:1994:AMH Processing Letters, 55(5): 283–??, September 15, 1995. [PCV94] Jignesh M. Patel, Michael J. CODEN IFPLAT. ISSN Carey, and Mary K. Ver- 0020-0190 (print), 1872-6119 non. Accurate modeling of (electronic). the hybrid hash join algorithm. ACM SIGMETRICS Pang:1993:PPHa Performance Evaluation Re- [PCL93a] H. Pang, M. Carey, and view, 22(1):56–66, May 1994. M. Livny. Partially pre- CODEN ???? ISSN 0163- emptible hash joins. Tech- 5999 (print), 1557-9484 (elec- nical Report CS TR 1144, tronic). University of Wisconsin– Park:1995:EHB Madison, Madison, WI, USA, 1993. ?? pp. PPHJ long ver- [PCY95] Jong Soo Park, Ming-Syan sion. Chen, and Philip S. Yu. REFERENCES 385

An effective hash-based al- hashing of variable length gorithm for mining associa- text strings. Communica- tion rules. SIGMOD Record tions of the Association for (ACM Special Interest Group Computing Machinery,34 on Management of Data),24 (11):120, November 1991. (2):175–186, May 1, 1995. CODEN CACMA2. ISSN CODEN SRECD8. ISSN 0001-0782 (print), 1557-7317 0163-5808 (print), 1943-5835 (electronic). Responds to (electronic). several comments [Dit91, Lit91, Sav91] on the author’s ACM:1991:PFI earlier paper [Pea90], and [PDI91] Proceedings of the First In- early work [Dit76]. ternational Conference on Parallel and Distributed In- Peiler:1982:ZRV formation Systems: Decem- [Pei82] M. Peiler. Zugriffsoperatio- ber 4–6, 1991, Fontainebleu nen auf Rdbm-verwaltungsdaten Hilton Resort, Miami Beach, — 1. Teil. Master’s Florida. IEEE Computer So- thesis, Technischen Uni- ciety Press, 1109 Spring versität Carolo-Wilhelmina Street, Suite 300, Silver zu Braunschweig, Braun- Spring, MD 20910, USA, schweig, Germany, 1982. ?? 1991. ISBN 0-8186-2295- pp. 4 (paperback), 0-8186-2296- 2 (microfiche), 0-8186-2297-0 Perry:1973:IME (hardcover). LCCN QA76.58 .I544 1991. [Per73] O. R. Perry. Indexing method employing hashing. Pearson:1990:FHV IBM Technical Disclosure [Pea90] Peter K. Pearson. Fast Bulletin, 16(3):694–697, Au- hashing of variable-length gust 1973. CODEN IBM- text strings. Communi- TAA. ISSN 0018-8689. cations of the Association Pescio:1996:AAM for Computing Machinery, 33(6):677–680, June 1990. [Pes96] Carlo Pescio. Algorithm al- CODEN CACMA2. ISSN ley: Minimal perfect hashing. 0001-0782 (print), 1557- Dr. Dobbs Journal, 21(7): 7317 (electronic). URL 101–102, 104, 116–117, July http://www.acm.org/pubs/ 1996. CODEN DDJOEB. toc/Abstracts/0001-0782/ ISSN 1044-789X. 78978.html. See [Dit76, Pujol:2012:LEC Dit91, Lit91, Pea91, Sav91]. [PES+12] Josep M. Pujol, Vijay Er- Pearson:1991:NFH ramilli, Georgos Siganos, [Pea91] Peter Pearson. Note on fast Xiaoyuan Yang, Nikolaos REFERENCES 386

Laoutaris, Parminder Chhabra, binatorics, Probability and and Pablo Rodriguez. The Computing, 22(3):455–476, little engine(s) that could: ???? 2013. CODEN CP- scaling online social net- COFG. ISSN 0963-5483 works. IEEE/ACM Trans- (print), 1469-2163 (elec- actions on Networking,20 tronic). (4):1162–1175, August 2012. CODEN IEANEP. ISSN Peyrin:2015:CAG 1063-6692 (print), 1558-2566 [Pey15] Thomas Peyrin. Collision (electronic). attack on Grindahl. Jour- Peterson:1957:ARA nal of Cryptology, 28(4):879– 898, October 2015. CO- [Pet57] W. W. Peterson. Ad- DEN JOCREQ. ISSN 0933- dressing for random-access 2790 (print), 1432-1378 (elec- storage. IBM Journal of tronic). URL http://link. Research and Development, springer.com/article/10. 1(2):130–146, April 1957. 1007/s00145-014-9186-9. CODEN IBMJAE. ISSN 0018-8646 (print), 2151- Pramanik:1985:DH 8556 (electronic). URL [PF85] S. Pramanik and F. Fotouhi. http://ieeexplore.ieee. Distributed hashing, March org/stamp/stamp.jsp?tp=& 1985. arnumber=5392733.First major paper dealing with the Pramanik:1988:OCR problem of searching in large [PF88] Sakti Pramanik and Far- ﬁles. Deﬁned open address- shad Fotouhi. Optimiz- ing in general, analyzed the ing the cost of relational performance of uniform hash- queries using partial-relation ing, and the behavior of lin- schemes. Information sys- ear open addressing with var- tem, 13(1):71–79, 1988. CO- ious bucket sizes. DEN INSYD6. ISSN 0306- Petersen:1983:AVV 4379 (print), 1873-6076 (electronic). [Pet83] D. Petersen. Auswahl eines verfahrens zur verwaltung Papadakis:2009:HBO des sekundaerspeichers der relationalen datenbankmas- [PFM+09] Harris Papadakis, Paraskevi chine (rdbm). Studienarbeit, Fragopoulou, Evangelos P. 1983. Markatos, Marios D. Dika- Petersson:2013:MDL iakos, and Alexandros Labrini- dis. Hash-based overlay [Pet13] Niclas Petersson. The max- partitioning in unstructured imum displacement for lin- peer-to-peer systems. Paral- ear probing hashing. Com- lel Processing Letters, 19(1): REFERENCES 387

57–71, March 2009. CODEN tions. In Seberry and Piep- PPLTEE. ISSN 0129-6264 rzyk [SP90], page ?? ISBN (print), 1793-642X (elec- 0-387-53000-2 (New York), 3- tronic). 540-53000-2 (Berlin). LCCN QA76.9.A25 A87 1990. Perrizo:1995:DDV Preneel:1991:CRH [PG95] W. Perrizo and V. N. R. Goli. Dynamic domain vector per- [PGV91] B. Preneel, R. Govaerts, and fect hash: a join method for J. Vandewalle. Collision re- dynamic memory allocations. sistant hash functions based Microcomputer Applications, on blockciphers. In Feigen- 14(3):93–??, 1995. CODEN baum [Fei91], page ?? ISBN MIAPEZ. ISSN 0820-0750. 0-387-55188-3 (New York), 3- 540-55188-3 (Berlin). LCCN Patil:2017:HHA QA76.9.A25 C79 1991. [PG17] Adarsh Patil and Ramaswamy Preneel:1992:CSH Govindarajan. HAShCache: Heterogeneity-aware shared [PGV92] B. Preneel, R. Govaerts, and DRAMCache for integrated J. Vandewalle. Cryptograph- heterogeneous systems. ACM ically secure hash functions: Transactions on Architec- an overview. In ????, page ?? ture and Code Optimization, ????, ????, 1992. Reference in 14(4):51:1–51:??, December [PS93, p. 186]. 2017. CODEN ???? ISSN 1544-3566 (print), 1544-3973 Prencel:1993:ATH (electronic). [PGV93a] B. Prencel, R. Govaerts, and Preneel:1990:ATH J. Vandewalle. An attack on two hash functions by [PGV90a] B. Preneel, R. Govaerts, and Zheng-Matsumoto-Imai. In J. Vandewalle. An attack Seberry and Zheng [SZ93], on two hash functions by pages 535–538. ISBN 0-387- Zheng–Matsumoto–Imai. In 57220-1 (New York), 3-540- Seberry and Pieprzyk [SP90], 57220-1 (Berlin). ISSN 0302- page ?? ISBN 0-387-53000- 9743 (print), 1611-3349 (elec- 2 (New York), 3-540-53000-2 tronic). LCCN QA76.9.A25 (Berlin). LCCN QA76.9.A25 A87 1992. A87 1990. Preneel:1993:ATH Preneel:1990:PMD [PGV93b] B. Preneel, R. Govaerts, [PGV90b] B. Preneel, R. Govaerts, and and J. Vandewalle. An J. Vandewalle. On the power attack on two hash func- of memory in the design of tions by Zheng-Matsumoto- collision resistant hash func- Imai. Lecture Notes in CS, REFERENCES 388

718:535–538, 1993. CO- tion authentication: Hash DEN LNCSD9. ISSN 0302- functions and digital signa- 9743 (print), 1611-3349 (elec- tures. In Computer se- tronic). curity and industrial cryptography: state of the art Preneel:1993:CSI and evolution: ESAT course [PGV93c] B. Preneel, R. Govaerts, and — May 1991, Leuven, Bel- J. Vandewalle, editors. Com- gium [PGV93c], pages 87– puter security and industrial 131. ISBN 0-387-57341-0, cryptography: state of the art 3-540-57341-0. ISSN 0302- and evolution: ESAT course 9743 (print), 1611-3349 (elec- — May 1991, Leuven, Bel- tronic). LCCN QA76.9.A25 gium, number 741 in Lec- C6373 1993. ture Notes in Computer Sci- Preneel:1993:PMD ence. Springer-Verlag, Berlin, Germany / Heidelberg, Ger- [PGV93g] B. Preneel, R. Govaerts, and many / London, UK / etc., J. Vandewalle. On the 1993. ISBN 0-387-57341-0, power of memory in the de- 3-540-57341-0. ISSN 0302- sign of collision resistant hash 9743 (print), 1611-3349 (elec- functions. In Seberry and tronic). LCCN QA76.9.A25 Zheng [SZ93], pages 105– C6373 1993. 121. ISBN 0-387-57220- 1 (New York), 3-540-57220- Preneel:1993:CHF 1 (Berlin). ISSN 0302- [PGV93d] B. Preneel, R. Govaerts, 9743 (print), 1611-3349 (elec- and J. Vandewalle. Crypto- tronic). LCCN QA76.9.A25 graphic hash functions. In A87 1992. Wolfowicz [Wol93a], pages Preneel:1994:HFB 161–171. [PGV94] Bart Preneel, Rene Govaerts, Preneel:1993:HFB and Joos Vandewalle. Hash [PGV93e] B. Preneel, R. Govaerts, and functions based on block J. Vandewalle. Hash func- ciphers: a synthetic ap- tions based on block ciphers: proach. Lecture Notes in a synthetic approach. In CS, 773:368–378, 1994. CO- Stinson [Sti93], pages 368– DEN LNCSD9. ISSN 0302- 378. ISBN 0-387-57766-1 9743 (print), 1611-3349 (elec- (New York), 3-540-57766-1 tronic). (Berlin). LCCN QA76.9.A25 Pawson:1973:CHT C79 1993. Preneel:1993:IAH [PH73] A. J. D. Pawson and F. R. A. Hopgood. Correspondence: [PGV93f] B. Preneel, R. Govaerts, and Hashing techniques for ta- J. Vandewalle. Informa- ble searching. The Com- REFERENCES 389

puter Journal, 16(3):285, Au- Pippenger:1979:ACT gust 1973. CODEN CM- PJA6. ISSN 0010-4620 [Pip79] Nicholas Pippenger. On the (print), 1460-2067 (elec- application of coding theory tronic). URL http:// to hashing. IBM Journal of www3.oup.co.uk/computer_ Research and Development, journal/hdb/Volume_16/ 23(2):225–226, March 1979. Issue_03/tiff/285.tif.See CODEN IBMJAE. ISSN [HD72]. 0018-8646 (print), 2151-8556 (electronic). Paul:2012:NPB Pippolini:1994:JIH

[PHG12] Souradyuti Paul, Ekawat [Pip94] F. Pippolini. Join indexes Homsirikamol, and Kris Gaj. and hash algorithms: Two A novel permutation-based methods for join process- hash mode of operation ing. In Anonymous [Ano94], FP and the hash function pages 9–18. SAMOSA. Lecture Notes in Pittel:1987:PAC CS, 7668:509–527, 2012. CO- DEN LNCSD9. ISSN 0302- [Pit87] B. Pittel. On probabilis- 9743 (print), 1611-3349 (elec- tic analysis of a coalesced tronic). URL http://link. hashing algorithm. An- springer.com/content/pdf/ nals of Probability, 15(3): 10.1007/978-3-642-34931- 1180–1202, July 1987. CO- 7_29. DEN APBYAE. ISSN 0091-1798 (print), 2168-894X Park:2001:VNH (electronic). URL http:// projecteuclid.org/euclid. [PHL01] Nan Kyoung Park, Joon Ho aop/1176992090. Hwang, and Pil Joong Lee. Piwowarski:1985:CBS HAS-V: a new hash function with variable output [Piw85] Marek Piwowarski. Com- length. Lecture Notes in ments on batched search- CS, 2012:202–??, 2001. CO- ing of sequential and tree- DEN LNCSD9. ISSN structured ﬁles. ACM Trans- 0302-9743 (print), 1611- actions on Database Systems, 3349 (electronic). URL 10(2):285–287, June 1985. http://link.springer-ny. CODEN ATDSD3. ISSN com/link/service/series/ 0362-5915 (print), 1557- 0558/bibs/2012/20120202. 4644 (electronic). URL htm; http://link.springer- http://www.acm.org/pubs/ ny.com/link/service/series/ articles/journals/tods/ 0558/papers/2012/20120202. 1985-10-2/p285-piwowarski/ pdf. p285-piwowarski.pdf; REFERENCES 390

http://www.acm.org/pubs/ number 88CH2603-9). Pis- citations/journals/tods/ cataway, NJ, USA. 1985-10-2/p285-piwowarski/ ; http://www.acm.org/ Pflug:1987:LPN pubs/toc/Abstracts/tods/ [PK87] Georg Ch. Pflug and Hans W. 214294.html. See [SG76b, Kessler. Linear probing with BG82]. a nonuniform address dis- Panneerselvam:1990:RSA tribution. Journal of the Association for Computing [PJBM90] G. Panneerselvam, G. A. Machinery, 34(2):397–410, Jullien, S. Bandyopadhyay, April 1987. CODEN JA- and W. C. Miller. Re- COAH. ISSN 0004-5411 configurable systolic archi- (print), 1557-735X (elec- tectures for hashing. In tronic). Proceedings — Parbase-90 Plachy:1989:PIC International Conference on Databases, Parallel Architec- [PK89] Emily C. Plachy and Pe- tures, and Their Applica- ter M. Kogge, editors. Pro- tions (Mar 7–9 1990: Miami ceedings of the 1989 Interna- Beach, FL, USA), pages 543– tional Conference on Paral- ?? IEEE Computer Soci- lel Processing, August 8–12, ety Press, 1109 Spring Street, 1989, volume 2. IEEE Com- Suite 300, Silver Spring, MD puter Society Press, 1109 20910, USA, 1990. IEEE cat- Spring Street, Suite 300, Sil- alog number 90CH2728-4. ver Spring, MD 20910, USA, Panneerselvam:1988:NAS 1989. ISBN 0-271-00686-2. LCCN QA76.6 .I548 1989. [PJM88] G. Panneerselvam, G. A. Three volumes. Jullien, and W. C. Miller. Popic:2018:FMB New architectures for systolic hashing. In PROCEED- [PKSB18] Victoria Popic, Volodymyr INGS — INTERNATIONAL Kuleshov, Michael Snyder, CONFERENCE ON SYS- and Serafim Batzoglou. Fast TOLIC ARRAYS (May 25– metagenomic binning via 27 1988: San Diego, CA, hashing and Bayesian clus- USA), pages 73–82. IEEE tering. Journal of Com- Computer Society Press, putational Biology, 25(7): 1109 Spring Street, Suite 300, 677–688, July 2018. CO- Silver Spring, MD 20910, DEN JCOBEM. ISSN 1066- USA, 1988. ISBN 0-8186- 5277 (print), 1557-8666 (elec- 8860-2. LCCN QA76.5 .I546 tronic). URL https://www. 1988 Sci-Eng. Available from liebertpub.com/doi/abs/ IEEE Service Cent (catalog 10.1089/cmb.2017.0250; REFERENCES 391

https://www.liebertpub. Jooseok Song. Secure dy- com/doi/pdf/10.1089/cmb. namic network reprogram- 2017.0250. ming using supplementary Pineda:2009:UOD hash in wireless sensor networks. Lecture Notes in CS, [PKW09] Gibran Fuentes Pineda, 4611:653–662, 2007. CO- Hisashi Koga, and Toshinori DEN LNCSD9. ISSN 0302- Watanabe. Unsupervised ob- 9743 (print), 1611-3349 (elec- ject discovery from images tronic). URL http://link. by mining local features us- springer.com/content/pdf/ ing hashing. Lecture Notes in 10.1007/978-3-540-73549- CS, 5856:978–985, 2009. CO- 6_64. DEN LNCSD9. ISSN 0302- Poblete:1989:LCF 9743 (print), 1611-3349 (electronic). URL http://link. [PM89] Patricio V. Poblete and springer.com/content/pdf/ J. Ian Munro. Last-come- 10.1007/978-3-642-10268- first-served hashing. Jour- 4_114. nal of Algorithms, 10(2):228– Periasamy:2021:EHF 248, June 1, 1989. CO- DEN JOALDV. ISSN 0196- [PL21] J. K. Periasamy and B. Latha. 6774 (print), 1090-2678 (elec- Efficient hash function-based tronic). duplication detection algorithm for data deduplication Petrucci:2020:ISS deduction and reduction. [PNPC20] Enrico Petrucci, Laurent Concurrency and Computa- Noé, Cinzia Pizzi, and Mat- tion: Practice and Experi- teo Comin. Iterative spaced ence, 33(3):e5213:1–e5213:??, seed hashing: Closing the February 10, 2021. CO- gap between spaced seed DEN CCPEBO. ISSN 1532- hashing and k-mer hash- 0626 (print), 1532-0634 (elec- ing. Journal of Compu- tronic). tational Biology, 27(2):223– Plauger:1998:SCCk 233, February 2020. CO- DEN JCOBEM. ISSN 1066- [Pla98] P. J. Plauger. Stan- 5277 (print), 1557-8666 (elec- dard C/C++: Hash tables. tronic). URL https://www. C/C++ Users Journal,16 liebertpub.com/doi/abs/ (11):10–??, November 1998. 10.1089/cmb.2019.0298; CODEN CCUJEX. ISSN https://www.liebertpub. 1075-2838. com/doi/pdf/10.1089/cmb. Park:2007:SDN 2019.0298. Poblete:1986:AFT [PLKS07] Kwangkyu Park, JongHyup Lee, Taekyoung Kwon, and [Pob86] Patricio V. Poblete. Approx- REFERENCES 392

imating functions by their /www.sciencedirect.com/ Poisson transform. Informa- science/article/pii/S0164121215001466. tion Processing Letters,23 (3):127–130, October 1986. Pagh:2007:LPC CODEN IFPLAT. ISSN [PPR07] Anna Pagh, Rasmus Pagh, 0020-0190 (print), 1872-6119 and Milan Ruzic. Linear (electronic). probing with constant inde- Ponder:1987:AHA pendence. In ACM [ACM07], pages 318–327. ISBN 1- [Pon87] Carl D. Ponder. Applica- 59593-631-9. LCCN ???? tions of hashing in algebraic Pagh:2009:LPC manipulation (an annotated bibliography). SIGSAM Bul- [PPR09] Anna Pagh, Rasmus Pagh, letin (ACM Special Interest andMilanRuˇzi´c. Linear Group on Symbolic and Al- probing with constant inde- gebraic Manipulation), 21(4): pendence. SIAM Journal 10–13, November 1987. CO- on Computing, 39(3):1107– DEN SIGSBZ. ISSN 0163- 1120, ???? 2009. CO- 5824 (print), 1557-9492 (elec- DEN SMJCAT. ISSN 0097- tronic). 5397 (print), 1095-7111 (electronic). Pagh:2008:UHC Panwar:2021:FES [PP08] Anna Pagh and Rasmus Pagh. Uniform hashing [PPS21] Kirtee Panwar, Ravindra Ku- in constant time and op- mar Purwar, and Garima timal space. SIAM Jour- Srivastava. A fast en- nal on Computing, 38(1): cryption scheme suitable 85–96, ???? 2008. CO- for video surveillance ap- DEN SMJCAT. ISSN 0097- plications using SHA-256 5397 (print), 1095-7111 (elec- hash function and 1D sine– tronic). sine chaotic map. Inter- national Journal of Image Pereira:2016:SHB and Graphics (IJIG), 21(02): [PPB16] GeovandroC.C.F.Pereira, ??, April 2021. ISSN 0219- Cassius Puodzius, and Paulo 4678. URL https://www. S. L. M. Barreto. Shorter worldscientific.com/doi/ hash-based signatures. The 10.1142/S0219467821500224. Journal of Systems and Pieprzyk:1998:RSF Software, 116(??):95–100, June 2016. CODEN JS- [PQ98] Josef Pieprzyk and Cheng Xin SODM. ISSN 0164-1212 Qu. Rotation-symmetric (print), 1873-1228 (elec- functions and fast hash- tronic). URL http:/ ing. Lecture Notes in CS, REFERENCES 393

1438:169–??, 1998. CO- ming Friche Rodler. Cuckoo DEN LNCSD9. ISSN hashing. Journal of Algo- 0302-9743 (print), 1611- rithms, 51(2):122–144, May 3349 (electronic). URL 2004. CODEN JOALDV. http://link.springer-ny. ISSN 0196-6774 (print), com/link/service/series/ 1090-2678 (electronic). URL 0558/bibs/1438/14380169. http://www.sciencedirect. htm; http://link.springer- com/science/article/pii/ ny.com/link/service/series/ S0196677403001925. 0558/papers/1438/14380169. Preneel:1993:ADC pdf. [Pre93] B. Preneel. Analysis and Pieprzyk:1999:RSF Design of Cryptographic [PQ99] J. Pieprzyk and Ch. Xin Hash Functions.Thesis Qu. Rotation-symmetric (Ph.D.), Katholieke Univer- functions and fast hashing. siteit Leuven, Leuven, Bel- J.UCS: Journal of Universal gium, January 1993. 355 Computer Science, 5(1):20– pp. URL http://wwwlib. 31, January 28, 1999. CO- umi.com/dissertations/ DEN ???? ISSN 0948-6968. fullcit/f64276. URL http://www.jucs. Preneel:1994:DPD org/jucs_5_1/rotation_ symmetric_functions_and. [Pre94a] B. Preneel. Design principles for dedicated hash functions. Pagh:2001:CH In Anderson [And94], pages 71–82. ISBN 0-387-58108-1, [PR01] Rasmus Pagh and Flem- 3-540-58108-1. ISSN 0302- ming Friche Rodler. Cuckoo 9743 (print), 1611-3349 (elec- hashing. Lecture Notes in tronic). LCCN QA76.9.A25 CS, 2161:121–133, 2001. CO- C36 1993. DEN LNCSD9. ISBN 3- 540-42493-8. ISSN 0302- Preneel:1994:CHF 9743 (print), 1611-3349 [Pre94b] Bart Preneel. Cryptographic (electronic). URL http: hash functions. Eur. Trans. //link.springer-ny.com/ Telecommun. Relat. Tech- link/service/series/0558/ nol., 5(4):431–448, 1994. CO- bibs/2161/21610121.htm; DEN ETTTET. ISSN 1120- http://link.springer- 3862. ny.com/link/service/series/ 0558/papers/2161/21610121. Prenel:1994:CHF pdf. [Pre94c] B. Prenel. Cryptographic Pagh:2004:CH hash functions. Eur. Trans. Telecommun. Relat. Tech- [PR04] Rasmus Pagh and Flem- nol., 5(4):431–??, July 1, REFERENCES 394

1994. CODEN ETTTET. computing the subset par- ISSN 1120-3862. tial order. Information Pro- cessing Letters, 56(6):337– Preneel:1997:HFM 341, December 22, 1995. [Pre97a] B. Preneel. Hash func- CODEN IFPLAT. ISSN tions and MAC algorithms 0020-0190 (print), 1872-6119 based on block ciphers. Lec- (electronic). URL http: ture Notes in CS, 1355: //www.sciencedirect.com/ 270–??, 1997. CODEN science/article/pii/0020019095001654. LNCSD9. ISSN 0302-9743 Peyravian:1998:PHV (print), 1611-3349 (electronic). [PRK98] M. Peyravian, A. Roginsky, and A. Kshemkalyani. On Preneel:1997:MHF probabilities of hash value [Pre97b] B. Preneel. MACs and hash matches. Computers and Se- functions: State of the art. curity, 17(2):171–176, March Information Security Techni- 1998. CODEN CPSEDU. cal Report, 2(2):33–43, 1997. ISSN 0167-4048. CODEN ???? ISSN 1363- Pontarelli:2016:PDP 4127. [PRM16] S. Pontarelli, P. Reviriego, Preneel:1999:SCH and J. A. Maestro. Parallel d-pipeline: A cuckoo hashing [Pre99] B. Preneel. The state implementation for increased of cryptographic hash func- throughput. IEEE Transac- tions. Lecture Notes in CS, tions on Computers, 65(1): 1561:158–182, 1999. CO- 326–331, ???? 2016. CO- DEN LNCSD9. ISSN 0302- DEN ITCOB4. ISSN 0018- 9743 (print), 1611-3349 (elec- 9340 (print), 1557-9956 (electronic). tronic). Price:1971:TLT Provenzano:1989:HTM

[Pri71] C. E. Price. Table lookup [Pro89] Tom Provenzano. A hash techniques. ACM Com- table manager in C++. C puting Surveys, 3(2):49– Users Journal, 7(11):83–??, 64, June 1971. CODEN November 1989. ISSN 0898- CMSVAN. ISSN 0360- 9788. 0300 (print), 1557-7341 (electronic). Prodinger:1994:ACP

Pritchard:1995:SSQ [Pro94] Helmut Prodinger. An asymptotic comment on a pa- [Pri95] Paul Pritchard. A simple perbyA.AnalytiandS.Pra- sub-quadratic algorithm for manik: “Performance analy- REFERENCES 395

sis of a main memory multi- Pieprzyk:1993:DHA directory hashing technique” [Inform. Process. Lett. 45 [PS93] Josef Pieprzyk and Babak (1993), no. 4, 191–197; MR Sadeghiyan. Design of Hash- 93k:68026]. Information Pro- ing Algorithms, volume 756 cessing Letters, 49(6):327– of Lecture Notes in Com- 328, March 22, 1994. CO- puter Science. Springer-Ver- DEN IFPLAT. ISSN 0020- lag, Berlin, Germany / Hei- 0190 (print), 1872-6119 (elec- delberg, Germany / London, tronic). UK / etc., 1993. CODEN LNCSD9. ISBN 3-540-57500- Prokopec:2018:CTC 6 (Berlin), 0-387-57500-6 (New York). ISSN 0302- [Pro18] Aleksandar Prokopec. Cache- 9743 (print), 1611-3349 (elec- tries: concurrent lock-free tronic). xiii + 194 pp. LCCN hash tries with constant-time QA76.9.H36 P53 1993. URL operations. SIGPLAN No- http://link.springer-ny. tices, 53(1):137–151, Jan- com/link/service/series/ uary 2018. CODEN SIN- 0558/tocs/t0756.htm; ODQ. ISSN 0362-1340 http://www.springerlink. (print), 1523-2867 (print), com/openurl.asp?genre= 1558-1160 (electronic). issue&issn=0302-9743&volume= Paiva:2015:ASS 756. Pavlou:2008:FAD [PRRR15] Jo˜ao Paiva, Pedro Ruivo, Paolo Romano, and Lu´ıs Ro- [PS08] Kyriacos E. Pavlou and drigues. AutoPlacer: Scal- Richard T. Snodgrass. Foren- able self-tuning data place- sic analysis of database tam- ment in distributed key-value pering. ACM Transactions stores. ACM Transactions on Database Systems, 33(4): on Autonomous and Adaptive 30:1–30:??, November 2008. Systems (TAAS), 9(4):19:1– CODEN ATDSD3. ISSN 19:??, January 2015. CO- 0362-5915 (print), 1557-4644 DEN ???? ISSN 1556- (electronic). 4665 (print), 1556-4703 (electronic). Porat:2012:CHV Peyravian:1999:HBE [PS12] E. Porat and B. Shalem. A cuckoo hashing variant with [PRZ99] M. Peyravian, A. Roginsky, improved memory utilization and N. Zunic. Hash-based en- and insertion time. In Storer cryption system. Computers and Marcellin [SM12], pages and Security, 18(4):345–350, 347–356. ISBN 1-4673-0715- 1999. CODEN CPSEDU. 7 (paperback). ISSN 1068- ISSN 0167-4048. 0314. LCCN ???? URL REFERENCES 396

http://ieeexplore.ieee. ber 2009. CODEN ???? ISSN org/stamp/stamp.jsp?tp=& 1084-6654. arnumber=6189266. IEEE Pahins:2017:HSL Computer Society order number P4656. [PSSC17] C´ıcero A. L. Pahins, Sean A. Stephens, Carlos Scheideg- Pieprzyk:1995:ACA ger, and João L. D. Comba. [PSN95] J. Pieprzyk and R. Safavi- Hashedcubes: Simple, low Naini, editors. Advances memory, real-time visual ex- in cryptology: ASIACRYPT ploration of big data. IEEE ’94: 4th International con- Transactions on Visualiza- ference on theory and ap- tion and Computer Graphics, plications of cryptology — 23(1):671–680, ???? 2017. November 1994, Wollon- CODEN ITVGEA. ISSN gong, Australia, number 917 1077-2626 (print), 1941-0506 in Lecture Notes in Com- (electronic), 2160-9306. puter Science. Springer-Ver- Pinkas:2018:SPS lag, Berlin, Germany / Hei- delberg, Germany / London, [PSZ18] Benny Pinkas, Thomas UK / etc., 1995. ISBN 3- Schneider, and Michael 540-59339-X. ISSN 0302- Zohner. Scalable private set 9743 (print), 1611-3349 (elec- intersection based on OT tronic). LCCN QA76.9.A25 extension. ACM Transac- I555 1994. tions on Privacy and Secu- Pramanik:1990:HSK rity (TOPS), 21(2):7:1–7:??, February 2018. ISSN 2471- [PSR90] S. Pramanik, C. Severance, 2566 (print), 2471-2574 (elec- and T. Rosenau. A high tronic). URL https://dl. speed KDL-RAM file system acm.org/citation.cfm?id= for parallel computers. In 3154794. Rishe et al. [RNT90], pages Patrascu:2010:IRL 195–203. ISBN 0-8186-2035-8 (paper), 0-8186-6035-X (mi- [PT10a] Mihai P˘atra¸scu and Mikkel crofiche). LCCN QA76.9.D3 Thorup. On the k- P3473 1990. IEEE catalog independence required by lin- number 90CH2728-4. ear probing and minwise in- Putze:2009:CHS dependence. In Abramsky et al. [AGK+10], pages 715– [PSS09] Felix Putze, Peter Sanders, 726. CODEN LNCSD9. and Johannes Singler. Cache- ISBN 3-642-14164-1 (vol. 1: , hash-, and space-efficient paperback), 3-642-14161-7 Bloom filters. ACM Jour- (vol. 2: paperback). ISSN nal of Experimental Algorith- 0302-9743 (print), 1611-3349 mics, 14(1):4:1–4:??, Decem- (electronic). LCCN QA267 REFERENCES 397

.I55 2010. URL http: ple tabulation hashing. Jour- //www.springerlink.com/ nal of the Association for content/978-3-642-14164- Computing Machinery,59 5/. (3):14:1–14:50, June 2012. CODEN JACOAH. ISSN Pong:2010:SSS 0004-5411 (print), 1557-735X [PT10b] Fong Pong and Nian-Feng (electronic). Tzeng. SUSE: superior storage-efficiency for rout- Pong:2012:CLT ing tables through prefix [PT12b] Fong Pong and Nian-Feng transformation and aggrega- Tzeng. Concise lookup tables tion. IEEE/ACM Transac- for IPv4 and IPv6 longest tions on Networking, 18(1): prefix matching in scalable 81–94, February 2010. CO- routers. IEEE/ACM Trans- DEN IEANEP. ISSN 1063- actions on Networking,20 6692 (print), 1558-2566 (elec- (3):729–741, June 2012. CO- tronic). DEN IEANEP. ISSN 1063- Patrascu:2011:PST 6692 (print), 1558-2566 (electronic). [PT11a] Mihai P˘atra¸scu and Mikkel Thorup. The power of sim- Patrascu:2013:TTH ple tabulation hashing. In ACM [ACM11], pages 1– [PT13] Mihai P˘atra¸scu and Mikkel 10. ISBN ???? LCCN Thorup. Twisted tabulation ???? URL http://www.gbv. hashing. In Sanjeev Khanna, de/dms/tib-ub-hannover/ editor, SODA ’13: Pro- 63314455x.. ceedings of the twenty-fourth annual ACM-SIAM sympo- Pong:2011:HRP sium on Discrete Algorithms, [PT11b] Fong Pong and Nian-Feng pages 209–228. ACM Press, Tzeng. HaRP: Rapid packet New York, NY 10036, USA, classification via hashing 2013. ISBN 1-61197-251-5, 1- round-down prefixes. IEEE 61197-310-4 (e-book). Transactions on Parallel and Patrascu:2016:IRL Distributed Systems, 22(7): 1105–1119, July 2011. CO- [PT16] Mihai P˘atra¸scu and Mikkel DEN ITDSEO. ISSN 1045- Thorup. On the k- 9219 (print), 1558-2183 (elec- independence required by lin- tronic). ear probing and minwise in- Patrascu:2012:PST dependence. ACM Trans- actions on Algorithms,12 [PT12a] Mihai P˘atra¸scu and Mikkel (1):8:1–8:??, February 2016. Thorup. The power of sim- CODEN ???? ISSN 1549- REFERENCES 398

6325 (print), 1549-6333 (elec- Preneel:1995:MBF tronic). [PV95] B. Preneel and P. C. Van Papamanthou:2016:AHT Oorschot. MDx-MAC and building fast MACs from [PTT16] Charalampos Papamanthou, hash functions. In Copper- Roberto Tamassia, and Nikos smith [Cop95a], pages 1–14. Triandopoulos. Authen- ISBN 3-540-60221-6. LCCN ticated hash tables based QA76.9.A25 C79 1995. on cryptographic accumula- Pasini:2007:HSW tors. Algorithmica, 74(2): 664–712, February 2016. CO- [PV07] Sylvain Pasini and Serge DEN ALGOEJ. ISSN 0178- Vaudenay. Hash-and-sign 4617 (print), 1432-0541 (elec- with weak hashing made se- tronic). URL http://link. cure. Lecture Notes in CS, springer.com/article/10. 4586:338–354, 2007. CO- 1007/s00453-014-9968-3. DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- Pirotte:1985:VLD tronic). URL http://link. springer.com/content/pdf/ [PV85] A. Pirotte and Y. Vassiliou, 10.1007/978-3-540-73458- editors. Very Large Data 1_25. Bases: Stockholm, 1985/ 11th International Confer- Poblete:2019:ARH ence on Very Large Data Bases, Stockholm, August [PV19] P. V. Poblete and A. Vi- 21–23, 1985. Morgan Kauf- ola. Analysis of Robin Hood mann Publishers, San Fran- and other hashing algorithms cisco, CA, 1985. ISBN 0- under the random probing 934613-17-6. LCCN QA 76.9 model, with and without D3 I61 1985. deletions. Combinatorics, Probability and Computing, Panti:1992:MOH 28(4):600–617, July 2019. CODEN CPCOFG. ISSN [PV92] Maurizio Panti and Salva- 0963-5483 (print), 1469-2163 tore Valenti. A modu- (electronic). URL https:/ lus oriented hash function /www.cambridge.org/core/ for the construction of min- journals/combinatorics- imal perfect tables. SIG- probability-and-computing/ PLAN Notices, 27(11):33–38, article/analysis-of-robin- November 1992. CODEN hood-and-other-hashing- SINODQ. ISSN 0362-1340 algorithms-under-the-random- (print), 1523-2867 (print), probing-model-with-and- 1558-1160 (electronic). without-deletions/933D4F203E3C70EF1505328741 REFERENCES 399

Petit:2008:EPR CODEN LNCSD9. ISBN 3- 540-60221-6 (Berlin). ISSN [PVCQ08] C. Petit, N. Veyrat-Charvillon, 0302-9743 (print), 1611- and J.-J. Quisquater. Eﬃ- 3349 (electronic). LCCN ciency and pseudo-randomness QA76.9.A25 C79 1995. URL of a variant of Z´emor–Tillich http://link.springer-ny. hash function. In 15th com/link/service/series/ IEEE International Confer- 0558/tocs/t0963.htm; ence on Electronics, Cir- http://www.springerlink. cuits and Systems, 2008 com/openurl.asp?genre= (ICECS 2008), pages 906– issue&issn=0302-9743&volume= 909. IEEE Computer Soci- 963.Sponsoredbythe ety Press, 1109 Spring Street, International Association Suite 300, Silver Spring, MD for Cryptologic Research 20910, USA, August 2008. (IACR), in cooperation with the IEEE Computer Society Poblete:1994:AHS Technical Committee on Se- [PVM94] P. V. Poblete, A. Viola, and curity and Privacy. J. I. Munro. The analy- Piper:1993:DSH sis of a hashing scheme by the diagonal Poisson trans- [PW93] F. Piper and P. Wild. Dig- form. Lecture Notes in ital signatures and hash CS, 855:94–??, 1994. CO- functions. In Anonymous DEN LNCSD9. ISSN 0302- [Ano93a], pages 124–130. 9743 (print), 1611-3349 (elec- ISBN 1-85617-211-2. LCCN tronic). ???? Prasanna:1994:SDP Poblete:1997:ALL [PW94] V. K. Prasanna and C.-L. [PVM97] Patricio V. Poblete, Alfredo Wang. Scalable data parallel Viola, and J. Ian Munro. object recognition using geo- Analyzing the LCFS linear metric hashing on the CM- probing hashing algorithm 5. In IEEE [IEE94c], pages with the help of Maple. 817–824. ISBN 0-8186-5680- Maple Technical Newsletter, 8, 0-8186-5681-6. LCCN 4(1):8–13, Winter 1997. ISSN QA76.58.S32 1994. 1061-5733. Phan:2006:SCI Preneel:1995:MMB [PW06] Raphael C.-W. Phan and [PvO95] B. Preneel and P. C. van David Wagner. Security Oorschot. MD-x MAC and considerations for incremen- building fast MACs from tal hash functions based on hash functions. In Copper- pair block chaining. Com- smith [Cop95b], pages 1–14. puters and Security, 25(2): REFERENCES 400

131–136, March 2006. CO- (print), 1432-0541 (elec- DEN CPSEDU. ISSN 0167- tronic). URL http://link. 4048 (print), 1872-6208 (elec- springer.com/article/10. tronic). URL https:/ 1007/s00453-013-9763-6. /www.sciencedirect.com/ science/article/pii/S0167404805002063. Pittel:1988:STE Peikert:2008:LTF [PY88] Boris Pittel and Jenn-Hwa [PW08] Chris Peikert and Brent Wa- Yu. Onsearchtimes ters. Lossy trapdoor func- for early-insertion coalesced tions and their applications. hashing. SIAM Journal In ACM [ACM08b], pages on Computing, 17(3):492– 187–196. ISBN 1-60558-047- 503, June 1988. CO- 3. LCCN QA76.6 .A152 2008. DEN SMJCAT. ISSN 0097- Pan:2013:CHF 5397 (print), 1095-7111 (electronic). [PWY+13] Ping Pan, Licheng Wang, Yixian Yang, Yuanju Gan, Quittner:1981:CSH Lihua Wang, and Chengqian Xu. Chameleon hash func- [QCH+81] P. Quittner, S. Csoka, S. Ha- tions and one-time signa- lasz, D. Kotsis, and K. Var- ture schemes from inner au- nai. Comparison of synonym tomorphism groups. Funda- handling and bucket orga- menta Informaticae, 126(1): nization methods. Commu- 103–119, January 2013. CO- nications of the Association DEN FUMAAJ. ISSN 0169- for Computing Machinery, 2968 (print), 1875-8681 (elec- 24(9):579–582, September tronic). 1981. CODEN CACMA2. Pagh:2010:COH ISSN 0001-0782 (print), 1557-7317 (electronic). [PWYZ10] Rasmus Pagh, Zhewei Wei, Ke Yi, and Qin Zhang. Cache-oblivious hashing. In Quinlan:2002:VNA Van Gucht [Van10], pages 297–304. ISBN 1-4503-0033- [QD02] Sean Quinlan and Sean Dor- 2. LCCN ???? ward. Venti: a new approach to archival storage. Pagh:2014:COH Technical report, Comput- [PWYZ14] Rasmus Pagh, Zhewei Wei, ing Sciences Research Cen- Ke Yi, and Qin Zhang. ter, Bell Laboratories, Mur- Cache-oblivious hashing. Al- ray Hill, NJ, USA, May 2, gorithmica, 69(4):864–883, 2002. 13 pp. URL http:// August 2014. CODEN AL- plan9.bell-labs.com/sys/ GOEJ. ISSN 0178-4617 doc/venti/venti.pdf. REFERENCES 401

Quisquater:1989:BHF delberg, Germany / Lon- don, UK / etc., 1995. CO- [QG89] J. J. Quisquater and M. Gi- DEN LNCSD9. ISBN 3- rault. 2n-bit hash-functions 540-59409-4. ISSN 0302- using n-bit symmetric block 9743 (print), 1611-3349 (elec- cipher algorithms. In tronic). LCCN QA76.9.A25 Quisquater and Vandewalle C794 1995. [QV89], page ?? ISBN 0- 387-53433-4 (New York), 3- Quisquater:1997:ASS 540-53433-4 (Berlin). LCCN QA76.9.A25 E964 1989. [QJ97] Jean-Jacques Quisquater and DM98.00. Marc Joye. Authentication of sequences with the SL2 Quisquater:1990:BHF hash function: application [QG90] Jean-Jacques Quisquater and to video sequences. Jour- Marc Girault. 2n-bit hash- nal of Computer Security, functions using n-bit sym- 5(3):213–223, ???? 1997. metric block cipher algo- CODEN JCSIET. ISSN rithms. Lecture Notes 0926-227X (print), 1875-8924 in CS, 434:102–??, 1990. (electronic). CODEN LNCSD9. ISSN 0302-9743 (print), 1611- Qi:1998:DAH 3349 (electronic). URL [QM98] Hongbin Qi and Charles U. http://link.springer-ny. Martel. Design and analy- com/link/service/series/ sis of hashing algorithms with 0558/bibs/0434/04340102. cache eﬀects. Report, De- htm; http://link.springer- partment of Computer Sci- ny.com/link/service/series/ ence, University of Califor- 0558/papers/0434/04340102. nia, Davis, Davis, CA, USA, pdf. 1998. URL http://theory. Quisquater:1995:ACE cs.ucdavis.edu/.

[QG95] J.-J. Quisquater and Louis C. Qu:2016:CHT Guillou, editors. Ad- vances in cryptology, EURO- [QP16] Yun R. Qu and Viktor K. CRYPT ’95: International Prasanna. Compact hash ta- Conference on the Theory bles for decision-trees. Par- and Application of Crypto- allel Computing, 54(??):121– graphic Techniques, Saint- 127, May 2016. CO- Malo, France, May 21–25, DEN PACOEJ. ISSN 1995: proceedings,volume 0167-8191 (print), 1872-7336 921 of Lecture Notes in Com- (electronic). URL http: puter Science. Springer-Ver- //www.sciencedirect.com/ lag, Berlin, Germany / Hei- science/article/pii/S016781911500157X. REFERENCES 402

Quittner:1983:ECI DEN LNCSD9. ISBN 0-387- 53433-4 (New York), 3-540- [Qui83] P´ae Quittner. Eﬃcient com- 53433-4 (Berlin). ISSN 0302- bination of index tables and 9743 (print), 1611-3349 (elec- hashing. Software—Practice tronic). LCCN QA76.9.A25 and Experience, 13(6):471– E964 1989; QA267.A1 L43 478, June 1983. CODEN no.434. DM98.00. URL SPEXBL. ISSN 0038-0644 http://link.springer-ny. (print), 1097-024X (elec- com/link/service/series/ tronic). 0558/tocs/t0434.htm; Quisquater:1989:ACE http://www.springerlink. com/content/978-0-387- [QV89] Jean-Jacques Quisquater and 53433-6; http://www. Joos Vandewalle, editors. springerlink.com/openurl. Advances in Cryptology– asp?genre=issue&issn=0302- EUROCRYPT ’89: Work- 9743&volume=434. shop on the Theory and Ap- Qiu:2020:FKF plication of Cryptographic Techniques, Houthalen, Bel- [QXL+20] Y. Qiu, J. Xie, H. Lv, gium, April 10–13, 1989: W. Yin, W. Luk, L. Wang, Proceedings. Springer-Verlag, B. Yu, H. Chen, X. Ge, Berlin, Germany / Heidel- Z. Liao, and X. Shi. FULL– berg, Germany / London, KV: Flexible and ultra- UK / etc., 1989. ISBN 0- low-latency in-memory key– 387-53433-4 (New York), 3- value store system design 540-53433-4 (Berlin). LCCN on CPU-FPGA. IEEE QA76.9.A25 E964 1989. Transactions on Parallel and DM98.00. Distributed Systems, 31(8): 1828–1444, 2020. CO- Quisquater:1990:ACE DEN ITDSEO. ISSN 1045- [QV90] Jean-Jacques Quisquater and 9219 (print), 1558-2183 (elec- Joos Vandewalle, editors. tronic). Advances in cryptology — Qi:2018:TSL EUROCRYPT ’89: Work- shop on the Theory and Ap- [QZD+18] Lianyong Qi, Xuyun Zhang, plication of Cryptographic Wanchun Dou, Chunhua Hu, Techniques, Houthalen, Bel- Chi Yang, and Jinjun Chen. gium, April 10–13, 1989: A two-stage locality-sensitive proceedings, volume 434 hashing based approach for of Lecture Notes in Com- privacy-preserving mobile puter Science. Springer-Ver- service recommendation in lag, Berlin, Germany / Hei- cross-platform edge environ- delberg, Germany / Lon- ment. Future Generation don, UK / etc., 1990. CO- Computer Systems, 88(??): REFERENCES 403

636–643, November 2018. Richter:2015:SDA CODEN FGSEVI. ISSN 0167-739X (print), 1872-7115 [RAD15] Stefan Richter, Victor Al- (electronic). URL http: varez, and Jens Dittrich. A //www.sciencedirect.com/ seven-dimensional analysis of science/article/pii/S0167739X18301420. hashing methods and its implications on query process- Radke:1970:UQR ing. Proceedings of the VLDB Endowment, 9(3):96– 107, November 2015. CO- [Rad70] C. E. Radke. The use DEN ???? ISSN 2150-8097. of quadratic residue research. Communications of Ragde:1993:PSC the Association for Comput- [Rag93] P. Ragde. The paral- ing Machinery, 13(2):103– lel simplicity of compaction 150, February 1970. CO- and chaining. Journal DEN CACMA2. ISSN 0001- of Algorithms, 14(3):371– 0782 (print), 1557-7317 (elec- 380, May 1993. CO- tronic). DEN JOALDV. ISSN 0196-6774 (print), 1090-2678 Radue:1983:DIS (electronic). URL http: //www.sciencedirect.com/ [Rad83] Jon Radue. On the design of science/article/pii/S0196677483710199. an interactive spelling dictionary for personal computers. Roman:2007:SCP SIGPC Notes (ACM Spe- [RAL07] Rodrigo Roman, Cristina Al- cial Interest Group on Per- caraz, and Javier Lopez. sonal Computing), 6(2):197– A survey of cryptographic 199, 1983. CODEN SPC- primitives and implementa- NDH. ISBN 0-89791-123-7. tions for hardware-constrained ACM (Order n 609830). Bal- sensor network nodes. Mobile timore, MD, USA. Networks and Applications, 12(4):231–244, August 2007. Radhakrishnan:1992:IBC CODEN ???? ISSN 1383- 469X. [Rad92] Jaikumar Radhakrishnan. Ramakrishna:1987:CPH Improved bounds for covering complete uniform hyper- [Ram87] M. V. Ramakrishna. Com- graphs. Information Pro- puting the probability of cessing Letters, 41(4):203– hash table/urn overﬂow. 207, March 18, 1992. CO- Communications in Statis- DEN IFPLAT. ISSN 0020- tics: Theory and Meth- 0190 (print), 1872-6119 (elec- ods, 16(11):3343–3353, 1987. tronic). CODEN CSTMDC. ISSN REFERENCES 404

0361-0926 (print), 1532-415X (electronic). Computing Re- (electronic). views: “This short communication deals with a special Ramakrishna:1988:EPM kind of hash function called ‘Bloom filters.’ These filters [Ram88a] M. V. Ramakrishna. An ex- are used, for example, to act probability model for fi- search a differential file con- nite hash tables. In ICDE’88 taining updates to a main [ICD88], pages 362–368. file.”. ISBN 0-8186-0827-7. LCCN ???? IEEE Service Cent. Pis- Ramakrishna:1992:SPH cataway, NJ, USA. [Ram92] M. V. Ramakrishna. A sim- Ramakrishna:1988:HPA ple perfect hashing method for static sets. In Koczko- [Ram88b] M. V. Ramakrishna. Hash- daj et al. [KLT92], pages ing in practice: Analysis of 401–404. ISBN 0-8186-2812- hashing and universal hash- X (hardcover), 0-8186-2811-1 ing. In Boral and Larson (microfiche). LCCN QA75.5 [BL88], pages 191–199. ISBN .I587 1992. 0-89791-268-3. LCCN QA Raman:1997:KFM 76.9 D3 S53 v.17 no.3 1988. US$33.00. [Ram97] Anand V. Raman. The Katapayadi formula and Ramakrishna:1989:ARP the modern hashing technique. IEEE Annals of [Ram89a] M. V. Ramakrishna. Anal- the History of Computing, ysis of random probing 19(4):49–52, 1997. CO- hashing. Information Pro- DEN IAHCEX. ISSN 1058- cessing Letters, 31(2):83– 6180 (print), 1934-1547 (elec- 90, April 26, 1989. CO- tronic). DEN IFPLAT. ISSN 0020- 0190 (print), 1872-6119 (elec- Ramakrishna:1991:DPH tronic). [RB91] M. V. Ramakrishna and Ramakrishna:1989:PPB Y. Bannai. Direct perfect hashing functions for exter- [Ram89b] M. V. Ramakrishna. Prac- nal files. J. Database Adm., tical performance of Bloom 2(1):19–29, 1991. CODEN filters and parallel free-text JDADEX. ISSN 1047-9430. searching. Communications Rijmen:2001:WHF of the Association for Com- puting Machinery, 32(10): [RB01] Vincent Rijmen and Paulo 1237–1239, October 1989. S. L. M. Barreto. The CODEN CACMA2. ISSN WHIRLPOOL hash func- 0001-0782 (print), 1557-7317 tion. World-Wide Web doc- REFERENCES 405

ument, 2001. URL http: Regnier:1982:LHG //paginas.terra.com.br/ informatica/paulobarreto/ [Reg82] Mireille Regnier. Linear WhirlpoolPage.html; http: hashing with groups of re- //planeta.terra.com.br/ organization: an algorithm informatica/paulobarreto/ for files without history. In whirlpool.zip. Scheuermann [Sch82a], pages 257–272. ISBN 0-12-624080- Rigoutsos:1994:SPS 9. LCCN QA76.9.D3 .I558 1982. US$34.00. [RC94] Isidore Rigoutsos and An- Regnier:1985:AGF drea Califano. Searching in parallel for similar strings. [Reg85] Mireille Regnier. Analy- IEEE Computational Sci- sis of grid file algorithms. ence & Engineering, 1(2):60– BIT (Nordisk tidskrift for 75, Summer 1994. CODEN informationsbehandling),25 ISCEE4. ISSN 1070-9924 (2):335–357, 1985. CODEN (print), 1558-190X (elec- BITTEL, NBITAB. ISSN tronic). 0006-3835 (print), 1572-9125 (electronic). Rao:2011:STE Regnier:1988:THA [RCF11] Weixiong Rao, Lei Chen, and [Reg88] Mireille Regnier. Trie hash- Ada Wai-Chee Fu. STAIRS: ing analysis. In ICDE’88 Towards efficient full-text fil- [ICD88], pages 377–381. tering and dissemination in ISBN 0-8186-0827-7 (paper- DHT environments. VLDB back), 0-8186-8827-0 (hard- Journal: Very Large Data cover), 0-8186-4827-9 (mi- Bases, 20(6):793–817, De- crofiche). LCCN QA76.9.D3 cember 2011. CODEN I5582 1988. IEEE Service VLDBFR. ISSN 1066-8888 Cent. Piscataway, NJ, USA. (print), 0949-877X (electronic). Reif:1988:AWC

Regnier:1981:AHT [Rei88] John H. Reif, editor. Aegean Workshop on Computing [Reg81] Mireille Regnier. On the (3rd: 1988: Kerkyra, Corfu average height of trees in Island, Greece) VLSI algo- digital search and dynamic rithms and architectures: 3rd hashing. Information Pro- Aegean Workshop on Com- cessing Letters, 13(2):64– puting, AWOC 88, Corfu, 66, November 1981. CO- Greece, June 28-July 1, 1988: DEN IFPLAT. ISSN 0020- proceedings. Springer-Verlag, 0190 (print), 1872-6119 (elec- Berlin, Germany / Heidel- tronic). berg, Germany / London, REFERENCES 406

UK / etc., 1988. ISBN 0- 0018-9340 (print), 1557- 387-96818-0. LCCN TK7874 9956 (electronic). URL .A338 1988. Lecture notes in http://ieeexplore.ieee. computer science # 319. org/stamp/stamp.jsp?tp=& arnumber=641938. Reid:2003:SSE Richter:1989:HJA [Rei03] Jason Reid. Secure Shell [RG89] Karol Richter and Dan Grig- in the Enterprise. Sun oras. Hash-join algorithms blueprints. Sun Microsystems for SIMD-MIMD computer Press, Palo Alto, CA, USA, architecture. Computers 2003. ISBN 0-13-142900-0 and Artificial Intelligence (paperback). xxiii + 198 = Vychislitel’nye mashiny i pp. LCCN QA76.76.O63 iskusstvennyi intellekt, 8(4): R448 2003. US$39.00. 369–384, 1989. CODEN Remy:1992:ERE CARIDY. ISSN 0232-0274. Ramirez-Gutierrez:2012:IRT [Rém92] Didier Rémy. Efficient represent of extensible records. [RGNMPM12] Kelsey A. Ramirez-Gutierrez, In Anonymous ??? [Ano92], Mariko Nakano-Miyatake, pages 12–16. and Hector M. Perez-Meana. Improvement of Radon transform- Reyes:2014:FKM based perceptual hashing using image normalization. In- [Rey14] Kristofer Reyes. Fast kinetic ternational Journal of Com- Monte Carlo simulations us- puter Applications, 34(4): ing hash table based caching 249–259, 2012. ISSN 1206- with applications to nanowire 212X (print), 1925-7074 growth and sintering. Multi- (electronic). URL scale Modeling & Simulation, https:// 12(1):200–224, ???? 2014. www.tandfonline.com/doi/ full/10.2316/Journal.202. CODEN MMSUBT. ISSN . 1540-3459 (print), 1540-3467 2012.4.202-3530 (electronic). Raghavan:1990:RIM

Ramakrishna:1997:EHH [RH90] R. Raghavan and J. P. Hayes. On randomly in- [RFB97] M. V. Ramakrishna, E. Fu, terleaved memories. In and E. Bahcekapili. Eﬃ- IEEE [IEE90], pages 49–58. cient hardware hashing func- ISBN 0-8186-2056-0 (paper- tions for high performance back: IEEE Computer Soci- computers. IEEE Transac- ety), 0-89791-412-0 (paper- tions on Computers, 46(12): back: ACM). LCCN QA 1378–1381, December 1997. 76.88 S87 1990. ACM or- CODEN ITCOB4. ISSN der number 415903. IEEE REFERENCES 407

Computer Society Press or- 1990’s: Seventeenth ander number 2056. IEEE cat- nual ACM Computer Sci- alog number 90CH2916-5. ence Conference, Febru- ary 21–23, 1989, Common- Rigoutsos:1992:MPM wealth Convention Center, [RH92] Isidore Rigoutsos and Robert Louisville, KY. ACM Press, Hummel. Massively parallel New York, NY 10036, USA, model matching: Geometric 1989. ISBN 0-89791-299-3. hashing on the Connection LCCN QA75.5 .A1371 1989. Machine. Computer, 25(2): US$36.00. 33–42, February 1992. CO- Rivest:1974:HCA DEN CPTRB4. ISSN 0018- 9162 (print), 1558-0814 (elec- [Riv74a] R. L. Rivest. On hash-coding tronic). algorithms for partial-match retrieval. In IEEE [IEE74], Rigoutsos:1995:BAM pages 95–103. [RH95] Isidore Rigoutsos and Robert Rivest:1974:AAR Hummel. A Bayesian approach to model match- [Riv74b] Ronald L. Rivest. Anal- ing with geometric hashing. ysis of associative retrieval Computer vision and image algorithms. Technical Re- understanding: CVIU, 62(1): port TR.54, Institut de la 11–26, July 1995. CODEN Recherche en Informatique CVIUF4. ISSN 1077-3142 et Automatique, now Insti- (print), 1090-235X (elec- tut National de Recherche tronic). en Informatique et Automa- tique (INRIA), Domaine de Risson:2009:TDR Voluceau — Rocquencourt — B.P. 105, 78153 Le Ches- [RHM09] John Risson, Aaron Har- nay Cedex, France, February wood, and Tim Moors. 1974. ?? pp. Also published Topology dissemination for in/as: Stanford CSD report reliable one-hop distributed 74-415. Also published in/as: hash tables. IEEE Trans- SIAM Journal for Comput- actions on Parallel and Dis- ing, Springer-Verlag (Heidel- tributed Systems, 20(5):680– berg, FRG and New York 694, May 2009. CODEN NY, USA)-Verlag, 1976, with ITDSEO. ISSN 1045-9219 mod. title. (print), 1558-2183 (electronic). Rivest:1976:OAK Riehl:1989:CTS [Riv76] Ronald L. Rivest. Op- timal arrangement of keys [Rie89] Arthur M. Riehl, editor. in a hash table. Techni- Computing Trends in the cal Report MIT/LCS/TM- REFERENCES 408

73, Massachusetts Institute Ris:1989:PIC of Technology, Computer Sci- ence Lab., Cambridge, Mas- [RK89] Fred Ris and Peter M. Kogge, sachusetts, July 1976. ?? pp. editors. Proceedings of the 1989 International Confer- Rivest:1978:OAK ence on Parallel Process- ing, August 8–12, 1989,vol- [Riv78] Ronald L. Rivest. Opti- ume 3. IEEE Computer Soci- mal arrangement of keys in ety Press, 1109 Spring Street, a hash table. Journal of Suite 300, Silver Spring, MD the Association for Comput- 20910, USA, 1989. ISBN 0- ing Machinery, 25(2):200– 271-00686-2. LCCN QA76.6 209, April 1978. CODEN .I548 1989 v.1-3. Three vol- JACOAH. ISSN 0004-5411 umes. (print), 1557-735X (elec- Roy:1991:LBH tronic). See [Yao85a]. [RK91] S. Roy and A. Keller. Load Rjasko:2012:BBP balancing in hash-based parallel join computation in [Rja12] Michal Rjaˇsko. Black- presence of data skew. Tech- box property of crypto- nical report, ????, 1991. ?? graphic hash functions. Lec- pp. Submitted to DE91. ture Notes in CS, 6888: 181–193, 2012. CODEN Rottenstreich:2015:BPW LNCSD9. ISSN 0302-9743 [RK15] Ori Rottenstreich and Isaac (print), 1611-3349 (elec- Keslassy. The Bloom para- tronic). URL http://link. dox: when not to use a springer.com/chapter/10. Bloom ﬁlter. IEEE/ACM 1007/978-3-642-27901-0_ Transactions on Networking, 14/. 23(3):703–716, June 2015. CODEN IEANEP. ISSN Reuhkala:1979:RHA 1063-6692 (print), 1558-2566 (electronic). [RJK79] Erkki Reuhkala, Matti Jalanko, and Teuvo Kohonen. Redun- Rottenstreich:2014:VIC dant hash addressing method adapted for the postprocess- [RKK14] Ori Rottenstreich, Yossi ing and error-correction of Kanizo, and Isaac Keslassy. computer-recognized speech. The variable-increment count- Record — IEEE Interna- ing Bloom ﬁlter. IEEE/ tional Conference on Acous- ACM Transactions on Net- tics, Speech & Signal Pro- working, 22(4):1092–1105, cessing, ??(??):591–594, ???? August 2014. CODEN 1979. CODEN RIIPDR. IEANEP. ISSN 1063-6692 REFERENCES 409

(print), 1558-2566 (elec- hashing. ACM Transactions tronic). on Database Systems, 14(2): 231–263, June 1, 1989. CO- Ragan-Kelley:2011:DSG DEN ATDSD3. ISSN 0362- [RKLC+11] Jonathan Ragan-Kelley, Jaakko 5915 (print), 1557-4644 (elec- Lehtinen, Jiawen Chen, tronic). Michael Doggett, and Fr´edo Rathi:1990:PCE Durand. Decoupled sampling for graphics pipelines. ACM [RLH90] A. Rathi, H. Lu, and G. E. Transactions on Graphics, Hedrick. Performance com- 30(3):17:1–17:??, May 2011. parison of extendible hash- CODEN ATGRDF. ISSN ing and linear hashing tech- 0730-0301 (print), 1557-7368 niques. In Hal Berghel, (electronic). E. A. (Elizabeth A.) Unger, and Richard Rankin, edi- Rothnie:1974:ABF tors, Proceedings of the ACM [RL74] James B. Rothnie, Jr. and SIGSMALL/PC Symposium Tomas Lozano. Attribute on Small Systems, Arling- based ﬁle organization in ton, VA, March 28–30, 1990, a paged memory environ- pages 178–185. ACM Press, ment. Communications of 1990. ISBN 0-89791-347-7. the Association for Com- LCCN QA76.5 .A155 1990. puting Machinery, 17(2):63– URL http://portal.acm. 69, February 1974. CO- org/toc.cfm?id=99412. DEN CACMA2. ISSN 0001-0782 (print), 1557-7317 Rathi:1991:PCE (electronic). See remarks [RLH91] Ashok Rathi, Huizu Lu, and [Cha84a]. G. E. Hedrick. Perfor- Ramamohanarao:1982:DHS mance comparison of extendible hashing an linear [RL82] K. Ramamohanarao and hashing techniques. SIGS- John W. Lloyd. Dynamic MALLslash PC Notes, 17(2): hashing schemes. The Com- 19–??, Summer 1991. CO- puter Journal, 25(4):479– DEN SGBLEC. ISSN 0893- 485, November 1982. CO- 2875. DEN CMPJA6. ISSN 0010- Richardson:1987:DEP 4620 (print), 1460-2067 (electronic). [RLM87] James P. Richardson, Hongjun Ramakrishna:1989:FOU Lu, and Krishna Mikkili- neni. Design and evalu- [RL89] M. V. Ramakrishna and Per- ation of parallel pipelined Ake˚ Larson. File organiza- join algorithms. In Dayal tion using composite perfect and Traiger [DT87], pages REFERENCES 410

399–409. ISBN 0-89791-236- proceedings/pods/308386/ 5. LCCN QA 76.9 D3 P76 p117-ramakrishna/. 1987. URL http://www. acm.org/pubs/articles/ Rosas:2011:CBC proceedings/mod/38713/ [RMB11] Erika Rosas, Olivier Marin, p399-richardson/p399-richardson. and Xavier Bonnaire. Corps: pdf; http://www.acm. Building a community of rep- org/pubs/citations/proceedings/ utable peers in distributed mod/38713/p399-richardson/ hash tables. The Com- . ACM order number 472870. puter Journal, 54(10):1721– Ramamohanarao:1983:PMR 1735, October 2011. CO- DEN CMPJA6. ISSN [RLT83] K. Ramamohanarao, John W. 0010-4620 (print), 1460-2067 Lloyd, and James A. Thom. (electronic). URL http: Partial-match retrieval us- //comjnl.oxfordjournals. ing hashing and descrip- org/content/54/10/1721. tors. ACM Transactions on full.pdf+html. Database Systems, 8(4):552– 576, December 1983. CO- Robey:2013:HBA DEN ATDSD3. ISSN 0362- 5915 (print), 1557-4644 (elec- [RNR13] Rachel N. Robey, David tronic). URL http://www. Nicholaeff, and Robert W. acm.org/pubs/articles/ Robey. Hash-based algo- journals/tods/1983-8-4/ rithms for discretized data. p552-ramamohanarao/p552- SIAM Journal on Scien- ramamohanarao.pdf; http: tific Computing, 35(4):C346– //www.acm.org/pubs/citations/ C368, ???? 2013. CO- journals/tods/1983-8-4/ DEN SJOCE3. ISSN 1064- p552-ramamohanarao/. 8275 (print), 1095-7197 (electronic). Ramakrishna:1988:ABD Rishe:1990:PIC [RM88] M. V. Ramakrishna and P. Mukhopadhyay. Anal- [RNT90] Naphtali Rishe, Sham Na- ysis of bounded disor- vathe, and Doron Tal, ed- der file organization. In itors. PARBASE-90, In- ACM [ACM88a], pages 117– ternational Conference on 125. ISBN 0-89791-263- Databases, Parallel Archi- 2. LCCN QA76.9.D3 A15 tectures, and Their Applica- 1988. URL http://www. tions: March 7–9, 1990, Mi- acm.org/pubs/articles/ ami Beach, Florida. IEEE proceedings/pods/308386/ Computer Society Press, p117-ramakrishna/p117- 1109 Spring Street, Suite 300, ramakrishna.pdf; http: Silver Spring, MD 20910, //www.acm.org/pubs/citations/ USA, 1990. ISBN 0-8186- REFERENCES 411

2035-8 (paper), 0-8186-6035- Rogaway:1999:BHA X (microfiche). LCCN QA76.9.D3 P3473 1990. [Rog99] Phillip Rogaway. Bucket hashing and its application Robinson:1986:OPL to fast message authentication. Journal of Cryp- [Rob86] T. J. Robinson. Order pre- tology, 12(2):91–115, 1999. serving linear hashing using CODEN JOCREQ. ISSN dynamic key statistics. In 0933-2790 (print), 1432- ACM-PODS’86 [ACM86a], 1378 (electronic). URL pages 91–99. ISBN 0-89791- http://link.springer.de/ 179-2. LCCN QA76.9.D3 link/service/journals/ A296 1986. US$24.00. 00145/bibs/12n2p91.html; Roe:1994:PSC http://link.springer. de/link/service/journals/ [Roe94] M. Roe. Performance of 00145/papers/12n2p91.pdf; symmetric ciphers and one- http://link.springer. way hash functions. In An- de/link/service/journals/ derson [And94], pages 83– 00145/papers/12n2p91.tex. 89. ISBN 0-387-58108-1, 3- 540-58108-1. ISSN 0302- Rogers:2019:AFH 9743 (print), 1611-3349 (electronic). LCCN QA76.9.A25 [Rog19a] J. Andrew Rogers. Aqua- C36 1993. Hash: Fast hashing with AES intrinsics. Web site., March Roe:1995:PBC 6, 2019. URL https://www. [Roe95] M. Roe. Performance of jandrewrogers.com/2019/ block ciphers and hash func- 03/06/aquahash/. tions — one year later. Lec- Rogers:2019:FPH ture Notes in CS, 1008: 359–??, 1995. CODEN [Rog19b] J. Andrew Rogers. Fast LNCSD9. ISSN 0302-9743 perfect hashing of integral (print), 1611-3349 (elec- types. Web site., March tronic). 6, 2019. URL https:/ /www.jandrewrogers.com/ Rogaway:1995:BHA 2019/02/12/fast-perfect- [Rog95] P. Rogaway. Bucket hash- hashing/. ing and its application to Ronnblom:2007:HEA fast message authentication. Lecture Notes in [Rön07] Johan Rönnblom. High- CS, 963:29–??, 1995. CO- error approximate dictionary DEN LNCSD9. ISSN 0302- search using estimate hash 9743 (print), 1611-3349 (elec- comparisons. Software— tronic). Practice and Experience, REFERENCES 412

37(10):1047–1059, August Street, Suite 300, Silver 2007. CODEN SPEXBL. Spring, MD 20910, USA, ISSN 0038-0644 (print), 2007. ISBN 1-4244-0802- 1097-024X (electronic). 4. LCCN QA76.9.D3 I5564 2007. URL http:// Rosenfeld:1974:IPP doi.ieeecomputersociety. [Ros74] Jack L. Rosenfeld, editor. In- org/10.1109/ICDE.2007. formation processing, 1974; 368997. IEEE catalog num- Proceedings of IFIP Congress ber 07EX1614. 74, Stockholm, Sweden, Au- Rosenfeld:2012:OCC gust 5–10, 1974.North- Holland, Amsterdam, The [Ros12] Meni Rosenfeld. Overview Netherlands, 1974. ISBN 0- of colored coins. Web 444-10689-8. LCCN QA 76 document., 2012. URL I615. https://bitcoil.co.il/ Rosenberg:1977:SRA BitcoinX.pdf; https: //web.archive.org/web/ [Ros77] A. L. Rosenberg. On stor- 20170922052930/https:// ing ragged arrays by hash- bitcoil.co.il/BitcoinX. ing. Mathematical Systems pdf. Theory, 10(??):??, 1977. CO- DEN MASTBA. ISSN 0025- Ross:2021:TPS 5661. Ross:2006:EHP [Ros21] Kenneth A. Ross. Techni- cal perspective: Scaling dy- [Ros06] Kenneth A. Ross. Efficient namic hash tables on real hash probes on modern pro- persistent memory. SIGMOD cessors. Research Report Record (ACM Special Inter- RC24100 (W0611-039), IBM est Group on Management of Corporation, Almaden, CA, Data), 50(1):86, June 2021. USA, November 8, 2006. 12 CODEN SRECD8. ISSN pp. 0163-5808 (print), 1943-5835 Ross:2007:EHP (electronic). URL https:/ /dl.acm.org/doi/10.1145/ [Ros07] Kenneth A. Ross. Efficient 3471485.3471505. hash probes on modern processors. In IEEE, editor, Pro- Rotem:1989:CMH ceedings of the 2007 IEEE 23rd International Confer- [Rot89] Doron Rotem. Clustered ence on Data Engineer- multiattribute hash files. In ing, Istanbul, Turkey, 11– ACM-PODS’89 [ACM89b], 15 April 2007, pages 1297– pages 225–234. ISBN 0- 1301. IEEE Computer So- 89791-308-6. LCCN QA 76.9 ciety Press, 1109 Spring D3 A26 1989. REFERENCES 413

Roussev:2009:HDF CODEN LNCSD9. ISSN 0302-9743 (print), 1611-3349 [Rou09] Vassil Roussev. Hashing and (electronic). data fingerprinting in digital forensics. IEEE Secu- Ramakrishna:1992:ODS rity & Privacy, 7(2):49–55, [RR92] M. V. Ramakrishna and March/April 2009. CODEN E. A. Ramos. Optimal dis- ???? ISSN 1540-7993 (print), tribution of signatures in sig- 1558-4046 (electronic). nature hashing. IEEE Trans- Rovan:1990:MFC actions on Knowledge and Data Engineering, 4(1):83– [Rov90] B. Rovan, editor. Mathe- 88, February 1, 1992. CO- matical Foundations of Com- DEN ITKEEH. ISSN 1041- puter Science, 1990: Ban- 4347. ska Bystrica, Czechoslovakia, Rechberger:2008:NRN August 27–31, 1990: Pro- ceedings, volume 452 of Lec- [RR08] C. Rechberger and V. Rij- ture Notes in Computer Sci- men. New results on NMAC/ ence. Springer-Verlag, Berlin, HMAC when instantiated Germany / Heidelberg, Ger- with popular hash functions. many / London, UK / etc., J.UCS: Journal of Univer- 1990. ISBN 0-387-52953-5 sal Computer Science, 14(3): (New York), 3-540-52953-5 347–376, ???? 2008. CO- (Berlin). LCCN QA76.9.M35 DEN ???? ISSN 0948- M386 1990. 6968. URL http://www. Ramakrishna:1991:PHF jucs.org/jucs_14_3/new_ results_on_nmac. [RP91] M. V. Ramakrishna and Raman:1999:FST G. A. Portice. Perfect hashing functions for hardware [RRR99] V. Raman, C. Pandu Ran- applications. In ICDE’91 gan, and R. Ramanujam, edi- [ICD91], page 464. ISBN 0- tors. Foundations of Software 8186-2138-9 (paper), 0-8186- Technology and Theoreti- 6138-0 (microfiche), 0-8186- cal Computer Science: 19th 9138-7 (hardcover). LCCN Conference, Chennai, In- QA76.9.D3 I5582 1991. dia, December 13–15, 1999: Rijmen:1995:ICD Proceedings, volume 1738 of Lecture Notes in Com- [RP95] V. Rijmen and B. Preneel. puter Science. Springer-Ver- Improved characteristics for lag, Berlin, Germany / Hei- differential cryptanalysis of delberg, Germany / Lon- hash functions based on don, UK / etc., 1999. CO- block ciphers. Lecture Notes DEN LNCSD9. ISBN 3-540- in CS, 1008:242–??, 1995. 66836-5 (softcover). ISSN REFERENCES 414

0302-9743 (print), 1611- 1549-6325 (print), 1549-6333 3349 (electronic). LCCN (electronic). QA267.A1 L43 no.1738. URL http://link.springer-ny. Renda:2012:LBH com/link/service/series/ [RRS12] M. Elena Renda, Giovanni 0558/tocs/t1738.htm; Resta, and Paolo Santi. Load http://www.springerlink. balancing hashing in geo- com/content/978-3-540- graphic hash tables. IEEE 66836-7; http://www. Transactions on Parallel and springerlink.com/openurl. Distributed Systems, 23(8): asp?genre=issue&issn=0302- 1508–1519, August 2012. 9743&volume=1738. CODEN ITDSEO. ISSN Rechberger:2006:NCW 1045-9219 (print), 1558-2183 (electronic). [RRS06] Christian Rechberger, Vin- Rosenberg:1975:HSE cent Rijmen, and Nicolas Sklavos. The NIST Crypto- [RS75] A. L. Rosenberg and L. J. graphic Workshop on Hash Stockmeyer. Hashing schemes Functions. IEEE Secu- for extendible arrays. In rity & Privacy, 4(1):54– ACM-TOC’75 [ACM75c], 56, January/February 2006. pages 159–166. CODEN ???? ISSN 1540-7993 (print), 1558-4046 Rosenberg:1977:HSE (electronic). URL http: [RS77] Arnold L. Rosenberg and //ieeexplore.ieee.org/ Larry J. Stockmeyer. Hash- iel5/8013/33481/01588827. ing schemes for extendible pdf; http://ieeexplore. arrays. Journal of the ieee.org/xpls/abs_all. Association for Computing jsp?isnumber=33481&arnumber= Machinery, 24(2):199–221, 1588827; http://www. April 1977. CODEN JA- csrc.nist.gov/pki/HashWorkshop/ COAH. ISSN 0004-5411 . (print), 1557-735X (elec- Raman:2007:SID tronic). Raschid:1992:PPS [RRS07] Rajeev Raman, Venkatesh Raman, and Srinivasa Rao [RS92] Louiqa Raschid and Stan- Satti. Succinct indexable dic- ley Y. W. Su. A par- tionaries with applications to allel pipelined strategy for encoding k-ary trees, preﬁx evaluating linear recursive sums and multisets. ACM predicates in a multipro- Transactions on Algorithms, cessor environment. Jour- 3(4):43:1–43:??, November nal of Parallel and Dis- 2007. CODEN ???? ISSN tributed Computing, 14(2): REFERENCES 415

146–162, February 1992. CO- and AIST, Japan, October DEN JPDCER. ISSN 0743- 27, 2014. 30 pp. URL http: 7315 (print), 1096-0848 (elec- //people.csail.mit.edu/ tronic). rivest/pubs/RS14.pdf.

Rogaway:2008:CCH Ramamohanarao:1984:RLH

[RS08] Phillip Rogaway and John [RSD84] K. Ramamohanarao and Steinberger. Constructing R. Sacks-Davis. Recursive cryptographic hash func- linear hashing. ACM Trans- tions from ﬁxed-key block- actions on Database Sys- ciphers. Lecture Notes in tems, 9(3):369–391, Septem- CS, 5157:433–450, 2008. CO- ber 1984. CODEN ATDSD3. DEN LNCSD9. ISSN 0302- ISSN 0362-5915 (print), 9743 (print), 1611-3349 (elec- 1557-4644 (electronic). tronic). URL http://link. Ramamohanarao:1985:PMR springer.com/content/pdf/ 10.1007/978-3-540-85174- [RSD85] K. Ramamohanarao and 5_24. R. Sacks-Davis. Partial match retrieval using recur- Reyhanitabar:2012:CHD sive linear hashing. BIT [RS12] Mohammad Reza Reyhan- (Nordisk tidskrift for infor- itabar and Willy Susilo. mationsbehandling), 25(3): On capabilities of hash do- 477–484, 1985. CODEN BIT- main extenders to preserve TEL, NBITAB. ISSN 0006- enhanced security proper- 3835 (print), 1572-9125 (elec- ties. Lecture Notes in CS, tronic). 7496:288–299, 2012. CO- Riazi:2017:CSC DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [RSK17] M. Sadegh Riazi, Moham- tronic). URL http://link. mad Samragh, and Fari- springer.com/chapter/10. naz Koushanfar. CAMsure: 1007/978-3-642-33272-2_ Secure content-addressable 19/. memory for approximate search. ACM Transactions Rivest:2014:SSR on Embedded Computing Sys- [RS14] Ronald L. Rivest and Ja- tems, 16(5s):136:1–136:??, cob C. N. Schuldt. Spritz October 2017. CODEN —- a spongy RC4-like ???? ISSN 1539-9087 (print), stream cipher and hash 1558-3465 (electronic). function. Report, MIT Ramamohanarao:1989:PMRa CSAIL and Research In- stitute for Secure Systems, [RSSD89a] K. Ramamohanarao, J. Shep- Cambridge, MA 02139, USA herd, and R. Sacks-Davis. REFERENCES 416

Partial-match retrieval for Raghavan:1981:ELS dynamic files using linear hashing with partial expan- [RT81] R. Raghavan and W. B. sions. In Litwin and Schek Thompson. Efficient local [LS89], page ?? ISBN 0-387- searching in sparse images. 51295-0. LCCN QA76.9.D3 Proceedings — IEEE Com- F671 1989. puter Society Conference on Ramamohanarao:1989:PMRb Pattern Recognition and Im- age Processing, pages 548– [RSSD89b] K. Ramamohanarao, J. Shep- 553, 1981. CODEN PIR- herd, and R. Sacks-Davis. PDG. Partial-match retrieval using multiple-key hashing with Raite:1987:PTC multiple file copies. In Proc. of the 1st Intern. Symposium [RT87a] T. Raita and J. Teuhola. Pre- on Database Systems for Ad- dictive test compression by vanced Applications, Seoul, hashing. In Yu and Rijsber- Korea, page ?? ????, ????, gen [YR87], pages 223–233. April 1989. ISBN 0-89791-232-2. LCCN Z 699 A1 I58 1987. US$19. Ramamohanarao:1990:MAH Ruchte:1987:LHP [RSSD90] Kotagiri Ramamohanarao, John Shepherd, and Ron [RT87b] Willard D. Ruchte and Sacks-Davis. Multi-attribute Alan L. Tharp. Linear hashing with multiple file hashing with priority split- copies for high performance ting: a method for im- partial-match retrieval. BIT proving the retrieval perfor- (Nordisk tidskrift for infor- mance of linear hashing. In mationsbehandling), 30(3): ICDE’87 [ICD87], pages 2–9. 404–423, 1990. CODEN BIT- ISBN 0-8186-0762-9. LCCN TEL, NBITAB. ISSN 0006- QA76.9.D3I5582 1987. IEEE 3835 (print), 1572-9125 (elec- Service Cent. Piscataway, tronic). NJ, USA. Ramamohanarao:1992:PRU Ramakrishna:1989:DEH [RSSD92] K. Ramamohanarao, J. Shep- herd, and R. Sacks-Davis. [RT89] M. V. Ramakrishna and Partial-match retrieval using W. R. Tout. Dynamic ex- multiple-key hashing with ternal hashing with guaran- multiple file copies. In Kim teed single access retrieval. et al. [KKP92], pages 250– In Litwin and Schek [LS89], 275. ISBN 981-02-1315- page ?? ISBN 0-387-51295- 8. LCCN QA76.9.D3 D3589 0. LCCN QA76.9.D3 F671 1992. 1989. REFERENCES 417

Rattanaritnont:2012:CTS 540-56413-6 (Berlin). LCCN QA76.9.A25 E964 1992. [RTK12] Geerajit Rattanaritnont, Masashi Ruland:1993:RDS Toyoda, and Masaru Kit- suregawa. Characterizing [Rul93] Christoph Ruland. Re- topic-specific hashtag cas- alizing digital signatures cade in Twitter based on with one-way hash func- distributions of user influ- tions. Cryptologia, 17(3): ence. Lecture Notes in CS, 285–300, July 1993. CO- 7235:735–742, 2012. CO- DEN CRYPE6. ISSN 0161- DEN LNCSD9. ISSN 0302- 1194 (print), 1558-1586 (elec- 9743 (print), 1611-3349 (electronic). URL http://www. tronic). URL http://link. informaworld.com/smpp/ springer.com/content/pdf/ content~content=a748639237~ 10.1007/978-3-642-29253- db=all~order=page. digi- 8_71. tal signatures; one-way hash functions; asymmetric cryp- Ruckert:2015:MSS tographic systems; smart [Ruc15] Martin Ruckert. The MMIX cards; one-time signatures; supplement: supplement to optimally implemented hash The Art of Computer Pro- functions; asymmetric algo- gramming, volumes 1, 2, 3 by rithms; one-bit signatures; Donald E. Knuth. Addison- N-bit signatures; infinite sig- Wesley, Reading, MA, USA, nature trees; performance. 2015. ISBN 0-13-399231-4 Russell:1992:NSC (paperback), 0-13-399289-6. xxi + 193 pp. LCCN QA76.6 [Rus92] Alexander Russell. Neces- .K64 2005 Suppl. 1. URL sary and sufficient conditions http://mmix.cs.hm.edu/. for collision-free hashing. In Brickell [Bri92], pages 433– Rueppel:1993:ACE 441. ISBN 0-387-57340-2 (New York), 3-540-57340-2 [Rue93] Rainer A. Rueppel, edi- (Berlin). LCCN QA76.9.A25 tor. Advances in Cryptology– C79 1992. DM104.00. EUROCRYPT ’92: Work- Russell:1993:NSC shop on the Theory and Ap- plication of Cryptographic [Rus93] A. Y. Russell. Neces- Techniques, Balatonfured, sary and sufficient condi- Hungary, May 24–28, 1992: tions for collision-free hash- Proceedings. Springer-Verlag, ing. Lecture Notes in CS, Berlin, Germany / Heidel- 740:433–441, 1993. CO- berg, Germany / London, DEN LNCSD9. ISSN 0302- UK / etc., 1993. ISBN 0- 9743 (print), 1611-3349 (elec- 387-56413-6 (New York), 3- tronic). REFERENCES 418

Russell:1995:NSC troduction: Geometric hashing. IEEE Computational [Rus95] Alexander Russell. Nec- Science & Engineering, 4(4): essary and suﬃcient condi- 9, October/December 1997. tions for collision-free hash- CODEN ISCEE4. ISSN ing. Journal of Cryptology,8 1070-9924 (print), 1558-190X (2):87–99, Spring 1995. CO- (electronic). URL http: DEN JOCREQ. ISSN 0933- //dlib.computer.org/cs/ 2790 (print), 1432-1378 (elec- books/cs1997/pdf/c4009. tronic). pdf. Ruzic:2008:UDD Ramaswamy:2007:HSP

[Ruˇz08] Milan Ruˇzi´c. Uniform deter- [RW07] Ramaswamy Ramaswamy ministic dictionaries. ACM and Tilman Wolf. High- Transactions on Algorithms, speed preﬁx-preserving IP 4(1):1:1–1:??, March 2008. address anonymization for CODEN ???? ISSN 1549- passive measurement sys- 6325 (print), 1549-6333 (elec- tems. IEEE/ACM Transac- tronic). tions on Networking, 15(1): 26–39, February 2007. CO- Rijmen:2002:PCP DEN IEANEP. ISSN 1063- [RVPV02] V. Rijmen, B. Van Rompay, 6692 (print), 1558-2566 (elec- B. Preneel, and J. Vande- tronic). walle. Producing collisions Reyhanitabar:2007:NIM for PANAMA. Lecture Notes in CS, 2355:37–51, 2002. CO- [RWSN07] Mohammad Reza Reyhan- DEN LNCSD9. ISSN 0302- itabar, Shuhong Wang, and 9743 (print), 1611-3349 (elec- Reihaneh Safavi-Naini. Non- tronic). URL ????. interactive manual channel message authentication Rickman:1973:SIL based on eTCR hash func- [RW73] J. Rickman and W. E. tions. Lecture Notes in CS, Walden. Structures for 4586:385–399, 2007. CO- an interactive on-line the- DEN LNCSD9. ISSN 0302- saurus. International Journal 9743 (print), 1611-3349 (elec- of Computer and Informa- tronic). URL http://link. tion Sciences, 2(2):115–127, springer.com/content/pdf/ June 1973. CODEN IJCIAH. 10.1007/978-3-540-73458- ISSN 0091-7036. 1_28. Rigoutsos:1997:GEI Rabitti:1990:DST

[RW97] Isidore Rigoutsos and Haim J. [RZ90] F. Rabitti and P. Zezula. A Wolfson. Guest Editors’ in- dynamic signature technique REFERENCES 419

for multimedia databases. In Sohrabi:2017:PSS Vidick [Vid90], page 193. ISBN 0-89791-408-2. LCCN [SA17] Mohammad Karim Sohrabi QA76.9.D3I5588 1990, Z 699 and Hosseion Azgomi. Par- A1 I582 1990. allel set similarity join on big data based on Locality- Ramakrishna:1997:PPS Sensitive Hashing. Science of [RZ97] M. V. Ramakrishna and Computer Programming, 145 Justin Zobel. Performance (??):1–12, October 1, 2017. in practice of string hash- CODEN SCPGD4. ISSN ing functions. In Rodney W. 0167-6423 (print), 1872-7964 Topor and Katsumi Tanaka, (electronic). URL http: editors, Database Systems for //www.sciencedirect.com/ Advanced Applications ’97, science/article/pii/S0167642317300813. Proceedings of the Fifth In- Saarinen:2012:CAG ternational Conference on Database Systems for Ad- [Saa12] Markku-Juhani Olavi Saari- vanced Applications (DAS- nen. Cycling attacks FAA), Melbourne, Australia, on GCM, GHASH and April 1–4, 1997,volume6 other polynomial MACs and of Advanced Database Re- hashes. Lecture Notes in CS, search and Development Se- 7549:216–225, 2012. CO- ries, pages 215–224. World DEN LNCSD9. ISSN 0302- Scientiﬁc Publishing Co. Pte. 9743 (print), 1611-3349 (elec- Ltd., P. O. Box 128, Far- tronic). URL http://link. rer Road, Singapore 9128, springer.com/chapter/10. 1997. ISBN 981-02-3107-5, 1007/978-3-642-34047-5_ 981-02-3118-0 (paperback). 13/. LCCN QA76.9.D3 I5565 Sabourin:1994:CCP 1997. URL http://www. worldscientific.com/doi/ [Sab94] Conrad F. Sabourin. Com- abs/10.1142/9789812819536_ putational character process- 0023. ing: character coding, input, output, synthesis, or- Surendro:1997:NRO dering, conversion, text com- [SA97] K. Surendro and Y. An- pression, encryption, display zai. Non-rigid object recog- hashing, literate program- nition using principal com- ming: bibliography. Infolin- ponent analysis and geomet- gua, Montr´eal, PQ, Canada, ric hashing. Lecture Notes in 1994. ISBN 2-921173-18-2. CS, 1296:50–??, 1997. CO- vii + 579 pp. LCCN ???? DEN LNCSD9. ISSN 0302- Sacco:1986:FTE 9743 (print), 1611-3349 (electronic). [Sac86] G. M. Sacco. Fragmentation: REFERENCES 420

a technique for eﬃcient query Salzberg:1988:FS processing. ACM Transac- tions on Database Systems, [Sal88] Betty Salzberg. File Struc- 11(2):113–133, June 1986. tures. Prentice-Hall, Engle- CODEN ATDSD3. ISSN wood Cliﬀs, NJ 07632, USA, 0362-5915 (print), 1557-4644 1988. ISBN 0-13-314691-X. x (electronic). Also published + 342 pp. LCCN QA76.9.F5 in/as: University of Torino, S25 1988. US$36.95. TR., Aug. 1983. Samson:1976:TOA

Sager:1984:NMG [Sam76] W. B. Samson. Testing over- ﬂow algorithms for a table of variable size. The [Sag84] Thomas J. Sager. A new Computer Journal, 19(1): method for generating min- 92, February 1976. CO- imal perfect hashing func- DEN CMPJA6. ISSN tions. Technical Report 0010-4620 (print), 1460-2067 TR CSc-84-15, University of (electronic). URL http: Missouri–Rolla, Rolla, MO, //comjnl.oxfordjournals. USA, November 1984. ?? pp. org/content/19/1/92.full. pdf+html; http://www3. Sager:1985:PTG oup.co.uk/computer_journal/ hdb/Volume_19/Issue_01/ [Sag85a] Thomas J. Sager. A poly- tiff/92.tif. nomial time generator for Samson:1981:HTC minimal perfect hash functions. Communications of [Sam81] W. B. Samson. Hash ta- the Association for Com- ble collision handling on stor- puting Machinery, 28(5): age devices with latency. 523–532, May 1985. CO- The Computer Journal,24 DEN CACMA2. ISSN 0001- (2):130–131, May 1981. CO- 0782 (print), 1557-7317 (elec- DEN CMPJA6. ISSN 0010- tronic). 4620 (print), 1460-2067 (electronic). Sager:1985:TCS Santoro:1976:FTS [Sag85b] Thomas J. Sager. A tech- [San76] Nicola Santoro. Full table nique for creating small fast search by polynomial func- compiler frontends. SIG- tions. Information Pro- PLAN Notices, 20(10):87– cessing Letters, 5(3):72–74, 94, October 1985. CODEN August ??, 1976. CO- SINODQ. ISSN 0362-1340 DEN IFPLAT. ISSN 0020- (print), 1523-2867 (print), 0190 (print), 1872-6119 (elec- 1558-1160 (electronic). tronic). REFERENCES 421

Sarwate:1980:NUC Sarkar:2013:NML

[Sar80] Dilip V. Sarwate. A note [Sar13] Palash Sarkar. A new multi- on: “Universal classes of linear universal hash fam- hash functions” [J. Comput. ily. Designs, Codes, and System Sci. 18 (1979), no. Cryptography, 69(3):351–367, 2, 143–154; MR 80f:68110a December 2013. CODEN ]byJ.L.CarterandM. DCCREC. ISSN 0925- N. Wegman. Information 1022 (print), 1573-7586 (elec- Processing Letters, 10(1):41– tronic). URL http://link. 45, February 1980. CO- springer.com/article/10. DEN IFPLAT. ISSN 0020- 1007/s10623-012-9672-8. 0190 (print), 1872-6119 (elec- Sarkar:2015:FNR tronic). [Sar15] Santanu Sarkar. Further non- Sarkar:2010:SGC randomness in RC4, RC4A and VMPC. Cryptography [Sar10] Palash Sarkar. A simple and and Communications, 7(3): generic construction of au- 317–330, September 2015. thenticated encryption with CODEN ???? ISSN 1936- associated data. ACM Trans- 2447 (print), 1936-2455 (elec- actions on Information and tronic). URL http://link. System Security, 13(4):33:1– springer.com/accesspage/ 33:??, December 2010. CO- article/10.1007/s12095- DEN ATISBQ. ISSN 1094- 014-0119-0. 9224 (print), 1557-7406 (elec- Sasaki:2011:MMP tronic). [Sas11] Yu Sasaki. Meet-in-the- Sarkar:2011:TBC middle preimage attacks on AES hashing modes and [Sar11] Palash Sarkar. A trade-oﬀ an application to Whirlpool. between collision probabil- Lecture Notes in CS, 6733: ity and key size in universal 378–396, 2011. CODEN hashing using polynomials. LNCSD9. ISSN 0302-9743 Designs, Codes, and Cryptog- (print), 1611-3349 (elec- raphy, 58(3):271–278, March tronic). URL http://link. 2011. CODEN DCCREC. springer.com/content/pdf/ ISSN 0925-1022 (print), 10.1007/978-3-642-21702- 1573-7586 (electronic). URL 9_22. http://www.springerlink. Savoy:1990:SBF com/openurl.asp?genre= article&issn=0925-1022& [Sav90] Jacques Savoy. Statistical be- volume=58&issue=3&spage= havior of fast hashing of vari- 271. able length test strings. SI- REFERENCES 422

GIR forum, 24(3):62–??, Fall DEN PTNRA8. ISSN 0031- 1990. CODEN FASRDV. 3203 (print), 1873-5142 (elec- ISSN 0163-5840. tronic). Savoy:1991:NFH Sabharwal:1997:IDN [Sav91] Jacques Savoy. Note on fast [SB97] C. L. Sabharwal and S. K. hashing of variable length Bhatia. Image databases text strings. Communi- and near-perfect hash table. cations of the Association Pattern Recognition, 30(11): for Computing Machinery, 1867–1876, November 1997. 34(11):118–119, November CODEN PTNRA8. ISSN 1991. CODEN CACMA2. 0031-3203 (print), 1873-5142 ISSN 0001-0782 (print), (electronic). 1557-7317 (electronic). Sug- gests an improvement to Shankar:2007:DAI Pearson’s hashing algorithm [SB07] Ajeet Shankar and Rastislav [Pea90] that avoids secondary Bod´ık. DITTO: automatic clustering. Exhibits a key incrementalization of data set for which Pearson’s al- structure invariant checks (in gorithm produces alarming Java). SIGPLAN Notices, clustering. See also comments 42(6):310–319, June 2007. in [Dit91, Lit91, Pea91], and CODEN SINODQ. ISSN early work in [Dit76]. 0362-1340 (print), 1523- Sheﬄer:1993:AHP 2867 (print), 1558-1160 (electronic). [SB93] Thomas J. Sheﬄer and Ran- Saikia:2014:PHF dal E. Bryant. An analysis of hashing on parallel and vec- [SB14] Navajit Saikia and Prabin K. tor computers. In Hariri and Bora. Perceptual hash func- Berra [HB93], pages III.29– tion for scalable video. In- III.36. ISBN 0-8493-8983- ternational Journal of Infor- 6 (set), 0-8493-8984-4 (vol. mation Security, 13(1):81– 1), 0-8493-8985-2 (vol. 2), 0- 93, February 2014. CO- 8493-8986-0 (vol. 3). LCCN DEN ???? ISSN 1615- QA76.58 .I55 1993. 5262 (print), 1615-5270 (electronic). URL http://link. Sabharwal:1995:PHT springer.com/article/10. [SB95] C. L. Sabharwal and S. K. 1007/s10207-013-0211-z. Bhatia. Perfect hash table al- Stevens:2017:AFS gorithm for image databases using negative associated val- [SBK+17] Marc Stevens, Elie Bursztein, ues. Pattern Recognition, Pierre Karpman, Ange Al- 28(7):1091–??, 1995. CO- bertini, Yarik Markov, Alex Pe- REFERENCES 423

tit Bianco, and Clement Shekita:1990:PEPa Baisse. Announcing the first SHA1 collision. Web [SC90b] Eugene J. Shekita and report, February 23, 2017. Michael J. Carey. A perfor- URL https://security. mance evaluation of pointer- googleblog.com/2017/02/ based joins. Technical Re- announcing-first-sha1- port TR 916, Computer Sci- collision.html. ences Department, Univer- sity of Wisconsin–Madison, Scolari:2016:SCP March 1990. ?? pp. [SBS16] Alberto Scolari, Davide Basilio Shekita:1990:PEPc Bartolini, and Marco Domenico Santambrogio. A software [SC90c] Eugene J. Shekita and cache partitioning system for Michael J. Carey. A perfor- hash-based caches. ACM mance evaluation of pointer- Transactions on Architec- based joins. SIGMOD Record ture and Code Optimization, (ACM Special Interest Group 13(4):57:1–57:??, December on Management of Data),19 2016. CODEN ???? ISSN (2):300–311, June 1990. CO- 1544-3566 (print), 1544-3973 DEN SRECD8. ISSN 0163- (electronic). 5808 (print), 1943-5835 (electronic). URL http://www. Sprague:1977:PTH acm.org/pubs/articles/ proceedings/mod/93597/ [SC77] Ralph H. Sprague and p300-shekita/p300-shekita. R. Chattergy, editors. Pro- pdf; http://www.acm. ceedings of the Tenth Hawaii org/pubs/citations/proceedings/ International Conference on mod/93597/p300-shekita/. System Sciences, Supple- ment: Selected Papers in Schauer:1976:PA Management Information Systems. Western Periodicals [Sch76] Helmut Schauer. Pascal für Co.,, North Hollywood, CA, Anfänger. R. Oldenbourg 1977. LCCN ?? Verlag, Munich, Germany and Vienna, Austria, 1976. Shekita:1990:PEPb ISBN 3-7029-0091-8. 175 pp. [SC90a] E. J. Shekita and M. J. Scheuermann:1979:OHH Carey. A performance evaluation of pointer-based joins. [Sch79a] Peter Scheuermann. Over- In Garcia-Molina and Ja- flow handling in hashing ta- gadish [GMJ90], page ?? bles: a hybrid approach. In- ISBN 0-89791-365-5. LCCN formation system, 4(3):183– QA 76.9 D3 S53 v.19 no.2 194, ???? 1979. CO- 1990. DEN INSYD6. ISSN 0306- REFERENCES 424

4379 (print), 1873-6076 (elec- Schmidt:1990:GPH tronic). [Sch90a] Douglas C. Schmidt. GPERF: Scholl:1979:PAN a perfect hash function gen- [Sch79b] M. Scholl. Performance anal- erator. In USENIX-C++’90 ysis of new file organiza- [USE90], pages 87–101. tions based on dynamic hash- Schneider:1990:CQP coding. Technical report, ????, Le Chesnay, France, [Sch90b] Donovan A. Schneider. Com- March 1979. ?? pp. plex query processing in Scholl:1981:NFO multiprocessor database machines. Technical Report TR [Sch81] Michel Scholl. New file orga- 965, University of Wisconsin, nizations based on dynamic September 1990. ?? pp. hashing. ACM Transactions on Database Systems, 6(1): Schneier:1991:OWH 194–211, March 1981. CO- [Sch91a] Bruce Schneier. One-way DEN ATDSD3. ISSN 0362- hash functions: Probabilis- 5915 (print), 1557-4644 (elec- tic algorithms can be used tronic). for general-purpose pattern Scheuermann:1982:PSI matching. Dr. Dobbs Jour- nal, 16(9):148–151, Septem- [Sch82a] P. Scheuermann, editor. In- ber 1, 1991. CODEN ternational Conference on DDJOEB. ISSN 1044-789X. Databases: Improving Us- ability and Responsiveness Schnorr:1991:FHE (2nd: 1982: Hebrew Univer- sity of Jerusalem), Jerusalem, [Sch91b] C. P. Schnorr. FFT-hashing, an efficient cryptographic Israel, June 22–24, 1982. Academic Press, New York, hash function. In Feigen- baum [Fei91], page ?? ISBN NY, USA, 1982. ISBN 0-12- 624080-9. LCCN QA76.9.D3 0-387-55188-3 (New York), 3- .I558 1982. US$34.00. 540-55188-3 (Berlin). LCCN QA76.9.A25 C79 1991. Schmitt:1982:CPF Schnorr:1993:FHIa [Sch82b] Alfred Schmitt. On the computational power of the [Sch93a] C. P. Schnorr. FFT-hash II, floor function. Information efficient cryptographic hash- Processing Letters, 14(1):1– ing. In Rueppel [Rue93], 3, March 27, 1982. CO- pages 41–51. ISBN 0-387- DEN IFPLAT. ISSN 0020- 56413-6 (New York), 3-540- 0190 (print), 1872-6119 (elec- 56413-6 (Berlin). LCCN tronic). QA76.9.A25 E964 1992. REFERENCES 425

Schnorr:1993:FHIb Notes in CS, 2178:257–??, 2001. CODEN LNCSD9. [Sch93b] C. P. Schnorr. FFT-hash ISSN 0302-9743 (print), II, efficient cryptographic 1611-3349 (electronic). URL hashing. Lecture Notes in http://link.springer-ny. CS, 658:45–54, 1993. CO- com/link/service/series/ DEN LNCSD9. ISSN 0302- 0558/bibs/2178/21780257. 9743 (print), 1611-3349 (elec- htm; http://link.springer- tronic). ny.com/link/service/series/ 0558/papers/2178/21780257. Schnorr:1993:FIE pdf. [Sch93c] C. P. Schnorr. FFT-hash Schlaffer:2011:SDR II, efficient cryptographic hashing. Lecture Notes in [Sch11] Martin Schläffer. Subspace CS, 658:45–54, 1993. CO- distinguisher for 5/8 rounds DEN LNCSD9. ISSN 0302- of the ECHO-256 hash func- 9743 (print), 1611-3349 (elec- tion. Lecture Notes in CS, tronic). 6544:369–387, 2011. CO- DEN LNCSD9. ISSN 0302- Scharinger:2001:CDD 9743 (print), 1611-3349 (elec- [Sch01a] J. Scharinger. Construc- tronic). URL http://link. tion of data dependent springer.com/content/pdf/ chaotic permutation hashes 10.1007/978-3-642-19574- to ensure communications 7_25. integrity. Lecture Notes Severance:1976:PGA in CS, 2094:196–??, 2001. CODEN LNCSD9. ISSN [SD76] D. G. Severance and R. A. 0302-9743 (print), 1611- Duhne. A practitioner’s 3349 (electronic). URL guide to addressing algo- http://link.springer-ny. rithms. Communications of com/link/service/series/ the Association for Com- 0558/bibs/2094/20940196. puting Machinery, 19(6): htm; http://link.springer- 314–326, June 1976. CO- ny.com/link/service/series/ DEN CACMA2. ISSN 0001- 0558/papers/2094/20940196. 0782 (print), 1557-7317 (elec- pdf. tronic). Scharinger:2001:ASK Samson:1978:STU

[Sch01b] Josef Scharinger. Application [SD78] W. B. Samson and R. H. of signed Kolmogorov hashes Davis. Search times us- to provide integrity and au- ing hash tables for records thenticity in Web-based soft- with non-unique keys. The ware distribution. Lecture Computer Journal, 21(3): REFERENCES 426

210–214, August 1978. CO- Schneider:1989:PEFa DEN CMPJA6. ISSN 0010- 4620 (print), 1460-2067 (elec- [SD89c] Donovan A. Schneider and tronic). David J. DeWitt. A performance evaluation of four Sacks-Davis:1985:PMK parallel join algorithms in a shared-nothing multiproces- [SD85] Ron Sacks-Davis. Perfor- sor environment. Technical mance of a multi-key access Report TR 836, University of method based on descrip- Wisconsin, April 1989. ?? torsandsuperimposedcod- pp. ing techniques. Information system, 10(4):391–403, 1985. Schneider:1989:PEFb CODEN INSYD6. ISSN 0306-4379 (print), 1873-6076 [SD89d] Donovan A. Schneider and (electronic). Hashing algo- David J. DeWitt. A per- rithm used to create descrip- formance evaluation of four tors for file indexing; this parallel join algorithms in extends the author’s earlier a shared-nothing multipro- work [SDR83b]. cessor environment. SIG- MOD Record (ACM Spe- Schneider:1989:PEFc cial Interest Group on Man- agement of Data), 18(2): [SD89a] D. Schneider and D. DeWitt. 110–121, June 1989. CO- A performance evaluation of DEN SRECD8. ISSN 0163- four parallel join algorithms 5808 (print), 1943-5835 (elec- in a shared-nothing multipro- tronic). URL http://www. cessor environment. In Clif- acm.org/pubs/articles/ ford et al. [CLM89], page 110. proceedings/mod/67544/ ISBN 0-89791-317-5. LCCN p110-schneider/p110-schneider. QA 76.9 D3 S53 v.18 no.2 pdf; http://www.acm. 1989. org/pubs/citations/proceedings/ Schneider:1989:DTA mod/67544/p110-schneider/ . Also published in [CLM89]. [SD89b] Donovan Schneider and David J. DeWitt. De- Schneider:1990:TPCb sign tradeoffs of alternative query tree representations for [SD90a] D. Schneider and D. DeWitt. multiprocessor database ma- Tradeoffs in processing com- chines. Technical Report plex join queries via hashing TR 869, Computer Sciences in multiprocessor database Department, University of machines. In McLeod et al. Wisconsin–Madison, August [MSDS90], page 469. ISBN 1989. ?? pp. 1-55860-149-X. LCCN ??? REFERENCES 427

Schneider:1990:TPCa Shih:1991:CDC

[SD90b] Donovan Schneider and [SDK91] C.-S. Shih, A. Dan, and David J. DeWitt. Trade- W. H. Kohler. Compar- oﬀs in processing complex ison of distributed concur- join queries via hashing in rency control protocols on a multiprocessor database ma- distributed database testbed. chines. Technical Report TR Technical Report COINS TR 930, University of Wisconsin, 91-13, University of Mas- April 1990. ?? pp. sachusetts, 1991. ?? pp.

Stern:1995:IPV Sacks-Davis:1987:MAM [SDKR87] R. Sacks-Davis, A. Kent, and [SD95] U. Stern and D. L. Dill. K. Ramamohanarao. Multi- Improved probabilistic verifi- key access methods based on cation by hash compaction. superimposed coding tech- In Camurati and Eveking niques. ACM Transactions [CE95], pages 206–224. ISBN on Database Systems,12 3-540-60385-9. ISSN 0302- (4):655–696, December 1987. 9743 (print), 1611-3349 (elec- CODEN ATDSD3. ISSN tronic). LCCN TK7874.75 0362-5915 (print), 1557-4644 .A39 1995. (electronic). ACM:1990:PFA Sajadieh:2012:RDL [SDA90] Proceedings of the First [SDMS12] Mahdi Sajadieh, Mohammad Annual ACM-SIAM Sym- Dakhilalian, Hamid Mala, posium on Discrete Algo- and Pouyan Sepehrdad. Re- rithms. Society for Industrial cursive diffusion layers for and Applied Mathematics, block ciphers and hash func- Philadelphia, PA, USA, 1990. tions. Lecture Notes in CS, ISBN 0-89871-251-3. LCCN 7549:385–401, 2012. CO- QA76.6 .A278 1990. DEN LNCSD9. ISSN 0302- ACM:1991:PSA 9743 (print), 1611-3349 (electronic). URL http://link. [SDA91] Proceedings of the Second springer.com/content/pdf/ Annual ACM-SIAM Sym- 10.1007/978-3-642-34047- posium on Discrete Algo- 5_22. rithms. Society for Industrial Sajadieh:2015:ERD and Applied Mathematics, Philadelphia, PA, USA, 1991. [SDMS15] Mahdi Sajadieh, Mohammad LCCN QA76.9.A43 A34 199. Dakhilalian, Hamid Mala, Symposium held Jan. 28– and Pouyan Sepehrdad. Effi- 30, 1991, San Francisco, CA, cient recursive diffusion lay- USA. ers for block ciphers and REFERENCES 428

hash functions. Journal Schellhorn:2014:SCP of Cryptology, 28(2):240– 256, April 2015. CO- [SDW14] Gerhard Schellhorn, John DEN JOCREQ. ISSN 0933- Derrick, and Heike Wehrheim. 2790 (print), 1432-1378 (elec- A sound and complete proof tronic). URL http://link. technique for linearizability springer.com/article/10. of concurrent data struc- 1007/s00145-013-9163-8. tures. ACM Transactions on Computational Logic,15 Sacks-Davis:1983:ILH (4):31:1–31:??, September 2014. CODEN ???? ISSN [SDR83a] R. Sacks-Davis and K. Ra- 1529-3785 (print), 1557-945X mamohanarao. Implemen- (electronic). tation of linear hashing schemes. In Barter [Bar83], Spirovska:2021:OCC pages 27:1–27:10. Published as Australian Computer Sci- ence Communications; vol 6, [SDZ21] K. Spirovska, D. Didona, and no. 1. W. Zwaenepoel. Optimistic causal consistency for geo- Sacks-Davis:1983:TLS replicated key–value stores. IEEE Transactions on Paral- [SDR83b] R. Sacks-Davis and K. Ra- lel and Distributed Systems, mamohanarao. A two level 32(3):527–542, March 2021. superimposed coding scheme CODEN ITDSEO. ISSN for partial match retrieval. 1045-9219 (print), 1558-2183 Information system, 8(4): (electronic). 273–280, 1983. CODEN INSYD6. ISSN 0306-4379 Smith:1989:ITD (print), 1873-6076 (electronic). See [SD85]. [SE89] F. J. Smith and L. C. Emer- son. Indexing technical data Sorenson:1975:DDH in a materials database. In Second International Confer- [SDT75] P. G. Sorenson, R. F. ence on Data and Knowl- Deutscher, and J. P. Trem- edge Systems for Manu- blay. Distribution-dependent facturing and Engineering hashing functions and their (Oct 16–18 1989: Gaithers- characteristics. In 19 ACM burg, MD, USA), pages 12– SIGMOD Conf. on the Man- 18. IEEE Computer Society agement of Data, King(ed), Press, 1109 Spring Street, page ?? ACM Press, New Suite 300, Silver Spring, MD York, NY 10036, USA, May 20910, USA, 1989. IEEE cat- 1975. alog number 89CH2806-8. REFERENCES 429

Shafieinejad:2021:SPQ Sedgewick:1990:AC [SE21] Masoumeh Shafieinejad and [Sed90] Robert Sedgewick. Algo- Navid Nasr Esfahani. A rithms in C. Addison-Wesley, scalable post-quantum hash- Reading, MA, USA, 1990. based group signature. De- ISBN 0-201-51425-7. xii + signs, Codes, and Cryp- 657 pp. LCCN QA76.73.C15 tography, 89(5):1061–1090, S43 1990. May 2021. CODEN DC- Sedgewick:1992:AC CREC. ISSN 0925-1022 (print), 1573-7586 (elec- [Sed92] Robert Sedgewick. Algo- tronic). URL https://link. rithms in C++. Addison- springer.com/article/10. Wesley, Reading, MA, USA, 1007/s10623-021-00857-9. 1992. ISBN 0-201-36118-3, 0-201-51059-6. xiv + 656 Sedgewick:1983:MAC pp. LCCN QA76.73.C153 [Sed83a] R. Sedgewick. Part III. math- S38 1992. ematical analysis of combina- Sedgewick:1993:AM torial algorithms. In Proba- bility Theory and Computer [Sed93] Robert Sedgewick. Algo- Science [LL83], page Part rithms in Modula-3.Ad- III. Mathematical analysis dison-Wesley, Reading, MA, of combinatorial algorithm. USA, 1993. ISBN 0-201- ISBN 0-12-455820-8. LCCN 53351-0. xiv + 656 pp. LCCN QA274 .P76 1983. Analysis QA76.73.M63 S43 1993. of hashing with linear prob- Severance:1974:ISM ing. [Sev74] Dennis G. Severance. Iden- Sedgewick:1983:A tifier search mechanisms: [Sed83b] Robert Sedgewick. Algo- a survey and generalized rithms. Addison-Wesley, model. ACM Comput- Reading, MA, USA, 1983. ing Surveys, 6(3):175–194, ISBN 0-201-06672-6. viii + September 1974. CODEN 551 pp. LCCN QA76.6 .S435 CMSVAN. ISSN 0360- 1983. 0300 (print), 1557-7341 (electronic). Sedgewick:1988:A Scott:1988:SMT [Sed88] Robert Sedgewick. Algo- rithms. Addison-Wesley, [SF88] Michael L. Scott and Raphael A. Reading, MA, USA, second Finkel. A simple mech- edition, 1988. ISBN 0-201- anism for type security 06673-4. xii + 657 pp. across compilation units. LCCN QA76.6 .S435 1988. IEEE Transactions on Soft- US$34.95. ware Engineering, 14(8): REFERENCES 430

1238–1239, August 1988. tion Processing Letters,5 CODEN IESEDJ. ISSN (2):31–34, 1976. CODEN 0098-5589 (print), 1939-3520 IFPLAT. ISSN 0020-0190 (electronic). URL http: (print), 1872-6119 (elec- //ieeexplore.ieee.org/ tronic). stamp/stamp.jsp?arnumber= Shneiderman:1976:BSS 7631. Sherkat:2019:NSE [SG76b] Ben Shneiderman and Victor Goodman. Batched search- [SFA+19] Reza Sherkat, Colin Flo- ing of sequential and tree rendo, Mihnea Andrei, Rolando structured ﬁles. ACM Trans- Blanco, Adrian Dragusanu, actions on Database Sys- Amit Pathak, Pushkar Khadilkar, tems, 1(3):268–275, Septem- Neeraj Kulkarni, Christian ber 1976. CODEN ATDSD3. Lemke, Sebastian Seifert, ISSN 0362-5915 (print), Sarika Iyer, Sasikanth Got- 1557-4644 (electronic). URL tapu, Robert Schulze, Chai- http://www.acm.org/pubs/ tanya Gottipati, Nirvik articles/journals/tods/ Basak, Yanhong Wang, 1976-1-3/p268-shneiderman/ Vivek Kandiyanallur, San- p268-shneiderman.pdf; tosh Pendap, Dheren Gala, http://www.acm.org/pubs/ Rajesh Almeida, and Pras- citations/journals/tods/ anta Ghosh. Native store ex- 1976-1-3/p268-shneiderman/ tension for SAP HANA. Pro- . See comments in [Piw85]. ceedings of the VLDB En- Also published in/as: In- dowment, 12(12):2047–2058, diana Un., CSD Tech. Ref. August 2019. CODEN ???? 0132. ISSN 2150-8097. Shasha:1988:CSS Simon:1972:APN [SG88] Dennis Shasha and Nathan [SG72] J. C. Simon and G. Guiho. Goodman. Concurrent On algorithms preserving search structure algorithms. neighborhood, to ﬁle and re- ACM Transactions on Database trieve information in a mem- Systems, 13(1):53–90, March ory. International Journal of 1988. CODEN ATDSD3. Computer and Information ISSN 0362-5915 (print), Sciences, 1(1):3–15, March 1557-4644 (electronic). URL 1972. CODEN IJCIAH. http://www.acm.org/pubs/ ISSN 0091-7036. articles/journals/tods/ Sassa:1976:HMF 1988-13-1/p53-shasha/p53- shasha.pdf; http://www. [SG76a] M. Sassa and E. Goto. A acm.org/pubs/citations/ hashing method for fast journals/tods/1988-13- set operations. Informa- 1/p53-shasha/; http:/ REFERENCES 431

/www.acm.org/pubs/toc/ (print), 1943-5843 (elec- Abstracts/tods/42204.html. tronic). Shangguan:2016:SHF Shaolan:2011:EDE

[SG16] Chong Shangguan and Gen- [SGY11] Zhang Shaolan, Xing Guobo, nian Ge. Separating hash and Yang Yixian. An eﬃcient families: a Johnson-type domain extension to con- bound and new construc- struct a cryptographic hash tions. SIAM Journal on function. In IEEE [IEE11a], Discrete Mathematics, 30(4): pages 424–427. ISBN 0- 2243–2264, ???? 2016. CO- 7695-4353-7, 1-61284-289-5. DEN SJDMEC. ISSN 0895- LCCN ???? URL http: 4801 (print), 1095-7146 (elec- //ieeexplore.ieee.org/ tronic). servlet/opac?punumber= 5750113. Steinwandt:2000:WHS Seiden:1992:FSO [SGGB00] Rainer Steinwandt, Markus Grassl, Willi Geiselmann, [SH92] Steven S. Seiden and Daniel S. and Thomas Beth. Weak- Hirschberg. Finding succinct ordered minimal perfect nesses in the SL2(F2n )hashing scheme. In Bellare hashing functions. Techni- [Bel00], pages 287–299. ISBN cal Report TR 92-23, Infor- 3-540-67907-3. ISSN 0302- mation and Computer Sci- 9743 (print), 1611-3349 (elec- ence, University of Califor- tronic). LCCN QA76.9.A25 nia, Irvine, 1992. 10 pp. C79 2000 Bar. URL Seiden:1994:FSO http://link.springer-ny. com/link/service/series/ [SH94] Steven S. Seiden and Daniel S. 0558/bibs/1880/18800287. Hirschberg. Finding succinct htm; http://link.springer- ordered minimal perfect hash ny.com/link/service/series/ functions. Information Pro- 0558/papers/1880/18800287. cessing Letters, 51(6):283– pdf. 288, September 26, 1994. CODEN IFPLAT. ISSN Sharma:2009:DAC 0020-0190 (print), 1872-6119 [SGK09] Arun Sharma, P. S. Grover, (electronic). and Rajesh Kumar. Depen- Shapiro:1986:JPD dency analysis for component- based software systems. [Sha86] L. D. Shapiro. Join pro- ACM SIGSOFT Software cessing in database sys- Engineering Notes, 34(4): tems with large main mem- 1–6, July 2009. CODEN ories. ACM Transactions SFENDP. ISSN 0163-5948 on Database Systems, 11(3): REFERENCES 432

239–264, September 1986. Science Education), 38(3): CODEN ATDSD3. ISSN 344, September 2006. CO- 0362-5915 (print), 1557-4644 DEN SIGSD3. ISSN 0097- (electronic). 8418 (print), 2331-3927 (electronic). Smith:1997:EHF Shemanske:2017:MCE [SHA97] Bradley J. Smith, Gregory L. Heileman, and Chaouki Ab- [She17] Thomas R. Shemanske. Mod- dallah. The exponential ern Cryptography and El- hash function. ACM Jour- liptic Curves: a Begin- nal of Experimental Algorith- ner’s Guide,volume83 mics, 2:3:1–3:??, ???? 1997. of Student mathematical li- ISSN 1084-6654. brary.AmericanMathe- Sheil:1978:MST matical Society, Providence, RI, USA, 2017. ISBN 1- [She78] B. A. Sheil. Median split 4704-3582-9, 1-4704-4123-3 trees: a fast lookup tech- (e-book). xii + 250 pp. nique for frequently occur- LCCN QA567.2.E44 S534 ring keys. Communications 2017. URL http://public. of the Association for Com- ebookcentral.proquest. puting Machinery, 21(11): com/choice/publicfullrecord. 947–958, November 1978. aspx?p=4940250. CODEN CACMA2. ISSN Sun:2017:CMC 0001-0782 (print), 1557-7317 (electronic). Early work on [SHF+17] Yuanyuan Sun, Yu Hua, Dan minimal perfect hash func- Feng, Ling Yang, Pengfei tions. Zuo, Shunde Cao, and Shekita:1991:HPF Yuncheng Guo. A collision- mitigation cuckoo hashing [She91] Eugene Shekita. High-perfor- scheme for large-scale stor- mance implementation tech- age systems. IEEE Trans- niques for next-generation actions on Parallel and Dis- database systems. Techni- tributed Systems, 28(3):619– cal Report TR 1026, Com- 632, March 2017. CO- puter Sciences Department, DEN ITDSEO. ISSN 1045- University of Wisconsin– 9219 (print), 1558-2183 (elec- Madison, May 1991. ?? pp. tronic). URL https://www. Sher:2006:MDS computer.org/csdl/trans/ td/2017/03/07523403-abs. [She06] David B. Sher. Motivating html. data structures with caching Shim:2017:PME Internet stock data. SIGCSE Bulletin (ACM Special In- [Shi17] Hyotaek Shim. PHash: terest Group on Computer a memory-eﬃcient, high- REFERENCES 433

performance key-value store sition theorem for universal for large-scale data-intensive one-way hash functions. Lec- applications. The Journal of ture Notes in CS, 1807:445– Systems and Software, 123 ??, 2000. CODEN LNCSD9. (??):33–44, January 2017. ISSN 0302-9743 (print), CODEN JSSODM. ISSN 1611-3349 (electronic). URL 0164-1212 (print), 1873-1228 http://link.springer-ny. (electronic). URL http: com/link/service/series/ //www.sciencedirect.com/ 0558/bibs/1807/18070445. science/article/pii/S0164121216301959. htm; http://link.springer- ny.com/link/service/series/ Shmoys:2000:PAA 0558/papers/1807/18070445. [Shm00] David Editor Shmoys, ed- pdf. itor. Proceedings of the 11th Annual ACM–SIAM Shoup:2000:UHF Symposium on Discrete Al- [Sho00b] Victor Shoup. Using gorithms, San Francisco, hash functions as a hedge California, January 9–11, against chosen ciphertext at- 2000, volume 101 of Proceed- tack. Lecture Notes in CS, ings in Applied Mathemat- 1807:275–??, 2000. CO- ics Ser. Society for Indus- DEN LNCSD9. ISSN trial and Applied Mathemat- 0302-9743 (print), 1611- ics, Philadelphia, PA, USA, 3349 (electronic). URL 2000. ISBN 0-89871-453-2. http://link.springer-ny. LCCN QA76.6 .A278 2000. com/link/service/series/ URL http://encompass. 0558/bibs/1807/18070275. library.cornell.edu/cgi- htm; http://link.springer- bin/checkIP.cgi?access= ny.com/link/service/series/ gateway\_standard\%26url= 0558/papers/1807/18070275. http://dl.acm.org/citation. pdf. cfm?id=338219. Shoup:1996:FPS Shoup:2005:ACC [Sho96] V. Shoup. On fast and prov- [Sho05] Victor Shoup, editor. Ad- ably secure message authen- vances in cryptology: CRYPTO tication based on universal 2005: 25th Annual Inter- hashing. Lecture Notes in national Cryptology Confer- CS, 1109:313–??, ???? 1996. ence, Santa Barbara, Cal- CODEN LNCSD9. ISSN ifornia, USA, August 14– 0302-9743 (print), 1611-3349 18, 2005: proceedings,vol- (electronic). ume 3621 of Lecture Notes in Computer Science. Spring- Shoup:2000:CTU er-Verlag, Berlin, Germany / [Sho00a] Victor Shoup. A compo- Heidelberg, Germany / Lon- REFERENCES 434

don, UK / etc., 2005. ISBN Sockut:2009:ORD 3-540-28114-2. ISSN 0302- 9743 (print), 1611-3349 (elec- [SI09] Gary H. Sockut and Balakr- tronic). LCCN QA76.9.A25 ishna R. Iyer. Online reorga- C79 2005; QA76.9 .A25; nization of databases. ACM QA76.9 C79 2005; QA76.9 Computing Surveys, 41(3): C794 2005; QA76.9; In- 14:1–14:136, July 2009. CO- ternet. URL http:/ DEN CMSVAN. ISSN 0360- /www.springerlink.com/ 0300 (print), 1557-7341 (elec- openurl.asp?genre=issue& tronic). issn=0302-9743&volume= Siegel:1989:UCF 3621. [Sie89] Alan Siegel. On universal Starzetz:2009:HBC classes of fast high performance hash functions, their [SHRD09] Paul Starzetz, Martin Heusse, time-space tradeoff, and their Franck Rousseau, and An- applications. In IEEE- drzej Duda. Hashing backoff: FOCS’89 [IEE89], pages 20– a collision-free wireless access 25. CODEN ASFPDV. ISBN method. Lecture Notes in 0-8186-1982-1 (hardcover), CS, 5550:429–441, 2009. CO- 0-8186-5982-3 (microfiche). DEN LNCSD9. ISSN 0302- ISSN 0272-5428. LCCN 9743 (print), 1611-3349 (elec- ???? IEEE catalog number tronic). URL http://link. 89CH2808-4. springer.com/content/pdf/ Siegel:2004:UCE 10.1007/978-3-642-01399- 7_34. [Sie04] Alan Siegel. On universal classes of extremely Shen:2020:VRS random constant-time hash functions. SIAM Jour- [SHZ+20] Ling Shen, Richang Hong, nal on Computing, 33(3): Haoran Zhang, Xinmei Tian, 505–543, June 2004. CO- and Meng Wang. Video DEN SMJCAT. ISSN 0097- retrieval with similarity- 5397 (print), 1095-7111 (elec- preserving deep temporal tronic). URL http:// hashing. ACM Transactions epubs.siam.org/sam-bin/ on Multimedia Computing, dbq/article/38621. Communications, and Ap- Silverstein:2002:JIS plications, 15(4):1–16, Jan- uary 2020. ISSN 1551- [Sil02a] Alan Silverstein. Judy IV 6857 (print), 1551-6865 (elec- Shop Manual. Hewlett– tronic). URL https://dl. Packard Corporation, ????, acm.org/doi/abs/10.1145/ August 5, 2002. URL http: 3356316. //judy.sourceforge.net/; REFERENCES 435

http://judy.sourceforge. Shintani:1998:MAS net/doc/shop_interm.pdf. [SK98] T. Shintani and M. Kitsure- Silverstein:2002:PPH gawa. Mining algorithms [Sil02b] Craig Silverstein. A practical for sequential patterns in perfect hashing algorithm. In parallel: Hash based ap- Goldwasser et al. [GJM02], proach. Lecture Notes in pages xi + 256. ISBN 0-8218- CS, 1394:283–294, 1998. CO- 2892-4 (hardcover). LCCN DEN LNCSD9. ISSN 0302- QA76.9.D35 D385 2002. 9743 (print), 1611-3349 (electronic). Simon:1998:FCO Schneier:1999:SAL [Sim98] Daniel R. Simon. Find- ing collisions on a one-way [SK99] Bruce Schneier and John street: Can secure hash func- Kelsey. Secure audit logs to tions be based on general as- support computer forensics. sumptions? Lecture Notes ACM Transactions on Infor- in CS, 1403:334–??, 1998. mation and System Security, CODEN LNCSD9. ISSN 2(2):159–176, May 1999. CO- 0302-9743 (print), 1611- DEN ATISBQ. ISSN 1094- 3349 (electronic). URL 9224 (print), 1557-7406 (elec- http://link.springer-ny. tronic). URL http://www. com/link/service/series/ acm.org/pubs/citations/ 0558/bibs/1403/14030334. journals/tissec/1999-2- htm; http://link.springer- 2/p159-schneier/. ny.com/link/service/series/ 0558/papers/1403/14030334. Sklavos:2005:ISH pdf.

Sakti:1988:GPP [SK05] N. Sklavos and O. Koufopavlou. Implementation of the SHA- [SK88] Pramanik Sakti and My- 2 hash family standard us- oung Ho Kim. General- ing FPGAs. The Jour- ized parallel processing mod- nal of Supercomputing,31 els for database systems. (3):227–248, March 2005. Proceedings of the Interna- CODEN JOSUED. ISSN tional Conference on Paral- 0920-8542 (print), 1573- lel Processing, 3:76–83, 1988. 0484 (electronic). URL CODEN PCPADL. ISSN http://www.springerlink. 0190-3918. Available from com/openurl.asp?genre= IEEE Service Cent (catalog article&issn=0920-8542& number 88CH2625-2). Pis- volume=31&issue=3&spage= cataway, NJ, USA. 227. REFERENCES 436

S:2020:SPE Kobayashi, and Hikaru Morita. Efficient sealed- [SK20] Ajish S. and K. S. Anil bid auction using hash Kumar. Security and per- chain. Lecture Notes in formance enhancement of CS, 2015:183–??, 2001. CO- fingerprint biometric tem- DEN LNCSD9. ISSN plate using symmetric hash- 0302-9743 (print), 1611- ing. Computers and Secu- 3349 (electronic). URL rity, 90(??):Article 101714, http://link.springer-ny. March 2020. CODEN com/link/service/series/ CPSEDU. ISSN 0167- 0558/bibs/2015/20150183. 4048 (print), 1872-6208 (elec- htm; http://link.springer- tronic). URL http:/ ny.com/link/service/series/ /www.sciencedirect.com/ 0558/papers/2015/20150183. science/article/pii/S016740482030002X. pdf. Sohn:2007:DDI Stevens:2015:FCF [SKC07] Andrew Sohn, Hukeun Kwak, and Kyusik Chung. DISH [SKP15] Marc Stevens, Pierre Karp- — Dynamic Information- man, and Thomas Peyrin. Based Scalable Hashing on Freestart collision on full a cluster of Web cache SHA-1. Cryptology ePrint servers. Lecture Notes in Archive, Report 2015/967., CS, 4782:785–796, 2007. CO- 2015. URL https:// DEN LNCSD9. ISSN 0302- eprint.iacr.org/2015/967. 9743 (print), 1611-3349 (electronic). URL http://link. springer.com/content/pdf/ Shang:1988:DCP 10.1007/978-3-540-75444- 2_73. [SL88] C. C. Shang and C. H. Lin. On the difficulty of Schuhknecht:2015:SDS constructing perfect hashing [SKD15] Felix Martin Schuhknecht, functions. In IEEE 1988 Pankaj Khanchandani, and International Symposium on Jens Dittrich. On the surpris- Information Theory — Ab- ing difficulty of simple things: stracts of papers,volume25n the case of radix partitioning. 13, pages 241–?? IEEE Com- Proceedings of the VLDB En- puter Society Press, 1109 dowment, 8(9):934–937, May Spring Street, Suite 300, 2015. CODEN ???? ISSN Silver Spring, MD 20910, 2150-8097. USA, 1988. Available from Suzuki:2001:ESB IEEE Service Cent (catalog number 88CH2621-1). Pis- [SKM01] Koutarou Suzuki, Kunio cataway, NJ, USA. REFERENCES 437

Shahzad:2016:AEP Shin:1994:NJA

[SL16] Muhammad Shahzad and [SM94] Dong Keun Shin and Arnold Charles Alex X. Liu. Accurate Meltzer. A new join al- and eﬃcient per-ﬂow la- gorithm. SIGMOD Record tency measurement without (ACM Special Interest Group probing and time stamp- on Management of Data),23 ing. IEEE/ACM Transac- (4):13–18, December 1994. tions on Networking, 24(6): CODEN SRECD8. ISSN 3477–3492, December 2016. 0163-5808 (print), 1943-5835 CODEN IEANEP. ISSN (electronic). 1063-6692 (print), 1558-2566 Sit:2002:SCP (electronic). [SM02] Emil Sit and Robert Mor- Schweller:2007:RSE ris. Security considerations for peer-to-peer distributed [SLC+07] Robert Schweller, Zhichun hash tables. Lecture Notes Li, Yan Chen, Yan Gao, in CS, 2429:261–??, 2002. Ashish Gupta, Yin Zhang, CODEN LNCSD9. ISSN Peter A. Dinda, Ming-Yang 0302-9743 (print), 1611-3349 Kao, and Gokhan Memik. (electronic). URL http: Reversible sketches: en- //link.springer.de/link/ abling monitoring and anal- service/series/0558/bibs/ ysis over high-speed data 2429/24290261.htm; http: streams. IEEE/ACM Trans- //link.springer.de/link/ actions on Networking,15 service/series/0558/papers/ (5):1059–1072, October 2007. 2429/24290261.pdf. CODEN IEANEP. ISSN Storer:2008:DDC 1063-6692 (print), 1558-2566 (electronic). [SM08] James A. (James Andrew) Storer and Michael W. Mar- Shultz:1987:TSM cellin, editors. DCC 2008: 2008 Data Compression Con- [SM87] R. Shultz and I. Miller. Tree ference: March 25–27, 2008, structured multiple processor Snowbird, Utah: proceed- join methods. In Proceedings ings. IEEE Computer Soci- of the International Confer- ety Press, 1109 Spring Street, ence on Data Engineering, Suite 300, Silver Spring, MD pages 190–199. IEEE Com- 20910, USA, 2008. ISBN puter Society, IEEE Com- 0-7695-3121-0. ISSN 1068- puter Society Press, 1109 0314. LCCN QA76.9.D33 Spring Street, Suite 300, Sil- D372 2008; QA76.9.D33 IN- ver Spring, MD 20910, USA, TERNET. URL http: February 1987. //ieeexplore.ieee.org/ REFERENCES 438

stamp/stamp.jsp?tp=&arnumber= ???? ISSN 1556-6056 (print), 4483271. 1556-6064 (electronic). Storer:2012:DDC Sarkar:2019:CKN

[SM12] James A. Storer and Michael W.[SN19] Pinaki Sarkar and Sukumar Marcellin, editors. DCC Nandi. A class of key- 2012: 2012 Data Com- node indexed hash chains pression Conference: pro- based key predistribution ceedings, 10–12 April 2012, (KPS): Signed weighted Snowbird, Utah. IEEE Com- graphs. Computer Net- puter Society Press, 1109 works (Amsterdam, Nether- Spring Street, Suite 300, Sil- lands: 1999), 164(??):Article ver Spring, MD 20910, USA, 106881, December 9, 2019. 2012. ISBN 1-4673-0715- CODEN ???? ISSN 7 (paperback). ISSN 1068- 1389-1286 (print), 1872-7069 0314. LCCN ???? URL (electronic). URL http: http://ieeexplore.ieee. //www.sciencedirect.com/ org/xpl/mostRecentIssue. science/article/pii/S1389128618303669. jsp?punumber=6189093. IEEE Computer Society order Snader:1987:LIF number P4656. [Sna87] Jon C. Snader. Look Sriram:1991:VPC it up faster with hashing. [SMS91] Kotikalapudi Sriram, R. Scott Byte Magazine, 12(1):128– McKinney, and Mostafa Hashem 144, January 1987. CO- Sherif. Voice packetization DEN BYTEDJ. ISSN 0360- and compression in broad- 5280 (print), 1082-7838 (elec- band ATM networks. IEEE tronic). Journal on Selected Areas Safavi-Naini:1998:MH in Communications, 9(3): 294–304, April 1991. CO- [SNBC98] Rei Safavi-Naini, Shahram DEN ISACEM. ISSN 0733- Bakhtiari, and Chris Charnes. 8716 (print), 1558-0008 (elec- MRD hashing. Lecture Notes tronic). IEEE Log Number in CS, 1372:134–??, 1998. 9042034. CODEN LNCSD9. ISSN Scionti:2018:EMM 0302-9743 (print), 1611- 3349 (electronic). URL [SMZ18] Alberto Scionti, Somnath http://link.springer-ny. Mazumdar, and Stephane com/link/service/series/ Zuckerman. Enabling mas- 0558/bibs/1372/13720134. sive multi-threading with fast htm; http://link.springer- hashing. IEEE Computer Ar- ny.com/link/service/series/ chitecture Letters, 17(1):1–4, 0558/papers/1372/13720134. January/June 2018. CODEN pdf. REFERENCES 439

Safavi-naini:2005:MH 3570-3 (paperback), 0-8186- 3571-1 (microﬁche). LCCN [SnC05] R. Safavi-naini and C. Charnes. QA76.9.D3I57 1993. MRD hashing. Designs, Codes, and Cryptography,37 Somervuo:1999:RHA (2):229–242, November 2005. [Som99] P. Somervuo. Redundant CODEN DCCREC. ISSN hash addressing of feature 0925-1022 (print), 1573- sequences using the self- 7586 (electronic). URL organizing map. Neural Pro- http://www.springerlink. cessing Letters, 10(1):25–34, com/openurl.asp?genre= August 1999. CODEN ???? article&issn=0925-1022& ISSN 1370-4621. volume=37&issue=2&spage= 229. Soukup:1992:SCL Snellen:1992:ITS [Sou92] J. Soukup. Selecting a C++ [Sne92] David Snellen. Ingres ta- library. C++ Report, 4(1):1, ble structures. DBMS, 5(8): 4–6, January 1992. CODEN 60–63, July 1992. CODEN CRPTE7. ISSN 1040-6042. DBMSEO. ISSN 1041-5173. Spetka:1989:THJ

Safavi-Naini:2006:SSS [SP89] Scott Edward Spetka and [SNW06] Rei Safavi-Naini and Huax- Gerald Popek. Three-way iong Wang. Secret shar- hash join query processing schemes with partial ing in distributed relational broadcast channels. Designs, database systems. Technical Codes, and Cryptography, report, UCLA Computer Sci- 41(1):5–22, October 2006. ence Dept., Los Angeles, CA, CODEN DCCREC. ISSN USA, 1989. 17 pp. 0925-1022 (print), 1573- Seberry:1990:ACA 7586 (electronic). URL http://www.springerlink. [SP90] Jennifer Seberry and Josef com/openurl.asp?genre= Pieprzyk, editors. Advances article&issn=0925-1022& in Cryptology–AUSCRYPT volume=41&issue=1&spage= ’90: International Confer- 5. ence on Cryptology, Sydney, Soloviev:1993:THA Australia, January 8–11, 1990: proceedings. Springer- [Sol93] V. Soloviev. A truncat- Verlag, Berlin, Germany / ing hash algorithm for pro- Heidelberg, Germany / Lon- cessing band-join queries. don, UK / etc., 1990. ISBN In Soloviev [ICD93], pages 0-387-53000-2 (New York), 3- 419–427. ISBN 0-8186- 540-53000-2 (Berlin). LCCN 3572-X (hardcover), 0-8186- QA76.9.A25 A87 1990. REFERENCES 440

Sadeghiyan:1991:COW page ?? ISBN 0-8186-0828- 5 (paperback), 0-8186-4828- [SP91] B. Sadeghiyan and J. Piep- 7 (microfiche), 0-8186-8828-9 rzyk. A construction for one (hardcover). LCCN QA75.5 way hash functions and pseu- .C58 1988. dorandom bit generators. In Davies [Dav91], pages 431– Spetka:1992:DAD 445. ISBN 0-387-54620- [Spe92] S. Spetka. A decomposi- 0 (New York), 3-540-54620- tion algorithm for distributed 0 (Berlin). ISSN 0302- hash join query processing. 9743 (print), 1611-3349 (elec- In Yu [Yu92], pages 53– tronic). LCCN QA76.9.A25 60. ISBN 0-8186-2660-7, 0- E964 1991. 8186-2661-5, 0-8186-2662-3. Satuluri:2012:BLS LCCN QA76.9.D3 I593 1992. [SP12] Venu Satuluri and Srinivasan Safkhani:2014:CCA Parthasarathy. Bayesian locality sensitive hashing for [SPLHCB14] Masoumeh Safkhani, Pe- fast similarity search. Pro- dro Peris-Lopez, Julio Cesar ceedings of the VLDB En- Hernandez-Castro, and Na- dowment, 5(5):430–441, Jan- sour Bagheri. Cryptanaly- uary 2012. CODEN ???? sis of the Cho et al. proto- ISSN 2150-8097. col: a hash-based RFID tag mutual authentication pro- Shaikh:2021:STB tocol. Journal of Compu- [SP21] Ayesha S. Shaikh and tational and Applied Math- Vibha D. Patel. Signifi- ematics, 259 (part B)(??): cance of the transition to bio- 571–577, March 15, 2014. metric template protection: CODEN JCAMDI. ISSN Explore the future. Inter- 0377-0427 (print), 1879-1778 national Journal of Image (electronic). URL http: and Graphics (IJIG), 21(02): //www.sciencedirect.com/ ??, April 2021. ISSN 0219- science/article/pii/S0377042713005281. 4678. URL https://www. See [CJP12]. worldscientific.com/doi/ Sprugnoli:1977:PHF 10.1142/S021946782150025X. Spector:1988:CFD [Spr77] Renzo Sprugnoli. Perfect hashing functions: a single [SPB88] A. Z. Spector, R. F. probe retrieving method for Pausch, and G. Bruell. static sets. Communications CAMELOT: a flexible, dis- of the Association for Com- tributed transaction pro- puting Machinery, 20(11): cessing system. In IEEE- 841–850, November 1977. COMPCON’88 [IEE88a], CODEN CACMA2. ISSN REFERENCES 441

0001-0782 (print), 1557-7317 Sethi:1989:FSR (electronic). This is the first discussion on perfect [SR89] Ishwar K. Sethi and Na- hashing; describes heuristics garajan Ramesh. A flexible for constructing perfect hash shape recognition approach functions. See comments in through hashing. In Proc. [AA79a]. ROBEX ’89 (sponsored by Robotics and Expert Systems Sourlas:2016:EHR Division, Instrument Society of America), pages 185–188. [SPSP16] Vasilis Sourlas, Ioannis ????, ????, 1989. Psaras, Lorenzo Saino, and Song:2001:HMO George Pavlou. Effi- cient hash-routing and do- [SR01] Zhexuan Song and Nick main clustering techniques Roussopoulos. Hashing mov- for information-centric net- ing objects. Lecture Notes works. Computer Networks in CS, 1987:161–??, 2001. (Amsterdam, Netherlands: CODEN LNCSD9. ISSN 1999), 103(??):67–83, July 5, 0302-9743 (print), 1611- 2016. CODEN ???? ISSN 3349 (electronic). URL 1389-1286 (print), 1872-7069 http://link.springer-ny. (electronic). URL http: com/link/service/series/ //www.sciencedirect.com/ 0558/bibs/1987/19870161. science/article/pii/S1389128616300998. htm; http://link.springer- ny.com/link/service/series/ Severance:1990:DLH 0558/papers/1987/19870161. pdf. [SPW90] C. Severance, S. Pramanik, and P. Wolberg. Distributed Shin:1998:NHF linear hashing and parallel [SRRL98] Sang Uk Shin, Kyung Hyune projection in main memory Rhee, Dae Hyun Ryu, and databases. In McLeod et al. Sang Jin Lee. A new hash [MSDS90], page 674. ISBN function based on MDx- 1-55860-149-X. LCCN ??? family and its application Schay:1963:MKA to MAC. Lecture Notes in CS, 1431:234–??, 1998. [SR63] G. Schay and N. Raver. A CODEN LNCSD9. ISSN method for key-to-address 0302-9743 (print), 1611- transformation. IBM Jour- 3349 (electronic). URL nal of Research and Devel- http://link.springer-ny. opment, 7(2):121–126, April com/link/service/series/ 1963. CODEN IBMJAE. 0558/bibs/1431/14310234. ISSN 0018-8646 (print), htm; http://link.springer- 2151-8556 (electronic). ny.com/link/service/series/ REFERENCES 442

0558/papers/1431/14310234. 275–282, 1983. CODEN pdf. DITCDP. ISBN 0-8186-0502- 2. IEEE Service Cent. Piscat- Shin:1999:HFM away, NJ, USA. [SRY99] Sang Uk Shin, Kyung Hyune Schmidt:1988:SCO Rhee, and Jae Woo Yoon. Hash functions and the MAC [SS88a] Jeanette P. Schmidt and using all-or-nothing prop- Alan Siegel. The spatial com- erty. Lecture Notes in CS, plexity of oblivious k—probe 1560:263–275, 1999. CO- hash functions. Ultracom- DEN LNCSD9. ISSN 0302- puter Note 142, ????, June 9743 (print), 1611-3349 (elec- 1988. ?? pp. tronic). Shasha:1988:ECE Schay:1962:AFA [SS88b] Dennis Shasha and Marc [SS62] G. Schay, Jr. and W. G. Snir. Efficient and correct ex- Spruth. Analysis of a file ad- ecution of parallel programs dressing method. Communi- that share memory. ACM cations of the Association for Transactions on Program- Computing Machinery, 5(8): ming Languages and Sys- 459–462, August 1962. CO- tems, 10(2):282–312, April DEN CACMA2. ISSN 0001- 1988. CODEN ATPSDT. 0782 (print), 1557-7317 (elec- ISSN 0164-0925 (print), tronic). Early analysis of lin- 1558-4593 (electronic). URL ear probing. http://www.acm.org/pubs/ toc/Abstracts/0164-0925/ Schmidt:1980:IPC 42277.html. [SS80] Jeanette P. Schmidt and Eli Schmidt:1989:AUP Shamir. An improved program for constructing open [SS89a] Jeanette P. Schmidt and hash tables. In de Bakker Alan Siegel. On aspects and van Leeuwen [dBvL80], of universality and perfor- pages 569–581. ISBN 0-387- mance for closed hashing. 10003-2. LCCN QA267.A1 In ACM-TOC’89 [ACM89c], L43 no.85. pages 355–366. ISBN 0- 89791-307-8. LCCN ???? Shen:1983:OSU Sequin:1989:PRT [SS83] John Paul Shen and Michael A. Schuette. On-line self- [SS89b] Carlo H. Séquin and Eliot K. monitoring using signatured Smyrl. Parameterized ray instruction streams. Di- tracing. Computer Graph- gest of Papers — Interna- ics, 23(3):307–314, July tional Test Conference, pages 1989. CODEN CGRADI, REFERENCES 443

CPGPBZ. ISSN 0097- in CS, 2247:40–??, 2001. 8930 (print), 1558-4569 CODEN LNCSD9. ISSN (electronic). URL http: 0302-9743 (print), 1611- //www.acm.org:80/pubs/ 3349 (electronic). URL citations/proceedings/ http://link.springer-ny. graph/74333/p307-sequin/ com/link/service/series/ . 0558/bibs/2247/22470040. Schmidt:1990:ACH htm; http://link.springer- ny.com/link/service/series/ [SS90a] Jeanette P. Schmidt and 0558/papers/2247/22470040. Alan Siegel. The analysis pdf. of closed hashing under limited randomness. In ACM- Shalev:2006:SOL TOC’90 [ACM90], pages [SS06] Ori Shalev and Nir Shavit. 224–234. ISBN 0-89791-361- Split-ordered lists: Lock- 2. LCCN ???? free extensible hash tables. Schmidt:1990:SCO Journal of the Association for Computing Machinery, [SS90b] Jeanette P. Schmidt and 53(3):379–405, May 2006. Alan Siegel. The spatial com- CODEN JACOAH. ISSN plexity of oblivious k-probe 0004-5411 (print), 1557-735X hash functions. SIAM Jour- (electronic). nal on Computing, 19(5): 775–786, October 1990. CO- Smith:2015:BPF DEN SMJCAT. ISSN 0097- 5397 (print), 1095-7111 (elec- [SS15] Jason Smith and Scott Schae- tronic). fer. Bijective parameterization with free bound- Schmidt:1992:GPH aries. ACM Transactions [SS92] Douglas C. Schmidt and Tat- on Graphics, 34(4):70:1– suya Suda. GPERF: a per- 70:??, August 2015. CO- fect hash function generator. DEN ATGRDF. ISSN 0730- Technical Report TR 92-47, 0301 (print), 1557-7368 (elec- Information and Computer tronic). Science, University of Cal- Shpilrain:2016:CLF ifornia, Irvine, Irvine, CA, USA, 1992. 19 pp. [SS16] Vladimir Shpilrain and Bianca Sarkar:2001:PAE Sosnovski. Compositions of linear functions and applica- [SS01] P. Sarkar and P. J. Schellen- tions to hashing. Groups. berg. A parallel algorithm Complexity. Cryptology,8 for extending cryptographic (2):155–161, November 2016. hash functions. Lecture Notes CODEN ???? ISSN 1867- REFERENCES 444

1144 (print), 1869-6104 (elec- ming environment. Mehran tronic). University Research Journal of Engineering and Tech- Sara:2001:SCT nology, 24(2):125–130, 2005. [SSaS01]ˇ Radim S´ˇara, Daniel Smutek, CODEN ???? ISSN 0254- and Petr Sucharda andtSt´ˇ epán 7821. Svaˇcina. Systematic con- Stipic:2013:PGT struction of texture features [SSU+13] Srdan Stipić, Vesna Smiljković, for Hashimoto’s lymphocytic Osman Unsal, Adrián Cristal, thyroiditis recognition from and Mateo Valero. Profile- sonographic images. Lecture guided transaction coalescing- Notes in CS, 2101:339–348, lowering transactional over- 2001. CODEN LNCSD9. heads by merging transac- ISSN 0302-9743 (print), tions. ACM Transactions on 1611-3349 (electronic). URL Architecture and Code Op- http://link.springer-ny. timization, 10(4):50:1–50:??, com/link/service/series/ December 2013. CODEN 0558/bibs/2101/21010339. ???? ISSN 1544-3566 (print), htm; http://link.springer- 1544-3973 (electronic). ny.com/link/service/series/ 0558/papers/2101/21010339. Sagonas:1994:XED pdf. [SSW94] Konstantinos Sagonas, Ter- Shen:2018:MDH rance Swift, and David S.

+ Warren. XSB as an eﬃcient [SSL 18] Xiaobo Shen, Fumin Shen, deductive database engine. Li Liu, Yun-Hao Yuan, Wei- In Snodgrass and Winslett wei Liu, and Quan-Sen Sun. [SW94b], pages 442–453. Multiview discrete hash- ISBN 0-89791-639-5. ISSN ing for scalable multime- 0163-5808 (print), 1943- dia search. ACM Transac- 5835 (electronic). LCCN tions on Intelligent Systems QA 76.9 D3 S53 v.23 no.2 and Technology (TIST), 9(5): 1994. URL http://www. 53:1–53:??, July 2018. CO- acm.org/pubs/articles/ DEN ???? ISSN 2157- proceedings/mod/191839/ 6904 (print), 2157-6912 (elec- p442-sagonas/p442-sagonas. tronic). pdf; http://www.acm. Soomro:2005:DDH org/pubs/citations/proceedings/ mod/191839/p442-sagonas/ [SSS05] H. K. Soomro, S. A. A. Shah, . and A. A. G. Shaikh. Devel- Schkolnick:1983:ICV opment of dynamic hashing key generation method for [ST83a] Mario Schkolnick and C. Thanos, Java based Sindhi program- editors. 9th International REFERENCES 445

Conference on Very Large with signatures. Information Data Bases: Florence, Italy, system, 18(8):597–??, 1993. October 31–November 2, CODEN INSYD6. ISSN 1983. Very Large Data Bases 0306-4379 (print), 1873-6076 Endowment, Saratoga, CA, (electronic). USA, 1983. Stahl:1973:HGH Schkolnick:1983:NIC [Sta73] Hans Michael Stahl. Hash- [ST83b] Mario Schkolnick and Costantino codingverfahren. (German). Thanos, editors. Ninth Inter- [Hash coding techniques]. national Conference on Very Angewandte Informatik/Applied Large Data Bases, Florence, Informatics, 15(10):435–440, Italy, October 31-November October 1973. CODEN AW- 2, 1983. Very Large Data IFA7. Bases Endowment, Saratoga, Stallings:1994:SSH CA, USA, 1983. ISBN 0- 934613-15-X. LCCN QA 76.9 [Sta94] William Stallings. SHA: The D3 I61 1983. Secure Hash Algorithm. Dr. Dobbs Journal, 19(4):32, 34, Sebesta:1985:MPH April 1, 1994. CODEN [ST85] Robert W. Sebesta and DDJOEB. ISSN 1044-789X. Mark A. Taylor. Minimal Stallings:1999:HAK perfect hash functions for reserved word lists. SIG- [Sta99] William Stallings. The PLAN Notices, 20(12):47–53, HMAC algorithm: Key hash- December 1985. CODEN ing for message authenti- SINODQ. ISSN 0362-1340 cation. Dr. Dobbs Jour- (print), 1523-2867 (print), nal, 24(4):46, 48–49, April 1558-1160 (electronic). 1999. CODEN DDJOEB. ISSN 1044-789X. URL http: Sebesta:1986:FIA //www.ddj.com/ftp/1999/ 1999_04/hmac.txt. [ST86] Robert W. Sebesta and Mark A. Taylor. Fast identiﬁ- Stallings:2006:WSH cation of Ada and Modula-2 [Sta06a] William Stallings. The reserved words. Journal of Whirlpool secure hash func- Pascal, Ada and Modula-2,5 tion. Cryptologia, 30(1): (2):36–39, March/April 1986. 55–67, January 2006. CO- CODEN JPAME8, JOPAD5. DEN CRYPE6. ISSN 0161- ISSN 0747-1351, 0735-1232. 1194 (print), 1558-1586 (elec- Schweitz:1993:AHS tronic). URL http://www. informaworld.com/smpp/ [ST93] Eric A. Schweitz and Alan L. content~content=a741992009~ Tharp. Adaptive hashing db=all~order=page. REFERENCES 446

Stamp:2006:ISP 9743 (print), 1611-3349 (electronic). [Sta06b] Mark Stamp. Informa- tion security: principles and Stinson:1993:ACC practice. Wiley-Intersci- [Sti93] Douglas R. Stinson, edi- ence, New York, NY, USA, tor. Advances in Cryptol- 2006. ISBN 0-471-73848- ogy, CRYPTO ’93: 13th An- 4 (cloth). xxi + 390 pp. nual International Cryptol- LCCN QA76.9.A25 S69 2006. ogy Conference, Santa Bar- URL http://www.loc.gov/ bara, California, USA, Au- catdir/enhancements/fy0645/ gust 22–26, 1993: Proceed- 2005005152-b.html; http: ings, volume 773 of Lec- //www.loc.gov/catdir/enhancements/ ture Notes in Computer Sci- fy0645/2005005152-d.html; ence. Springer-Verlag, Berlin, http://www.loc.gov/catdir/ Germany / Heidelberg, Ger- toc/ecip058/2005005152. many / London, UK / etc., html. 1993. ISBN 0-387-57766-1 Stewart:1982:DSV (New York), 3-540-57766-1 (Berlin). LCCN QA76.9.A25 [Ste82] Neil Stewart. Data struc- C79 1993. tures for virtual-circuit implementation. Computer Stinson:1994:CTU Communications, 5(4):196– [Sti94a] D. R. Stinson. Combinatorial 201, August 1982. CODEN techniques for universal hash- COCOD7. ISSN 0140-3664 ing. Journal of Computer (print), 1873-703X (elec- and System Sciences, 48(2): tronic). 337–346, April 1, 1994. CO- Stevens:2018:HPL DEN JCSSBM. ISSN 0022- 0000 (print), 1090-2724 (elec- [Ste18] Hallam Stevens. Hans Pe- tronic). ter Luhn and the birth Stinson:1994:UHA of the hashing algorithm. IEEE Spectrum, 55(2):44– [Sti94b] D. R. Stinson. Univer- 49, February 2018. CO- sal hashing and authen- DEN IEESAM. ISSN 0018- tication codes. Designs, 9235 (print), 1939-9340 (elec- Codes, and Cryptography, tronic). 4(4):369–380, 1994. CO- DEN DCCREC. ISSN 0925- Stinson:1991:UHA 1022 (print), 1573-7586 (elec- [Sti91] D. R. Stinson. Universal tronic). hashing and authentication Stinson:1994:ACC codes. Lecture Notes in CS, 576:74–85, 1991. CO- [Sti94c] Douglas R. Stinson, edi- DEN LNCSD9. ISSN 0302- tor. Advances in Cryptol- REFERENCES 447

ogy, CRYPTO ’93: 13th An- tor. Readings in Database nual International Cryptol- Systems. Morgan Kauf- ogy Conference, Santa Bar- mann Publishers, San Fran- bara, California, USA, Au- cisco, CA, 1988. ISBN 0- gust 22–26, 1993: Pro- 934613-65-6. xii + 644 pp. ceedings, volume 773 of LCCN QA76.9.D3 R4 1988. Lecture Notes in Com- US$29.95. Contains reprint puter Science. Springer-Ver- of [Lit80]. lag, Berlin, Germany / Hei- delberg, Germany / Lon- Stonebraker:1992:PAS don, UK / etc., 1994. CO- [Sto92] Michael Stonebraker, editor. DEN LNCSD9. ISBN 0- Proceedings of the 1992 ACM 387-57766-1 (New York), 3- SIGMOD International Con- 540-57766-1 (Berlin). ISSN ference on Management of 0302-9743 (print), 1611- Data, San Diego, Califor- 3349 (electronic). LCCN nia, June 2–5, 1992,volume QA76.9.A25 C79 1993. URL 21(2) of SIGMOD Record http://link.springer-ny. (ACM Special Interest Group com/link/service/series/ on Management of Data). 0558/tocs/t0773.htm; ACM Press, New York, NY http://www.springerlink. 10036, USA, 1992. ISBN com/content/978-0-387- 0-89791-521-6. ISSN 0163- 57766-1; http://www. 5808 (print), 1943-5835 (elec- springerlink.com/openurl. tronic). LCCN ???? asp?genre=issue&issn=0302- 9743&volume=773. Sundaram:2013:SSS Stinson:2006:SOT [STS+13] Narayanan Sundaram, Aizana [Sti06] D. R. Stinson. Some observa- Turmukhametova, Nadathur tions on the theory of crypto- Satish, Todd Mostak, Pi- graphic hash functions. De- otr Indyk, Samuel Madden, signs, Codes, and Cryptogra- and Pradeep Dubey. Stream- phy, 38(2):259–277, February ing similarity search over one 2006. CODEN DCCREC. billion tweets using paral- ISSN 0925-1022 (print), lel locality-sensitive hashing. 1573-7586 (electronic). URL Proceedings of the VLDB En- http://www.springerlink. dowment, 6(14):1930–1941, com/openurl.asp?genre= September 2013. CODEN article&issn=0925-1022& ???? ISSN 2150-8097. volume=38&issue=2&spage= Stumm:1982:UMZ 259. Stonebraker:1988:RDS [Stu82] Gisela Stumm. Untersuchung zu mehrfachattribut-zugriﬀsverfahren [Sto88] Michael Stonebraker, edi- fuer datenbanken. Mas- REFERENCES 448

ter’s thesis, Technischen Uni- Sun:2002:BJP versität Carolo-Wilhelmina zu Braunschweig, Braun- [Sun02] Sun Microsystems. BigDec- schweig, Germany, 1982. ?? imal (Java 2 Platform SE pp. v1.4.0). Sun Microsystems, Mountain View, CA, USA, Sturc:1985:MHU 2002. 17 pp. URL http:/ /java.sun/com/products. [Stu85] Jan Sturc. Multidimensional hashing used for conjunctive Sun:2015:CCH queries evaluation. Comput- ers and Artificial Intelligence [Sun15] Zhenan Sun. Code con- = Vychislitel’nye mashiny i sistent hashing based on iskusstvennyi intellekt, 4(2): information-theoretic crite- 143–151, 1985. CODEN rion. IEEE Transactions CARIDY. ISSN 0232-0274. on Big Data, 1(3):84–94, September 2015. CODEN Samples:1986:SSB ???? ISSN 2332-7790. [SUH86] A. D. Samples, D. Ungar, Schnorr:1994:PFH and P. Hilfinger. SOAR: Smalltalk without bytecodes. [SV94a] C. Schnorr and S. Vaude- SIGPLAN Notices, 21(11): nay. Parallel FFT-Hashing. 107, November 1986. CO- Lecture Notes in CS, 809: DEN SINODQ. ISSN 149–??, 1994. CODEN 0362-1340 (print), 1523- LNCSD9. ISSN 0302-9743 2867 (print), 1558-1160 (elec- (print), 1611-3349 (electronic). tronic).

Sundar:1991:LBD Schnorr:1994:BBC

[Sun91] R. Sundar. A lower bound for [SV94b] C. P. Schnorr and S. Vau- the dictionary problem under denay. Black box crypt- a hashing model. In IEEE- analysis of hash networks FOCS’91 [IEE91b], pages based on multipermutations. 612–621. ISBN 0-8186-2445- Technical Report TR-94-017, 0 (paperback), 0-8186-2447-7 International Computer Sci- (hardcover). LCCN QA 76 ence Institute, Berkeley, CA, S979 1991. USA, April 1994. ?? pp. Sundar:1993:LBC Schnorr:1995:BBC

[Sun93] R. Sundar. A lower bound [SV95] C. P. Schnorr and S. Vaude- on the cell probe complex- nay. Black box cryptanal- ity of the dictionary problem. ysis of hash networks based Citedin[ANS09],butper- on multipermutations. In De haps never published., 1993. Santis [De 95], pages 47–57. REFERENCES 449

ISBN 3-540-60176-7. ISSN functional multi-maps with 0302-9743 (print), 1611- type-heterogeneous hash- 3349 (electronic). LCCN tries. SIGPLAN Notices, QA76.9.A25 E965 1995. 53(4):283–295, April 2018. CODEN SINODQ. ISSN Suganya:2006:LRK 0362-1340 (print), 1523- [SV06] A. Suganya and N. Vija- 2867 (print), 1558-1160 (elec- yarangan. Landau–Ramanujan tronic). keyed hash functions for mes- Stanca:2001:HAC sage authentication. Jour- nal of Discrete Mathematical [SVCC01] Marian Stanca, Stamatis Sciences and Cryptography,9 Vassiliadis, Sorin Cotofana, (1):1–8, 2006. CODEN ???? and Henk Corporaal. Hashed ISSN 0972-0529. addressed caches for embed- Steindorfer:2015:CSM ded pointer based codes (research note). Lecture Notes [SV15a] Michael J. Steindorfer and in CS, 1900:965–??, 2001. Jurgen J. Vinju. Code spe- CODEN LNCSD9. ISSN cialization for memory effi- 0302-9743 (print), 1611- cient hash tries (short paper). 3349 (electronic). URL SIGPLAN Notices, 50(3):11– http://link.springer-ny. 14, March 2015. CODEN com/link/service/series/ SINODQ. ISSN 0362-1340 0558/bibs/1900/19000965. (print), 1523-2867 (print), htm; http://link.springer- 1558-1160 (electronic). ny.com/link/service/series/ 0558/papers/1900/19000965. Steindorfer:2015:OHA pdf. [SV15b] Michael J. Steindorfer and Slot:1984:TVC Jurgen J. Vinju. Optimiz- ing hash-array mapped tries [SvEB84] C. Slot and P. van Emde Boas. for fast and lean immutable On tape versus core: An JVM collections. SIGPLAN application of space efficient Notices, 50(10):783–800, Oc- perfect hash functions to the tober 2015. CODEN SIN- invariance of space. In ACM- ODQ. ISSN 0362-1340 TOC’84 [ACM84b], pages (print), 1523-2867 (print), 391–400. 1558-1160 (electronic). Sincovec:1986:DSU Steindorfer:2018:MOA [SW86] R. F. Sincovec and R. S. [SV18] Michael J. Steindorfer and Wiener. Data Structures Us- Jurgen J. Vinju. To- ing Modula-2. John Wiley, many or to-one? All- New York, NY, USA, 1986. in-one! Efficient purely ISBN 0-471-81489-X. xxiii + REFERENCES 450

500 pp. LCCN QA76.73.M63 tors. Proceedings of the S56 1986. 1994 ACM SIGMOD Inter- Stubbs:1987:DSA national Conference on Man- agement of Data / SIGMOD [SW87] Daniel F. Stubbs and Neil W. ’94, Minneapolis, Minnesota, Webre. Data Structures May 24–27, 1994,volume with Abstract Data Types and 23(2) of SIGMOD Record Modula-2. Brooks/Cole, Pa- (ACM Special Interest Group cific Grove, CA, USA, 1987. on Management of Data). ISBN 0-534-07302-6. xx + ACM Press, New York, NY 556 pp. LCCN QA76.9.D35 10036, USA, 1994. ISBN S76 1987. US$43.25. Text- 0-89791-639-5. ISSN 0163- book treatment of hashing. 5808 (print), 1943-5835 (elec- Shasha:1991:OEQ tronic). LCCN QA 76.9 D3 S53 v.23 no.2 1994. [SW91] Dennis Shasha and Tsong- Sun:2014:SSA Li Wang. Optimizing equijoin queries in distributed [SWQ+14] Yifang Sun, Wei Wang, Jian- databases where relations bin Qin, Ying Zhang, and are hash-partitioned. ACM Xuemin Lin. SRS: solving Transactions on Database c-approximate nearest neigh- Systems, 16(2):279–??, June bor queries in high dimen- 1, 1991. CODEN ATDSD3. sional Euclidean space with ISSN 0362-5915 (print), a tiny index. Proceedings of 1557-4644 (electronic). the VLDB Endowment, 8(1): 1–12, September 2014. CO- Snodgrass:1994:SIC DEN ???? ISSN 2150-8097. [SW94a] R. T. Snodgrass and M. Winslett, Sun:2018:MSM editors. SIGMOD ’94: Inter- national conference on man- [SWTX18] P. Sun, Y. Wen, D. N. B. agement of data — May Ta, and H. Xie. MetaFlow: 1994, Minneapolis, MN, A scalable metadata lookup volume 23 (2) of SIG- service for distributed file MOD RECORD 1994.ACM systems in data centers. Press, New York, NY 10036, IEEE Transactions on Big USA, 1994. ISBN 0- Data, 4(2):203–216, June 89791-639-5. ISSN 0163- 2018. ISSN 2332-7790. 5808 (print), 1943-5835 (elec- Shen:2008:HBP tronic). LCCN QA 76.9 D3 S53 v.23 no.2 1994. [SX08] Haiying Shen and Cheng- Zhong Xu. Hash-based prox- Snodgrass:1994:PAS imity clustering for efficient [SW94b] Richard T. Snodgrass and load balancing in heteroge- Marianne Winslett, edi- neous DHT networks. Jour- REFERENCES 451

nal of Parallel and Dis- Shibata:2008:LFD tributed Computing, 68(5): 686–702, May 2008. CO- [SY08] Tomoyuki Shibata and Os- DEN JPDCER. ISSN 0743- amu Yamaguchi. Local 7315 (print), 1096-0848 (elec- Fisher discriminant compo- tronic). nent hashing for fast nearest neighbor classiﬁcation. Su:2016:PSN Lecture Notes in CS, 5342: 339–349, 2008. CODEN [SXL16] Shenghui Su, Tao Xie, and LNCSD9. ISSN 0302-9743 Shuwang L¨u. A provably (print), 1611-3349 (elec- secure non-iterative hash tronic). URL http://link. function resisting birthday springer.com/content/pdf/ attack. Theoret. Com- 10.1007/978-3-540-89689- put. Sci., 654(??):128–142, 0_38. November 22, 2016. CO- Sasaki:2011:KKD DEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 [SY11] Yu Sasaki and Kan Yasuda. (electronic). URL http: Known-key distinguishers on //www.sciencedirect.com/ 11-round Feistel and colli- science/article/pii/S0304397516001547. sion attacks on its hashing modes. Lecture Notes in CS, Sung:2008:LSI 6733:397–415, 2011. CO- DEN LNCSD9. ISSN 0302- [SXLL08] Minho Sung, Jun Xu, Jun 9743 (print), 1611-3349 (elec- Li, and Li Li. Large- tronic). URL http://link. scale IP traceback in high- springer.com/content/pdf/ speed Internet: practical 10.1007/978-3-642-21702- techniques and information- 9_23. theoretic foundation. IEEE/ Shao:2020:HCS ACM Transactions on Net- working, 16(6):1253–1266, [SYW+20] T. Shao, Y. Yang, Y. Weng, December 2008. CODEN Q. Hou, and K. Zhou. H- IEANEP. ISSN 1063-6692 CNN: Spatial hashing based (print), 1558-2566 (elec- CNN for 3D shape analy- tronic). sis. IEEE Transactions on Visualization and Computer Seltzer:1991:NHP Graphics, 26(7):2403–2416, 2020. CODEN ITVGEA. [SY91] Margo Seltzer and Ozan ISSN 1077-2626. Yigit. A new hashing pack- Seberry:1993:ACA age for UNIX. In USENIX- WINTER’91 [USE91], pages [SZ93] Jennifer Seberry and Yuliang 173–184. Zheng, editors. Advances in REFERENCES 452

Cryptology–AUSCRYPT ’92: Szymanski:1985:HTR Workshop on the Theory and Application of Cryptographic [Szy85] T. G. Szymanski. Hash ta- Techniques, Gold Coast, ble reorganization. Jour- Queensland, Australia, De- nal of Algorithms, 6(3):322– cember 13–16, 1992: Pro- 325, September 1985. CO- ceedings, volume 718 of Lec- DEN JOALDV. ISSN 0196- ture Notes in Computer Sci- 6774 (print), 1090-2678 (elec- ence. Springer-Verlag, Berlin, tronic). Germany / Heidelberg, Ger- Tenenbaum:1981:DSU many / London, UK / etc., 1993. ISBN 0-387-57220- [TA81] Aaron M. Tenenbaum and 1 (New York), 3-540-57220- Moshe J. Augenstein. Data 1 (Berlin). ISSN 0302- Structures Using Pascal. 9743 (print), 1611-3349 (elec- Prentice-Hall Software Se- tronic). LCCN QA76.9.A25 ries, Editor: Brian W. A87 1992. Kernighan. Prentice-Hall, Englewood Cliﬀs, NJ 07632, Sun:2020:RRL USA, 1981. ISBN 0-13- 196501-8. xiv + 545 pp. [SZO+20] Guolin Sun, Tong Zhan, LCCN QA76.9.D35 T46. Boateng Gordon Owusu, Ayepah-Mensah Daniel, Guisong Tenenbaum:1986:DSU Liu, and Wei Jiang. Revised reinforcement learning based [TA86] Aaron M. Tenenbaum and on anchor graph hashing for Moshe J. Augenstein. Data autonomous cell activation in Structures Using Pascal. cloud-RANs. Future Gen- Prentice-Hall, Englewood eration Computer Systems, Cliﬀs, NJ 07632, USA, sec- 104(??):60–73, March 2020. ond edition, 1986. ISBN CODEN FGSEVI. ISSN 0-13-196668-5. x + 774 0167-739X (print), 1872-7115 pp. LCCN QA76.9.D35 T46 (electronic). URL http: 1986. US$36.95. New section //www.sciencedirect.com/ on dynamic hashing added science/article/pii/S0167739X18318788. for this edition. Tai:1979:IPT Szymanski:1982:HTR [Tai79] Kuo-Chung Tai. On the im- [Szy82] Thomas G. Szymanski. Hash plementation of parsing ta- table reorganization. In Pro- bles. SIGPLAN Notices,14 ceedings of the 1982 Confer- (1):100–101, January 1979. ence on Information Sciences CODEN SINODQ. ISSN and Systems., pages 480–484. 0362-1340 (print), 1523- Princeton University Press, 2867 (print), 1558-1160 (elec- Princeton, NJ, USA, 1982. tronic). REFERENCES 453

Tamminen:1981:OPE Taylor:1989:SIA

[Tam81] Markku Tamminen. Order [Tay89] Jeff Taylor. String-indexed preserving extendible hash- arrays in C++. Computer ing and bucket tries. BIT Language Magazine, 6(12): (Nordisk tidskrift for infor- 43–??, December 1, 1989. mationsbehandling), 21(4): CODEN COMLEF. ISSN 419–435, 1981. CODEN BIT- 0749-2839. TEL, NBITAB. ISSN 0006- Tharp:1991:TBD 3835 (print), 1572-9125 (electronic). [TB91] Alan L. Tharp and William Boswell. B+ trees, bounded Tamminen:1982:EHO disorder and adaptive hashing. Information system, [Tam82] Markku Tamminen. Ex- 16(1):65–72, 1991. CO- tendible hashing with over- DEN INSYD6. ISSN 0306- flow. Information Pro- 4379 (print), 1873-6076 (elec- cessing Letters, 15(5):227– tronic). 232, December 1982. CO- Tang:2005:LTO DEN IFPLAT. ISSN 0020- 0190 (print), 1872-6119 (elec- [TBC+05] Chunqiang Tang, Melissa J. tronic). Buco, Rong N. Chang, Sand- hya Dwarkadas, Laura Z. Tamminen:1985:SAC Luan, Edward So, and Christopher Ward. Low traf- [Tam85] Markku Tamminen. On fic overlay networks with search by address compu- large routing tables. ACM tation. BIT (Nordisk tid- SIGMETRICS Performance skrift for informationsbehan- Evaluation Review, 33(1):14– dling), 25(1):135–147, 1985. 25, June 2005. CODEN CODEN BITTEL, NBITAB. ???? ISSN 0163-5999 (print), ISSN 0006-3835 (print), 1557-9484 (electronic). 1572-9125 (electronic). Dis- cusses hashing applications Tsichritzis:1983:MF to file searching. [TC83] D. Tsichritzis and S. Christo- Tanaka:1983:DSD doulakis. Message files. ACM Transactions on Office In- [Tan83] Y. Tanaka. A data-stream formation Systems, 1(1):88– database machine with large 98, January 1983. CODEN capacity. In Advanced ATOSDO. ISSN 0734-2047. Database Machine Architec- URL http://www.acm.org: ture [Hsi83], pages 168–202. 80. Discusses application of ISBN 0-13-011262-3. LCCN hashingtosignaturesfortext QA76.9.D3 A343 1983. searching. REFERENCES 454

Tang:1993:URH the scalability of the Er- lang distributed actor plat- [TC93] S. M. Tang and L. R. Chow. form. ACM Transactions Using rank hashing function on Programming Languages to develop a data allocating and Systems, 39(4):17:1– scheme for a two-disk sys- 17:??, September 2017. CO- tem. The Journal of Sys- DEN ATPSDT. ISSN 0164- tems and Software, 22(2): 0925 (print), 1558-4593 (elec- 107–116, August 1, 1993. tronic). CODEN JSSODM. ISSN 0164-1212 (print), 1873-1228 Tang:2013:TOH (electronic). [TCW+13] Jinhui Tang, Qiang Chen, Tang:2004:AHR Meng Wang, Shuicheng Yan, Tat-Seng Chua, and Ramesh [TC04] Xueyan Tang and Samuel T. Jain. Towards optimizing Chanson. Adaptive hash human labeling for interac- routing for a cluster of client- tive image tagging. ACM side Web proxies. Jour- Transactions on Multime- nal of Parallel and Dis- dia Computing, Communi- tributed Computing, 64(10): cations, and Applications,9 1168–1184, October 2004. (4):29:1–29:??, August 2013. CODEN JPDCER. ISSN CODEN ???? ISSN 1551- 0743-7315 (print), 1096-0848 6857 (print), 1551-6865 (elec- (electronic). tronic). Trinder:2017:SRI Tang:2020:VHD [TCP+17] Phil Trinder, Natalia Chechina, + Nikolaos Papaspyrou, Kon- [TCY 20] Zhenjun Tang, Lv Chen, stantinos Sagonas, Simon Heng Yao, Xianquan Zhang, Thompson, Stephen Adams, and Chunqiang Yu. Video Stavros Aronis, Robert hashing with DCT and NMF. Baker, Eva Bihari, Olivier The Computer Journal,63 Boudeville, Francesco Ce- (7):1017–1030, July 2020. sarini, Maurizio Di Stefano, CODEN CMPJA6. ISSN Sverker Eriksson, Viktória 0010-4620 (print), 1460-2067 Förd˝os, Amir Ghaffari, (electronic). URL http:// Aggelos Giantsios, Rickard academic.oup.com/comjnl/ Green, Csaba Hoch, David article/63/7/1017/5540176. Klaftenegger, Huiqing Li, Turau:1993:ETC Kenneth Lundin, Kenneth Mackenzie, Katerina Rouk- [TD93] V. Turau and H. Duch- ounaki, Yiannis Tsiouris, ene. Equality testing for and Kjell Winblad. Scal- complex objects based on ing reliably: Improving hashing. Data and Knowl- REFERENCES 455

edge Engineering, 10(1):101– //www.acm.org:80/tois/ 112, February 1993. CO- abstracts/tomasic.html. DEN DKENEW. ISSN 0169-023X (print), 1872-6933 Tharp:1988:FOP (electronic). [Tha88] Alan L. Tharp. File Or- Terashima:1987:EPL ganization and Processing. John Wiley, New York, NY, [Ter87] Motoaki Terashima. Ex- USA, 1988. ISBN 0-471- tended property list — its 60521-2. xv + 398 pp. concept and applications. LCCN QA76.9.F5 T48 1988. Journal of the Information US$28.00. Textbook treat- Processing Society of Japan, ment of hashing in Chapter 10(3):154–160, 1987. CO- 7. DEN JIPRDE. ISSN 0387- 6101. Thorup:2000:ESU Tenenhaus:2010:GAN [Tho00] Mikkel Thorup. Even [TGGF10] Arthur Tenenhaus, Vincent strongly universal hash- Guillemot, Xavier Gidrol, ing is pretty fast. In and Vincent Frouin. Gene as- Shmoys [Shm00], pages 496– sociation networks from mi- 497. ISBN 0-89871-453-2. croarray data using a regular- LCCN QA76.6 .A278 2000. ized estimation of partial cor- URL http://encompass. relation based on PLS regres- library.cornell.edu/cgi- sion. IEEE/ACM Transac- bin/checkIP.cgi?access= tions on Computational Bi- gateway\_standard\%26url= ology and Bioinformatics,7 http://dl.acm.org/citation. (2):251–262, April 2010. CO- cfm?id=338219. DEN ITCBCY. ISSN 1545- Thorup:2013:STF 5963 (print), 1557-9964 (electronic). [Tho13] M. Thorup. Simple tabu- Tomasic:1997:DSE lation, fast expanders, double tabulation, and high [TGL+97] Anthony Tomasic, Luis Gra- independence. In IEEE vano, Calvin Lue, Peter [IEE13], pages 90–99. ISBN Schwarz, and Laura Haas. 0-7695-5135-1. ISSN 0272- Data structures for eﬃ- 5428. LCCN QA76 .S95 cient broker implementa- 2012. URL http://dimacs. tion. ACM Transactions rutgers.edu/FOCS13/; on Information Systems, http://theory.stanford. 15(3):223–253, July 1997. edu/~tim/focs13/. IEEE CODEN ATISET. ISSN Computer Society order 1046-8188. URL http: number P????. REFERENCES 456

Thorup:2017:FPH Tao:2012:HCG

[Tho17] Mikkel Thorup. Fast and [TI12] Liang Tao and Horace H. S. powerful hashing using tab- Ip. Hashing with Cauchy ulation. Communications graph. Lecture Notes in of the Association for Com- CS, 7674:21–32, 2012. CO- puting Machinery, 60(7): DEN LNCSD9. ISSN 0302- 94–101, July 2017. CO- 9743 (print), 1611-3349 (elec- DEN CACMA2. ISSN 0001- tronic). URL http://link. 0782 (print), 1557-7317 (elec- springer.com/chapter/10. tronic). URL http://cacm. 1007/978-3-642-34778-8_ acm.org/magazines/2017/ 3/. 7/218878/fulltext. Thakkar:1985:VAT

Taylor:1997:AHN [TK85] Shreekant S. Thakkar and Alan E. Knowles. Vir- [THS97] Stephen Taylor, Nabil Hachem, tual Address Translation Us- and Stanley Selkow. The ing Parallel Hashing Hard- average height of a node ware. IEEE Computer Soci- in the BANG abstract di- ety Press, 1109 Spring Street, rectory tree. Information Suite 300, Silver Spring, MD Processing Letters, 61(1):55– 20910, USA, 1985. ISBN 61, January 14, 1997. CO- 0-8186-0654-1. 697–705 pp. DEN IFPLAT. ISSN 0020- LCCN ???? IEEE Service 0190 (print), 1872-6119 (elec- Cent. Piscataway, NJ, USA. tronic). Tanaka:1988:HSS Tang:2018:PIH [TK88] Eiichi Tanaka and Atsuko [THY+18] Zhenjun Tang, Ziqing Huang, Kogawara. High speed string Heng Yao, Xianquan Zhang, edit methods using hierarchi- Lv Chen, and Chunqiang cal ﬁles and hashing tech- Yu. Perceptual image hash- nique. In IEEE-ICPR’88 ing with weighted DWT fea- [IEE88d], pages 334–336. tures for reduced-reference CODEN PICREG. ISBN image quality assessment. 0-8186-0878-1. LCCN ???? The Computer Journal,61 Available from IEEE Ser- (11):1695–1709, November vice Cent (catalog number 1, 2018. CODEN CM- 88CH2614-6). Piscataway, PJA6. ISSN 0010-4620 NJ, USA. (print), 1460-2067 (elec- Tran:2007:FBC tronic). URL http:// academic.oup.com/comjnl/ [TK07] Thinh Ngoc Tran and Surin article/61/11/1695/4993055. Kittitornkun. FPGA-based REFERENCES 457

cuckoo hashing for pat- Torres:1999:SIS tern matching in NIDS/ NIPS. Lecture Notes in CS, [TKI99] Marco A. Torres, Susumu 4773:334–343, 2007. CO- Kuroyanagi, and Akira DEN LNCSD9. ISSN 0302- Iwata. The Self-Indexed 9743 (print), 1611-3349 (elec- Search Algorithm: a bit-level tronic). URL http://link. approach to minimal perfect springer.com/content/pdf/ hashing. Information Pro- 10.1007/978-3-540-75476- cessing Letters, 69(5):253– 3_34. 258, March 12, 1999. CO- DEN IFPLAT. ISSN 0020- Tibouchi:2017:IEC 0190 (print), 1872-6119 (electronic). [TK17] Mehdi Tibouchi and Taechan Kim. Improved elliptic curve Takata:1989:MMM hashing and point representation. Designs, Codes, and [TKT+89] H. Takata, S. Komori, Cryptography, 82(1–2):161– T. Tamura, F. Asai, T. Tokuda, 177, January 2017. CO- K. Shima, H. Nishikawa, DEN DCCREC. ISSN 0925- and H. Terada. 100 mega- 1022 (print), 1573-7586 (elec- access matching memory for tronic). URL http://link. a data-driven microproces- springer.com/accesspage/ sor. In Symposium on VLSI article/10.1007/s10623- Circuits Digest of Techni- 016-0288-2; http://link. cal Papers (May 25–27 1989: springer.com/article/10. Kyoto, Japan), pages 123– 1007/s10623-016-0288-2. 124. IEEE Computer Soci- ety Press, 1109 Spring Street, Takemasa:2020:DPF Suite 300, Silver Spring, MD 20910, USA, 1989. IEEE cat- [TKH20] Junji Takemasa, Yuki Koizumi, alog number 89TH0262-6. and Toru Hasegawa. Data prefetch for fast NDN soft- Tan:1993:RSM ware routers based on hash table-based forward- [TL93] Kian-Lee Tan and Hongium ing tables. Computer Net- Lu. On resource schedul- works (Amsterdam, Nether- ing of multi-join queries lands: 1999), 173(??):Article in parallel database sys- 107188, May 22, 2020. CO- tems. Information Process- DEN ???? ISSN 1389- ing Letters, 48(4):189–195, 1286 (print), 1872-7069 (elec- November 29, 1993. CO- tronic). URL http:/ DEN IFPLAT. ISSN 0020- /www.sciencedirect.com/ 0190 (print), 1872-6119 (elec- science/article/pii/S138912861931196X. tronic). REFERENCES 458

Tang:1995:SLO Yuan-Cheng Lai. Towards load-balanced service chain- [TL95] S. M. Tang and R. Chow ing by Hash-based Traf- Louis. The study of letter- ﬁc Steering on Softswitches. oriented hashing schemes. Journal of Network and The Journal of Systems Computer Applications, 109 and Software, 28(2):157–167, (??):1–10, May 1, 2018. February 1, 1995. CO- CODEN JNCAF3. ISSN DEN JSSODM. ISSN 0164- 1084-8045 (print), 1095-8592 1212 (print), 1873-1228 (elec- (electronic). URL http: tronic). //www.sciencedirect.com/ science/article/pii/S1084804518300699. Tseng:2007:DHS Tang:2016:RIH [TLLL07] Kuo-Kun Tseng, Ying-Dar Lin, Tsern-Huei Lee, and [TLZL16] Zhenjun Tang, Huan Lao, Yuan-Cheng Lai. Determin- Xianquan Zhang, and Kai istic high-speed root-hashing Liu. Robust image hashing automaton matching copro- via DCT and LLE. Com- cessor for embedded network puters and Security, 62(??): processor. ACM SIGARCH 133–148, September 2016. Computer Architecture News, CODEN CPSEDU. ISSN 35(3):36–43, June 2007. CO- 0167-4048 (print), 1872-6208 DEN CANED2. ISSN 0163- (electronic). URL https: 5964 (print), 1943-5851 (elec- //www.sciencedirect.com/ tronic). science/article/pii/S0167404816300852. Tseng:2009:FSA Tubaishat:2002:PEL

[TLLL09] Kuo-Kun Tseng, Yuan- [TMB02] Malik Ayed Tubaishat, San- Cheng Lai, Ying-Dar Lin, jay Kumar Madria, and and Tsern-Huei Lee. A Bharat Bhargava. Perfor- fast scalable automaton- mance evaluation of linear matching accelerator for em- hash structure model in a bedded content processors. nested transaction environ- ACM Transactions on Em- ment. The Journal of Sys- bedded Computing Systems, tems and Software, 63(3): 8(3):19:1–19:??, April 2009. 219–239, September 15, 2002. CODEN ???? ISSN 1539- CODEN JSSODM. ISSN 9087 (print), 1558-3465 (elec- 0164-1212 (print), 1873-1228 tronic). (electronic). Thai:2018:TLB Triplett:2010:SCH

[TLLL18] Minh-Tuan Thai, Ying-Dar [TMW10] Josh Triplett, Paul E. Lin, Po-Ching Lin, and McKenney, and Jonathan REFERENCES 459

Walpole. Scalable concur- 0-387-57419-0 (New York), 3- rent hash tables via relativis- 540-57419-0 (Berlin). LCCN tic programming. Operat- QA76.9.D3 I5586 1992. ing Systems Review, 44(3): 102–109, July 2010. CODEN Torn:1984:HOI OSRED8. ISSN 0163-5980 (print), 1943-586X (elec- [Tor84] Aimo A. Torn. Hashing tronic). with overflow indexing. BIT (Nordisk tidskrift for infor- Tsudaka:1992:PHJ mationsbehandling), 24(3): 317–332, 1984. CODEN BIT- [TNKT92] S.-I. Tsudaka, M. Nakano, TEL, NBITAB. ISSN 0006- M. Kitsuregawa, and M. Tak- 3835 (print), 1572-9125 (elec- agi. Parallel hash join on tronic). shared-everything multiprocessor: Implementation and Toyama:1986:DOQ performance evaluation. In Golshani [Gol92], page ?? [Toy86] M. Toyama. Data organiza- ISBN 0-8186-2545-7 (paper) tions and query processing in 0-8186-2546-5 (microfiche) database systems. In Chu 0-8186-2547-3 (hardcover). et al. [CGO86], pages 25–32. LCCN QA76.9.D3 I5582 ISBN 0-934613-18-4. LCCN 1992. QA76.9.D3 I559 1986. Tomkins:2020:NZT Toyama:1993:JAM [TNS20] Hayley Tomkins, Monica Nevins, and Hadi Salmasian. [Toy93] Motomichi Toyama. Join al- New Zémor–Tillich type hash gorithm for multidimensional linear hash databases. Ad- functions over GL2(Fpn ). Journal of Mathematical vances in software science Cryptology, 14(1):236–253, and technology, 4(??):43–62, August 1, 2020. CO- 1993. ISSN 1044-7997. DEN ???? ISSN 1862- Tout:1995:DLB 2976 (print), 1862-2984 (electronic). URL https://www. [TP95] W. R. Tout and S. Pramanik. degruyter.com/document/ Distributed load balancing doi/10.1515/jmc-2019-0033/ for parallel main memory html. hash join. IEEE Transac- Toptsis:1992:LBP tions on Parallel and Dis- tributed Systems, 6(8):841– [Top92] Anestis A. Toptsis. Load bal- ??, August 1, 1995. CO- ancing in parallel hash join DEN ITDSEO. ISSN 1045- with data skew. In Finin 9219 (print), 1558-2183 (elec- et al. [FNY92], page ?? ISBN tronic). REFERENCES 460

Tong:2015:HTS et al. [CGO86], pages 189– 196. ISBN 0-934613-18-4. [TP15] Da Tong and Viktor Prasanna. LCCN QA76.9.D3 I559 1986. High throughput sketch based online heavy hitter de- Trono:1992:UPC tectiononFPGA. ACM SIGARCH Computer Ar- [Tro92] John A. Trono. An un- chitecture News, 43(4):70– dergraduate project to com- 75, September 2015. CO- pute minimal perfect hashing DEN CANED2. ISSN 0163- functions. SIGCSE Bulletin 5964 (print), 1943-5851 (elec- (ACM Special Interest Group tronic). on Computer Science Educa- tion), 24(3):??, 1992. CO- Taniar:2002:PSH DEN SIGSD3. ISSN 0097- 8418 (print), 2331-3927 (elec- [TR02] David Taniar and J. Wenny tronic). Rahayu. Parallel sort- hash object-oriented col- Trono:1995:CTS lection join algorithms for shared-memory machines. [Tro95] John A. Trono. A comparison Parallel Algorithms and of three strategies for com- Applications, 17(2):85–126, puting letter oriented, min- ???? 2002. CODEN imal perfect hashing func- PAAPEC. ISSN 1063- tions. SIGPLAN Notices, 7192. URL http://www. 30(4):29–35, April 1, 1995. informaworld.com/smpp/ CODEN SINODQ. ISSN content~content=a777924083. 0362-1340 (print), 1523-2867 (print), 1558-1160 (elec- Trainiter:1963:ARA tronic). This paper in- [Tra63] M. Trainiter. Addressing for troduces a simple modiﬁca- random-access storage with tion that produces dramatic multiple bucket capabilities. speedups to the algorithms Journal of the Association of Cichelli [Cic80b] and Cook for Computing Machinery, and Oldehoeft [CO82b]. ??(3):307–315, July 1963. CODEN JACOAH. ISSN Trono:2006:OTL 0004-5411 (print), 1557-735X [Tro06] John A. Trono. Opti- (electronic). mal table lookup for re- Thom:1986:SAD served words in Ada. ACM SIGADA Ada Letters, 26(1): [TRN86] J. A. Thom, K. Ramamo- 25–30, April 2006. CO- hanarao, and L. Naish. A DEN AALEE5. ISSN 1094- superjoin algorithm for de- 3641 (print), 1557-9476 (elec- ductive databases. In Chu tronic). REFERENCES 461

Tremblay:1976:IDS 3203 (print), 1873-5142 (electronic). [TS76] J. P. Tremblay and P. G. Sorenson. An Introduction to Tsai:1996:PAG Data Structures With Appli- [Tsa96] Frank C. D. Tsai. A proba- cations. McGraw-Hill, New bilistic approach to geomet- York, NY, USA, 1976. ISBN ric hashing using line fea- 0-07-065150-7. xvi + 704 pp. tures. Computer vision and LCCN QA76.9.D35 .T73. image understanding: CVIU, Tremblay:1984:IDS 63(1):182–195, January 1996. CODEN CVIUF4. ISSN [TS84] J. P. Tremblay and P. G. 1077-3142 (print), 1090-235X Sorenson. An Introduc- (electronic). tion to Data Structures With Applications. McGraw-Hill, Tsai:2008:EMS New York, NY, USA, second edition, 1984. ISBN [Tsa08] Jia-Lun Tsai. Efficient 0-07-065157-4. xviii + 861 multi-server authentication pp. LCCN QA76.9.D35 T73 scheme based on one-way 1984. Hashing is covered in hash function without ver- section 6–2.4. ification table. Comput- ers and Security, 27(3–4): Tilchin:1985:EDS 115–121, May/June 2008. [TS85] O. T. Til’chin and O. L. CODEN CPSEDU. ISSN Shor. Efficient data stor- 0167-4048 (print), 1872-6208 age and retrieval organi- (electronic). URL https: zation using the frequency //www.sciencedirect.com/ properties of the query science/article/pii/S0167404808000084. stream. Programming and Tsoukalos:2015:HTP Computer Software; translation of Programmirovaniye, [Tso15] Mihalis Tsoukalos. Hash ta- (Moscow, USSR) Plenum, bles — theory and practice. 11(6):364–368, November– Linux Journal, 2015(256): December 1985. CODEN 2:1–2:??, August 2015. CO- PCSODA. ISSN 0361- DEN LIJOFX. ISSN 1075- 7688 (print), 1608-3261 (elec- 3583 (print), 1938-3827 (electronic). tronic). URL http://dl. acm.org/ft_gateway.cfm? Tsai:1994:GHL id=2830288. [Tsa94] F. C. D. Tsai. Geometric Turan:2011:SRS hashing with line features. Pattern Recognition, 27(3): [TSP+11] Turan, M. S., R. Perlner, 377–??, March 1994. CO- L. E. Bassham, W. Burr, DEN PTNRA8. ISSN 0031- D. Chang, S. Chang, M. Dworkin, REFERENCES 462

J. Kelsey, J. M. Paul, and Tai:1981:CCH R. Peralta. Status report on the Second Round of [TT81] K.-C Tai and A. L. Tharp. the SHA-3 Cryptographic Computed chaining: a hybrid Hash Algorithm Competi- of direct chaining and open tion. NIST Interagency Re- addressing. Information sys- port 7764, National Insti- tem, 6(2):111–116, 1981. CO- tute for Standards and Tech- DEN INSYD6. ISSN 0306- nology, Gaithersburg, MD 4379 (print), 1873-6076 (elec- 20899-8900, USA, February tronic). 2011. URL http:/csrc. Tharp:1982:PTS nist.gov/groups/ST/hash/ sha-3/Round2/documents/ [TT82] Alan L. Tharp and Kuo- Round2_Report_NISTIR_7764. Chung Tai. The practical- pdf. ity of text signatures for accelerating string search- Tsudik:1992:MAOa ing. Software—Practice and Experience, 12(1):35– [Tsu92a] G. Tsudik. Message authen- 44, January 1982. CODEN tication with one-way hash SPEXBL. ISSN 0038-0644 functions. Computer Com- (print), 1097-024X (elec- munication Review, 22(5): tronic). Expands Harrison’s 29–38, October 1, 1992. CO- work [Har71a]. DEN CCRED2. ISSN 0146- 4833. Tai:1986:CCC Tsudik:1992:MAOb [TT86] K. C. Tai and A. L. Tharp. A comparison of [Tsu92b] G. Tsudik. Message authen- computed chaining to pre- tication with one-way hash dictors. IEEE Transactions functions. In IEEE [IEE92a], on Software Engineering,SE- page ?? Three volumes. 12(8):870–874, August 1986. IEEE Computer Society or- CODEN IESEDJ. ISSN der number 2860. IEEE cat- 0098-5589 (print), 1939-3520 alog number 92CH3133-6. (electronic). URL http: Thomlinson:1998:NBP //ieeexplore.ieee.org/ stamp/stamp.jsp?arnumber= [TSY98] Matthew W. Thomlinson, 6312990. Daniel R. Simon, and Ben- Talia:2010:EDQ net Yee. Non-biased pseudo random number genera- [TT10] Domenico Talia and Paolo tor. United States Patent Trunﬁo. Enabling dy- 5,778,069., July 7, 1998. namic querying over dis- URL http:www.google. tributed hash tables. Jour- com/patents/US5778069. nal of Parallel and Dis- REFERENCES 463

tributed Computing, 70(12): 4586:293–307, 2007. CO- 1254–1265, December 2010. DEN LNCSD9. ISSN 0302- CODEN JPDCER. ISSN 9743 (print), 1611-3349 (elec- 0743-7315 (print), 1096-0848 tronic). URL http://link. (electronic). springer.com/content/pdf/ 10.1007/978-3-540-73458- Tian:1993:NHF 1_22. [TTY93] Z. Tian, S. Tong, and Tang:2018:CIC S. Yang. A new hashing function: Statistical behavior and [TWL+18] Min Tang, Tongtong Wang, algorithm. SIGIR forum,27 Zhongyuan Liu, Ruofeng (1):3–??, Spring 1993. CO- Tong, and Dinesh Manocha. DEN FASRDV. ISSN 0163- I-cloth: incremental col- 5840. lision handling for GPU- based interactive cloth sim- Torenvliet:1983:ROT ulation. ACM Transactions [Tv83] Leen Torenvliet and P. van on Graphics, 37(6):204:1– Emde Boas. The reconstruc- 204:??, November 2018. CO- tion and optimization of trie DEN ATGRDF. ISSN 0730- hashing functions. In Schkol- 0301 (print), 1557-7368 (elec- nick and Thanos [ST83a], tronic). pages 142–156. CODEN VLDBDP. Tzschach:1977:TCS Teuhola:1991:MSA [TWW77] H. G. Tzschach, Helmut Waldschmidt, and Hermann [TW91] Jukka Teuhola and Lutz K.-G. Walter, editors. The- Wegner. Minimal space, oretical computer science/3rd average linear time dupli- GI conference, Darmstadt, cate deletion. Communica- March 28–30, 1977,vol- tions of the Association for ume 48 of Lecture Notes in Computing Machinery,34 Computer Science. Springer- (3):62–73, March 1991. CO- Verlag, Berlin, Germany / DEN CACMA2. ISSN 0001- Heidelberg, Germany / Lon- 0782 (print), 1557-7317 (elec- don, UK / etc., 1977. ISBN tronic). 0-387-08138-0. LCCN QA267 .G18 1977. Tartary:2007:CPH Tang:2011:SFB [TW07] Christophe Tartary and Huaxiong Wang. Combin- [TWZW11] Zhenjun Tang, Shuozhong ing prediction hashing and Wang, Xinpeng Zhang, and MDS codes for eﬃcient mul- Weimin Wei. Structural ticast stream authentica- feature-based image hashing tion. Lecture Notes in CS, and similarity metric for tam- REFERENCES 464

pering detection. Funda- sc-conference.org/sc2003/ menta Informaticae, 106(1): paperpdfs/pap299.pdf. 75–91, January 2011. CO- Tyma:1996:TJP DEN FUMAAJ. ISSN 0169- 2968 (print), 1875-8681 (elec- [Tym96] Paul Tyma. Tuning Java tronic). performance. Dr. Dobbs Journal, 21(4):52, 55–56, 58, Tarjan:1979:SST 90, April 1996. CODEN [TY79] Robert Endre Tarjan and DDJOEB. ISSN 1044-789X. Andrew Chi-Chih Yao. Stor- Tao:2010:EAN ing a sparse table. Commu- [TYSK10] Yufei Tao, Ke Yi, Cheng nications of the Association Sheng, and Panos Kalnis. for Computing Machinery, Efficient and accurate near- 22(11):606–611, November est neighbor and closest pair 1979. CODEN CACMA2. search in high-dimensional ISSN 0001-0782 (print), space. ACM Transactions 1557-7317 (electronic). See on Database Systems, 35(3): also [FKS84]. 20:1–20:??, July 2010. CO- Tien:1991:CHB DEN ATDSD3. ISSN 0362- 5915 (print), 1557-4644 (elec- [TY91] J.-Y. Tien and W.-P. Yang. tronic). Comments on “hash-based andindex-basedjoinal- Tang:2015:EGF gorithms for cube and [TYZO15] Suhua Tang, Yi Yu, Roger ring connected multicom- Zimmermann, and Sadao puters”. IEEE Transac- Obana. Efficient geo-fencing tions on Knowledge and via hybrid hashing: A com- Data Engineering, 3(3):387– bination of bucket selec- ??, September 1, 1991. CO- tion and in-bucket binary DEN ITKEEH. ISSN 1041- search. ACM Transactions 4347. on Spatial Algorithms and Tang:2003:EDL Systems (TSAS), 1(2):5:1– 5:22, November 2015. CO- [TY03] Hong Tang and Tao Yang. DEN ???? ISSN 2374- An efficient data location 0353 (print), 2374-0361 (elec- protocol for self-organizing tronic). URL http://dl. storage clusters. In ACM acm.org/citation.cfm?id= [ACM03b], page ?? ISBN 2774219. 1-58113-695-1. LCCN ???? Tillich:1994:GHF URL http://www.sc-conference. org/sc2003/inter_cal/inter_[TZ94a] J.-P. Tillich and G. Zemor. cal_detail.php?eventid= Group-theoretic hash func- 10686#0; http://www. tions. In Cohen [Coh94], REFERENCES 465

pages 90–110. ISBN 3- togram equalization frame- 540-57843-9. ISSN 0302- work: An efficient parallel 9743 (print), 1611-3349 (elec- hash-based join. Information tronic). LCCN QA268 .A397 Processing Letters, 55(5): 1994. 283–289, September 15, 1995. Tillich:1994:HS CODEN IFPLAT. ISSN 0020-0190 (print), 1872-6119 [TZ94b] J.-P. Tillich and G. Zemor. (electronic). Hashing with SL2. Lec- ture Notes in CS, 839:40– Ugawa:2010:IRB 49, 1994. CODEN LNCSD9. ISSN 0302-9743 (print), [UIY10] Tomoharu Ugawa, Hideya 1611-3349 (electronic). Iwasaki, and Taiichi Yuasa. Improved replication-based Thorup:2012:TBI incremental garbage collection for embedded systems. [TZ12] Mikkel Thorup and Yin SIGPLAN Notices, 45(8):73– Zhang. Tabulation-based 82, August 2010. CODEN 5-independent hashing with SINODQ. ISSN 0362-1340 applications to linear prob- (print), 1523-2867 (print), ing and second moment es- 1558-1160 (electronic). timation. SIAM Journal on Computing, 41(2):293– Ullman:1970:DHF 331, ???? 2012. CO- DEN SMJCAT. ISSN 0097- [Ull70] Jeffrey D. Ullman. The 5397 (print), 1095-7111 (elec- design of hashing functions. tronic). Technical Report 85, Prince- ton University, Electrical En- Urvoy:2008:TWS gineering Department, TR, [UCFL08] Tanguy Urvoy, Emmanuel September 1970. ?? pp. Chauveau, Pascal Filoche, Ullman:1972:NEH and Thomas Lavergne. Track- ing Web spam with HTML [Ull72] Jeffrey D. Ullman. A note style similarities. ACM on the efficiency of hash- Transactions on the Web ing functions. Journal of (TWEB), 2(1):3:1–3:??, Febru- the Association for Comput- ary 2008. CODEN ???? ISSN ing Machinery, 19(3):569– 1559-1131 (print), 1559-114X 575, July 1972. CODEN (electronic). JACOAH. ISSN 0004-5411 Ung:1995:UPR (print), 1557-735X (electronic). Early work on the [UHT95] K. P. Ung, K. C. Hwang, and problem of finding optimal G. K. Tag. Uniform parti- hash functions for open ad- tioning of relations using his- dressing. REFERENCES 466

Ullman:1982:PDS USENIX:1991:PWU

[Ull82] Jeﬀrey D. Ullman. Principles [USE91] Proceedings of the Win- of Database Systems.Com- ter 1991 USENIX Confer- puter Science Press, 11 Taft ence: January 21-January Court, Rockville, MD 20850, 25, 1991, Dallas, TX, USA. USA, second edition, 1982. USENIX, San Francisco, CA, ISBN 0-7167-8069-0. vii + USA, 1991. 484 pp. LCCN QA76.9.D3 U44 1983. USENIX:2000:PAL Urdaneta:2011:SDS [USE00a] USENIX, editor. Pro- ceedings of the 4th Annual [UPV11] Guido Urdaneta, Guillaume Linux Showcase and Confer- Pierre, and Maarten Van ence, Atlanta, October 10– Steen. A survey of DHT 14, 2000, Atlanta, Geor- security techniques. ACM gia, USA. USENIX, San Computing Surveys, 43(2): Francisco, CA, USA, 2000. 8:1–8:??, January 2011. CO- ISBN 1-880446-17-0. LCCN DEN CMSVAN. ISSN 0360- ???? URL http://www. 0300 (print), 1557-7341 (elec- usenix.org/publications/ tronic). library/proceedings/als2000/ . Uchiyama:2009:RIB USENIX:2000:PUT [US09] Hideaki Uchiyama and Hideo Saito. Rotated image based [USE00b] USENIX, editor. Proceedings photomosaic using combina- of the 7th USENIX Tcl/Tk tion of principal component Conference (Tcl/2k): Febru- hashing. Lecture Notes in ary 14–18, 2000, Austin, CS, 5414:668–679, 2009. CO- Texas, USA. USENIX, San DEN LNCSD9. ISSN 0302- Francisco, CA, USA, 2000. 9743 (print), 1611-3349 (elec- ISBN 1-880446-24-3. LCCN tronic). URL http://link. ???? URL http://db. springer.com/content/pdf/ usenix.org/publications/ 10.1007/978-3-540-92957- library/proceedings/tcl2k/ 4_58. . USENIX:1990:UCC Vakhshoori:1985:UHD

[USE90] USENIX C++ conference [Vak85] Koorosh Vakhshoori. The use proceedings: C++ Confer- of hashing in a database ma- ence, San Francisco, Cal- chine. Master’s thesis, Uni- ifornia, April 9–11, 1990. versity of California, Davis, USENIX, San Francisco, CA, Davis, CA, USA, 1985. 183 USA, 1990. pp. REFERENCES 467

Valduriez:1987:JI (Berlin). LCCN QA76.9.A25 C79 1992. DM104.00. [Val87] Patrick Valduriez. Join indices. ACM Transactions vanTrung:1994:CCC on Database Systems, 12(2): 218–246, June 1987. CO- [van94] T. van Trung. A combina- DEN ATDSD3. ISSN 0362- torial characterization of cer- 5915 (print), 1557-4644 (elec- tain universal classes of hash tronic). Compares join in- functions. Journal of Com- dices with inverted indices, binatorial Designs, 2(3):161– clustered indices, B+ trees, ??, May 1, 1994. CODEN linked lists, and hybrid hash JDESEU. ISSN 1063-8539. techniques. Gucht:2010:PHE Valiant:2015:FCS [Val15] Gregory Valiant. Finding [Van10] Dirk Van Gucht, editor. correlations in subquadratic PODS’10: proceedings of the time, with applications to Twenty-Eight ACM SIGMOD- learning parities and the clos- SIGACT-SIGART Sympo- est pair problem. Jour- sium on Principles of Database nal of the Association for Systems: Indianapolis, Indi- Computing Machinery,62 ana, USA, June 6–11, 2011. (2):13:1–13:??, May 2015. ACM Press, New York, NY CODEN JACOAH. ISSN 10036, USA, 2010. ISBN 1- 0004-5411 (print), 1557-735X 4503-0033-2. LCCN ???? (electronic). Vaudenay:1992:FHI vanderPool:1973:OSAb [Vau92] S. Vaudenay. FFT-hash-II [van73] J. A. van der Pool. Opti- is not yet collision-free. In mum storage allocation for Brickell [Bri92], pages 587– a ﬁle with open address- 593. ISBN 0-387-57340-2 ing. IBM Journal of Research (New York), 3-540-57340-2 and Development, 17(2):106– (Berlin). LCCN QA76.9.A25 114, March 1973. CO- C79 1992. DM104.00. DEN IBMJAE. ISSN 0018- 8646 (print), 2151-8556 (elec- Vaudenay:1993:FHI tronic). [Vau93] S. Vaudenay. FFT-Hash- Vandery:1992:FHN II is not yet collision-free. [Van92] S. Vandery. FFT-hash Lecture Notes in CS, 740: II is not yet collision- 587–593, 1993. CODEN free. In Brickell [Bri92], LNCSD9. ISSN 0302-9743 page ?? ISBN 0-387-57340- (print), 1611-3349 (elec- 2 (New York), 3-540-57340-2 tronic). REFERENCES 468

Vaudenay:2006:ACE 76.9 D3 S53 v.23 no.2 1994. URL http://www. [Vau06] Serge Vaudenay, editor. Ad- acm.org/pubs/articles/ vances in Cryptology — EU- proceedings/mod/191839/ ROCRYPT 2006: 25th In- p253-vingralek/p253-vingralek. ternational Conference on pdf; http://www.acm. the Theory and Applications org/pubs/citations/proceedings/ of Cryptographic Techniques, mod/191839/p253-vingralek/ St. Petersburg, Russia, May . 28–June 1, 2006, Proceed- Vitter:1985:OAM ings, volume 4004 of Lec- ture Notes in Computer Sci- [VC85] Jeffrey Scott Vitter and Wen- ence. Springer-Verlag, Berlin, Chin Chen. Optimum al- Germany / Heidelberg, Ger- gorithms for a model of di- many / London, UK / etc., rect chaining. SIAM Jour- 2006. ISBN 3-540-34547-7. nal on Computing, 14(2): LCCN ???? URL http: 490–499, May 1985. CO- //www.springerlink.com/ DEN SMJCAT. ISSN 0097- content/978-3-540-34547- 5397 (print), 1095-7111 (elec- 3. tronic). Vckovski:2000:MTS Vitter:1987:DAC [VB00] Andrej Vckovski and Ja- [VC87] Jeffrey Scott Vitter and Wen- son Brazile. A multi- Chin Chen. The Design threaded server for shared and Analysis of Coalesced hash table access. In Hashing. Oxford University USENIX [USE00b], page ?? Press, Walton Street, Oxford ISBN 1-880446-24-3. LCCN OX2 6DP, UK, 1987. ISBN ???? URL http://db. 0-19-504182-8. xii + 160 usenix.org/publications/ pp. LCCN QA76.9.H36 V57 library/proceedings/tcl2k/ 1987. US$29.95. vckovski.html. Vandierendonck:2005:XBH Vingralek:1994:DFO [VD05] H. Vandierendonck and [VBW94] Radek Vingralek, Yuri Breit- K. De Bosschere. XOR- bart, and Gerhard Weikum. based hash functions. IEEE Distributed file organiza- Transactions on Computers, tion with scalable cost/ 54(7):800–812, July 2005. performance. In Snod- CODEN ITCOB4. ISSN grass and Winslett [SW94b], 0018-9340 (print), 1557- pages 253–264. ISBN 0- 9956 (electronic). URL 89791-639-5. ISSN 0163- http://ieeexplore.ieee. 5808 (print), 1943-5835 org/stamp/stamp.jsp?tp=& (electronic). LCCN QA arnumber=1432664. REFERENCES 469

vandenBraak:2016:CXH 17(1):27–38, January 1973. CODEN IBMJAE. ISSN + [vdBGLGL 16] Gert-Jan van den Braak, 0018-8646 (print), 2151-8556 Juan Gómez-Luna, JoséMar´ıa (electronic). González-Linares, Henk Cor- poraal, and Nicolás Guil. deVillers:1974:HSS Configurable XOR hash func- [vdSdW74a] E. v. d. S. de Villers and tions for banked scratchpad L. B. Wilson. Hashing the memories in GPUs. IEEE subscripts of a sparse matrix. Transactions on Computers, BIT (Nordisk tidskrift for 65(7):2045–2058, ???? 2016. informationsbehandling),14 CODEN ITCOB4. ISSN (3):347–358, 1974. CODEN 0018-9340 (print), 1557-9956 BITTEL, NBITAB. ISSN (electronic). 0006-3835 (print), 1572-9125 vanderHoeven:2012:IPI (electronic).

[vdHvH12] Joris van der Hoeven and DeVilliers:1974:HSS Mark van Hoeij, editors. IS- SAC 2012: Proceedings of the [vdSDW74b] E. v. d. S. De Villiers and 2012 International Sympo- L. B. Wilson. Hashing the sium on Symbolic and Alge- subscripts of a sparse ma- braic Computation, July 22– trix. BIT (Copenhagen),14 25, 2012, Grenoble, France. (3):347–358, ???? 1974. CO- ACM Press, New York, NY DEN NBITAB. 10036, USA, 2012. ISBN 1- vanderVegt:2012:PCH 4503-1269-1. LCCN QA76.95 .I59 2012. [vdVL12] Steven van der Vegt and Alfons Laarman. A par- vanderPool:1972:OSA allel compact hash table. [vdP72] J. A. van der Pool. Op- Lecture Notes in CS, 7119: timum storage allocation 191–204, 2012. CODEN for initial loading of a ﬁle. LNCSD9. ISSN 0302-9743 IBM Journal of Research (print), 1611-3349 (elec- and Development, 16(6):579– tronic). URL http://link. 586, November 1972. CO- springer.com/chapter/10. DEN IBMJAE. ISSN 0018- 1007/978-3-642-25929-6_ 8646 (print), 2151-8556 (elec- 18/. tronic). Veklerov:1985:ADH vanderPool:1973:OSAa [Vek85] Eugene Veklerov. Analysis [vdP73] J. A. van der Pool. Optimum of dynamic hashing with de- storage allocation for a ﬁle in ferred splitting. ACM Trans- steady state. IBM Journal of actions on Database Systems, Research and Development, 10(1):90–96, March 1985. REFERENCES 470

CODEN ATDSD3. ISSN national Conference on Re- 0362-5915 (print), 1557-4644 search and Development in (electronic). Information Retrieval, Brus- sels, Belgium, 5–7 Septem- Ventae:1984:FTR ber 1990. ACM Press, New [Ven84] Olli Ventae. Fast Text York, NY 10036, USA, 1990. Reconstruction Method for ISBN 0-89791-408-2. LCCN the Correction of Imperfect QA76.9.D3I5588 1990, Z 699 Text. IEEE Computer Soci- A1 I582 1990. ety Press, 1109 Spring Street, Viola:2005:EDI Suite 300, Silver Spring, MD [Vio05] Alfredo Viola. Exact dis- 20910, USA, 1984. ISBN 0- tribution of individual dis- 8186-0624-X. 446–452 pp. placements in linear prob- LCCN Q 334 C66 1984. ing hashing. ACM Trans- IEEE Service Cent. Piscat- actions on Algorithms, 1(2): away, NJ, USA. 214–242, October 2005. CO- Ventae:1986:GDS DEN ???? ISSN 1549- 6325 (print), 1549-6333 (elec- [Ven86] Olli Ventae. N-gram driven tronic). search for sentences in a syntactic network. Proceedings Vitter:1980:TCH of the International Confer- [Vit80a] J. S. Vitter. Tuning the coa- ence on Acoustics, Speech, lesced hashing method to ob- and Signal Processing, pages tain optimum performance. 1145–1148, 1986. CODEN In IEEE-FOCS’80 [IEE80b], IPRODJ. ISSN 0736-7791. pages 238–247. IEEE Service Cent. Piscat- away, NJ, USA. Vitter:1980:ACHa Vo:1991:FHF [Vit80b] Jeﬀrey Scott Vitter. Anal- ysis of Coalescing Hashing. [VFN91] Phong Vo, Glenn Fowler, PhD thesis, Stanford Univer- and Landon Curt Noll. sity, Stanford, CA, USA, Oc- FowlerNollVo hash func- tober 1980. ?? pp. See also tion. Web document., technical report [Vit80c]. 1991. URL https:// en.wikipedia.org/wiki/ Vitter:1980:ACHb Fowler%E2%80%93Noll%E2% [Vit80c] Jeﬀrey Scott Vitter. Anal- 80%93Vo_hash_function# ysis of coalescing hashing. cite_note-2. Technical Report STAN-CS- Vidick:1990:PIC 80-817, Stanford University, October 1980. ?? pp. This [Vid90] Jean-Luc Vidick, editor. Pro- is the author’s Ph.D. thesis, ceedings of the 13th Inter- [Vit80b]. REFERENCES 471

Vitter:1981:SMS Vitter:1983:ASP [Vit83] Jeﬀrey Scott Vitter. Anal- [Vit81a] J. S. Vitter. A shared- ysis of the search perfor- memory scheme for coalesced mance of coalesced hashing. hashing. Information Pro- Journal of the Association cessing Letters, 13(2):77– for Computing Machinery, 79, November 1981. CO- 30(2):231–258, April 1983. DEN IFPLAT. ISSN 0020- CODEN JACOAH. ISSN 0190 (print), 1872-6119 (elec- 0004-5411 (print), 1557-735X tronic). (electronic). Vitter:1981:DAH Vitter:1985:EIO

[Vit81b] Jeffrey Scott Vitter. Dele- [Vit85] Jeffrey Scott Vitter. An ef- tion algorithms for hash- ficient I/O interface for opti- ing that preserve random- cal disks. ACM Transactions ness. Annual Symposium on Database Systems, 10(2): on Foundations of Computer 129–162, June 1985. CO- Science (Proceedings), pages DEN ATDSD3. ISSN 0362- 127–132, 1981. CODEN 5915 (print), 1557-4644 (elec- ASFPDV. ISSN 0272-5428. tronic). URL http://www. acm.org/pubs/articles/ Vitter:1982:DAH journals/tods/1985-10-2/ p129-vitter/p129-vitter. [Vit82a] J. S. Vitter. Deletion al- pdf; http://www.acm. gorithms for hashing that org/pubs/citations/journals/ preserve randomness. Jour- tods/1985-10-2/p129-vitter/ nal of Algorithms, 3(3):261– ; http://www.acm.org/ 275, September 1982. CO- pubs/toc/Abstracts/tods/ DEN JOALDV. ISSN 0196- 3862.html. 6774 (print), 1090-2678 (elec- Vitter:2001:EMA tronic). [Vit01] Jeffrey Scott Vitter. Ex- Vitter:1982:ICH ternal memory algorithms and data structures: dealing [Vit82b] Jeffrey Scott Vitter. Im- with massive data. ACM plementations for coalesced Computing Surveys, 33(2): hashing. Communications of 209–271, June 2001. CO- the Association for Comput- DEN CMSVAN. ISSN 0360- ing Machinery, 25(12):911– 0300 (print), 1557-7341 (elec- 926, December 1982. CO- tronic). DEN CACMA2. ISSN 0001- Varghese:1987:HHT 0782 (print), 1557-7317 (electronic). [VL87] George Varghese and Tony REFERENCES 472

Lauck. Hashed and hi- hierarchical timing wheels: erarchical timing wheels: efficient data structures for Data structures for the ef- implementing a timer facil- ficient implementation of a ity. IEEE/ACM Transac- timer facility. In ACM- tions on Networking, 5(6): OSP’87 [ACM87], pages 25– 824–834, December 1997. 38. ISBN 0-89791-242-x. CODEN IEANEP. ISSN LCCN QA76.6 .O625 v.21:5. 1063-6692 (print), 1558- Published as ACM Operating 2566 (electronic). URL Systems Review, SIGOPS, http://www.acm.org/pubs/ volume 21, number 5. citations/journals/ton/ 1997-5-6/p824-varghese/. vanLeeuwen:1994:GTC Anonymous:1982:VLD [vL94] Jan van Leeuwen, editor. Graph-theoretic concepts in [VLD82] Very Large Data Bases: computer science: 19th In- Eighth International Confer- ternational Workshop, WG ence on Very Large Data ’93, Utrecht, The Nether- Bases, Mexico City, Mex- lands, June 16–18, 1993: ico, September 8–10, 1982. proceedings, volume 790 Morgan Kaufmann Publish- of Lecture Notes in Com- ers, San Francisco, CA, 1982. puter Science. Springer-Ver- ISBN 0-934613-14-1. LCCN lag, Berlin, Germany / Hei- QA76.9.D3 I559 1982. delberg, Germany / Lon- don, UK / etc., 1994. CO- vonMises:1939:ABG DEN LNCSD9. ISBN 0- [vM39] R. von Mises. Uber¨ 86636-292-4 (New York), 3- Aufteilungs- und Beset- 540-57899-4 (Berlin). ISSN zungswahrscheinlichkeiten. 0302-9743 (print), 1611- (German) [on partitioning 3349 (electronic). LCCN and occupation probabili- QA75.5 .I647 1993. URL ties]. Istanbul˙ Universitesi¨ http://link.springer-ny. Fen Fakültesi Mecmuasi,4 com/link/service/series/ (??):145–163, 1939. See also 0558/tocs/t0790.htm; [BC39]. http://www.springerlink. com/content/978-0-86636- vonMaurich:2012:ESB 292-4; http://www.springerlink. com/openurl.asp?genre= [vMG12] Ingo von Maurich and issue&issn=0302-9743&volume= Tim Güneysu. Embed- 790. ded syndrome-based hash- Varghese:1997:HHT ing. Lecture Notes in CS, 7668:339–357, 2012. CO- [VL97] George Varghese and An- DEN LNCSD9. ISSN 0302- thony Lauck. Hashed and 9743 (print), 1611-3349 (elec- REFERENCES 473

tronic). URL http://link. mica, 21(1):37–71, May 1998. springer.com/chapter/10. CODEN ALGOEJ. ISSN 1007/978-3-642-34931-7_ 0178-4617 (print), 1432- 20/. 0541 (electronic). URL http://www.springerlink. Vaswani:2007:PPP com/openurl.asp?genre= [VNC07] Kapil Vaswani, Aditya V. article&issn=0178-4617& Nori, and Trishul M. Chilimbi. volume=21&issue=1&spage= Preferential path profiling: 37. Fourth European compactly numbering inter- Symposium on Algorithms esting paths. SIGPLAN No- (Barcelona, 1996). tices, 42(1):351–362, Jan- vanTrung:2014:TBF uary 2007. CODEN SIN- ODQ. ISSN 0362-1340 [vT14] Tran van Trung. A tight (print), 1523-2867 (print), bound for frameproof codes 1558-1160 (electronic). viewed in terms of separating hash families. De- Vidali:2010:CVB signs, Codes, and Cryptogra- [VNP10] Janoˇs Vidali, Peter Nose, and phy, 72(3):713–718, Septem- Enes Paˇsalić. Collisions for ber 2014. CODEN DC- variants of the BLAKE hash CREC. ISSN 0925-1022 function. Information Pro- (print), 1573-7586 (elec- cessing Letters, 110(14–15): tronic). URL http://link. 585–590, July 1, 2010. CO- springer.com/article/10. DEN IFPLAT. ISSN 0020- 1007/s10623-013-9800-0. 0190 (print), 1872-6119 (elec- Valduriez:1984:MHS tronic). [VV84] Patrick Valduriez and Yann Viola:1996:ALP Viemont. A multikey hashing scheme using predicate [VP96] A. Viola and P. V. Poblete. trees. In ACM SIGMOD ’84 The analysis of linear prob- [ACM84a], pages 107–114. ing hashing with buckets. CODEN SRECD8. ISBN Lecture Notes in CS, 1136: 0-89791-128-8. ISSN 0163- 221–??, 1996. CODEN 5808 (print), 1943-5835 (elec- LNCSD9. ISSN 0302-9743 tronic). LCCN QA76.9.D3 (print), 1611-3349 (elec- A15 1984. tronic). VanWyk:1986:CHL Viola:1998:ALP [VV86] Christopher J. Van Wyk and [VP98] Alfredo Viola and Patri- Jeffrey Scott Vitter. The cio V. Poblete. The anal- complexity of hashing with ysis of linear probing hash- lazy deletion. Algorithmica, ing with buckets. Algorith- 1(1):17–29, January 1986. REFERENCES 474

CODEN ALGOEJ. ISSN Walker:1988:CSP 0178-4617 (print), 1432-0541 (electronic). [Wal88] Henry M. Walker. Com- puter Science 2: Princi- vanOorschot:1994:PCS ples of Software Engineer- ing, Data Types, and Al- [vW94] P. C. van Oorschot and gorithms. Scott, Foresman M. J. Wiener. Parallel colli- and Company, Glenview, IL, sion search with application USA, 1988. ISBN 0-673- to hash functions and dis- 39829-3. xvii + 637 pp. crete logarithms. In ACM LCCN QA76.758 .W35 1989. [ACM94a], pages 210–218. US$25.00. Textbook treat- ISBN 0-89791-732-4. LCCN ment of hashing. ???? Vadhan:2012:CPS Wang:1984:NOT

[VZ12] Salil Vadhan and Colin Jia [Wan84] Patrick Shen-Pei Wang. New Zheng. Characterizing pseu- OCR Technique with Learn- doentropy and simplifying Capability. ACM Press, ing pseudorandom genera- New York, NY 10036, USA, tor constructions. In ACM 1984. ISBN 0-89791-127-X. [ACM12], pages 817–836. 182–?? pp. LCCN ???? ISBN 1-4503-1245-4. LCCN ???? URL http://www.gbv. Wang:2005:VCA de/dms/tib-ub-hannover/ 63314455x.. [Wan05] Shiuh-Jeng Wang. Vowel- Wagner:2000:CYL consonant addressing mode on hashing for English letter- [Wag00] David Wagner. Cryptanal- oriented keys. Journal of Dis- ysis of the Yi-Lam hash. crete Mathematical Sciences Lecture Notes in CS, 1976: and Cryptography, 8(1):1–25, 483–488, 2000. CODEN 2005. CODEN ???? ISSN LNCSD9. ISSN 0302-9743 0972-0529. (print), 1611-3349 (electronic). Wang:2014:DRG

Waldschmidt:1974:OIC [Wan14] Pai-Chou Wang. Dynamic reducts generation using cas- [Wal74] Helmut Waldschmidt. Opti- cading hashes. Interna- mierungsfragen im Compiler- tional Journal of Founda- bau. Carl Hanser, M¨unchen, tions of Computer Science, Germany, 1974. ISBN 3-446- 25(2):219–??, February 2014. 11895-0. 154 pp. LCCN CODEN IFCSEN. ISSN QA76.6 .W326. 0129-0541. REFERENCES 475

Warren:1986:GHR ity in shared-disk ﬁle systems. In ACM [ACM03b], [War86] Van Warren. Geometric page ?? ISBN 1-58113-695- hashing for rendering com- 1. LCCN ???? URL http: plex scenes. M.sc. the- //www.sc-conference.org/ sis, University of Utah, May sc2003/inter_cal/inter_ 1986. ix + 74 pp. cal_detail.php?eventid= Warren:2014:IPH 10686#1; http://www. sc-conference.org/sc2003/ [War14] Michael S. Warren. 2HOT: paperpdfs/pap132.pdf. an improved parallel hashed oct-tree N-body algorithm Wang:2016:CNC for cosmological simulation. [WBWV16] Sen Wang, Jun Bi, Jianping Scientiﬁc Programming,22 Wu, and Athanasios V. Vasi- (2):109–124, ???? 2014. lakos. CPHR: In-network CODEN SCIPEV. ISSN caching for information- 1058-9244 (print), 1875-919X centric networking with par- (electronic). titioning and hash-routing. Wu:1987:ASM IEEE/ACM Transactions on Networking, 24(5):2742– [WB87] C. T. Wu and Walter A. 2755, October 2016. CO- Burkhard. Associative DEN IEANEP. ISSN 1063- searching in multiple stor- 6692 (print), 1558-2566 (elec- age units. ACM Transactions tronic). on Database Systems, 12(1): 38–64, March 1987. CO- Wegman:1979:NCA DEN ATDSD3. ISSN 0362- [WC79] Mark N. Wegman and 5915 (print), 1557-4644 (elec- J. Lawrence Carter. New tronic). Discusses interpola- classes and applications of tion hashing, a multidimen- hash functions. Annual Sym- sional variant of linear hash- posium on Foundations of ing. Computer Science (Proceed- White:1990:CSA ings), ??(??):175–182, ???? 1979. CODEN ASFPDV. [WB90] L. B. White and B. Boashash. Cross spectral analysis of Wegman:1981:NHF nonstationary processes. IEEE [WC81] Mark N. Wegman and Transactions on Information J. Lawrence Carter. New Theory, 36(4):830, 1990. hash functions and their use Wu:2003:HHS in authentication and set equality. Journal of Com- [WB03] Changxun Wu and Randal puter and System Sciences, Burns. Handling heterogene- 22(3):265–279, June 1981. REFERENCES 476

CODEN JCSSBM. ISSN tive algorithm for paralleliz- 0022-0000 (print), 1090-2724 ing hash joins in the presence (electronic). of data skew. In ICDE’91 [ICD91], page 200. ISBN 0- Wu:1994:AGH 8186-2138-9 (paper), 0-8186- [WC94] T.-C. Wu and C.-C. Chang. 6138-0 (microﬁche), 0-8186- Application of geometric 9138-7 (hardcover). LCCN hashing to iconic database QA76.9.D3 I5582 1991. retrieval. Pattern Recogni- tion Letters, 15(9):871–??, Webb:1972:DAE September 1, 1994. CO- DEN PRLEDG. ISSN 0167- [Web72] D. A. Webb. The Develop- 8655 (print), 1872-7344 (elec- ment and Application of an tronic). Evaluation Model for Hash Coding Systems. Ph.d. thesis, Walker:2007:PHF Syracuse University, Syra- [WC07] Robert A. Walker, II and cuse, NY, USA, August 1972. Charles J. Colbourn. Per- fect Hash families: construc- Weems:1988:SPA tions and existence. Journal of Mathematical Cryptology, [Wee88] Bob P. Weems. A study 1(2):125–150, 2007. CODEN of page arrangements for ex- ???? ISSN 1862-2976 (print), tendible hashing. Informa- 1862-2984 (electronic). tion Processing Letters,27 (5):245–248, April 1988. CO- Weng:2012:RIC DEN IFPLAT. ISSN 0020- [WDP+12] Li Weng, Rony Darazi, Bart 0190 (print), 1872-6119 (elec- Preneel, Benoˆıt Macq, and tronic). Ann Dooms. Robust image content authentication using Wee:2007:OWP perceptual hashing and watermarking. Lecture Notes in [Wee07] Hoeteck Wee. One-way per- CS, 7674:315–326, 2012. CO- mutations, interactive hash- DEN LNCSD9. ISSN 0302- ing and statistically hid- 9743 (print), 1611-3349 (elec- ing commitments. Lec- tronic). URL http://link. ture Notes in CS, 4392: springer.com/content/pdf/ 419–433, 2007. CODEN 10.1007/978-3-642-34778- LNCSD9. ISSN 0302-9743 8_29. (print), 1611-3349 (elec- Wolf:1991:EAP tronic). URL http://link. springer.com/content/pdf/ [WDYT91] J.L.Wolf,D.M.Dias,P.S. 10.1007/978-3-540-70936- Yu, and J. Turek. An eﬀec- 7_23. REFERENCES 477

Wee:2011:TRC Chen. Hashing algorithms. In Frakes and Baeza-Yates [Wee11] Hoeteck Wee. Threshold [FBY92], chapter 13, pages and revocation cryptosys- 293–362. ISBN 0-13-463837- tems via extractable hash 9. LCCN QA76.9.D351543 proofs. Lecture Notes in CS, 1992. US$56.00. 6632:589–609, 2011. CO- DEN LNCSD9. ISSN 0302- Wang:2004:CHF 9743 (print), 1611-3349 (elec- [WFLY04] Xiaoyun Wang, Dengguo tronic). URL http://link. Feng, Xuejia Lai, and springer.com/content/pdf/ Hongbo Yu. Collisions for 10.1007/978-3-642-20465- hash functions MD4, MD5, 4_32. HAVAL-128 and RIPEMD. Wee:2012:DPH Cryptology ePrint Archive, Report 2004/199, 2004. URL [Wee12] Hoeteck Wee. Dual pro- http://eprint.iacr.org/ jective hashing and its ap- 2004/199.pdf; http:/ plications — lossy trapdoor /www.tcs.hut.fi/~mjos/ functions and more. Lec- md5/. ture Notes in CS, 7237: 246–262, 2012. CODEN Weiss:2012:MSH LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [WFT12] Yair Weiss, Rob Fergus, and tronic). URL http://link. Antonio Torralba. Multi- springer.com/accesspage/ dimensional spectral hash- chapter/10.1007/978-3- ing. Lecture Notes in CS, 642-29011-4_15; http:/ 7576:340–353, 2012. CO- /link.springer.com/chapter/ DEN LNCSD9. ISSN 0302- 10.1007/978-3-642-29011- 9743 (print), 1611-3349 (elec- 4_16/. tronic). URL http://link. springer.com/content/pdf/ Wenzel:1992:WBU 10.1007/978-3-642-33715- [Wen92] M. Wenzel. Wörterbücher für 4_25. ein beschränktes universum. Wu:2012:PPA (German) [Dictionaries for a limited universe]. Diplomar- [WFW+12] Shuang Wu, Dengguo Feng, beit, Fachbereich Informatik, Wenling Wu, Jian Guo, Universität des Saarlandes, Le Dong, and Jian Zou. Saarbrücken, Germany, ???? (pseudo) preimage attack on 1992. round-reduced Grøstl hash Wartik:1992:HA function and others. Lec- ture Notes in CS, 7549: [WFHC92] Steven Wartik, Edward Fox, 127–145, 2012. CODEN Lenwood Heath, and Qi-Fan LNCSD9. ISSN 0302-9743 REFERENCES 478

(print), 1611-3349 (elec- fax, Virginia, April 1988. tronic). URL http://link. American Statistical Asso- springer.com/chapter/10. ciation, Alexandria, VA, 1007/978-3-642-34047-5_ USA, 1988. URL http: 8/. //www.dtic.mil/dtic/tr/ fulltext/u2/a208838.pdf. Weaver:1994:SAM Weide:1983:MCE [WG94] David L. Weaver and Tom Germond. The SPARC [WH83] Bruce W. Weide and David J. Architecture Manual: Ver- Hogan. Mapping to Cells: sion 9. Prentice-Hall PTR, Extension of a Data Struc- Upper Saddle River, NJ ture for Fast Storage and 07458, USA, 1994. ISBN Retrieval. Springer-Verlag, 0-13-099227-5. xxii + 357 Berlin, Germany / Heidel- pp. LCCN QA76.9.A73S648 berg, Germany / London, 1992. US$33.00. URL http:/ UK / etc., 1983. ISBN 0-387- /www.sparc.org/standards/ 90835-8. 37–41 pp. LCCN SPARCV9.pdf. QA276.4 .C58 1982. Wagner:2000:PSU Wang:2007:BTS

[WG00] David Wagner and Ian Gold- [WHS+07] Chia-Wei Wang, Hung- berg. Proofs of security for Chang Hsiao, Wen-Hung the Unix password hashing Sun, Chung-Ta King, and algorithm. Lecture Notes Ming-Tsung Sun. Building in CS, 1976:560–572, 2000. a tuple space on structured CODEN LNCSD9. ISSN peer-to-peer networks. The 0302-9743 (print), 1611- Journal of Supercomputing, 3349 (electronic). URL 40(3):213–227, June 2007. http://link.springer-ny. CODEN JOSUED. ISSN com/link/service/series/ 0920-8542 (print), 1573- 0558/bibs/1976/19760560. 0484 (electronic). URL htm; http://link.springer- http://www.springerlink. ny.com/link/service/series/ com/openurl.asp?genre= 0558/papers/1976/19760560. article&issn=0920-8542& pdf. volume=40&issue=3&spage= 213. Wegman:1988:CSS Wiederhold:1983:FOD [WGM88] Edward J. Wegman, Don- ald T. Gantz, and John J. [Wie83] Gio Wiederhold. File Or- Miller, editors. Computing ganization for Database De- Science and Statistics Pro- sign. McGraw-Hill Com- ceedings of the 20th Sympo- puter Science Series, Editor: sium on the Interface Fair- Richard W. Hamming and REFERENCES 479

Edward A. Feigenbaum. Mc- ogy conference, Santa Bar- Graw-Hill, New York, NY, bara, California, USA, Au- USA, 1983. ?? pp. gust 15–19, 1999 proceedings, volume 1666 of Lec- Wiener:1986:EVH ture Notes in Computer Sci- [Wie86] Richard S. Wiener. An ence. Springer-Verlag, Berlin, eﬃcient virtual hash algo- Germany / Heidelberg, Ger- rithm for a spelling checker. many / London, UK / etc., Journal of Pascal, Ada 1999. ISBN 3-540-66347-9. and Modula-2, 5(1):23–29, LCCN QA76.9.A25 C79 1999 January–February 1986. CO- Bar. DEN JOPAD5, JPAME8. Williams:1959:HII ISSN 0735-1232. [Wil59] F. A. Williams. Handling Wiederhold:1987:FOD identiﬁers as internal symbols [Wie87a] Gio Wiederhold. File Or- in language processors. Com- ganisation For Database De- munications of the Associa- sign. McGraw-Hill, New tion for Computing Machin- York, NY, USA, 1987. ISBN ery, 2(6):21–24, June 1959. 0-07-070133-4. xiv + 619 pp. CODEN CACMA2. ISSN LCCN QA76.9.F5 W53 1987. 0001-0782 (print), 1557-7317 US$38.95. (electronic). Wiedermann:1987:SA Williams:1971:SUM

[Wie87b] Juraj Wiedermann. Search- [Wil71] J. G. Williams. Storage uti- ing Algorithms. B.G.Teub- lization in a memory hier- ner, Stuttgart, Germany, archy when storage assign- 1987. ISBN 3-322-00433-3. ment is performed by a hash- 123 pp. LCCN QA76.9.D35 ing algorithm. Communi- W525 1987. cations of the Association for Computing Machinery,14 Wiederhold:1989:DD (3):172–5, March 1971. CO- [Wie89] Gio Wiederhold. Dateiorgan- DEN CACMA2. ISSN 0001- isation in Datenbanken.Mc- 0782 (print), 1557-7317 (elec- Graw-Hill, New York, NY, tronic). USA, 1989. ISBN 3-89028- 133-8. ?? pp. Willard:1978:NDS Wiener:1999:ACC [Wil78] Dan E. Willard. New data structures for orthogonal [Wie99] Michael Wiener, editor. Ad- queries. Technical Report vances in cryptology — TR-22-78, Centre for Re- CRYPTO ’99: 19th an- search in Computing Tech- nual international cryptol- nology, Harvard University, REFERENCES 480

Cambridge, MA, 1978. ?? Wildner:1996:CAS pp. Published in [Wil85a]. [Wil96] U. Wildner. Compiler as- Willett:1979:DRE sisted self-checking of structural integrity using return [Wil79] Peter Willett. Document re- address hashing. Lecture trieval experiments using in- Notes in CS, 1150:161–??, dexing vocabularies of vary- 1996. CODEN LNCSD9. ing size — 2. hashing, trunca- ISSN 0302-9743 (print), tion, digram and trigram en- 1611-3349 (electronic). coding of index terms. Jour- nal of Documentation,35 Wild:1997:AAB (4):296–305, December 1979. [Wil97] Fred Wild. Algorithm al- CODEN JDOCAS. ISSN ley. Dr. Dobbs Journal,22 0022-0418 (print), 1758-7379 (3):105–??, March 1997. CO- (electronic). DEN DDJOEB. ISSN 1044- Willard:1985:NDS 789X. Willard:2000:ECG [Wil85a] Dan E. Willard. New data structures for orthog- [Wil00] Dan E. Willard. Examin- onal range queries. SIAM ing computational geometry, Journal on Computing,14 Van Emde Boas trees, and (1):232–253, February 1985. hashing from the perspective CODEN SMJCAT. ISSN of the fusion tree. SIAM 0097-5397 (print), 1095-7111 Journal on Computing,29 (electronic). This paper, to- (3):1030–1049, June 2000. gether with an earlier re- CODEN SMJCAT. ISSN port [Wil78], present seven 0097-5397 (print), 1095-7111 data structures for orthogo- (electronic). URL http:/ nal range queries which are /epubs.siam.org/sam-bin/ more eﬃcient than earlier dbq/article/32242. data structures used for this purpose, such as box array Wiley:2003:DHT hashing. [Wil03] Brandon Wiley. Distributed hash tables, Part I. Linux Williamson:1985:CCS Journal, 2003(114):7, Oc- [Wil85b] Stanley Gill Williamson. tober 2003. CODEN LI- Combinatorics for Computer JOFX. ISSN 1075-3583 Science. Computer Sci- (print), 1938-3827 (elec- ence Press, 11 Taft Court, tronic). Rockville, MD 20850, USA, WilsonGarcia:2014:GLD 1985. ISBN 0-88175-020-4. xliii + 479 pp. LCCN QA164 [Wil14] Edscott Wilson Garc´ıa. GNU .W55 1985. US$39.95. libdbh (disk-basedhashta- REFERENCES 481

bles). SourceForge software sets of data. In Akl et al. archive., April 9, 2014. URL [AFK90], page ?? ISBN 0- http://sourceforge.net/ 387-53504-7 (New York), 3- projects/dbh; http:/ 540-53504-7 (Berlin). LCCN /www.gnu.org/software/ QA75.5 .I578 1990. libdbh/. Winters:1990:MPHa Winkowski:1978:SMF [Win78] J. Winkowski, editor. Mathe- [Win90b] Vincent G. Winters. Mini- matical Foundations of Com- mal perfect hashing in poly- puter Science, 1978: pro- nomial time. BIT (Nordisk ceedings, 7th Symposium, Za- tidskrift for informations- kopane, Poland, September behandling), 30(2):235–244, 4–8, 1978,volume64ofLec- 1990. CODEN BITTEL, ture Notes in Computer Sci- NBITAB. ISSN 0006-3835 ence. Springer-Verlag, Berlin, (print), 1572-9125 (elec- Germany / Heidelberg, Ger- tronic). many / London, UK / etc., 1978. ISBN 0-387-08917-9. Wirth:1975:AD LCCN QC770 .I55 1978. [Wir75] Niklaus Wirth. Algorith- Winternitz:1983:POW men und Datenstrukturen.B. [Win83] Robert S. Winternitz. Pro- G. Teubner, Stuttgart, Ger- ducing a one-way hash func- many, 1975. ISBN 3-519- tion from DES. In Chaum 02330-X. 376 pp. LCCN et al. [CRS83a], pages 203– QA76.9.D35 W57. DM26.80. 207. ISBN 0-306-41637-9, 1- 4757-0604-9 (print), 1-4757- Wirth:1983:AD 0602-2. LCCN QA76.9.A25 C791 1983. [Wir83] N. Wirth. Algorithmen Winternitz:1984:SOH und Datenstrukturen.B. G. Teubner, Stuttgart, Ger- [Win84] Robert S. Winternitz. Secure many, third edition, 1983. one-way hash function built ISBN 3-519-02250-8. 320 pp. from DES. Proceedings of the Symposium on Security and Wirth:1986:ADS Privacy, pages 88–90, 1984. CODEN PSSPEO. ISBN 0- [Wir86] Niklaus Wirth. Algorithms 8186-0532-4. IEEE Service and Data Structures.Pren- Cent. Piscataway, NJ, USA. tice-Hall, Englewood Cliﬀs, NJ 07632, USA, 1986. ISBN Winters:1990:MPHb 0-13-022005-1. 288 pp. [Win90a] Vincent G. Winters. Mini- LCCN QA76.9.D35 W58 mal perfect hashing for large 1986. US$32.95. REFERENCES 482

Westergaard:2007:CME number for BF-based object locating algorithm. Lec- [WKBA07] Michael Westergaard, Lars Michael ture Notes in CS, 7332: Kristensen, Gerth Stølting 543–552, 2012. CODEN Brodal, and Lars Arge. The LNCSD9. ISSN 0302-9743 ComBack method — ex- (print), 1611-3349 (elec- tending hash compaction tronic). URL http://link. with backtracking. Lec- springer.com/content/pdf/ ture Notes in CS, 4546: 10.1007/978-3-642-31020- 445–464, 2007. CODEN 1_65. LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- Wang:2020:PEF tronic). URL http://link. [WLC20] Kefei Wang, Jian Liu, and springer.com/content/pdf/ Feng Chen. Put an ele- 10.1007/978-3-540-73094- phant into a fridge: op- 1_26. timizing cache eﬃciency Wipke:1978:HFR for in-memory key–value stores. Proceedings of [WKO78] W. T. Wipke, S. Krishnan, the VLDB Endowment,13 and G. I. Ouchi. Hash func- (9):1540–1554, May 2020. tions for rapid storage and re- CODEN ???? ISSN trieval of chemical structures. 2150-8097. URL https:/ Journal of Chemical Infor- /dl.acm.org/doi/abs/10. mation and Computer Sci- 14778/3397230.3397247. ences, 18(1):32–37, February 1978. CODEN JCISD8. ISSN Wang:2008:HBS 0095-2338. [WLLG08] Hongzhi Wang, Jianzhong Li, Wang:2007:LBP Jizhou Luo, and Hong Gao. Hash-base subgraph query [WL07] Xiaoming Wang and Dmitri processing method for graph- Loguinov. Load-balancing structured XML documents. performance of consistent Proceedings of the VLDB En- hashing: asymptotic anal- dowment, 1(1):478–489, Au- ysis of random node join. gust 2008. CODEN ???? IEEE/ACM Transactions ISSN 2150-8097. on Networking, 15(4):892– 905, August 2007. CO- Wang:2019:DDD DEN IEANEP. ISSN 1063- [WLWZ19] Yicheng Wang, Yang Liu, 6692 (print), 1558-2566 (elec- Peiyun Wu, and Zhao Zhang. tronic). Detect DRAM disturbance Yau:2009:NTV error by using disturbance bin counters. IEEE Com- [WL12] Zhu Wang and Tiejian Luo. puter Architecture Letters, Optimizing hash function 18(1):34–37, January/June REFERENCES 483

2019. CODEN ???? ISSN rata for the book, are avail- 1556-6056 (print), 1556-6064 able for anonymous ftp from (electronic). munnari.oz.au in the directory /pub/mg. Wang:1993:IHA Witten:1999:MGC [WM93] Y. B. Wang and T. P. Mack. An indexed-hash al- [WMB99] Ian H. Witten, Alistair Mof- gorithm for an agrometeoro- fat, and Timothy C. Bell. logical data management sys- Managing Gigabytes: Com- tem. Computers and Elec- pressing and Indexing Doc- tronics in Agriculture, 8(2): uments and Images.Mor- 105–??, March 1, 1993. CO- gan Kaufmann Publishers, DEN CEAGE6. ISSN 0168- San Francisco, CA, second 1699. edition, 1999. ISBN 1- Wyman:2019:IAT 55860-570-3. xxxi + 519 pp. LCCN TA1637 .W58 [WM19] Chris Wyman and Mor- 1994. US$54.95. URL ftp: gan McGuire. Improved //ftp.math.utah.edu/pub/ alpha testing using hashed mg/; ftp://ftp.math. sampling. IEEE Transac- utah.edu/pub/mg/mg-1.3x/ tions on Visualization and bibsearch-1.02.tar.gz; Computer Graphics, 25(2): ftp://munnari.oz.au:/ 1309–1320, February 2019. pub/mg; http://www.cs. CODEN ITVGEA. ISSN mu.oz.au/mg/; http:// 1077-2626 (print), 1941- www.cs.mu.oz.au/~alistair/ 0506 (electronic), 2160- arith_coder/; http:// 9306. URL https://www. www.math.utah.edu/pub/ computer.org/csdl/trans/ mg/; http://www.math. tg/2019/02/08010336-abs. utah.edu/pub/mg/mg-1.3x/ . html bibsearch-1.02.tar.gz; Witten:1994:MGC http://www.mkp.com/books_ catalog/1-55860-570-3. [WMB94] Ian H. Witten, Alistair Mof- asp. fat, and Timothy C. Bell. Managing Gigabytes: Com- Woelfel:2001:NBO pressing and Indexing Docu- ments and Images.VanNos- [Woe01] Philipp Woelfel. New bounds trand Reinhold, New York, on the OBDD-size of inte- NY, USA, 1994. ISBN 0- ger multiplication via univer- 442-01863-0. xiv + 429 sal hashing. Lecture Notes pp. LCCN TA1637 .W58 in CS, 2010:563–??, 2001. 1994. US$54.95. The soft- CODEN LNCSD9. ISSN ware for full-text indexing de- 0302-9743 (print), 1611- scribedinthisbook,ander- 3349 (electronic). URL REFERENCES 484

http://link.springer-ny. tronic). LCCN QA75.5 com/link/service/series/ .I643 2006. URL http: 0558/bibs/2010/20100563. //www.springerlink.com/ htm; http://link.springer- content/w40104p9224657rk/ ny.com/link/service/series/ . 0558/papers/2010/20100563. Wogulis:1989:SAS pdf. [Wog89] James Wogulis. Self- Woelfel:2005:BOS adjusting and split sequence [Woe05] Philipp Woelfel. Bounds hash tables. Information on the OBDD-size of inte- Processing Letters, 30(4): ger multiplication via uni- 185–188, February 27, 1989. versal hashing. Jour- CODEN IFPLAT. ISSN nal of Computer and Sys- 0020-0190 (print), 1872-6119 tem Sciences, 71(4):520– (electronic). 534, November 2005. CO- Wolverton:1984:PHF DEN JCSSBM. ISSN 0022-0000 (print), 1090-2724 [Wol84] David Alan Wolverton. A (electronic). URL http: perfect hash function for //www.sciencedirect.com/ Ada reserved words. ACM science/article/pii/S002200000500067X. SIGADA Ada Letters, 4(1): 40–44, July/August 1984. Woelfel:2006:CMO CODEN AALEE5. ISSN [Woe06a] Philipp Woelfel. A construc- 1094-3641 (print), 1557-9476 tion method for optimally (electronic). universal hash families and Wolfowicz:1993:SPR its consequences for the existence of RBIBDs. Theo- [Wol93a] W. Wolfowicz, editor. State ret. Comput. Sci., 363(1):76– and progress of research 84, October 25, 2006. CO- in cryptography: 3rd Sym- DEN TCSCDI. ISSN 0304- posium — February 1993, 3975 (print), 1879-2294 (elec- Rome, PROCEEDINGS OF tronic). THE SYMPOSIUM ON STATE AND PROGRESS Woelfel:2006:MEM OF RESEARCH IN CRYP- [Woe06b] Philipp Woelfel. Maintain- TOGRAPHY 1993; 3rd. [], ing external memory eﬃ- Rome; Fondazione Ugo Bor- cient hash tables. In D´ıaz doni, 1993. et al. [DJRZ06], pages 508– Wolfowicz:1993:SPS 519. CODEN LNCSD9. ISBN 3-540-38044-2 (paper- [Wol93b] William Wolfowicz, editor. back). ISSN 0302-9743 SPRC 93: proceedings of (print), 1611-3349 (elec- the 3rd Symposium of State REFERENCES 485

and Progress of Research in //www.idealibrary.com/ Cryptography, Rome, 15–16 links/doi/10.1006/jpdc. February, 1993. Fondazione 1994.1044/production/pdf. Ugo Bordoni, Rome, Italy, 1993. LCCN ???? Wei:2012:SIV Wood:1989:PQP [WPS+12] Lei Wei, Thomas Peyrin, [Woo89] D. Wood. Parallel queues and Przemys law Soko lowski, San pools, an evaluation. Mas- Ling, Josef Pieprzyk, and ter’s thesis, Courant Insti- Huaxiong Wang. On the tute, New York University, (in)security of IDEA in var- New York, NY, USA, Jan- ious hashing modes. Lec- uary 1989. ?? pp. Revised ture Notes in CS, 7549: version available as NYU Ul- 163–179, 2012. CODEN tracomputer Note #150. LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- Weng:2010:IHV tronic). URL http://link. springer.com/chapter/10. [WP10] Li Weng and Bart Preneel. 1007/978-3-642-34047-5_ From image hashing to video 10/. hashing. Lecture Notes in CS, 5916:662–668, 2010. CO- Wah:1990:PIC DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [WPY90] Benjamin W. Wah (v.1), tronic). URL http://link. David A. Padua (v.2), and springer.com/content/pdf/ Pen-Chung Yew (v.3), edi- 10.1007/978-3-642-11301- tors. Proceedings of the 1990 7_66. International Conference on Parallel Processing, August Wang:1994:SDP 13–17, 1990. Pennsylvania [WPKK94] Cho-Li Wang, Viktor K. State University Press, Uni- Prasanna, Hyoung J. Kim, versity Park, PA, USA, 1990. and Ashfaq A. Khokhar. ISBN 0-271-00728-1. LCCN Scalable data parallel imple- QA 76.58 I58 1990. Three mentations of object recog- volumes. nition using geometric hash- Wolfson:1997:GHO ing. Journal of Parallel and Distributed Computing,21[WR97] Haim J. Wolfson and Isidore (1):96–109, April 1994. CO- Rigoutsos. Geometric hash- DEN JPDCER. ISSN 0743- ing: An overview. IEEE 7315 (print), 1096-0848 (elec- Computational Science & tronic). URL http://www. Engineering, 4(4):10–21, Oc- idealibrary.com/links/ tober/December 1997. CO- doi/10.1006/jpdc.1994. DEN ISCEE4. ISSN 1070- 1044/production; http: 9924 (print), 1558-190X REFERENCES 486

(electronic). URL http: Wegbreit:1976:PPC //dlib.computer.org/cs/ books/cs1997/pdf/c4010. [WS76] Ben Wegbreit and Jay M. pdf; http://www.computer. Spitzen. Proving properties org/cse/cs1998/c4010abs. of complex data structures. htm. Journal of the Association for Computing Machinery, Wright:1983:SFS 23(2):389–396, April 1976. [Wri83] William E. Wright. Some CODEN JACOAH. ISSN ﬁle structure considerations 0004-5411 (print), 1557-735X pertaining to magnetic bub- (electronic). ble memory. The Com- puter Journal, 26(1):43–51, Warren:1993:PHO February 1983. CODEN [WS93] Michael S. Warren and CMPJA6. ISSN 0010- John K. Salmon. A parallel 4620 (print), 1460-2067 (elec- hashed oct-tree N-body al- tronic). URL http:// gorithm. In IEEE [IEE93], www3.oup.co.uk/computer_ pages 12–21. ISBN 0-8186- journal/hdb/Volume_26/ 4340-4 (paperback), 0-8186- Issue_01/tiff/43.tif; 4341-2 (microﬁche), 0-8186- http://www3.oup.co.uk/ 4342-0 (hardback), 0-8186- computer_journal/hdb/Volume_ 4346-3 (CD-ROM). ISSN 26/Issue_01/tiff/44.tif; 1063-9535. LCCN QA76.5 http://www3.oup.co.uk/ .S96 1993. URL ftp://ftp. computer_journal/hdb/Volume_ cacr.caltech.edu/nbody/ 26/Issue_01/tiff/45.tif; sc93.ps.Z. http://www3.oup.co.uk/ computer_journal/hdb/Volume_ Whiting:2003:MPH 26/Issue_01/tiff/46.tif; http://www3.oup.co.uk/ [WS03] Douglas L. Whiting and computer_journal/hdb/Volume_ Michael J. Sabin. Mont- 26/Issue_01/tiff/47.tif; gomery prime hashing for http://www3.oup.co.uk/ message authentication. In computer_journal/hdb/Volume_ Joye [Joy03], pages 50– 26/Issue_01/tiff/48.tif; 67. CODEN LNCSD9. http://www3.oup.co.uk/ ISBN 3-540-00847-0. ISSN computer_journal/hdb/Volume_ 0302-9743 (print), 1611- 26/Issue_01/tiff/49.tif; 3349 (electronic). LCCN http://www3.oup.co.uk/ QA76.9.A25 C822 2003. URL computer_journal/hdb/Volume_ http://link.springer-ny. 26/Issue_01/tiff/50.tif; com/link/service/series/ http://www3.oup.co.uk/ 0558/tocs/t2612.htm; computer_journal/hdb/Volume_ http://www.springerlink. 26/Issue_01/tiff/51.tif. com/openurl.asp?genre= REFERENCES 487

issue&issn=0302-9743&volume= ISSN 1556-4681 (print), 2612. 1556-472X (electronic). Wang:2013:PPC Wu:2007:ASO

[WS13] Gaoli Wang and Yanzhao [WTN07] Di Wu, Ye Tian, and Shen. Preimage and pseudo- Kam Wing Ng. An analyt- collision attacks on step- ical study on optimizing the reduced SM3 hash func- lookup performance of dis- tion. Information Pro- tributed hash table systems cessing Letters, 113(8):301– under churn. Concurrency 306, April 30, 2013. CO- and Computation: Practice DEN IFPLAT. ISSN 0020- and Experience, 19(4):543– 0190 (print), 1872-6119 (elec- 569, March 25, 2007. CO- tronic). URL http:/ DEN CCPEBO. ISSN 1532- /www.sciencedirect.com/ 0626 (print), 1532-0634 (elec- science/article/pii/S0020019013000513. tronic). Wang:2012:PAC Wu:2009:REL

[WSSO12] Lei Wang, Yu Sasaki, Kazuo [WTN09] Di Wu, Ye Tian, and Sakiyama, and Kazuo Ohta. Kam-Wing Ng. Resilient Polynomial-advantage crypt- and eﬃcient load balanc- analysis of 3D cipher and 3D- ing in distributed hash ta- based hash function. Lec- bles. Journal of Network ture Notes in CS, 7631: and Computer Applications, 170–181, 2012. CODEN 32(1):45–60, January 2009. LNCSD9. ISSN 0302-9743 CODEN JNCAF3. ISSN (print), 1611-3349 (elec- 1084-8045 (print), 1095-8592 tronic). URL http://link. (electronic). URL http: springer.com/chapter/10. //www.sciencedirect.com/ 1007/978-3-642-34117-5_ science/article/pii/S1084804508000398. 11/. Wang:2013:GNL Wei:2016:HTH [WTZ+13] Yi Wang, Dongzhe Tai, Ting [WSZ+16] Ying Wei, Yangqiu Song, Zhang, Jianyuan Lu, Boyang YiZhen,BoLiu,andQiang Xu, Huichen Dai, and Bin Yang. Heterogeneous trans- Liu. Greedy name lookup lated hashing: a scalable so- for named data networking. lution towards multi-modal ACM SIGMETRICS Perfor- similarity search. ACM mance Evaluation Review,41 Transactions on Knowl- (1):359–360, June 2013. CO- edge Discovery from Data DEN ???? ISSN 0163- (TKDD), 10(4):36:1–36:??, 5999 (print), 1557-9484 (elec- July 2016. CODEN ???? tronic). REFERENCES 488

Wu:1984:IHD on Database Systems,15 (2):208, June 1990. CO- [Wu84] C. T. Wu. Interpolation DEN ATDSD3. ISSN 0362- hashing with descriptors. In 5915 (print), 1557-4644 (elec- Proceedings of the 1984 Con- tronic). ference on Information Sci- ences and Systems., pages Wang:2009:PAH 653–657. Princeton Univ, Dep of Electrical Engineering [WW09] Gaoli Wang and Shaohui & Computer Science, Prince- Wang. Preimage attack ton, NJ, USA, 1984. on hash function RIPEMD. Lecture Notes in CS, 5451: Wu:1985:DOM 274–284, 2009. CODEN LNCSD9. ISSN 0302-9743 [Wu85] C. Thomas Wu. Data organi- (print), 1611-3349 (elec- zation method for the paral- tronic). URL http://link. lel execution of relational op- springer.com/content/pdf/ erations. In Proceedings — 10.1007/978-3-642-00843- Foundations of Data Organi- 6_24. zation., pages 399–405. Or- ganizing Committee of the Wu:2018:SDH Int Conference on Founda- + tions of Data Organization, [WWG 18] Lin Wu, Yang Wang, Zongyuan Jpn, 1985. Kyoto Sangyo Ge, Qichang Hu, and Xue Univ. Computer Science Inst, Li. Structured deep hash- Kyoto, Jpn. ing with convolutional neural networks for fast per- Wu:2005:HC son re-identiﬁcation. Com- [Wu05] Chuan-Kun Wu. Hash chan- puter vision and image understanding: CVIU, 167 nels. Computers and Secu- (??):63–73, February 2018. rity, 24(8):653–661, Novem- CODEN CVIUF4. ISSN ber 2005. CODEN CPSEDU. 1077-3142 (print), 1090-235X ISSN 0167-4048 (print), (electronic). URL 1872-6208 (electronic). URL http: //www.sciencedirect.com/ https://www.sciencedirect. science/article/pii/S1077314217302011. com/science/article/pii/ S0167404805000696. Wang:2009:HSEa Whang:1990:LTP [WWZ09] Weiyan Wang, Xiaoling [WVT90] K. Y. Whang, B. T. Van- Wang, and Aoying Zhou. der Zanden, and H. M. Hash-Search: an eﬃcient Taylor. A linear-time SLCA-based keyword search probabilistic counting algo- algorithm on XML docu- rithm for database applica- ments. Lecture Notes in CS, tions. ACM Transactions 5463:496–510, 2009. CO- REFERENCES 489

DEN LNCSD9. ISSN 0302- July/September 2002. CO- 9743 (print), 1611-3349 (elec- DEN CSSEEI. ISSN 0267- tronic). URL http://link. 6192. springer.com/content/pdf/ Wang:2018:TTP 10.1007/978-3-642-00887- 0_44. [WYD+18] Weiqing Wang, Hongzhi Wang:2001:ECP Yin, Xingzhong Du, Quoc Viet Hung Nguyen, and Xi- [WX01] H. Wang and C. Xing. Ex- aofang Zhou. TPM: a tem- plicit constructions of perfect poral personalized model for hash families from algebraic spatial item recommenda- curves over ﬁnite ﬁelds. Jour- tion. ACM Transactions on nal of Combinatorial The- Intelligent Systems and Tech- ory (Series A), 93(1):112– nology (TIST), 9(6):61:1– 124, January 2001. CODEN 61:??, November 2018. CO- JCBTA7. ISSN 0097-3165. DEN ???? ISSN 2157- 6904 (print), 2157-6912 (elec- Wu:2000:LSH tronic). URL https://dl. acm.org/ft_gateway.cfm? [WY00] Kun-Lung Wu and Philip S. id=3230706. Yu. Latency-sensitive hashing for collaborative Web Wolf:1993:PHJ caching. Computer Net- works (Amsterdam, Nether- [WYT93] J. L. Wolf, P. S. Yu, and lands: 1999), 33(1–6):633– J. Turek. A parallel hash 644, June 2000. CO- join algorithm for managing DEN ???? ISSN 1389- data skew. IEEE Transac- 1286 (print), 1872-7069 (elections on Parallel and Dis- tronic). URL http://www. tributed Systems, 4(12):1355– elsevier.nl/gej-ng/10/ ??, December 1, 1993. CO- 15/22/48/25/69/abstract. DEN ITDSEO. ISSN 1045- html; http://www.elsevier. 9219 (print), 1558-2183 (elec- nl/gej-ng/10/15/22/48/ tronic). 25/69/article.pdf; http: Wang:2014:CGR //www9.org/w9cdrom/301/ 301.html. [WYW14] Zongyue Wang, Hongbo Yu, Wu:2002:CRH and Xiaoyun Wang. Crypt- analysis of GOST R hash [WY02] K-L Wu and P. S. Yu. Con- function. Information Pro- trolled replication for hash cessing Letters, 114(12): routing-based Web caching. 655–662, December 2014. International Journal of CODEN IFPLAT. ISSN Computer Systems Science 0020-0190 (print), 1872-6119 and Engineering, 17(4/5):??, (electronic). URL http: REFERENCES 490

//www.sciencedirect.com/ C794 2005; QA76.9; In- science/article/pii/S0020019014001458. ternet. URL http:/ /www.springerlink.com/ Wang:2005:CSA openurl.asp?genre=issue& issn=0302-9743&volume= [WYY05a] X. Wang, Y. L. Yin, and 3621. H. Yu. Collision search attacks on SHA-1. Unpub- Woodruﬀ:1993:HVT lished (??) research sum- [WZ93] D. L. Woodruﬀ and E. Zemel. mary., 2005. Hashing vectors for tabu Wang:2005:FCFa search. Annals of Opera- tions Research, 40(1 / 4): [WYY05b] Xiaoyun Wang, Yiqun Lisa 123–??, May 1, 1993. CO- Yin, and Hongbo Yu. Find- DEN AOREEV. ISSN 0254- ing collisions in the full 5330 (print), 1572-9338 (elec- SHA-1. Technical report, tronic). Shandong University, Shan- Wang:2012:BPS dong, China, June 22, 2005. URL http://cryptome. [WZ12] Wenyuan Wang and Zheng org/wang_sha1_v2.zip. Zhang. Balanced partition scheme for distributed Wang:2005:FCFb caching systems to solve load imbalance problems. [WYY05c] Xiaoyun Wang, Yiqun Lisa ACM SIGSOFT Software Yin, and Hongbo Yu. Find- Engineering Notes, 37(6):1– ing collisions in the full 6, November 2012. CO- SHA-1. Lecture Notes in DEN SFENDP. ISSN 0163- CS, 3621:17–??, 2005. CO- 5948 (print), 1943-5843 (elec- DEN LNCSD9. ISSN 0302- tronic). 9743 (print), 1611-3349 (electronic). Wang:2010:UHT

Wang:2005:ECS [WZJS10] Yuliang Wang, Qiuxia Zhao, Liehui Jiang, and Yi Shao. [WYY05d] Xiaoyun Wang, Hongbo Yu, Ultra high throughput im- and Yiqun Lisa Yin. Ef- plementations for MD5 hash ﬁcient collision search at- algorithm on FPGA. Lec- tacks on SHA-0. In Shoup ture Notes in CS, 5938: [Sho05], pages 1–?? CO- 433–441, 2010. CODEN DEN LNCSD9. ISBN 3- LNCSD9. ISSN 0302-9743 540-28114-2. ISSN 0302- (print), 1611-3349 (elec- 9743 (print), 1611-3349 (electronic). URL http://link. tronic). LCCN QA76.9.A25 springer.com/content/pdf/ C79 2005; QA76.9 .A25; 10.1007/978-3-642-11842- QA76.9 C79 2005; QA76.9 5_60. REFERENCES 491

Wang:2018:SBD DavidS.L.Wei,HaoYue, and Feng Wu. A secure, eﬃ- + [WZY 18] J. Wang, X. Zhang, J. Yin, cient, and accountable edge- R. Wang, H. Wu, and based access control frame- D. Han. Speed up big data work for information cen- analytics by unveiling the tric networks. IEEE/ACM storage distribution of sub- Transactions on Networking, datasets. IEEE Transactions 27(3):1220–1233, June 2019. on Big Data, 4(2):231–244, CODEN IEANEP. ISSN June 2018. ISSN 2332-7790. 1063-6692 (print), 1558-2566 Xu:2006:TNH (electronic).

[XBH06] Zhiyong Xu, Laxmi Bhuyan, Xu:2014:HTM and Yiming Hu. Tulip: a new hash based cooperative Web [XLZC14] Yang Xu, Zhaobo Liu, caching architecture. The Zhuoyuan Zhang, and H. Jonathan Journal of Supercomputing, Chao. High-throughput and 35(3):301–320, March 2006. memory-eﬃcient multimatch CODEN JOSUED. ISSN packet classiﬁcation based 0920-8542 (print), 1573- on distributed and pipelined 0484 (electronic). URL hash tables. IEEE/ACM http://www.springerlink. Transactions on Networking, com/openurl.asp?genre= 22(3):982–995, June 2014. article&issn=0920-8542& CODEN IEANEP. ISSN volume=35&issue=3&spage= 1063-6692 (print), 1558-2566 301. (electronic). Xia:2009:APL Xu:2011:MDP [XCCK09] Ye Xia, Shigang Chen, Chunglae Cho, and Vivekanand[XMLC11] Y. Xu, L. Ma, Z. Liu, Korgaonkar. Algorithms and H. J. Chao. A multi- and performance of load- dimensional progressive per- balancing with multiple hash fect hashing for high-speed functions in massive content string matching. In ACM, distribution. Computer Net- editor, ANCS’11: Proceed- works (Amsterdam, Nether- ings of the 17th ACM/IEEE lands: 1999), 53(1):110–125, Symposium on Architectures January 16, 2009. CODEN for Networking and Com- ???? ISSN 1389-1286 (print), munications Systems, Brook- 1872-7069 (electronic). lyn, NY, USA, October 3–4, Xue:2019:SEA 2011, pages 167–177. ACM Press, New York, NY 10036, [XHZ+19] Kaiping Xue, Peixuan He, USA, 2011. ISBN 0-7695- Xiang Zhang, Qiudong Xia, 4521-1. REFERENCES 492

Xin:2013:LVR URL http://ieeexplore. ieee.org/servlet/opac? [XNS+13] Xin Xin, Abhishek Nagar, punumber=5680738. Gaurav Srivastava, Zhu Li, Felix Fernandes, and Agge- Yao:1978:VLD los K. Katsaggelos. Large [Yao78] S. Bing Yao, editor. Very visual repository search with large data bases: Fourth hash collision design opti- International Conference on mization. IEEE MultiMe- Very Large Data Bases, West dia, 20(2):62–71, April/June Berlin, Germany, Septem- 2013. CODEN IEMUE4. ber 13–15, 1978. ACM Press, ISSN 1070-986X. New York, NY 10036, USA, Yamane:1985:HJT 1978. Yao:1980:NAE [Yam85] Yasuo Yamane. A hash join technique for relational [Yao80] Andrew C. Yao. A note database systems. In IEEE- on the analysis of extendible FODS’85 [IEE85b], pages hashing. Information Pro- 388–398. Kyoto Sangyo Univ. cessing Letters, 11(2):84– Computer Science Inst, Ky- 86, 1980. CODEN IF- oto, Jpn. PLAT. ISSN 0020-0190 (print), 1872-6119 (elec- Yang:2005:TFN tronic). [Yan05] JiXian Yang. TWOBLOCK: Yao:1981:STS a fast new hash function, 2005. URL http: [Yao81] Andrew Chi-Chih Yao. Should //yjxonline.hostrocket. tables be sorted? Journal com/Hash2005.pdf. World- of the Association for Com- Wide Web document. puting Machinery, 28(3):615– 628, July 1981. CODEN Yang:2010:PII JACOAH. ISSN 0004-5411 [Yan10] Yixian Yang, editor. Pro- (print), 1557-735X (elec- ceedings 2010 IEEE Inter- tronic). national Conference on In- Yao:1983:LBP formation Theory and In- formation Security: De- [Yao83] Andrew C. Yao. Lower cember 17–19, 2010, Bei- bounds by probabilistic argu- jing, China. IEEE Com- ments. Annual Symposium puter Society Press, 1109 on Foundations of Computer Spring Street, Suite 300, Science (Proceedings), pages Silver Spring, MD 20910, 420–428, 1983. CODEN USA, 2010. ISBN 1-4244- ASFPDV. ISBN 0-8186- 6942-2. LCCN QA76.9.A25. 0508-1. ISSN 0272-5428. REFERENCES 493

IEEE Service Cent. Piscat- November 1, 1995. CO- away, NJ, USA. DEN ALGOEJ. ISSN 0178- 4617 (print), 1432-0541 (elec- Yao:1985:OAK tronic).

[Yao85a] Andrew C. Yao. On op- Yasuda:2007:SIS timal arrangements of keys with double hashing. Jour- [Yas07] Kan Yasuda. “Sandwich” is nal of Algorithms, 6(2): indeed secure: How to au- 253–264, June 1985. CO- thenticate a message with DEN JOALDV. ISSN 0196- just one hashing. Lec- 6774 (print), 1090-2678 (elec- ture Notes in CS, 4586: tronic). 355–369, 2007. CODEN LNCSD9. ISSN 0302-9743 Yao:1985:UHO (print), 1611-3349 (electronic). URL http://link. [Yao85b] Andrew C. Yao. Uniform springer.com/content/pdf/ hashing is optimal. Jour- 10.1007/978-3-540-73458- nal of the Association for 1_26. Computing Machinery,32 (3):687–693, July 1985. CO- Yen:1995:PHC DEN JACOAH. ISSN 0004-5411 (print), 1557- [YB95] I-Ling L. Yen and Farokh B. 735X (electronic). URL Bastani. Parallel hashing: http://www.acm.org/pubs/ Collision resolution strategies toc/Abstracts/0004-5411/ and performance. Journal 3836.html. Also published of Parallel and Distributed in/as: Stanford Un., CSD, Computing, 31(2):190–198, TR-CS-85-1038, Jan. 1985. December 1995. CODEN JPDCER. ISSN 0743- Yao:1991:WRA 7315 (print), 1096-0848 (electronic). URL http://www. [Yao91] Andrew C. Yao. Weighted idealibrary.com/links/ random assignments with ap- doi/10.1006/jpdc.1995. plication to hashing. In Hsu 1158/production; http: and Lee [HL91], page 42. //www.idealibrary.com/ ISBN 0-387-54945-5 (New links/doi/10.1006/jpdc. York), 3-540-54945-5 (Berlin). 1995.1158/production/pdf. LCCN QA76.9.A43 I57 1991. Yu:2017:FSD Yao:1995:MOK [YBQZ17] Ye Yu, Djamal Belazzougui, [Yao95] Andrew Chi-Chih Yao. Min- Chen Qian, and Qin Zhang. imean optimal key arrange- A fast, small, and dynamic mentsinhashtables. Al- forwarding information base. gorithmica, 14(5):409–428, ACM SIGMETRICS Perfor- REFERENCES 494

mance Evaluation Review,45 Yang:1984:DPH (1):41–42, June 2017. CO- DEN ???? ISSN 0163- [YD84] W. P. Yang and M. W. Du. 5999 (print), 1557-9484 (elec- A dynamic perfect hash func- tronic). tion defined by an extended hash indicator table. In Yu:2018:MEU Dayal et al. [DSS84], pages 245–254. [YBQZ18] Ye Yu, Djamal Belazzougui, Yang:1985:BMC Chen Qian, and Qin Zhang. Memory-efficient and ultra- [YD85] W. P. Yang and M. W. fast network lookup and for- Du. A backtracking method warding using Othello hash- for constructing perfect hash ing. IEEE/ACM Transac- functions from a set of tions on Networking, 26(3): mapping functions. BIT 1151–1164, June 2018. CO- (Nordisk tidskrift for infor- DEN IEANEP. ISSN 1063- mationsbehandling), 25(1): 6692 (print), 1558-2566 (elec- 148–164, 1985. CODEN BIT- tronic). TEL, NBITAB. ISSN 0006- 3835 (print), 1572-9125 (elec- Yang:2012:RHA tronic). Yuen:1986:DFO [YCJ12] Gaobo Yang, Ning Chen, and Qin Jiang. A robust hash- [YD86a] T. S. Yuen and H. C. Du. ing algorithm based on SURF Dynamic file organizations for video copy detection. for partial match retrieval Computers and Security,31 based on linear hashing. In (1):33–39, February 2012. Proceedings of the Interna- CODEN CPSEDU. ISSN tional Conference on Data 0167-4048 (print), 1872-6208 Engineering, pages 116– (electronic). URL https: 123. IEEE Computer Soci- //www.sciencedirect.com/ ety, IEEE Computer Soci- science/article/pii/S0167404811001404. ety Press, 1109 Spring Street, Suite 300, Silver Spring, MD Yo:1993:OPA 20910, USA, February 1986. ISBN 0-8186-0655-X. LCCN [YCRY93] M.-L. Yo, M.-S. Chen, ???? IEEE Service Cent. Pis- C. Ravishankar, and P. Yu. cataway, NJ, USA. On optimal processor allo- Yuen:1986:DFS cation to support pipelined hash joins. In Buneman [YD86b] Tak-Sun Yuen and David and Jajodia [BJ93], page ?? Huang-Chang Du. Dy- ISBN 0-89791-592-5. LCCN namic file structure for par- QA76.A1 A1135 v.22:2. tial match retrieval based REFERENCES 495

on overflow bucket shar- Yuan:2012:EMR ing. IEEE Transactions on Software Engineering,SE-12 [YGC+12] Jiangbo Yuan, Guillaume (8):801–810, August 1986. Gravier, Sébastien Cam- CODEN IESEDJ. ISSN pion, Xiuwen Liu, and Hervé 0098-5589 (print), 1939-3520 Jégou. Efficient mining (electronic). URL http: of repetitions in large-scale //ieeexplore.ieee.org/ TV streams with product stamp/stamp.jsp?arnumber= quantization hashing. Lec- 6312983. ture Notes in CS, 7583: 271–280, 2012. CODEN Yang:1983:SPH LNCSD9. ISSN 0302-9743 (print), 1611-3349 (elec- [YDT83] W. P. Yang, M. W. Du, and tronic). URL http://link. J. C. Tsay. Single-pass per- springer.com/content/pdf/ fect hashing for data storage 10.1007/978-3-642-33863- and retrieval. In Proceedings 2_27. of the 17th Annual Confer- ence on Information Sciences Yang:2019:DSA

and Systems., pages 470–476. + Johns Hopkins Univ, Balti- [YGS 19] T. Yang, S. Gao, Z. Sun, more, Md, USA, 1983. Y. Wang, Y. Shen, and X. Li. Diamond sketch: Ac- Yen:1991:MPH curate per-ﬂow measurement for big streaming data. IEEE Transactions on Parallel and [Yen91] I.-L. Yen. Massively par- Distributed Systems, 30(12): allel hash algorithms and 2650–2662, December 2019. performance. In ACM- CODEN ITDSEO. ISSN CSC’91 [ACM91b], pages 21– 1045-9219 (print), 1558-2183 28. ISBN 0-89791-382-5. (electronic). LCCN QA76.5 .A137 1991. Yasuda:1989:PAM Yu:2010:DRF [YIAS89] Takuya Yasuda, Satoshi [YG10] Zhen Yu and Yong Guan. Igarashi, Oichi Atoda, and A dynamic en-route ﬁlter- Nobuo Saito. ‘Pattern asso- ing scheme for data report- ciative memory’ and its use ing in wireless sensor net- in logic programming lan- works. IEEE/ACM Transac- guage processors. Systems tions on Networking, 18(1): and computers in Japan,20 150–163, February 2010. CO- (11):11–20, November 1989. DEN IEANEP. ISSN 1063- CODEN SCJAEP. ISSN 6692 (print), 1558-2566 (elec- 0882-1666 (print), 1520-684X tronic). (electronic). REFERENCES 496

Yum:2010:FVH tronic). URL https:/ /www.sciencedirect.com/ [YKLH10] Dae Hyun Yum, Jin Seok science/article/pii/S0167404804001919. Kim, Pil Joong Lee, and Sung Je Hong. On fast Yen:1990:HTS verification of hash chains. Lecture Notes in CS, 5985: [YLB90] I.-L. Yen, D.-R. Leu, and 382–396, 2010. CODEN F. B. Bastani. Hash table and LNCSD9. ISSN 0302-9743 sorted array: a case study of (print), 1611-3349 (elec- multi-entry data structures tronic). URL http://link. in massively parallel systems. springer.com/content/pdf/ In Jájá[Jáj90], pages 51–54. 10.1007/978-3-642-11925- ISBN 0-8186-9053-4. LCCN 5_26. QA76.58 .S95 1990. Yao:1983:SSG Yi:2009:SSG [YkWY83] Tien-Shun Yao, Bao ku Wang, [YLC+09] Ke Yi, Feifei Li, Graham and Jing-Sheng Yu. Sim- Cormode, Marios Hadjieleft- ulation system of graph heriou, George Kollios, and composed Chinese charac- Divesh Srivastava. Small syn- ter processing. In Anony- opses for group-by query ver- mous [Ano83], pages 367– ification on outsourced data 378. ISBN 0-87664-739- streams. ACM Transactions 5. LCCN TA165.M52 1983. on Database Systems,34 Two volumes. (3):15:1–15:??, August 2009. Yi:1997:NHF CODEN ATDSD3. ISSN 0362-5915 (print), 1557-4644 [YL97] X. Yi and K.-Y. Lam. A new (electronic). hash function based on block cipher. Lecture Notes in Yang:2019:NAK CS, 1270:139–??, 1997. CO- DEN LNCSD9. ISSN 0302- [YLSZ19] Zheng Yang, Junyu Lai, 9743 (print), 1611-3349 (elec- Yingbing Sun, and Jiany- tronic). ing Zhou. A novel authen- Yang:2004:ACH ticated key agreement protocol with dynamic creden- [YL04] Cungang Yang and Celia tial for WSNs. ACM Trans- Li. Access control in actions on Sensor Networks, a hierarchy using one-way 15(2):22:1–22:??, April 2019. hash functions. Comput- CODEN ???? ISSN 1550- ers and Security, 23(8):659– 4859 (print), 1550-4867 (elec- 664, December 2004. CO- tronic). URL https://dl. DEN CPSEDU. ISSN 0167- acm.org/ft_gateway.cfm? 4048 (print), 1872-6208 (elec- id=3303704. REFERENCES 497

Yu:2020:VBG Xiong Wei, Chen Luo, and Chen Hongsheng. Hash [YLZ20] Bin Yu, Xiaofeng Li, and join optimization based on He Zhao. Virtual block shared cache chip multi- group: a scalable blockchain processor. Lecture Notes in model with partial node stor- CS, 5463:293–307, 2009. CO- age and distributed hash ta- DEN LNCSD9. ISSN 0302- ble. The Computer Jour- 9743 (print), 1611-3349 (elec- nal, 63(10):1524–1536, Oc- tronic). URL http://link. tober 2020. CODEN CM- springer.com/content/pdf/ PJA6. ISSN 0010-4620 10.1007/978-3-642-00887- (print), 1460-2067 (elec- 0_26. tronic). URL http:// academic.oup.com/comjnl/ Yu:1987:RDI article/63/10/1524/5828295. [YR87] C. T. Yu and C. J. Rijs- Yokoyama:1989:NLP bergen, editors. Research and Development in Infor- [YMI89] Shoichi Yokoyama, Fumio mation Retrieval: Proceed- Motoyoshi, and Hitoshi Isa- ings of the Tenth Annual hara. Natural language pro- International ACM SIGIR cessing system with a large Conference. ACM Press, New vocabulary in secondary stor- York, NY 10036, USA, 1987. age. Denshi Gijutsu Sogo ISBN 0-89791-232-2. LCCN Kenkyusho Iho/Bulletin of Z 699 A1 I58 1987. US$19. the Electrotechnical Labora- tory, 53(5):52–70, 1989. CO- Yoon:2004:SUA DEN DGSKAR. ISSN 0366- 9092. [YRY04] Eun-Jun Yoon, Eun-Kyung Ryu, and Kee-Young Yoo. Yamane:1989:DEH A secure user authentication [YNKM89] Y. Yamane, M. Narita, scheme using hash functions. F. Kozakura, and A. Maki- Operating Systems Review, nouchi. Design and eval- 38(2):62–68, April 2004. uation of a high-speed ex- CODEN OSRED8. ISSN tended relational database 0163-5980 (print), 1943-586X engine, XRDB. In Proc. of (electronic). the 1st Intern. Symposium Yum:2009:SLF on Database Systems for Ad- vanced Applications, Seoul, [YSEL09] Dae Hyun Yum, Jae Woo Korea, page ?? ????, ????, Seo, Sungwook Eom, and April 1989. Pil Joong Lee. Single-layer Yadan:2009:HJO fractal hash chain traversal with almost optimal com- [YNW+09] Deng Yadan, Jing Ning, plexity. Lecture Notes in REFERENCES 498

CS, 5473:325–339, 2009. CO- Yang:1997:HFM DEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (elec- [YTHC97] Cheng-Hsing Yang, Chia- tronic). URL http://link. Chun Tsai, Jan-Ming Ho, springer.com/content/pdf/ and Sao-Jie Chen. Hmap: a 10.1007/978-3-642-00862- fast mapper for EPGAs us- 7_22. ing extended GBDD hash tables. ACM Transactions on Yao:2005:HBL Design Automation of Elec- [YSL05] D. Yao, Cyrus Shahabi, and tronic Systems., 2(2):135– Per-Ake˚ Larson. Hash-based 150, January 1997. CO- labeling techniques for stor- DEN ATASFO. ISSN 1084- age scaling. VLDB Jour- 4309 (print), 1557-7309 (elec- nal: Very Large Data Bases, tronic). URL http://www. 14(2):222–237, April 2005. acm.org/pubs/articles/ CODEN VLDBFR. ISSN journals/todaes/1997-2- 1066-8888 (print), 0949-877X 2/p135-yang/p135-yang. (electronic). pdf; http://www.acm. org/pubs/citations/journals/ Yang:2011:NHB todaes/1997-2-2/p135-yang/ [YSW+11] Kai Yang, Yan Shi, Weili . Wu, Xiaofeng Gao, and Yu:2006:SST Jiaofei Zhong. A novel hash-based streaming scheme [YTJ06] Yi Yu, Masami Takata, for energy eﬃcient full-text and Kazuki Joe. Similar- search in wireless data broad- ity searching techniques in cast. Lecture Notes in CS, content-based audio retrieval 6587:372–388, 2011. CO- via hashing. Lecture Notes in DEN LNCSD9. ISSN 0302- CS, 4351:397–407, 2006. CO- 9743 (print), 1611-3349 (elec- DEN LNCSD9. ISSN 0302- tronic). URL http://link. 9743 (print), 1611-3349 (elec- springer.com/content/pdf/ tronic). URL http://link. 10.1007/978-3-642-20149- springer.com/content/pdf/ 3_28. 10.1007/978-3-540-69423- 6_39. Yaniv:2016:HDC Ytrehus:2006:LFN [YT16] Idan Yaniv and Dan Tsafrir. Hash, don’t cache (the page [Ytr06] Øyvind Ytrehus, editor. Cod- table). ACM SIGMETRICS ing and Cryptography: In- Performance Evaluation Re- ternational Workshop, WCC view, 44(1):337–350, June 2005, Bergen, Norway, 2016. CODEN ???? ISSN March 14–18, 2005. Revised 0163-5999 (print), 1557-9484 Selected Papers, volume 3969 (electronic). of Lecture Notes in Com- REFERENCES 499

puter Science. Springer-Ver- CA, 1992. ISBN 1-55860- lag, Berlin, Germany / Hei- 151-1. LCCN QA76.9.D3 I61 delberg, Germany / London, 1992. UK / etc., 2006. ISBN 3-540- 35481-6. LCCN QA76.9.A25 Yuba:1982:SOP I557 2005. Yu:1992:IWR [Yub82] Toshitsugu Yuba. Stud- ies on optimization prob- [Yu92] P. S. Yu, editor. 2nd In- lems of key searching. Den- ternational workshop on re- shi Gijutsu Sogo Kenkyusho search issues on data en- Kenkyu Hokoku/Researches gineering: transaction and of the Electrotechnical Lab- query processing: – February oratory, ??(823):??, March 1992, Tempe, AZ,INTER- 1982. CODEN DGSKBS. NATIONAL WORKSHOP ISSN 0366-9106. ON RESEARCH ISSUES IN DATA ENGINEERING Yung:2002:ACC 1992; 2nd. IEEE Computer Society Press, 1109 Spring [Yun02] Moti Yung, editor. Advances Street, Suite 300, Silver in cryptology — CRYPTO Spring, MD 20910, USA, 2002: 22nd Annual Inter- 1992. ISBN 0-8186-2660-7, national Cryptology Confer- 0-8186-2661-5, 0-8186-2662- ence, Santa Barbara, Cal- 3. LCCN QA76.9.D3 I593 ifornia, USA, August 18– 1992. 22, 2002: Proceedings,vol- Yu:2018:RHT ume 2442 of Lecture Notes in Computer Science and Lec- [Yu18] Peng Yu. Revisiting hash ta- ture Notes in Artiﬁcial In- ble performance. Web site., telligence. Springer-Verlag, January 13, 2018. URL Berlin, Germany / Heidel- https://attractivechaos. berg, Germany / London, wordpress.com/2018/01/ UK / etc., 2002. CO- 13/revisiting-hash-table- DEN LNCSD9. ISBN 3-540- performance/. 44050-X (paperback). ISSN Yuan:1992:VLD 0302-9743 (print), 1611- 3349 (electronic). LCCN [Yua92] Li-Yan Yuan, editor. Very QA76.9.A25 C79 2002. URL Large Data Bases: VLDB http://link.springer-ny. ’92, Proceedings of the 18th com/link/service/series/ International Conference on 0558/tocs/t2442.htm; Very Large Data Bases, Au- http://www.springerlink. gust 23–27, 1992, Vancouver, com/openurl.asp?genre= Canada. Morgan Kaufmann issue&issn=0302-9743&volume= Publishers, San Francisco, 2442. REFERENCES 500

Yuval:1975:FNN Yoon:2007:SCH

[Yuv75] G. Yuval. Finding near [YY07] Eun-Jun Yoon and Kee- neighbours in K-dimensional Young Yoo. A secure space. Information Pro- chaotic hash-based biomet- cessing Letters, 3(4):113– ric remote user authentica- 114, March ??, 1975. CO- tion scheme using mobile de- DEN IFPLAT. ISSN 0020- vices. Lecture Notes in CS, 0190 (print), 1872-6119 (elec- 4537:612–623, 2007. CO- tronic). DEN LNCSD9. ISSN 0302- Yang:2009:ILV 9743 (print), 1611-3349 (electronic). URL http://link. [YWH09] Heng Yang, Qing Wang, springer.com/content/pdf/ and Zhoucan He. Index- 10.1007/978-3-540-72909- ing large visual vocabulary 9_68. by randomized dimensions hashing for high quantiza- Yen:2000:WOW tion accuracy: Improving the object retrieval qual- [YZ00] Sung-Ming Yen and Yu- ity. Lecture Notes in CS, liang Zheng. Weighted one- 5702:783–790, 2009. CO- way hash chain and its ap- DEN LNCSD9. ISSN 0302- plications. Lecture Notes 9743 (print), 1611-3349 (elec- in CS, 1975:135–??, 2000. tronic). URL http://link. CODEN LNCSD9. ISSN springer.com/content/pdf/ 0302-9743 (print), 1611- 10.1007/978-3-642-03767- 3349 (electronic). URL 2_95. http://link.springer-ny. Young:2001:HRS com/link/service/series/ 0558/bibs/1975/19750135. [YY01] Adam Young and Moti Yung. htm; http://link.springer- Hash to the rescue: Space ny.com/link/service/series/ minimization for PKI di- 0558/papers/1975/19750135. rectories. Lecture Notes pdf. in CS, 2015:235–??, 2001. CODEN LNCSD9. ISSN Yu:2016:NFC 0302-9743 (print), 1611- 3349 (electronic). URL [YZ16] Qian Yu and Chang N. http://link.springer-ny. Zhang. A new and fast com/link/service/series/ cryptographic hash function 0558/bibs/2015/20150235. basedonRC4. Cryptologia, htm; http://link.springer- 40(6):522–540, 2016. CO- ny.com/link/service/series/ DEN CRYPE6. ISSN 0161- 0558/papers/2015/20150235. 1194 (print), 1558-1586 (elec- pdf. tronic). REFERENCES 501

Zamora:1980:ADC Zhu:2012:JLS

[Zam80] Antonio Zamora. Auto- [ZC12] Xinglei Zhu and Chang W. matic detection and correc- Chen. A joint layered scheme tion of spelling errors in a for reliable and secure mo- large data base. Journal bile JPEG-2000 streaming. of the American Society for ACM Transactions on Mul- Information Science, 31(1): timedia Computing, Commu- 51–57, January 1980. CO- nications, and Applications, DEN AISJB6. ISSN 0002- 8(3):30:1–30:??, July 2012. 8231 (print), 1097-4571 (elec- CODEN ???? ISSN 1551- tronic). 6857 (print), 1551-6865 (electronic). Zhang:2006:CFS Zeng:2019:PKE [ZBB+06] Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, [ZCZQ19] Ming Zeng, Jie Chen, Kai Rajiv K. Kalia, Aiichiro Zhang, and Haifeng Qian. Nakano, Ashish Sharma, and Public key encryption with Priya Vashishta. Collision- equality test via hash proof free spatial hash functions for system. Theoret. Comput. structural analysis of billion- Sci., 795(??):20–35, Novem- vertex chemical bond net- ber 26, 2019. CODEN works. Computer Physics TCSCDI. ISSN 0304-3975 Communications, 175(5): (print), 1879-2294 (elec- 339–347, September 1, 2006. tronic). URL http:/ CODEN CPHCBZ. ISSN /www.sciencedirect.com/ 0010-4655 (print), 1879-2944 science/article/pii/S0304397519303822. (electronic). URL http: //www.sciencedirect.com/ Zollhofer:2015:SBR science/article/pii/S0010465506002311. [ZDI+15] Michael Zollh¨ofer, Angela Zobrist:1977:DCO Dai, Matthias Innmann, Chenglei Wu, Marc Stam- [ZC77] Albert L. Zobrist and Fred- minger, Christian Theobalt, erick R. Carlson, Jr. De- and Matthias Nießner. Shading- tection of combined occur- based reﬁnement on volu- rences. Communications of metric signed distance func- the Association for Com- tions. ACM Transactions puting Machinery, 20(1):31– on Graphics, 34(4):96:1– 35, January 1977. CO- 96:??, August 2015. CO- DEN CACMA2. ISSN 0001- DEN ATGRDF. ISSN 0730- 0782 (print), 1557-7317 (elec- 0301 (print), 1557-7368 (electronic). tronic). REFERENCES 502

Zeller:1991:AHJ Zeller:1990:AHJ

[Zel91] H. Zeller. Adaptive Hash- [ZG90a] H. Zeller and J. Gray. An Join-Algorithmen (in Ger- adaptive hash join algorithm man). Ph.d. thesis, Univer- for multiuser environments. sity of Stuttgart, Stuttgart, In McLeod et al. [MSDS90], Germany, November 1991. ?? page 186. ISBN 1-55860-149- pp. X. LCCN ??? Zeller:1990:HJA Zemor:1991:HFG [ZG90b] H. Zeller and J. Gray. Hash [Zem91] G. Zemor. Hash func- join algorithms in a multiuser tions and graphs with large environment. In McLeod girths. In Davies [Dav91], et al. [MSDS90], page ?? pages 508–511. ISBN 0-387- ISBN 1-55860-149-X. LCCN 54620-0 (New York), 3-540- ??? 54620-0 (Berlin). ISSN 0302- Zhang:2005:ILL 9743 (print), 1611-3349 (electronic). LCCN QA76.9.A25 [ZGG05] Hui Zhang, Ashish Goel, E964 1991. and Ramesh Govindan. Im- proving lookup latency in Zemor:1994:HFC distributed hash table systems using random sam- [Z´em94] Gilles Z´emor. Hash func- pling. IEEE/ACM Trans- tions and Cayley graphs. De- actions on Networking,13 signs, Codes, and Cryptogra- (5):1121–1134, October 2005. phy, 4(4):381–394, 1994. CO- CODEN IEANEP. ISSN DEN DCCREC. ISSN 0925- 1063-6692 (print), 1558-2566 1022 (print), 1573-7586 (elec- (electronic). tronic). Zuo:2018:WFC Zhang:2006:NGD [ZH18] Pengfei Zuo and Yu Hua. [ZF06] Bin Zhang and Dengguo A write-friendly and cache- Feng. New guess-and- optimized hashing scheme determine attack on the self- for non-volatile memory shrinking generator. Lec- systems. IEEE Transac- ture Notes in CS, 4284: tions on Parallel and Dis- 54–68, 2006. CODEN tributed Systems, 29(5):985– LNCSD9. ISSN 0302-9743 998, May 2018. CODEN (print), 1611-3349 (elec- ITDSEO. ISSN 1045-9219 tronic). URL http://link. (print), 1558-2183 (elec- springer.com/content/pdf/ tronic). URL https://www. 10.1007/11935230_4.pdf. computer.org/csdl/trans/ REFERENCES 503

td/2018/05/08186236-abs. 6:1–6:8. ISBN 1-59593- html. 466-9. LCCN QA76.9.D3 I58388 2006. URL Zhang:2007:TTI http:/ /portal.acm.org/toc.cfm? [Zha07] Rui Zhang. Tweaking TBE/ id=1140402. IBE to PKE transforms Zhu:2013:SHF with Chameleon hash functions. Lecture Notes in CS, [ZHC+13] Xiaofeng Zhu, Zi Huang, 4521:323–339, 2007. CO- Hong Cheng, Jiangtao Cui, DEN LNCSD9. ISSN 0302- and Heng Tao Shen. Sparse 9743 (print), 1611-3349 (elec- hashing for fast multimedia tronic). URL http://link. search. ACM Transactions springer.com/content/pdf/ on Information Systems,31 10.1007/978-3-540-72738- (2):9:1–9:??, May 2013. CO- 5_21. DEN ATISET. ISSN 1046- 8188. Zhai:2019:DVP Zheng:1990:PDS [Zha19a] Sheping Zhai. Distance variety preserving hashing for [Zhe90] Yuliang Zheng. Principles large-scale retrieval. Con- for Designing Secure Block currency and Computation: Ciphers and One-Way Hash Practice and Experience,31 Functions. PhD thesis, Yoko- (12):e4829:1–e4829:??, June hama National University, 25, 2019. CODEN CCPEBO. Yokohama, Japan, 1990. ?? ISSN 1532-0626 (print), pp. 1532-0634 (electronic). Zheng:1994:RSS Zhandry:2019:ME [ZHS94] Yuliang Zheng, T. Hardjono, [Zha19b] Mark Zhandry. The magic of and J. Seberry. Reusing ELFs. Journal of Cryptology, shares in secret sharing 32(3):825–866, July 2019. schemes. The Computer CODEN JOCREQ. ISSN Journal, 37(3):199–205, ???? 0933-2790 (print), 1432- 1994. CODEN CMPJA6. 1378 (electronic). URL ISSN 0010-4620 (print), https://link.springer. 1460-2067 (electronic). com/article/10.1007/s00145- Zobel:2001:MHT 018-9289-9. Zukowski:2006:ACH [ZHW01] Justin Zobel, Steﬀen Heinz, and Hugh E. Williams. In- [ZHB06] M. Zukowski, S. H´eman, and memory hash tables for ac- P. A. Boncz. Architecture- cumulating text vocabular- conscious hashing. In Aila- ies. Information Process- maki et al. [ABM06], pages ing Letters, 80(6):271–277, REFERENCES 504

December 31, 2001. CO- Zhang:2009:IBR DEN IFPLAT. ISSN 0020- 0190 (print), 1872-6119 (elec- [ZJ09] Jianhong Zhang and Cheng tronic). URL http://www. Ji. An ID-based and repair- elsevier.com/gej-ng/10/ ing NTRUSign-based anony- 23/20/84/37/27/abstract. mous multi-proxy signature html. scheme. In IEEE, editor, Proceedings of the Interna- Zuo:2019:LHH tional Conference on Com- [ZHW19] Pengfei Zuo, Yu Hua, and Jie putational Intelligence and Wu. Level hashing: a high- Software Engineering, 2009. performance and ﬂexible- CiSE 2009, December 11– resizing persistent hashing 13, 2009, Wuhan, China, index structure. ACM Trans- pages 1–?? IEEE Com- actions on Storage, 15(2): puter Society Press, 1109 13:1–13:??, June 2019. CO- Spring Street, Suite 300, Sil- DEN ???? ISSN 1553- ver Spring, MD 20910, USA, 3077 (print), 1553-3093 (elec- 2009. ISBN 1-4244-4507- tronic). URL https://dl. 8. LCCN QA76.758 2009. acm.org/ft_gateway.cfm? URL http://ieeexplore. id=3322096. ieee.org/servlet/opac? punumber=5362500. IEEE Zhou:2021:ELS catalog number CFP0926H.

[ZHW21] Wei Zhou, Jiankun Hu, and Zhao:1994:DDBa Song Wang. Enhanced locality-sensitive hashing for [ZJM94a] X. Zhao, R. G. Johnson, ﬁngerprint forensics over and N. J. Martin. DBJ large multi-sensor databases. — a dynamic balancing hash IEEE Transactions on Big join algorithm in multipro- Data, 7(4):759–769, 2021. cessor database systems. In- ISSN 2332-7790. formation system, 19(1):89– 100, January 1994. CO- Zuo:2019:WDH DEN INSYD6. ISSN 0306- 4379 (print), 1873-6076 (elec- [ZHZ+19] P. Zuo, Y. Hua, M. Zhao, tronic). W. Zhou, and Y. Guo. Write deduplication and hash mode Zhao:1994:DDBb encryption for secure non- volatile main memory. IEEE [ZJM94b] X. Zhao, R. G. Johnson, Micro, 39(1):44–51, Jan- and N. J. Martin. DBJ uary/February 2019. CO- — a dynamic balancing hash DEN IEMIDZ. ISSN 0272- join algorithm in multipro- 1732 (print), 1937-4143 (elec- cessor database systems. In tronic). Jarke et al. [JBJ94], pages REFERENCES 505

301–308. ISBN 0-387-57818- Zhou:2012:TSC 8 (New York), 3-540-57818- 8 (Berlin). ISSN 0302- [ZLC+12] Junfeng Zhou, Guoxiang 9743 (print), 1611-3349 (elec- Lan, Ziyang Chen, Xian tronic). LCCN QA76.9.D3 Tang, and Jingfeng Guo. I55844 1994. DM80.00. Top-down SLCA computa- Zhao:1994:DDBc tion based on hash search. Lecture Notes in CS, 7418: [ZJM94c] X. Zhao, R. G. Johnson, 272–283, 2012. CODEN and N. J. Martin. DBJ LNCSD9. ISSN 0302-9743 — a dynamic balancing hash (print), 1611-3349 (elec- join algorithm in multipro- tronic). URL http://link. cessor database systems. In springer.com/content/pdf/ Jarke et al. [JBJ94], pages 10.1007/978-3-642-32281- 89–100. ISBN 0-387-57818- 5_27. 8 (New York), 3-540-57818- 8 (Berlin). ISSN 0302- Zhang:2018:AKS 9743 (print), 1611-3349 (elec- + tronic). LCCN QA76.9.D3 [ZLC 18] Dongxiang Zhang, Yuchen I55844 1994. DM80.00. Li, Xin Cao, Jie Shao, and Heng Tao Shen. Augmented Zee:2008:FFV keyword search on spatial entity databases. VLDB Jour- [ZKR08] Karen Zee, Viktor Kun- nal: Very Large Data Bases, cak, and Martin Rinard. 27(2):225–244, April 2018. Full functional veriﬁcation of CODEN VLDBFR. ISSN linked data structures. SIG- 1066-8888 (print), 0949-877X PLAN Notices, 43(6):349– (electronic). 361, June 2008. CODEN SINODQ. ISSN 0362-1340 Zhu:2020:FMM (print), 1523-2867 (print), 1558-1160 (electronic). [ZLC+20] Lei Zhu, Xu Lu, Zhiyong Zhang:2012:LLF Cheng, Jingjing Li, and Huaxiang Zhang. Flexible [ZL12] Donghui Zhang and Per- multi-modal hashing for scal- Ake˚ Larson. LHlf: lock- able multimedia retrieval. free linear hashing (poster ACM Transactions on In- paper). SIGPLAN Notices, telligent Systems and Tech- 47(8):307–308, August 2012. nology (TIST), 11(2):14:1– CODEN SINODQ. ISSN 14:20, March 2020. CODEN 0362-1340 (print), 1523-2867 ???? ISSN 2157-6904 (print), (print), 1558-1160 (elec- 2157-6912 (electronic). URL tronic). PPOPP ’12 confer- https://dl.acm.org/doi/ ence proceedings. abs/10.1145/3365841. REFERENCES 506

Zhang:2007:BHR Zhihao Yang, Jian Wang, and Yanpeng Li. Biomolec- [ZLL+07] Zheng Zhang, Qiao Lian, ular event trigger detection Shiding Lin, Wei Chen, using neighborhood hash fea- Yu Chen, and Chao Jin. tures. Journal of The- BitVault: a highly reliable oretical Biology, 318(??): distributed data retention 22–28, February 7, 2013. platform. Operating Sys- CODEN JTBIAP. ISSN tems Review, 41(2):27–36, 0022-5193 (print), 1095-8541 April 2007. CODEN OS- (electronic). URL http: RED8. ISSN 0163-5980 //www.sciencedirect.com/ (print), 1943-586X (elec- science/article/pii/S002251931200570X. tronic). Zheng:1991:SPO Zhang:2018:LFT [ZMI91] Y. Zheng, T. Matsumoto, [ZLLD18] Deli Zhang, Pierre Laborde, and H. Imai. Structural Lance Lebanoﬀ, and Damian properties of one-way hash Dechev. Lock-free trans- functions. Lecture Notes in actional transformation for CS, 537:285–302, 1991. CO- linked data structures. ACM DEN LNCSD9. ISSN 0302- Transactions on Parallel 9743 (print), 1611-3349 (elec- Computing (TOPC), 5(1): tronic). 6:1–6:??, September 2018. Zhu:2016:LEI CODEN ???? ISSN 2329- 4949 (print), 2329-4957 (elec- [ZNPM16] Erkang Zhu, Fatemeh Nar- tronic). gesian, Ken Q. Pu, and Ren´ee J. Miller. LSH ensem- Zhang:2012:HSP ble: Internet-scale domain search. Proceedings of the [ZLY+12] Yijia Zhang, Hongfei Lin, VLDB Endowment, 9(12): Zhihao Yang, Jian Wang, 1185–1196, August 2016. and Yanpeng Li. Hash CODEN ???? ISSN 2150- subgraph pairwise kernel 8097. for protein-protein interaction extraction. IEEE/ACM Zhou:1993:DAH Transactions on Computa- [ZO93] X. F. Zhou and M. E. Or- tional Biology and Bioinfor- lowska. A dynamic approach matics, 9(4):1190–1202, July for handling data skew prob- 2012. CODEN ITCBCY. lems in parallel hash join ISSN 1545-5963 (print), computation. In Anony- 1557-9964 (electronic). mous [Ano93c], pages 133– Zhang:2013:BET 137. ISBN 7-80003-285-X, 0-7803-1233-3, 0-87031-232- [ZLY+13] Yijia Zhang, Hongfei Lin, 5, 0-87031-234-1. LCCN REFERENCES 507

TK5105.5.I327 1993. Five Zheng:1990:HOW volumes. [ZPS90] Y. Zheng, J. Pieprzyk, and Zhao:2013:AAP J. Seberry. HAVAL — a one- [ZO13] Zhen Wei Zhao and Wei Tsang way hashing algorithm with Ooi. APRICOD: an access- variable length of output. In pattern-driven distributed Seberry and Pieprzyk [SP90], caching middleware for fast page ?? ISBN 0-387-53000- content discovery of noncon- 2 (New York), 3-540-53000-2 tinuous media access. ACM (Berlin). LCCN QA76.9.A25 Transactions on Multime- A87 1990. dia Computing, Communica- Zheng:1993:HOWa tions, and Applications, 9(2): 15:1–15:??, May 2013. CO- [ZPS93a] Y. Zheng, J. Pieprzyk, and DEN ???? ISSN 1551- J. Seberry. HAVAL — a one- 6857 (print), 1551-6865 (elec- way hashing algorithm with tronic). variable length of output. In Seberry and Zheng [SZ93], Zobrist:1970:NHMa pages 3.1–3.10. ISBN 0-387- [Zob70a] Albert L. Zobrist. A new 57220-1 (New York), 3-540- hashing method with ap- 57220-1 (Berlin). ISSN 0302- plication for game play- 9743 (print), 1611-3349 (elec- ing. Technical Report 88, tronic). LCCN QA76.9.A25 Computer Sciences Depart- A87 1992. ment, University of Wis- Zheng:1993:HOWb consin, Madison, WI, USA, 1970. [ZPS93b] Y. Zheng, J. Pieprzyk, and J. Seberry. HAVAL — a Zobrist:1970:NHMb one-way hashing algorithm [Zob70b] Albert L. Zobrist. A new with variable length of out- hashing method with ap- put. Lecture Notes in CS, plication for game playing. 718:83–104, 1993. CO- ICCA Journal, 13(2):69–73, DEN LNCSD9. ISSN 0302- ???? 1970. ISSN 0920-234X. 9743 (print), 1611-3349 (electronic). Zou:1985:MMC Zhao:2012:HCB [Zou85] Youwen Zou. MPHF method for Chinesizing Cobol re- [ZQSH12] Huawei Zhao, Jing Qin, Min- served words. Hunan Keji glei Shu, and Jiankun Hu. A Daxue Xuebao/Journal of hash chains based key man- Hunan Science and Tech- agement scheme for wire- nology University, 1(1-2):97– less sensor networks. Lec- 104, September 1985. CO- ture Notes in CS, 7672: DEN HKDXEX. 296–308, 2012. CODEN REFERENCES 508

LNCSD9. ISSN 0302-9743 dl.acm.org/doi/10.1145/ (print), 1611-3349 (elec- 3471485.3471499. tronic). URL http://link. Zhang:2005:ISS springer.com/content/pdf/ 10.1007/978-3-642-35362- [ZW05] Jianhong Zhang and Yu- 8_23. min Wang. An improved signature scheme without Zhou:2008:RTS using one-way Hash functions. Applied Mathemat- [ZRL+08] Kun Zhou, Zhong Ren, ics and Computation, 170(2): Stephen Lin, Hujun Bao, 905–908, November 15, 2005. Baining Guo, and Heung- CODEN AMHCBQ. ISSN Yeung Shum. Real-time 0096-3003 (print), 1873-5649 smoke rendering using com- (electronic). pensated ray marching. ACM Transactions on Graphics,27 Zhang:2010:LCH (3):36:1–36:??, August 2008. [ZWCL10] Dell Zhang, Jun Wang, Deng CODEN ATGRDF. ISSN Cai, and Jinsong Lu. Lapla- 0730-0301 (print), 1557-7368 cian co-hashing of terms and (electronic). documents. Lecture Notes in Zezula:1991:DPS CS, 5993:577–580, 2010. CO- DEN LNCSD9. ISSN 0302- [ZRT91] P. Zezula, F. Rabitti, and 9743 (print), 1611-3349 (elec- P. Tiberio. Dynamic par- tronic). URL http://link. titioning of signature ﬁles. springer.com/content/pdf/ ACM Transactions on In- 10.1007/978-3-642-12275- formation Systems, 9(4):336– 0_51. 369, October 1991. CODEN Zhang:2017:LBP ATISET. ISSN 1046-8188. URL http://www.acm.org: [ZWH17] Jiaming Zhang, Shuhui 80. Wang, and Qingming Huang. Zukowski:2021:TPO Location-based parallel tag completion for geo-tagged so- [Zuk21] Marcin Zukowski. Techni- cial image retrieval. ACM cal perspective: Optimisti- Transactions on Intelli- cally compressed hash ta- gent Systems and Tech- bles & strings in the USSR. nology (TIST), 8(3):38:1– SIGMOD Record (ACM Spe- 38:??, April 2017. CODEN cial Interest Group on Man- ???? ISSN 2157-6904 (print), agement of Data), 50(1): 2157-6912 (electronic). 59, June 2021. CODEN Zhang:2014:FFS SRECD8. ISSN 0163-5808 (print), 1943-5835 (elec- [ZWT+14] Yong-Dong Zhang, Yu Wang, tronic). URL https:// Sheng Tang, Steven C. H. REFERENCES 509

Hoi, and Jin-Tao Li. FSpH: and its applications. The- Fitted spectral hashing for oret. Comput. Sci., 804(??): eﬃcient similarity search. 1–28, January 12, 2020. Computer vision and im- CODEN TCSCDI. ISSN age understanding: CVIU, 0304-3975 (print), 1879-2294 124(??):3–11, July 2014. (electronic). URL http: CODEN CVIUF4. ISSN //www.sciencedirect.com/ 1077-3142 (print), 1090-235X science/article/pii/S0304397519306607. (electronic). URL http: Zhao:1983:PMC //www.sciencedirect.com/ science/article/pii/S1077314214000241[ZZ83]. Hejun Zhao and Yuefang Zhang. Practical micro- Zou:2012:PAS computer management sys- [ZWW+12] Jian Zou, Wenling Wu, tem of an automated stereo- Shuang Wu, Bozhan Su, and warehouse. Chi Hsieh Kung Le Dong. Preimage attacks Ch’eng Hsueh Pao/Chinese on step-reduced SM3 hash Journal of Mechanical Engi- function. Lecture Notes in neering, 19(3):22–31, Septem- CS, 7259:375–390, 2012. CO- ber 1983. CODEN CHHKA2. DEN LNCSD9. ISSN 0302- ISSN 0577-6686. 9743 (print), 1611-3349 (elec- Zhou:2018:DSH tronic). URL http://link. [ZZLZ18] Ke Zhou, Jiangfeng Zeng, springer.com/content/pdf/ Yu Liu, and Fuhao Zou. 10.1007/978-3-642-31912- Deep sentiment hashing 9_25. for text retrieval in social Zhang:2019:SPB CIoT. Future Generation Computer Systems, 86(??): [ZXL19] Rui Zhang, Rui Xue, and 362–371, September 2018. Ling Liu. Security and pri- CODEN FGSEVI. ISSN vacy on blockchain. ACM 0167-739X (print), 1872-7115 Computing Surveys, 52(3): (electronic). URL https: 51:1–51:??, July 2019. CO- //www.sciencedirect.com/ DEN CMSVAN. ISSN 0360- science/article/pii/S0167739X18302383. 0300 (print), 1557-7341 (electronic). URL https://dl. Zhang:2021:POP acm.org/ft_gateway.cfm? [ZZLZ21] Zheng Zhang, Xiaofeng Zhu, id=3316481. Guangming Lu, and Yudong Zhou:2020:NUI Zhang. Probability ordinal- preserving semantic hash- [ZYWM20] Yanwei Zhou, Bo Yang, ing for large-scale image Tao Wang, and Yi Mu. retrieval. ACM Transac- Novel updatable identity- tions on Knowledge Discov- based hash proof system ery from Data (TKDD),15 REFERENCES 510

(3):37:1–37:22, May 2021. CODEN ???? ISSN 1556-4681 (print), 1556-472X (electronic). URL https:/ /dl.acm.org/doi/10.1145/ 3442204. Zhang:2017:NLR [ZZM17] Leyou Zhang, Jingxia Zhang, and Yi Mu. Novel leakage- resilient attribute-based encryption from hash proof system. The Computer Jour- nal, 60(4):541–554, March 23, 2017. CODEN CM- PJA6. ISSN 0010-4620 (print), 1460-2067 (electronic). URL https:// academic.oup.com/comjnl/ article/60/4/541/2608069.