Document Search Results

Fingerprinting-based minimal perfect hashing revisited. (English) Zbl 07887805

ACM J. Exp. Algorithm. 28, Paper No. 1.4, 16 p. (2023).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Fan, Jason; Khan, Jamshed; Pibiri, Giulio Ermanno; Patro, Rob

Spectrum preserving tilings enable sparse and modular reference indexing. (English) Zbl 1530.92166

Tang, Haixu (ed.), Research in computational molecular biology. 27th annual international conference, RECOMB 2023, Istanbul, Turkey, April 16–19, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13976, 21-40 (2023).

MSC: 92D20 92D10 92-04

Cite Review PDF

Full Text: DOI

OA License

Bertrand, Jules; Dufossé, Fanny; Singh, Somesh; Uçar, Bora

Algorithms and data structures for hyperedge queries. (English) Zbl 07832058

ACM J. Exp. Algorithm. 27, Article No. 1.13, 23 p. (2022).

MSC: 68Wxx

Cite Review PDF

Full Text: DOI

Bercea, Ioana Oriana; Even, Guy

An extendable data structure for incremental stable perfect hashing. (English) Zbl 07774418

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 1298-1310 (2022).

MSC: 68Qxx

Cite Review PDF

Full Text: DOI

Vaz Netto, Marcelo; Montenegro González, Sahudy

SSLC: a search algorithm based on linear collisions and Poisson probability distribution. (English) Zbl 1521.68048

ACM J. Exp. Algorithm. 27, Article No. 1.4, 15 p. (2022).

MSC: 68P10

Cite Review PDF

Full Text: DOI

Yu, Huacheng

Nearly optimal static las Vegas succinct dictionary. (English) Zbl 07534653

SIAM J. Comput. 51, No. 3, STOC20-174-STOC20-249 (2022).

MSC: 68P05 68P30

Cite Review PDF

Full Text: DOI

Guruswami, Venkatesan; Riazanov, Andrii

Beating Fredman-Komlós for perfect \(k\)-hashing. (English) Zbl 1483.94025

J. Comb. Theory, Ser. A 188, Article ID 105580, 21 p. (2022).

MSC: 94A24 94A15 68P10 68R10

Cite Review PDF

Full Text: DOI arXiv

Darivandpour, Javad; Le, Duc V.; Atallah, Mikhail J.

Secure two-party input-size reduction: challenges, solutions and applications. (English) Zbl 1523.68032

Inf. Sci. 567, 256-277 (2021).

MSC: 68Q10 94A60 94A62

Cite Review PDF

Full Text: DOI

Costa, Simone; Dalai, Marco

New bounds for perfect \(k\)-hashing. (English) Zbl 1460.94043

Discrete Appl. Math. 289, 374-382 (2021).

MSC: 94A60 68P10 68R10

Cite Review PDF

Full Text: DOI arXiv

Guruswami, Venkatesan; Riazanov, Andrii

Beating Fredman-Komlós for perfect \(k\)-hashing. (English) Zbl 07561585

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 92, 14 p. (2019).

MSC: 68Nxx 68Qxx

Cite Review PDF

Full Text: DOI

Jia, C. J.; Wang, Y.; Mendl, C. B.; Moritz, B.; Devereaux, T. P.

Paradeisos: a perfect hashing algorithm for many-body eigenvalue problems. (English) Zbl 1511.65033

Comput. Phys. Commun. 224, 81-89 (2018).

MSC: 65F15 65F50

Cite Review PDF

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

Cite Review PDF

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

Cite Review PDF

Full Text: DOI

Bhaskara, Aditya; Desai, Devendra; Srinivasan, Srinkath

Optimal hitting sets for combinatorial shapes. (English) Zbl 1366.68361

Theory Comput. 9, Paper No. 13, 441-470 (2013).

MSC: 68W20 90C27

Cite Review PDF

Full Text: DOI

OA License

Botelho, Fabiano C.; Wormald, Nicholas; Ziviani, Nivio

Cores of random \(r\)-partite hypergraphs. (English) Zbl 1243.68323

Inf. Process. Lett. 112, No. 8-9, 314-319 (2012).

MSC: 68W20 05C80 05C85 68P05

Cite Review PDF

Full Text: DOI

Belazzougui, Djamal; Boldi, Paolo; Pagh, Rasmus; Vigna, Sebastiano

Theory and practice of monotone minimal perfect hashing. (English) Zbl 1284.68631

