Suchergebnisse - sublinear-time deterministic parallel algorithms

A sublinear-time randomized approximation algorithm for matrix games von Grigoriadis, Michael D., Khachiyan, Leonid G.

“… This paper presents a parallel randomized algorithm which computes a pair of ε-optimal strategies for a given ( m, n)-matrix game A = [ a ij ] ϵ [−1, 1] in O( ε −2log 2( n+ m …”
Volltext

Distributed Edge Connectivity in Sublinear Time von Daga, Mohit, Henzinger, Monika, Nanongkai, Danupon, Saranurak, Thatchaphol

“… We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity \(\lambda …”
Volltext

Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages von Larmore, Lawrence L., Rytter, Wojciech

“… Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages …”
Volltext

Sublinear-time parallel algorithms for matching and related problems von Goldberg, A.V., Plotkin, S.A., Vaidya, P.M.

“… The authors present the first sub-linear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search …”
Volltext

A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs von Jelić, Slobodan, Laue, Sören, Matijević, Domagoj, Wijerama, Patrick

“… ). Their approach builds on ideas of the sublinear time algorithm of Grigoriadis and Khachiyan’s (Oper Res Lett 18(2):53–58, 1995 ) and Garg and Könemann’s (SIAM J Comput 37(2):630–652, 2007 ) non-uniform-increment amortization scheme …”
Volltext

Efficient computation of extremal structures in graphs and hypergraphs von Kelsen, Pierre

“… We propose two approaches for designing fast parallel algorithms for special cases of this problem …”
Volltext

Fast Distributed Network Decompositions and Covers von Awerbuch, Baruch, Berger, Bonnie, Cowen, Lenore, Peleg, David

“… This paper presents deterministic sublinear-time distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network …”
Volltext

Randomized Initialization on the 1-Dimensional Reconfigurable Mesh von Nakano, K.

“… We first show a simple deterministic initialization algorithm for the I-dimensional reconfigurable mesh that runs in O (n) time …”
Volltext

Non-Local Probes Do Not Help with Graph Problems von Göös, Mika, Hirvonen, Juho, Levi, Reut, Medina, Moti, Suomela, Jukka

“… This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms …”
Volltext