Výsledky vyhledávání - sublinear-time deterministic parallel algorithms
-
1
A sublinear-time randomized approximation algorithm for matrix games
ISSN: 0167-6377, 1872-7468Vydáno: Amsterdam Elsevier B.V 01.09.1995Vydáno v Operations research letters (01.09.1995)“…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ískat plný text
Journal Article -
2
Distributed Edge Connectivity in Sublinear Time
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 08.04.2019Vydáno v arXiv.org (08.04.2019)“…We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity \(\lambda…”
Získat plný text
Paper -
3
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
ISSN: 0304-3975, 1879-2294Vydáno: Amsterdam Elsevier B.V 15.05.1998Vydáno v Theoretical computer science (15.05.1998)“…Sublinear time almost optimal algorithms for the recognition problem for three basic subclasses of context-free languages…”
Získat plný text
Journal Article -
4
Sublinear-time parallel algorithms for matching and related problems
ISBN: 9780818608773, 0818608773Vydáno: IEEE 1988Vydáno v Symposium on Foundations of Computer Science, 29th, 1988 (1988)“…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ískat plný text
Konferenční příspěvek -
5
A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs
ISSN: 0885-7458, 1573-7640Vydáno: New York Springer US 01.10.2015Vydáno v International journal of parallel programming (01.10.2015)“… ). 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ískat plný text
Journal Article -
6
Efficient computation of extremal structures in graphs and hypergraphs
ISBN: 9798208451458Vydáno: ProQuest Dissertations & Theses 01.01.1992“… We propose two approaches for designing fast parallel algorithms for special cases of this problem…”
Získat plný text
Dissertation -
7
Fast Distributed Network Decompositions and Covers
ISSN: 0743-7315, 1096-0848Vydáno: San Diego, CA Elsevier Inc 15.12.1996Vydáno v Journal of parallel and distributed computing (15.12.1996)“…This paper presents deterministic sublinear-time distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network…”
Získat plný text
Journal Article -
8
Randomized Initialization on the 1-Dimensional Reconfigurable Mesh
ISBN: 0769530494, 9780769530499ISSN: 2379-5352Vydáno: IEEE 01.12.2007Vydáno v Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2007) (01.12.2007)“… We first show a simple deterministic initialization algorithm for the I-dimensional reconfigurable mesh that runs in O (n) time…”
Získat plný text
Konferenční příspěvek -
9
Non-Local Probes Do Not Help with Graph Problems
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 16.12.2015Vydáno v arXiv.org (16.12.2015)“…This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms…”
Získat plný text
Paper

