Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,977,152 papers from all fields of science
Search
Sign In
Create Free Account
Binary logarithm
Known as:
Logarithmus dualis
, Log2
, Logarithmus binaris
Expand
In mathematics, the binary logarithm (log2 n) is the power to which the number 2 must be raised to obtain the value n. That is, for any real number x…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Algorithm
Analysis of algorithms
Binary entropy function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Tight Bounds for Quasirandom Rumor Spreading
Spyros Angelopoulos
,
Benjamin Doerr
,
Anna Huber
,
K. Panagiotou
Electronic Journal of Combinatorics
2009
Corpus ID: 5845902
This paper addresses the following fundamental problem: Suppose that in a group of n people, where each person knows all other…
Expand
2005
2005
On the θ-coverage and connectivity of large random networks ∗ †
F. Xue
,
P. Kumar
2005
Corpus ID: 7221063
Wireless planar networks have been used to model wireless networks in a tradition that dates back to 1961 to the work of E. N…
Expand
2004
2004
Scheduling Algorithms for Providing Flexible , Rate-Based , Quality of Service Guarantees for Packet-Switching in Banyan Networks
C. Caramanis
,
Michael Rosenblum
,
M. Goemans
,
V. Tarokh
2004
Corpus ID: 12128861
We consider the problem of providing flexible, ratebased, quality of service guarantees for a particular class of multistage…
Expand
2004
2004
Permutations Avoiding Arithmetic Patterns
P. Hegarty
Electronic Journal of Combinatorics
2004
Corpus ID: 15067992
A permutation $\pi$ of an abelian group $G$ (that is, a bijection from $G$ to itself) will be said to avoid arithmetic…
Expand
2004
2004
The price of connectedness in expansions
F. Fomin
,
P. Fraigniaud
,
Dimitrios Thilikos Touloupas
2004
Corpus ID: 6676992
Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion…
Expand
2003
2003
An Improved Algorithm of Multicast Topology Inference from End-to-End Measurements
Hui Tian
,
Hong Shen
International Symposium on High Performance…
2003
Corpus ID: 31438369
Multicast topology inference from end-to-end measurements has been widely used recently. Algorithms of inference on loss…
Expand
1987
1987
2-D Compaction -- A Monte Carlo Method
R. C. Mosteller
,
A. Frey
,
R. Suaya
1987
Corpus ID: 1400897
In this paper we study the two-dimensional compaction of integrated circuit layouts. A curvilinear representation for circuit…
Expand
1987
1987
Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
A. Oruç
,
M. Y. Oruç
IEEE transactions on computers
1987
Corpus ID: 15312792
A fundamental problem in interconnection network theory is to design permutation networks with as few cells as possible and a…
Expand
1986
1986
A VLSI Solution to the Vertical Segment Visibility Problem
E. Lodi
,
L. Pagli
IEEE transactions on computers
1986
Corpus ID: 32872337
We present a parallel algorithm to solve the visibility problem among n vertical segments in a plane, which can be implemented on…
Expand
1983
1983
A new binary logarithm-based computing system
G. Frangakis
1983
Corpus ID: 61410490
An approximation of the binary logarithm log2 N of any positive binary number N is derived, and the design of a fast computing…
Expand