Amanote Research
Register
Sign In
Barker Sequences and Flat Polynomials
doi 10.1017/cbo9780511721274.007
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Peter Borwein
Michael J. Mossinghoff
Publisher
Cambridge University Press
Related search
An O(log N) Dynamic Router-Table Design
IEEE Transactions on Computers
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
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(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation
SIAM Journal on Scientific and Statistical Computing
Design of an Energy-Efficient Wireless Router Switch
The Discrete Logarithm Hides $O(\log N)$ Bits
SIAM Journal on Computing
Mathematics
Computer Science
An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing
Mathematics
Computer Science
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
Bounding the Router Table Size in an ISP Network Using RINA
Design and Development of an Embedded Aeronautical Router With Security Capabilities
Undirected Graph Exploration With ⊝(log Log N) Pebbles
