O(log/sup 2/ 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
Efficient Range ORAM with $\mathbb{O}(\log^{2}{N})$ Locality
... Instead, we use Path ORAM as a comparison point. While Path ORAM is not optimized for seek performance, it does provide a good baseline and the addition of the locality-aware physical layout with a relaxed security ...
17
Fischer, Johannes (2007): Data Structures for Efficient String Algorithms. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
... A[1, n] of elements from a totally ordered set (with order re- lation “ ≤ ”), rmq A (l, r) returns the index of a smallest element in A[l, r], ...each time a query is presented, resulting in ...
141
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
Energy efficient MCDS algorithm for MANETs based on convex hulls
... polynomial time algorithms to construct a CDS in a general graph ...of 2(H(∆)+1), where H is a harmonic function and ∆ is the degree of the node that has highest number of neighbours in ...is ...
13
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
... running time O(n log n log log n) using O(n log n log log n) ...in O(n log n) ...
10
A safe and complete algorithm for metagenomic assembly
... of O(m 2 + n 3 ) , and the one for the edge-covering case with a complexity of O(m 2 n) ; n and m denote the num- ber of nodes and edges, respectively, of the input ...
12
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
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
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
Achieving quantum supremacy with sparse and noisy commuting quantum computations
... of O(n log n) long-range gates anticoncentrate, and then showing that such circuits can be implemented on a 2d square lattice of size √ n × √ n in depth O( √ n ...
23
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
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 ...rithm 2 is not of a lower quality, but identical to Algorithm 1's ...has time complexity ...
20
Research on an Algorithm of the Acceptable Shortest Path
... given 2-edge connected network G V E , with V 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 ...
8
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
A Parallel Algorithm for the Spanning Forest Problem on Proper Circle Graphs
... in O ( log n ) time using O n ( log n ) processors on the EREW (Exclusive Read Exclusive Write) PRAM ...in O ( log n ) time with ...
8
Almost logarithmic-time space optimal leader election in population protocols
... of 2 is at most 4n/α, with very high ...α 2 /4 and in turn the expected number of 1s in σ is at least ...process log log n times we get reduction of agents in state 0 to n/ ...
16
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
... of 2 D -LHP over a D dimensional grid ...scales O (| ∂A |) , where | ∂A | is the size of the boundary of ...for 2 and more dimensions remains ...for O ( log n ) local ...
33