Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Roman Waupotitsch
An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation
SIAM Journal on Scientific and Statistical Computing
Related publications
An O(N Log N) Algorithm for Shape Modeling.
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing
Mathematics
Computer Science
An O(log N) Dynamic Router-Table Design
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
International Journal of Computational Geometry and Applications
Geometry
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
Theoretical Computer Science
Topology
The Discrete Logarithm Hides $O(\log N)$ Bits
SIAM Journal on Computing
Mathematics
Computer Science
Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
On the Integral � Π/2 0 Log N Cosx Log P Sinx Dx
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Area-Time Optimal Division for T = Ω((log N)1 + Ε)
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
