#### Filter Results:

#### Publication Year

1998

2005

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Michael L. Gargano, Arthur Weissenseel, Joseph F. Malerba, Marty Lewinter
- 2005

Consider the path graph P x of length x ≥ 1 on x + 1 vertices 0, 1, 2, ..., x. At time t = 1, a single edge path C 1 = { a 1 , a 1 + 1 } with a 1 ∈ { 0, 1, 2, ..., x-1 } (i.e., a " car ") is placed (i.e., " parked ") randomly on P x. Therefore, the available parking space has been reduced. As more cars arrive (one each time period t = 1, 2, 3, ...), they… (More)

- Joseph F. Malerba, Narayan Murthy
- ACM Southeast Regional Conference
- 1998

Binary search trees are used to maintain lists that need searching. It is desirable that such a search tree have minimal height. In practice, if you construct a binary search tree with given data, there is no guarantee that it will be well-balanced. In the literature, there are many balanced trees. One such tree is discussed in [5]. Another well-balanced… (More)

- ‹
- 1
- ›