Encoding nearest larger values (Q1698712): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 03:39, 15 July 2024

scientific article

Language	Label	Description	Also known as
English	Encoding nearest larger values	scientific article

Statements

scholarly article

0 references

Encoding nearest larger values (English)

0 references

0 references

Theoretical Computer Science

0 references

publication date

16 February 2018

0 references

full work available at URL

http://hdl.handle.net/2381/39591

0 references

zbMATH Keywords

data structures

0 references

encoding data structures

0 references

succinct data structures

0 references

MaRDI profile type

0 references

Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

0 references

Encoding 2D range maximum queries

0 references

Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays

0 references

Encoding range minima and range top-2 queries

0 references

Faster entropy-bounded compressed suffix trees

0 references

Space efficient data structures for nearest larger neighbor

0 references

Combined data structure for previous- and next-smaller-values

0 references

Finding Nearest Larger Neighbors

0 references

Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

0 references

0 references

A uniform paradigm to succinctly encode various families of trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2017.02.017

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1698712

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1698712&oldid=36373053"