Found 79 Documents (Results 1–79)
When a dollar makes a BWT. (English) Zbl 1477.68554
Fully functional suffix trees and optimal text searching in BWT-runs bounded space. (English) Zbl 1491.68067
The problem of combinatorial encoding of a continuous dynamics and the notion of transfer of paths in graphs. (English. Russian original) Zbl 1451.37061
J. Math. Sci., New York 247, No. 5, 646-656 (2020); translation from Zap. Nauchn. Semin. POMI 481, 12-28 (2019).
Top tree compression of tries. (English) Zbl 1518.68071
Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 4, 18 p. (2019).
Optimal prefix codes with fewer distinct codeword lengths are faster to construct. (English) Zbl 1430.68096
Bipolar comparison. (English) Zbl 1481.53089
MSC:
53C45
Algorithmic counting of nonequivalent compact Huffman codes. arXiv:1901.11343
Preprint, arXiv:1901.11343 [math.CO] (2019).
Dynamic trees with almost-optimal access cost. (English) Zbl 1524.68109
Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 38, 14 p. (2018).
Slowing down top trees for better worst-case compression. (English) Zbl 1497.68171
Navarro, Gonzalo (ed.) et al., 29th annual symposium on combinatorial pattern matching, CPM 2018, July 2–4, 2018, Qingdao, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 105, Article 16, 8 p. (2018).
Constant-time tree traversal and subtree equality check for grammar-compressed trees. (English) Zbl 1392.68185
Small-space LCE data structure with constant-time queries. (English) Zbl 1441.68026
Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 10, 15 p. (2017).
On sets and graphs. Perspectives on logic and combinatorics. (English) Zbl 1382.05002
Cham: Springer (ISBN 978-3-319-54980-4/hbk; 978-3-319-54981-1/ebook). xix, 275 p. (2017).
Reviewer: Ayesha Shabbir (Gurjat)
Real-world algorithms. A beginner’s guide. (English) Zbl 1373.68004
Cambridge, MA: MIT Press (ISBN 978-0-262-03570-5/hbk; 978-0-262-33814-1/ebook). xvi, 509 p. (2017).
Reviewer: Irina Ioana Mohorianu (Norwich)
Wavelet based image compression using different techniques: a comparative study. (English) Zbl 1363.93231
Note on islands in path-length sequences of binary trees. arXiv:1409.3855
Preprint, arXiv:1409.3855 [math.CO] (2014).
Two-base numeration systems. (English. Russian original) Zbl 1298.68085
Cybern. Syst. Anal. 49, No. 4, 501-510 (2013); translation from Kibern. Sist. Anal. 2013, No. 4, 17-28 (2013).
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression. (English) Zbl 1271.05051
LRM-trees: compressed indices, adaptive sorting, and compressed permutations. (English) Zbl 1252.68082
A compact encoding of unordered binary trees. (English) Zbl 1331.68061
Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 106-113 (2011).
Error resilient LZ’77 data compression: algorithms, analysis, and experiments. (English) Zbl 1314.94015
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts. (English) Zbl 1105.68035
Analysis of the multiplicity matching parameter in suffix trees. (English) Zbl 1104.68034
Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 307-321, electronic (2005).
A tight upper bound on the size of the antidictionary of a binary string. (English) Zbl 1099.68602
Martínez, Conrado (ed.), 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6–10, 2005. Nancy: The Association Discrete Mathematics & Theoretical Science (DMTCS). Discrete Mathematics and Theoretical Computer Science Proceedings AD, 393-398, electronic (2005).
Compressed suffix arrays and suffix trees with applications to text indexing and string matching. (English) Zbl 1092.68115
Cache-oblivious B-trees. (English) Zbl 1092.68028
Logistic model trees. (English) Zbl 1101.68767
Data coding by linear forms of numerical sequences. (English. Russian original) Zbl 1097.94019
Cybern. Syst. Anal. 39, No. 5, 633-643 (2003); translation from Kibern. Sist. Anal. 2003, No. 5, 3-15 (2003).
A fast image coding algorithm based on human visual system. (Chinese. English summary) Zbl 1108.68623
Self-similarity and intermittency. (English) Zbl 1043.60031
Debnath, Lokenath (ed.), Wavelets and signal processing. Boston, MA: Birkhäuser (ISBN 0-8176-4235-8/hbk). Applied and Numerical Harmonic Analysis, 361-375 (2003).
Reviewer: Rudolf Gorenflo (Berlin)
Parity encoding of binary sequences. (English) Zbl 1007.94015
Reviewer: Bal Kishan Dass (Delhi)
Bounding the inefficiency of length-restricted prefix codes. (English) Zbl 1012.94008
Reviewer: Jerzy Żurawiecki (Lublin)
Average profile of the Lempel-Ziv parsing scheme for a Markovian source. (English) Zbl 1020.68034
MSC:
68P30
On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol. (English) Zbl 1029.68548
MSC:
68P30
Extended synchronizing codewords for \(q\)-ary complete prefix codes. (English) Zbl 0991.94027
Reviewer: Jerzy Żurawiecki (Lublin)
Universal data compression based on the Burrows-Wheeler transformation: theory and practice. (English) Zbl 1314.94038
A minimized automaton representation of reachable states. (English) Zbl 1065.68579
Int. J. Softw. Tools Technol. Transf. 2, No. 3, 270-278 (1999).
Using canonical trees to efficiently implement Huffman decode information. (English) Zbl 0962.94038
Reviewer: L.M.G.M.Tolhuizen (Eindhoven)
Some combinatorial optimization problems in phylogenetics. (English) Zbl 0953.92024
Lovász, L. (ed.) et al., Graph theory and combinatorial biology. Based on talks and discussions of the international colloquium on combinatorics and graph theory, Balatonlelle, Hungary, July 1996. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 7, 363-413 (1999).
Optimum Huffman forests. (English) Zbl 0960.68068
MSC:
68P30
Time-optimal tree computations on sparse meshes. (English) Zbl 1528.68268
Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 193-205 (1995).
A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\). (English) Zbl 0785.03028
On binary tree encodements. (English) Zbl 0542.68080
Corrigendum to “DPDA’s in ‘atomic normal form’ and applications to equivalence problems”. (English) Zbl 0486.68040
MSC:
68Q05
68Q45
Corrigendum to “DPDA’s in “atomic normal form” and applications to equivalence problems”. (English) Zbl 0483.68048
MSC:
68Q05
68Q45
DPDA’s in ’Atomic normal form’ and applications to equivalence problems. (English) Zbl 0474.68065
MSC:
68Q05
68Q45
Toward a theory of data encoding - extended abstract. (English) Zbl 0416.68056
Proc. Conf. theoretical computer science, Waterloo/Ontario 1977, 255-261 (1977).
Filter Results by …
Document Type
- Journal Articles (64)
- Collection Articles (11)
- Books (2)
- arXiv Preprints (2)
all
top 5
Author
- Navarro, Gonzalo (7)
- Szpankowski, Wojciech (6)
- Munro, J. Ian (5)
- Barbay, Jérémy (3)
- Bille, Philip (3)
- Fischer, Johannes (3)
- Gallier, Jean H. (3)
- Gawrychowski, Paweł (3)
- Gørtz, Inge Li (3)
- Landau, Gad M. (3)
- Sadakane, Kunihiko (3)
- Shapira, Dana (3)
- Weimann, Oren (3)
- Bannai, Hideo (2)
- Deo, Narsingh (2)
- Golin, Mordecai J. (2)
- He, Meng (2)
- Hon, Wing-Kai (2)
- Iacono, John (2)
- Inenaga, Shunsuke (2)
- Jacquet, Philippe (2)
- Klein, Shmuel Tomi (2)
- Mäkinen, Veli (2)
- Micikevicius, Paulius (2)
- Nakano, Shin-ichi (2)
- Nekrich, Yakov (2)
- Satti, Srinivasa Rao (2)
- Sung, Wing-Kin (2)
- Takeda, Masayuki (2)
- Thankachan, Sharma V. (2)
- Vitter, Jeffrey Scott (2)
- Ward, Mark Daniel (2)
- Abedin, Paniz (1)
- Abraham, Uri (1)
- Arshad, Sahar (1)
- Artés, A. (1)
- Balkenhol, Bernhard (1)
- Baruch, Gilad (1)
- Belal, Ahmed A. (1)
- Belazzougui, Djamal (1)
- Benassi, Albert (1)
- Bender, Michael A. (1)
- Bhagavathi, D. (1)
- Bokka, V. (1)
- Bovik, Alan Conrad (1)
- Caminiti, Saverio (1)
- Chan, Timothy Moon-Yew (1)
- Charon, Irène (1)
- Claude, Francisco (1)
- Cohen, Serge (1)
- Cuevas, Francisco J. (1)
- Daptardar, Ajay (1)
- Deguy, Sébastien (1)
- Demaine, Erik D. (1)
- Dudek, Bartłomiej (1)
- Elmasry, Amr (1)
- Elsholtz, Christian (1)
- Escott, Adrian E. (1)
- Farach-Colton, Martin (1)
- Farzan, Arash (1)
- Ferragina, Paolo (1)
- Fraile, D. (1)
- Frank, Eibe (1)
- Funamoto, Takashi (1)
- Gagie, Travis (1)
- Gillett, Will D. (1)
- Giuliani, Sara (1)
- Gołȩbiewski, Zbigniew (1)
- Gravier, Sylvain (1)
- Grossi, Roberto (1)
- Gurla, Himabindu (1)
- Hall, Mark A. (1)
- Heuberger, Clemens (1)
- Holzmann, Gerard J. (1)
- Hooshmand, Sahar (1)
- Hudry, Olivier (1)
- I, Tomohiro (1)
- Ishiwata, Shiro (1)
- Istas, Jacques (1)
- Iwata, Kozue (1)
- Jansson, Jesper (1)
- Kassim, Ashraf A. (1)
- Kazemi, Ramin (1)
- Khan, Usman Ali (1)
- Köppl, Dominik (1)
- Krenn, Daniel (1)
- Krizanc, Danny (1)
- Kurtz, Stefan (1)
- Laber, Eduardo Sany (1)
- Landwehr, Niels (1)
- Langerman, Stefan (1)
- Lebedeva, Nina V. (1)
- Lipták, Zsuzsanna (1)
- Lobstein, Antoine-Christophe (1)
- Lohrey, Markus (1)
- Lonardi, Stefano (1)
- López, Hiram H. (1)
- Losada, Miguel A. (1)
- Louridas, Panos (1)
- Magner, Abram (1)
- and 62 more Authors
all
top 5
Serial
- Theor. Comput. Sci. (11)
- Algorithmica (7)
- Inf. Comput. (4)
- Discrete Appl. Math. (3)
- SIAM J. Comput. (3)
- Congr. Numerantium (3)
- ACM Trans. Algorithms (3)
- Cybern. Syst. Anal. (2)
- Acta Inf. (1)
- Discrete Math. (1)
- IEEE Trans. Inf. Theory (1)
- Inf. Process. Manage. (1)
- IEEE Trans. Comput. (1)
- Inf. Sci. (1)
- J. Comput. Syst. Sci. (1)
- ACM Trans. Program. Lang. Syst. (1)
- Circuits Syst. Signal Process. (1)
- Ann. Pure Appl. Logic (1)
- Signal Process. (1)
- Mach. Learn. (1)
- Des. Codes Cryptography (1)
- Geom. Funct. Anal. (1)
- Pattern Recognition (1)
- J. Math. Sci., New York (1)
- J. ACM (1)
- Discrete Math. Theor. Comput. Sci. (1)
- Fundam. Inform. (1)
- Bul. Inst. Politeh. Iași, Secția Autom. Calc. (1)
- J. UCS (1)
- IEEE Trans. Image Process. (1)
- J. Softw. (1)
- ACM J. Exp. Algorithm. (1)
- J. Discrete Algorithms (1)
- Discrete Math. Algorithms Appl. (1)
- Algorithms (Basel) (1)
