Area-Time Optimal Division for T = Ω((log N)1 + Ε)

Information and Computation - United States
doi 10.1016/0890-5401(87)90034-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Closed Expressions for � 1 0 T -1 Log N-1 T Log P (1 - T) Dt

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1982English

RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem

1977English

An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation

SIAM Journal on Scientific and Statistical Computing
1992English

Area-Time Optimal Adder Design

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1990English

An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem

SIAM Journal on Computing
MathematicsComputer Science
1993English

Optimal Message Log Reclamation for Uncoordinated Checkpointing

English

On the Integral � ∞ 0 E -Μt T T Ν- 1 Log M T Dt

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1983English

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy