Eager Street

Eager Acquisition

In most operating systems, operations such as dynamic memory allocation can be very expensive. The time it takes for memory allocations via operations like "malloc" depends on the implementation of the operations. If the telecommunication application is supposed to run on a non-real-time operating system, the time to execute malloc will vary even if the same size of memory is to be acquired. Ru...

Reginald Eager

Eager for Distinctness

I provide evidence that the interpretation of disjunctive sentences is sensitive to the linear order of the disjuncts. I argue that the asymmetry is rooted in informational redundancies that are present in one order that are not present in the other. I propose a constraint that ensures informational distinctness between earlier and later disjuncts. The constraint is checked at a surprising poin...

Eager Glr Parsing

Eager st-Ordering

Given a biconnected graph G = (V,E) with edge {s, t} ∈ E, an st-ordering is an ordering v1, . . . , vn of V such that s = v1, t = vn, and every other vertex has both a higher-numbered and a lower-numbered neighbor. Previous linear-time st-ordering algorithms are based on a preprocessing step in which depth-first search is used to compute lowpoints. The actual ordering is determined only in a se...