Výsledky vyhľadávania - sublinear-time deterministic parallel algorithms

A sublinear-time randomized approximation algorithm for matrix games Autor 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…”
Získať plný text

Distributed Edge Connectivity in Sublinear Time Autor 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…”
Získať plný text

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

“…Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages…”
Získať plný text

Sublinear-time parallel algorithms for matching and related problems Autor 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…”
Získať plný text

A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs Autor 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…”
Získať plný text

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

“… We propose two approaches for designing fast parallel algorithms for special cases of this problem…”
Získať plný text

Fast Distributed Network Decompositions and Covers Autor 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…”
Získať plný text

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

“… We first show a simple deterministic initialization algorithm for the I-dimensional reconfigurable mesh that runs in O (n) time…”
Získať plný text

Non-Local Probes Do Not Help with Graph Problems Autor 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…”
Získať plný text