×

Found 58 Documents (Results 1–58)

Fast and simple compact hashing via bucketing. (English) Zbl 1515.68100

Faro, Simone (ed.) et al., 18th international symposium on experimental algorithms, SEA 2020, Catania, Italy, June 16–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 160, Article 7, 14 p. (2020).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Data structures for sets. 2nd edition. (English) Zbl 1390.68232

Mehta, Dinesh P. (ed.) et al., Handbook of data structures and applications. Boca Raton, FL: Chapman & Hall/CRC (ISBN 978-1-4987-0185-3/hbk; 978-1-4987-0188-4/ebook). Chapman & Hall/CRC Computer and Information Science Series, 529-544 (2018).
MSC:  68P05
PDFBibTeX XMLCite

Compact dynamic rewritable (CDRW) arrays. (English) Zbl 1430.68058

Fekete, Sándor (ed.) et al., Proceedings of the 19th workshop on algorithm engineering and experiments, ALENEX ’17, Barcelona, Spain, January 17–18, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 109-119 (2017).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Compact encodings and indexes for the nearest larger neighbor problem. (English) Zbl 1432.68094

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8973, 53-64 (2015).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Asymptotically optimal encodings for range selection. (English) Zbl 1360.68384

Raman, Venkatesh (ed.) et al., 34th international conference on foundation of software technology and theoretical computer science, FSTTCS 2014, New Delhi, India, December 15–17, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-77-4). LIPIcs – Leibniz International Proceedings in Informatics 29, 291-301 (2014).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Encodings for range selection and top-\(k\) queries. (English) Zbl 1394.68096

Bodlaender, Hans L. (ed.) et al., Algorithms – ESA 2013. 21st annual European symposium, Sophia Antipolis, France, September 2–4, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40449-8/pbk). Lecture Notes in Computer Science 8125, 553-564 (2013).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Succinct representations of ordinal trees. (English) Zbl 1394.68102

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 319-332 (2013).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Range extremum queries. (English) Zbl 1293.68088

Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 280-287 (2012).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: DOI

Succinct indices for range queries with applications to orthogonal range maxima. (English) Zbl 1272.68115

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 327-338 (2012).
MSC:  68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two dimensional range minimum queries and Fibonacci lattices. (English) Zbl 1365.68172

Epstein, Leah (ed.) et al., Algorithms – ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10–12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 217-228 (2012).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Succinct representations of binary trees for range minimum queries. (English) Zbl 1364.68150

Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 396-407 (2012).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Random access to grammar-compressed strings. (English) Zbl 1375.68229

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 373-389 (2011).
PDFBibTeX XMLCite
Full Text: Link

Encoding 2D range maximum queries. (English) Zbl 1330.68051

Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 180-189 (2011).
MSC:  68P05 68P30 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal trade-offs for succinct string indexes. (English) Zbl 1288.68047

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 678-689 (2010).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

More haste, less waste: lowering the redundancy in fully indexable dictionaries. (English) Zbl 1236.68064

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 517-528, electronic only (2009).
MSC:  68P30 68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Universal succinct representations of trees? (English) Zbl 1248.68168

Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 451-462 (2009).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Computing minimum spanning trees with uncertainty. (English) Zbl 1259.68161

Albers, Susanne (ed.) et al., STACS 2008. 25th international symposium on theoretical aspects of computer science, Bordeaux, France, February 21–23, 2008. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-06-4). LIPIcs – Leibniz International Proceedings in Informatics 1, 277-288, electronic only (2008).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

On the redundancy of succinct data structures. (English) Zbl 1155.68374

Gudmundsson, Joachim (ed.), Algorithm theory – SWAT 2008. 11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2–4, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69900-2/pbk). Lecture Notes in Computer Science 5124, 148-159 (2008).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Streaming algorithms for data in motion. (English) Zbl 1176.68238

Chen, Bo (ed.) et al., Combinatorics, algorithms, probabilistic and experimental methodologies. First international symposium, ESCAPE 2007, Hangzhou, China, April 7–9, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-74449-8/pbk). Lecture Notes in Computer Science 4614, 294-304 (2007).
MSC:  68W05 68P05 68W01
PDFBibTeX XMLCite
Full Text: DOI

On the size of succinct indices. (English) Zbl 1151.68385

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 371-382 (2007).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Compressed prefix sums. (English) Zbl 1132.68022

van Leeuwen, Jan (ed.) et al., SOFSEM 2007: Theory and practice of computer science. 33rd conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 20–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-69506-6/pbk). Lecture Notes in Computer Science 4362, 235-247 (2007).
MSC:  68P05 68P20 68P30
PDFBibTeX XMLCite
Full Text: DOI

Engineering the LOUDS succinct tree representation. (English) Zbl 1196.68058

Àlvarez, Carme (ed.) et al., Experimental algorithms. 5th international workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24–27, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34597-3/pbk). Lecture Notes in Computer Science 4007, 134-145 (2006).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

Succinct ordinal trees with level-ancestor queries. (English) Zbl 1317.68043

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 1-10 (2004).
MSC:  68P05 68W05
PDFBibTeX XMLCite

A simple optimal representation for balanced parentheses. (English) Zbl 1103.68474

Sahinalp, Suleyman Cenk (ed.) et al., Combinatorial pattern matching. 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5–7, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22341-X/pbk). Lecture Notes in Computer Science 3109, 159-172 (2004).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Succinct dynamic dictionaries and trees. (English) Zbl 1039.68043

Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 357-368 (2003).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: Link

Succinct representations of permutations. (English) Zbl 1039.68546

Baeten, Jos C. M. (ed.) et al., Automata, languages and programming. 30th international colloquium, ICALP 2003, Eindhoven, The Netherland, June 30 – July 4, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40493-7/pbk). Lect. Notes Comput. Sci. 2719, 345-356 (2003).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: Link

Succinct indexable dictionaries with applications to encoding \(k\)-ary trees and multisets. (English) Zbl 1093.68582

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 233-242 (2002).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: arXiv

Exponential structures for efficient cache-oblivious algorithms. (English) Zbl 1056.68511

Widmayer, Peter (ed.) et al., Automata, languages and programming. 29th international colloquium, ICALP 2002, Málaga, Spain, July 8–13, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43864-5). Lect. Notes Comput. Sci. 2380, 195-207 (2002).
MSC:  68P05 68P10 68T20
PDFBibTeX XMLCite
Full Text: Link

Persistence, randomization and parallelization: on some combinatorial games and their applications (abstract). (English) Zbl 1504.68044

Dehne, Frank (ed.) et al., Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 709, 289-301 (1993).
PDFBibTeX XMLCite
Full Text: DOI

Randomized data structures for the dynamic closest-pair problem. (English) Zbl 0801.68036

Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 301-310 (1993).
MSC:  68P05 68U05
PDFBibTeX XMLCite

Persistence, amortization and randomization. (English) Zbl 0800.68346

Aggarwal, Alok (ed.), Discrete algorithms. Proceedings of the 2nd annual ACM-SIAM symposium, held January 28-30, 1991, in San Francisco, CA (USA). Philadelphia, PA: SIAM. 78-88 (1991).
MSC:  68P05 91A43 68R10
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software