Sentence examples for running in logarithmic time from inspiring English sources

While the general chaining algorithm requires a dictionary data structure with insert, delete, predecessor and successor operations running in logarithmic time (e.g. an AVL-tree or a red-black tree), our approach only needs a linear list, which is much easier to implement and requires less space.

Furthermore, the cumulative number of exits increases linearly over the logarithm of time, that is the event rate is constant in logarithmic time (Fig. 4).

The former uses an obfuscation strategy to protect data, while enabling searches in logarithmic time.

In logarithmic time the random (i.e. Poisson) structure of the exits is visible (Fig. 2).

While exponential decay is characterised by Poisson statistics in linear time, record dynamics is characterised by Poisson statistics in logarithmic time [4], [5], [8], [12], [13], [14].

Independence of the fluctuating record signal leads the record times to be uncorrelated in logarithmic time, so the record value at time log (Tk) is independent of previous records at time log (Tk-n).

Both the reaction selection/search and copy number/propensity update step, therefore, run in time logarithmic in the number of reactions.

This procedure runs in linear time.

The model runs in discrete time steps.

> -wrap-foot> Running times: The simple near-optimal algorithm runs in time roughly linear in.

The algorithm runs in time.