Article

A Tight Lower Bound for On-line Monotonic List Labeling

Authors:

Paul F. Dietz,

Joel I. Seiferas,

Ju ZhangAuthors Info & Claims

SWAT '94: Proceedings of the 4th Scandinavian Workshop on Algorithm Theory

Pages 131 - 142

Published: 06 July 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Bender MHu H(2007)An adaptive packed-memory arrayACM Transactions on Database Systems10.1145/1292609.129261632:4(26-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1292609.1292616
Bird RSadnicki S(2007)Minimal on-line labellingInformation Processing Letters10.1016/j.ipl.2006.07.011101:1(41-45)Online publication date: 16-Jan-2007
https://dl.acm.org/doi/10.1016/j.ipl.2006.07.011
Bender MHu HGottlob GVan den Bussche J(2006)An adaptive packed-memory arrayProceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1142351.1142355(20-29)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1142351.1142355
Show More Cited By

A Tight Lower Bound for On-line Monotonic List Labeling
1. Mathematics of computing

Recommendations

A Tight Lower Bound for On-Line Monotonic List Labeling
A Tight Lower Bound for Online Monotonic List Labeling

Maintaining a monotonic labeling of an ordered list during the insertion of n items requires $\Omega$(n log n) individual relabelings, in the worst case, if the number of usable labels is only polynomial in n. This follows from a lower bound for a new ...
A tight lower bound on the minimal dispersion
Abstract
We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce bounding the ...

Comments

Information & Contributors

Information

Published In

SWAT '94: Proceedings of the 4th Scandinavian Workshop on Algorithm Theory

July 1994

381 pages

ISBN:3540582185

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 06 July 1994

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bender MHu H(2007)An adaptive packed-memory arrayACM Transactions on Database Systems10.1145/1292609.129261632:4(26-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1292609.1292616
Bird RSadnicki S(2007)Minimal on-line labellingInformation Processing Letters10.1016/j.ipl.2006.07.011101:1(41-45)Online publication date: 16-Jan-2007
https://dl.acm.org/doi/10.1016/j.ipl.2006.07.011
Bender MHu HGottlob GVan den Bussche J(2006)An adaptive packed-memory arrayProceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1142351.1142355(20-29)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.1145/1142351.1142355
Aspnes JKirsch JKrishnamurthy AChaudhuri SKutten S(2004)Load balancing and locality in range-queriable data structuresProceedings of the twenty-third annual ACM symposium on Principles of distributed computing10.1145/1011767.1011785(115-124)Online publication date: 25-Jul-2004
https://dl.acm.org/doi/10.1145/1011767.1011785
Bender MFineman JGilbert SLeiserson CGibbons PAdler M(2004)On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programsProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007933(133-144)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007933
Awerbuch BScheideler CGibbons PAdler M(2004)Consistent and compact data management in distributed storage systemsProceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures10.1145/1007912.1007920(44-53)Online publication date: 27-Jun-2004
https://dl.acm.org/doi/10.1145/1007912.1007920
Chen YMihaila GBordawekar RPadmanabhan S(2004)L-TreeProceedings of the 2004 international conference on Current Trends in Database Technology10.1007/978-3-540-30192-9_20(209-218)Online publication date: 14-Mar-2004
https://dl.acm.org/doi/10.1007/978-3-540-30192-9_20
Andersson APetersson OClarkson K(1995)On-line approximate list indexing with applicationsProceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/313651.313659(20-27)Online publication date: 22-Jan-1995
https://dl.acm.org/doi/10.5555/313651.313659

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

A Tight Lower Bound for On-Line Monotonic List Labeling

A Tight Lower Bound for Online Monotonic List Labeling

A tight lower bound on the minimal dispersion

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations