Home › Entities › doctoral_thesis › Computation-friendly compression of matrices and tries

Computation-friendly compression of matrices and tries

Doctoral dissertation defended in 2024
Place doctoral_thesis Q138605219
Press Enter · cited answer in seconds

Computation-friendly compression of matrices and tries

Summary

Computation-friendly compression of matrices and tries is a doctoral thesis[1].

Key Facts

  • Computation-friendly compression of matrices and tries authored Francesco Tosoni[2].
  • Computation-friendly compression of matrices and tries's instance of is recorded as doctoral thesis[3].
  • Computation-friendly compression of matrices and tries's place of publication is recorded as Pisa[4].
  • Computation-friendly compression of matrices and tries's language of work or name is recorded as English[5].
  • Computation-friendly compression of matrices and tries's publication date is recorded as +2024-05-04T00:00:00Z[6].
  • Computation-friendly compression of matrices and tries's main subject is recorded as lossless compression[7].
  • Computation-friendly compression of matrices and tries's main subject is recorded as matrix multiplication[8].
  • Computation-friendly compression of matrices and tries's main subject is recorded as trie[9].
  • Computation-friendly compression of matrices and tries's main subject is recorded as succinct data structure[10].
  • Computation-friendly compression of matrices and tries's Handle ID is recorded as 20.500.14242/216698[11].
  • Computation-friendly compression of matrices and tries's first line is recorded as Efficient representation, indexing, and data manipulation are extensively studied problems in Computer Science, with applications in various domains such as machine learning platforms, key-value storage, pattern matching, and graph analysis tasks.[12].
  • Computation-friendly compression of matrices and tries's author name string is recorded as Francesco Tosoni[13].
  • Computation-friendly compression of matrices and tries's copyright holder is recorded as Francesco Tosoni[14].
  • Computation-friendly compression of matrices and tries's URN-NBN is recorded as URN:NBN:IT:UNIPI-216698[15].
  • Computation-friendly compression of matrices and tries's copyright status is recorded as copyrighted[16].

Body

Designation and Status

Computation-friendly compression of matrices and tries's instance of is recorded as doctoral thesis[3].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  2. [2] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . tesidottorato.depositolegale.it. Retrieved . tesidottorato.depositolegale.it. Provenance: wikidata.org.
  15. [16] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Computation-friendly compression of matrices and tries. Retrieved May 3, 2026, from https://4ort.xyz/entity/computation-friendly-compression-of-matrices-and-tries
MLA “Computation-friendly compression of matrices and tries.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/computation-friendly-compression-of-matrices-and-tries.
BibTeX @misc{4ortxyz_computation-friendly-compression-of-matrices-and-tries_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Computation-friendly compression of matrices and tries}}, year = {2026}, url = {https://4ort.xyz/entity/computation-friendly-compression-of-matrices-and-tries}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Computation-friendly compression of matrices and tries — https://4ort.xyz/entity/computation-friendly-compression-of-matrices-and-tries (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/computation-friendly-compression-of-matrices-and-tries · Last refreshed: