Results 1  10
of
228
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of the TwentyFourth Annual ACM Symposium on Theory of Computing, pages 339369, Victoria, B.C., Canada, May 1992. (225) [207] L. G. Khachian. A polynomial time algorithm for linear programming. Doklady Akademii Nauk SSSR, n.s., 244(5):10931096, 1979. English translation in Soviet Math. Dokl. 20, 191194. (150, 151, 153) [208] S. Khuller. On computing graph closures. Information Processing Letters, 31(5):249255, 12 June 1989. (142, 224) [209] S. Khuller and B. Schieber. E#cient parallel algorithms for testing k connectivity and finding disjoint st paths in graphs. SIAM Journal on Computing, 20(2):352375, April 1991. (134) [210] G. A. P. Kindervater and J. K. Lenstra. An introduction to parallelism in combinatorial optimization. In J. van Leeuwen and J. K. Lenstra, editors, Parallel Computers and Computation, volume 9 of CWI Syllabus, pages 163184. Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1985. (17) [211] G. A. P. Kindervater and J. K. Lenstra. Parallel algorithms. In M. O'hEigeartaigh, J. K. Lenstra, and A. H. G. Rinnooy Kan, editors, Combinatorial Optimization: Annotated Bibliographies, chapter 8, pages 106128. John Wiley & Sons, Chichester, 1985. (17, 21) [212] G. A. P. Kindervater, J. K. Lenstra, and D. B. Shmoys. The parallel complexity of TSP heuristics. Journal of Algorithms, 10(2):249270, June 1989. (138) 272 BIBLIOGRAPHY [213] G. A. P. Kindervater and H. W. J. M. Trienekens. Experiments with parallel algorit...
Reviewed by:
, 2014
"... doi: 10.3389/fpls.2014.00013 Significant role of PB1 and UBA domains in multimerization of Joka2, a selective autophagy cargo receptor from tobacco Katarzyna ZientaraRytter and Agnieszka Sirko* ..."
Abstract
 Add to MetaCart
doi: 10.3389/fpls.2014.00013 Significant role of PB1 and UBA domains in multimerization of Joka2, a selective autophagy cargo receptor from tobacco Katarzyna ZientaraRytter and Agnieszka Sirko*
Music information retrieval
 Annual Review of Information Science and Technology
, 2003
"... International Symposium on ..."
Fast ContextFree Grammar Parsing Requires Fast Boolean Matrix Multiplication
, 2002
"... In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG parsing algorithm known. We prove a dual result: any CFG parser with time complexity $O(g n^{3  \epsilson})$, where $g$ is ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG parsing algorithm known. We prove a dual result: any CFG parser with time complexity $O(g n^{3  \epsilson})$, where $g$ is the size of the grammar and $n$ is the length of the input string, can be efficiently converted into an algorithm to multiply $m \times m$ Boolean matrices in time $O(m^{3  \epsilon/3})$. Given that practical, substantially subcubic Boolean matrix multiplication algorithms have been quite difficult to find, we thus explain why there has been little progress in developing practical, substantially subcubic general CFG parsers. In proving this result, we also develop a formalization of the notion of parsing.
Repetitionbased text indexes
, 1999
"... fast pattern matching queries. The scheme provides a general framework for representing information about repetitions, i.e., multiple occurrences of the same string in the text, and for using the information in pattern matching. Wellknown text indexes, such as suffix trees, suffix arrays, DAWGs and ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
fast pattern matching queries. The scheme provides a general framework for representing information about repetitions, i.e., multiple occurrences of the same string in the text, and for using the information in pattern matching. Wellknown text indexes, such as suffix trees, suffix arrays, DAWGs and their variations, which we collectively call suffix indexes, can be seen as instances of the scheme.
Roadmap of Infinite Results
, 2008
"... This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage
On the CostEffectiveness and Realization of the Theoretical PRAM Model
 SONDERFORSCHUNGSBEREICH 124 VLSI ENTWURFSMETHODEN UND PARALLELITAT, UNIVERSITAT SAARBRUCKEN
, 1991
"... Todays parallel computers provide good support for problems that can be easily embedded on the machines' topologies with regular and sparse communication patterns. But they show poor performance on problems that do not satisfy these conditions. A general purpose parallel computer should guarant ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Todays parallel computers provide good support for problems that can be easily embedded on the machines' topologies with regular and sparse communication patterns. But they show poor performance on problems that do not satisfy these conditions. A general purpose parallel computer should guarantee good performance on most parallelizable problems and should allow users to program without special knowledge about the underlying architecture. Access to memory cells should be fast for local and non local cells and should not depend on the access pattern. A theoretical model that reaches this goal is the PRAM. But it was thought to be very expensive in terms of constant factors. Our goal is to show that the PRAM is a realistic approach for a general purpose architecture for any class of algorithms. To do that we sketch a measure of costeffectiveness that allows to determine constant factors in costs and speed of machines. This measure is based on the price/performance ratio and can be compu...
Results 1  10
of
228