#### Filter Results:

#### Publication Year

2009

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Suppose that a random <i>n</i>-bit number <i>V</i> is multiplied by an odd constant <i>M</i> ≥ 3, by adding shifted versions of the number <i>V</i> corresponding to the 1s in the binary representation of the constant <i>M</i>. Suppose further that the additions are performed by carry-save adders until the number of summands is reduced to two, at which… (More)

- Alexander Izsak
- 2009

The goal of this thesis is to upper bound the expected value of the second largest eigenvalue in magnitude of random regular graphs with a given minimum girth. Having a small upper bound implies such random graphs are likely to be expanders and thus have several combinatorial properties useful in various fields of computer science. The best possible upper… (More)

- ‹
- 1
- ›