Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"

Mehlhorn, Kurt; Preparata, Franco P.; Monien, Burkhard; Vidal-Naquet, Guy

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Preparata, Franco P.
Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mehlhorn, K., & Preparata, F. P. (1986). Area-time Optimal Division for T=Omega(log n)$^1+epsilon$". In STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science (pp. 341-352). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AEC8-4

Abstract

There is no abstract available