Power of two

Known as: 2%5E32, Power of 2, 18446744073709551616 
In mathematics, a power of two means a number of the form 2n where n is an integer, i.e. the result of exponentiation with number two as the base and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
In the standard consensus problem there are n processes with possibly different input values and the goal is to eventually reach… (More)
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In this paper, we propose a network coding using a lattice for the two-way relay channel with two nodes communicating… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Most routing protocols in disruption tolerant networks (DTN) use redundant transmissions to explore the diversities in routing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • table I
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The Power of Two Choices in Randomized Load Balancing 
  • figure 1
  • table 2
  • table 1
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Measurements and models show that enhanced aerosol concentrations can augment cloud albedo not only by increasing total droplet… (More)
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Controlling the peak-to-mean envelope power ratio (PMEPR) of Orthogonal Frequency Division Multiplexed (OFDM) transmissions is a… (More)
  • table I
  • table II
  • table III
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We characterize the power of two-prover one-round (<italic>MIP</italic>(2,1)) proof systems, showing that <italic>MIP</italic>(2… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We describe two new algorithms for implementing barrier synchronization on a shared-memory multicomputer. Both algorithms are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?