Genuzio, Marco; Ottaviano, Giuseppe; Vigna, Sebastiano Fast scalable construction of ([compressed] static | minimal perfect hash) functions. (English) Zbl 1446.68038 Inf. Comput. 273, Article ID 104517, 17 p. (2020). MSC: 68P05 68P30 PDFBibTeX XMLCite \textit{M. Genuzio} et al., Inf. Comput. 273, Article ID 104517, 17 p. (2020; Zbl 1446.68038) Full Text: DOI
Marchet, Camille; Lecompte, Lolita; Limasset, Antoine; Bittner, Lucie; Peterlongo, Pierre A resource-frugal probabilistic dictionary and applications in bioinformatics. (English) Zbl 1434.68132 Discrete Appl. Math. 274, 92-102 (2020). MSC: 68P05 92D10 PDFBibTeX XMLCite \textit{C. Marchet} et al., Discrete Appl. Math. 274, 92--102 (2020; Zbl 1434.68132) Full Text: DOI arXiv
Hemaspaandra, Lane A.; Rubery, Daniel Recursion-theoretic ranking and compression. (English) Zbl 1459.03059 J. Comput. Syst. Sci. 101, 31-41 (2019). Reviewer: Marius Zimand (Towson) MSC: 03D20 03D30 03D15 68Q25 PDFBibTeX XMLCite \textit{L. A. Hemaspaandra} and \textit{D. Rubery}, J. Comput. Syst. Sci. 101, 31--41 (2019; Zbl 1459.03059) Full Text: DOI arXiv
Limasset, Antoine; Rizk, Guillaume; Chikhi, Rayan; Peterlongo, Pierre Fast and scalable minimal perfect hashing for massive key sets. (English) Zbl 1433.68104 Iliopoulos, Costas S. (ed.) et al., 16th international symposium on experimental algorithms, SEA 2017, London, UK, June 21–23, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 75, Article 25, 16 p. (2017). MSC: 68P05 68P20 68W40 PDFBibTeX XMLCite \textit{A. Limasset} et al., LIPIcs -- Leibniz Int. Proc. Inform. 75, Article 25, 16 p. (2017; Zbl 1433.68104) Full Text: DOI arXiv
Han, Yijie Construct a perfect word hash function in time independent of the size of integers. (English) Zbl 1420.68249 Inf. Process. Lett. 128, 5-10 (2017). MSC: 68W40 68P10 94A60 PDFBibTeX XMLCite \textit{Y. Han}, Inf. Process. Lett. 128, 5--10 (2017; Zbl 1420.68249) Full Text: DOI
Chakraborty, Suvradip; Paul, Goutam; Rangan, C. Pandu Forward-secure authenticated symmetric key exchange protocol: new security model and secure construction. (English) Zbl 1388.94040 Au, Man-Ho (ed.) et al., Provable security. 9th international conference, ProvSec 2015, Kanazawa, Japan, November 24–26, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-26058-7/pbk; 978-3-319-26059-4/ebook). Lecture Notes in Computer Science 9451, 149-166 (2015). MSC: 94A60 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., Lect. Notes Comput. Sci. 9451, 149--166 (2015; Zbl 1388.94040) Full Text: DOI
Han, Yijie A linear time algorithm for ordered partition. (English) Zbl 1407.68120 Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9130, 89-103 (2015). MSC: 68P10 68Q25 PDFBibTeX XMLCite \textit{Y. Han}, Lect. Notes Comput. Sci. 9130, 89--103 (2015; Zbl 1407.68120) Full Text: DOI
Bshouty, Nader H. Linear time constructions of some \(d\)-restriction problems. (English) Zbl 1459.68150 Paschos, Vangelis Th. (ed.) et al., Algorithms and complexity. 9th international conference, CIAC 2015, Paris, France, May 20–22, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9079, 74-88 (2015). MSC: 68R05 68Q25 68W20 PDFBibTeX XMLCite \textit{N. H. Bshouty}, Lect. Notes Comput. Sci. 9079, 74--88 (2015; Zbl 1459.68150) Full Text: DOI arXiv
Bshouty, Nader Testers and their applications. (English) Zbl 1364.68359 Proceedings of the 5th conference on innovations in theoretical computer science, ITCS’14, Princeton, NJ, USA, January 11–14, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2243-0). 327-351 (2014). MSC: 68W20 68R05 PDFBibTeX XMLCite \textit{N. Bshouty}, in: Proceedings of the 5th conference on innovations in theoretical computer science, ITCS'14, Princeton, NJ, USA, January 11--14, 2014. New York, NY: Association for Computing Machinery (ACM). 327--351 (2014; Zbl 1364.68359) Full Text: DOI
Grossi, Roberto; Ottaviano, Giuseppe Fast compressed tries through path decompositions. (English) Zbl 1347.68101 ACM J. Exp. Algorithm. 19, Spec. Iss. 2, Article No. 3.4, 20 p. (2014). MSC: 68P05 PDFBibTeX XMLCite \textit{R. Grossi} and \textit{G. Ottaviano}, ACM J. Exp. Algorithm. 19, Article No. 3.4, 20 p. (2014; Zbl 1347.68101) Full Text: DOI
Belazzougui, Djamal; Navarro, Gonzalo; Valenzuela, Daniel Improved compressed indexes for full-text document retrieval. (English) Zbl 1268.68075 J. Discrete Algorithms 18, 3-13 (2013). MSC: 68P20 68P05 68W05 PDFBibTeX XMLCite \textit{D. Belazzougui} et al., J. Discrete Algorithms 18, 3--13 (2013; Zbl 1268.68075) Full Text: DOI
Cheng, Zhiqian; Wang, Sufang Structures of a type of perfect hash function family. (Chinese. English summary) Zbl 1289.94048 J. Henan Univ. Sci. Technol., Nat. Sci. 33, No. 2, 79-82 (2012). MSC: 94A60 68P25 05C90 PDFBibTeX XMLCite \textit{Z. Cheng} and \textit{S. Wang}, J. Henan Univ. Sci. Technol., Nat. Sci. 33, No. 2, 79--82 (2012; Zbl 1289.94048)
Bruen, Aiden A.; Wehlau, David L.; Forcinito, Mario Error correcting codes, block designs, perfect secrecy and finite fields. (English) Zbl 1114.94007 Acta Appl. Math. 93, No. 1-3, 253-278 (2006). Reviewer: Sergio R. López-Permouth (Athens) MSC: 94A60 11T71 81P68 PDFBibTeX XMLCite \textit{A. A. Bruen} et al., Acta Appl. Math. 93, No. 1--3, 253--278 (2006; Zbl 1114.94007) Full Text: DOI
Micciancio, Daniele Almost perfect lattices, the covering radius problem, and applications to Ajtai’s connection factor. (English) Zbl 1112.68067 SIAM J. Comput. 34, No. 1, 118-169 (2004). MSC: 68Q25 11Y16 11H71 52C07 52C17 68P25 68Q17 68R05 PDFBibTeX XMLCite \textit{D. Micciancio}, SIAM J. Comput. 34, No. 1, 118--169 (2004; Zbl 1112.68067) Full Text: DOI
Dietzfelbinger, Martin; Hagerup, Torben Simple minimal perfect hashing in less space. (English) Zbl 1006.68526 Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 109-120 (2001). MSC: 68P05 PDFBibTeX XMLCite \textit{M. Dietzfelbinger} and \textit{T. Hagerup}, Lect. Notes Comput. Sci. 2161, 109--120 (2001; Zbl 1006.68526) Full Text: Link
Fachini, Emanuela; Nilli, Alon Recursive bounds for perfect hashing. (English) Zbl 0996.68039 Discrete Appl. Math. 111, No. 3, 307-311 (2001). MSC: 68P10 PDFBibTeX XMLCite \textit{E. Fachini} and \textit{A. Nilli}, Discrete Appl. Math. 111, No. 3, 307--311 (2001; Zbl 0996.68039) Full Text: DOI
Deo, Narsingh; Kumar, Nishit; Parsons, James Minimum-length fundamental-cycle set: New heuristics and an empirical study. (English) Zbl 0896.05055 Congr. Numerantium 107, 141-154 (1995). MSC: 05C85 05C38 68R10 PDFBibTeX XMLCite \textit{N. Deo} et al., Congr. Numerantium 107, 141--154 (1995; Zbl 0896.05055)
Alon, Noga; Yuster, Raphael; Zwick, Uri Color-coding. (English) Zbl 0885.68116 J. Assoc. Comput. Mach. 42, No. 4, 844-856 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Assoc. Comput. Mach. 42, No. 4, 844--856 (1995; Zbl 0885.68116) Full Text: DOI
Nilli, A. Perfect hashing and probability. (English) Zbl 0820.68063 Comb. Probab. Comput. 3, No. 3, 407-409 (1994). MSC: 68Q45 68R15 60G35 PDFBibTeX XMLCite \textit{A. Nilli}, Comb. Probab. Comput. 3, No. 3, 407--409 (1994; Zbl 0820.68063) Full Text: DOI
Havas, George; Majewski, Bohdan S. Graph theoretic obstacles to perfect hashing. (English) Zbl 0801.05064 Congr. Numerantium 98, 81-93 (1993). MSC: 05C99 05C38 68R10 05C80 05C85 PDFBibTeX XMLCite \textit{G. Havas} and \textit{B. S. Majewski}, Congr. Numerantium 98, 81--93 (1993; Zbl 0801.05064)
Czech, Zbigniew J.; Majewski, Bohdan S. A linear time algorithm for finding minimal perfect hash functions. (English) Zbl 0786.68042 Comput. J. 36, No. 6, 579-587 (1993). MSC: 68Q25 68P99 PDFBibTeX XMLCite \textit{Z. J. Czech} and \textit{B. S. Majewski}, Comput. J. 36, No. 6, 579--587 (1993; Zbl 0786.68042) Full Text: DOI
Goldsmith, Judy; Hemachandra, Lane A.; Kunen, Kenneth Polynomial-time compression. (English) Zbl 0752.68039 Comput. Complexity 2, No. 1, 18-39 (1992). MSC: 68Q15 PDFBibTeX XMLCite \textit{J. Goldsmith} et al., Comput. Complexity 2, No. 1, 18--39 (1992; Zbl 0752.68039) Full Text: DOI
Schmidt, Jeanette P.; Siegel, Alan The spatial complexity of oblivious k-probe hash functions. (English) Zbl 0711.68039 SIAM J. Comput. 19, No. 5, 775-786 (1990). MSC: 68P10 68Q05 68R05 68R10 PDFBibTeX XMLCite \textit{J. P. Schmidt} and \textit{A. Siegel}, SIAM J. Comput. 19, No. 5, 775--786 (1990; Zbl 0711.68039) Full Text: DOI
Ragde, Prabhakar The parallel simplicity of compaction and chaining. (English) Zbl 0766.68051 Automata, languages and programming, Proc. 17th Int. Colloq., Warwick/GB 1990, Lect. Notes Comput. Sci. 443, 744-751 (1990). MSC: 68W15 68P99 68Q25 PDFBibTeX XMLCite \textit{P. Ragde}, Lect. Notes Comput. Sci. 443, 744--751 (1990; Zbl 0766.68051)
Cercone, Nick; Krause, Max; Boates, John Minimal and almost minimal perfect hash function search with application to natural language lexicon design. (English) Zbl 0521.68096 Comput. Math. Appl. 9, 215-231 (1983). MSC: 68T99 68T50 PDFBibTeX XMLCite \textit{N. Cercone} et al., Comput. Math. Appl. 9, 215--231 (1983; Zbl 0521.68096) Full Text: DOI
Du, M. W.; Hsieh, T. M.; Jea, K. F.; Shieh, D. W. The study of a new perfect hash scheme. (English) Zbl 0509.68063 IEEE Trans. Software Eng. 9, 305-313 (1983). MSC: 68R99 PDFBibTeX XMLCite \textit{M. W. Du} et al., IEEE Trans. Softw. Eng. 9, 305--313 (1983; Zbl 0509.68063) Full Text: DOI