O(N log N) time
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations
... in O n ( log n ) ...( n log n ) is the tight lower ...( n log n ) time bound and in parallel algorithms, we cannot avoid the Ω ( n ...
6
Energy efficient MCDS algorithm for MANETs based on convex hulls
... in O(n log n) time for favourable inputs and performs well than most of the ...run time complexity of various convex hull ...
13
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
... with n vertices, m edges and k connected ...an O ( log n ) time parallel algorithm with O n ( log n ) processors for constructing a spanning forest on proper ...
8
A stitch in time: Efficient computation of genomic DNA melting bubbles
... in time complexity has been achieved with- out introducing any approximation or simplification such as ...has time complexity O(N log N), which is the same as computing melting ...
20
Almost logarithmic-time space optimal leader election in population protocols
... process log log n times we get reduction of agents in state 0 to n/ log n in at most O(n log n) consecutive ...0) O(n log ...
16
Research on an Algorithm of the Acceptable Shortest Path
... n vertexes and E m edges, then there are at least one edge e * whose removal from G V E , will result the greatest increase in the shortest distance between two specified nodes called the origin node s ...
8
Parallel O(log(n)) time edge colouring of trees and Halin graphs
... Algorithm EDGECOLOUR; [the algorithm edge colours Hahn graphs with 0=3 Step 0 Using the Euler tour technique [13] root the tree T at a vertex root of distance one from C... Colour the ed[r] ...
17
Radio network algorithms for global communication
... an O(n 11/6 )-time broadcasting ...in O(n log 2 n) time, the first to be only a poly-logarithmic fac- tor away from linear ...complexity O(n ...
151
Fischer, Johannes (2007): Data Structures for Efficient String Algorithms. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... constant time are useful for many different algorithmic tasks ...and time- consumption of the Enhanced Suffix Array, a collection of arrays that can be used for many tasks in pattern ...+ o(n) ...
141
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
... The algorithm in [13] finds a collection of directed cycles that partition the vertex set (called a cycle-cover in some settings) such that the total length of the cycles is minimized. This can be achieved in polynomial ...
13
Efficient Range ORAM with $\mathbb{O}(\log^{2}{N})$ Locality
... Typically, ORAM performance metrics have focused on communication overhead, or bandwidth, loosely describing the number of additional data reads/writes needed to perform a single access [27]. More recently, other metrics ...
17
An Oblivious Parallel RAM with $O(\log^2 N)$ Parallel Runtime Blowup
... of O(log 2 N) per lookup, but they do not achieve perfectly linear access time speedup with ...is O(f(m) log m log 2 N), f(m) = ...
12
Hash Tables with Pseudorandom Global Order
... Hashmaps are an essential part of many algorithms as they allow associative retrieval of n elements in aver- age constant time and have a space complexity of O(n). The key is associated to the ...
6
Behavior of O(log n) Local Commuting Hamiltonians
... over time, consider the following prob- lem called k-constraint satisfaction problem (k-CSP) - Given a set of n variables each taking values in a finite set S, and given a set of constraints on the values ...
33
Computation of Geographic Location with the Aid of Geospatial Images
... running time is excellent. For adjacency matrix the time complexity of this algorithm would be O(N2) and if binary heap implementation is used complexity would be O((N+E) logN); ...
5
An efficient high dimensional quantum Schur transform
... We have presented an efficient algorithm for a high dimensional Schur transform that runs in time O(poly(n, log d, log 1/)). This improves exponentially in the dimension over the prior ...
21
Bis(μ N nitroso N phenylhydroxylaminato) κ3O,O′:O′;κ3O′:O,O′ bis[(N nitroso N phenylhydroxylaminato κ2O,O′)lead(II)]
... long time (Bottei & Schneggenburger, 1970), and the compound was assumed to exist as a mononuclear ...5 N 2 O 2 ) 2 ] 2 O , O ′-chelate to the lead(II) ...
10
A versatile, linear complexity algorithm for flow routing in topographies with depressions
... most efficient when the number of local minima is large (see Sect. 4). While being the most optimized sequential variant that has been proposed so far, the Wei et al. (2018) variant fills the depressions with perfectly ...
14
N,N,N′N′ Tetraphenyl 2,2′ (o phenylenedioxy)diacetamide
... Data collection: SMART Siemens, 1996; cell refinement: SAINT Siemens, 1996; data reduction: SAINT; programs used to solve structure: SHELXTL Sheldrick, 1997; programs used to refine stru[r] ...
8
Verifiable stream computation and Arthur Merlin communication
... polylogarithmic time (a similar property was achieved by Schr¨oder and Schr¨oder [40], but for a simpler class of queries, and with unidirectional com- munication from the verifier to the prover on each stream ...
33