Introduced a new binary search tree algorithm, cache-splay, that was the first to achieve the Unified Bound of Iacono since this problem was posed in 2001, and showed that the lower bound framework (see below) applied to a more general model of computation than binary search. Additionally, my thesis summarized my previous work on developing both lower bounds and upper bounds on the cost of sequ...

An analysis and experimental evidence are presented that the visual control of steering in following a straight demarcated path is possible even when information about the direction of one's travel (course) is not available. Two likely sources of optical information available to observers are considered, bearing and splay, that might be used for steering under these conditions. In an experiment...

Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a ‘splay heuristic.’ Sleator and Tarjan showed that if amortised rather than worst-case times are considered, splay trees are optimal. Splay trees have the advantage of simplicity: th...

During the 1927 Mississippi flood, the levee was dynamited downstream of New Orleans creating a 2 km wide crevasse that inundated the Breton Sound estuary and deposited a crevasse splay of about 130 km2. We measured sediment deposition in the splay that consisted of a silty-clay layer bounded by aged peat below and living roots above. Based on coring, we developed a map of the crevasse splay. T...

We evaluated the influence of the trench-parallel component of plate motion on the active fault system within the Nankai accretionary wedge from reflection seismic profiles, high-resolution seafloor bathymetry, and deep-towed sub-bottom profiles. Our study demonstrated that a large portion of the trench-parallel component of oblique plate subduction is released by strike-slip motion along a fau...

Recently, the topographic patterning of surfaces by lithography and nanoimprinting has emerged as a new and powerful tool for producing single structural domains of liquid crystals and other soft materials. Here the use of surface topography is extended to the organization of liquid crystals of bent-core molecules, soft materials that, on the one hand, exhibit a rich, exciting, and intensely st...

The IEEE 802.11 random access MAC suffers from expensive channel acquisition costs which are exacerbated by the use of TCP. This floor acquisition mechanism is primarily a way to fashion unicast “links” out of what is fundamentally a broadcast medium. The main thesis of this paper is that such unicast usage of the wireless channel is unnecessary, and that once the floor has been acquired, we ca...

In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Pǎtraşcu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 an...

We analyze the effects of synaptic depression or facilitation on the existence and stability of the splay or asynchronous state in a population of all-to-all, pulse-coupled neural oscillators. We use mean-field techniques to derive conditions for the local stability of the splay state and determine how stability depends on the degree of synaptic depression or facilitation. We also consider the ...