ACM J. Exp. Algorithm. 16, Spec. Iss. 2, Article No. 3.2, 26 p. (2011).

MSC: 68W05 68P10 68P05 68P30

Cite Review PDF

Full Text: DOI

Goldreich, Oded; Wigderson, Avi

On the circuit complexity of perfect hashing. (English) Zbl 1343.94057

Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 26-29 (2011).

MSC: 94A60 68R05

Cite Review PDF

Full Text: DOI

Alon, Noga; Gutner, Shai

Balanced families of perfect hash functions and their applications. (English) Zbl 1300.68062

ACM Trans. Algorithms 6, No. 3, Article No. 54, 12 p. (2010).

MSC: 68W25 68Q25 68R10

Cite Review PDF

Full Text: DOI arXiv

Ružić, Milan

Making deterministic signatures quickly. (English) Zbl 1298.68117

ACM Trans. Algorithms 5, No. 3, Article No. 26, 26 p. (2009).

MSC: 68Q25 68P05 68Q05 68W05

Cite Review PDF

Full Text: DOI

Alon, Noga; Gutner, Shai

Balanced hashing, color coding and approximate counting. (English) Zbl 1273.68270

Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 1-16 (2009).

MSC: 68R05 68Q25 68R10 92D10

Cite Review PDF

Full Text: DOI

Carrasco, Rafael C.; Daciuk, Jan

A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata. (English) Zbl 1183.68334

Theor. Inform. Appl. 43, No. 4, 779-790 (2009).

MSC: 68Q45 68P05

Cite Review PDF

Full Text: DOI EuDML Link

Ružić, Milan

Uniform deterministic dictionaries. (English) Zbl 1445.68073

ACM Trans. Algorithms 4, No. 1, Article No. 1, 23 p. (2008).

MSC: 68P05 68W40

Cite Review PDF

Full Text: DOI

Andreev, A. E.; Jukna, S.

Very large cliques are easy to detect. (English) Zbl 1159.05318

Discrete Math. 308, No. 16, 3717-3721 (2008).

MSC: 05C69

Cite Review PDF

Full Text: DOI Link

Raman, Rajeev; Raman, Venkatesh; Satti, Srinivasa Rao

Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets. (English) Zbl 1446.68046

ACM Trans. Algorithms 3, No. 4, Article No. 43, 25 p. (2007).

MSC: 68P05

Cite Review PDF

Full Text: DOI

Alon, Noga; Gutner, Shai

Balanced families of perfect hash functions and their applications. (English) Zbl 1171.68868

Arge, Lars (ed.) et al., Automata, languages and programming. 34th international colloquium, ICALP 2007, Wrocław, Poland, July 9–13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73419-2/pbk). Lecture Notes in Computer Science 4596, 435-446 (2007).

MSC: 68W25 68Q25 68R10

Cite Review PDF

Full Text: DOI

Chang, Chin-Chen; Lin, Chih-Yang; Chou, Henry

Perfect hashing schemes for mining traversal patterns. (English) Zbl 1096.68606

Fundam. Inform. 70, No. 3, 185-202 (2006).

MSC: 68P15 68T05

Cite Review PDF

Daciuk, Jan; van Noord, Gertjan

Finite automata for compact representation of tuple dictionaries. (English) Zbl 1069.68064

Theor. Comput. Sci. 313, No. 1, 45-56 (2004).

MSC: 68Q45

Cite Review PDF

Full Text: DOI

Cole, Richard; Hariharan, Ramesh

Faster suffix tree construction with missing suffix links. (English) Zbl 1069.68644

SIAM J. Comput. 33, No. 1, 26-42 (2003).

MSC: 68W05 68W20 68W40

Cite Review PDF

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

Cite Review PDF

Full Text: Link

Křížek, Michal; Luca, Florian; Somer, Lawrence

[Šolcová, Alena]

17 lectures on Fermat numbers. From number theory to geometry. With a foreword by Alena Šolcová. (English) Zbl 1010.11002

CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. 9. New York, NY: Springer. xxiv, 257 p. (2001).

Reviewer: Bernd Richter (Berlin)

MSC: 11-01 11A51 11A07

Cite Review PDF

Hagerup, Torben; Tholey, Torsten

Efficient minimal perfect hashing in nearly minimal space. (English) Zbl 0976.68594

Ferreira, Afonso (ed.) et al., STACS 2001. 18th annual symposium on theoretical aspects of computer science. Dresden, Germany, February 15-17, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2010, 317-326 (2001).

MSC: 68W05 68P10 68Q25