O(log n log n) time
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
Can We Overcome the $n \log n$ Barrier for Oblivious Sorting?
... (log n)-bit ...(bin, time step) pair, and each edge in G represents an admissible move from a bin corresponding to time step t to another bin in time step t 0 > ...all n ...
54
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
A stitch in time: Efficient computation of genomic DNA melting bubbles
... the log- log ...execution time was overly increased, because the required memory exceeded the available 1 gigabyte ...has time complexity O(N 2 ...
20
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
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
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
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
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 O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
... Our investigation of ATSPP was primarily motivated by the orienteering problem and related ones such as the k-TSP and k-stroll problems. Orienteering in directed graphs is the following problem: given a directed graph G ...
13
SRC TN 1998 015 pdf
... construct O(ρ)- competitive online algorithms for average completion ...using O(ρ) resource augmentation into online algorithms that achieve the optimum flow time using O (ρ · F M AX ∗ ) ...
19
Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded
... in O(log(log(g))) time (by inserting a fictitious element having infinite value and then deleting it after comput- ing its ...in O(R log(log(g))) time on the ...
8
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
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations
... with O ( log n ) time and O n ( log n ) ...sorts n numbers in O ( log n ) time using n processors on the EREW ...in ...
6
CHf-ORAM: A Constant Communication ORAM without Homomorphic Encryption
... optimal O(1) communi- cation complexity in the number of blocks stored in the ORAM [11, ...of time) often outweighs savings in commu- nication ...to O(1) between client and ...
12
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
... in O ( log n ) time using O n ( log n ) processors by applying parallel prefix computation ...in O ( log n ) time using O ...
8
Aging in language dynamics
... size N is different in the two ...with log N (see inset of ...p log log (N ))): the average number of linguistic categories in the population remains limited to a small value (of ...
16
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
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