The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase parentheses-matching (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1991-2016 (11)
Publication types (Num. hits)
article(2) incollection(2) inproceedings(7)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 11 keywords

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
145Sushil K. Prasad, Sajal K. Das 0001, Calvin Ching-Yuen Chen Efficient EREW PRAM Algorithms for Parentheses-Matching. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF EREW PRAM algorithms, parentheses-matching, polylog-time parallel algorithms, exclusive-read and exclusive-write, parallelrandom-access machine, input string, working space, time-optimal algorithms, pattern recognition, parallel algorithms, computational complexity, data structures, data structures, parallel machines, time complexity, arrays, space complexity, random-access storage, PRAM model
69Sajal K. Das 0001, Calvin Ching-Yuen Chen, Gene Lewis, Sushil K. Prasad Some Fast Parallel Algorithms for Parentheses Matching. Search on Bibsonomy ICCI The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
36Kazuhiko Kakehi 0001, Kiminori Matsuzaki, Kento Emoto Efficient Parallel Tree Reductions on Distributed Memory Environments. Search on Bibsonomy International Conference on Computational Science (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Tree reduction, parentheses matching, parallel algorithm, BSP
31Meng He 0001 Succinct Data Structures for Parentheses Matching. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
31Meng He 0001 Succinct Data Structures for Parentheses Matching. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Chun-Hsi Huang, Xin He Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching. Search on Bibsonomy PPSC The full citation details ... 2001 DBLP  BibTeX  RDF
31Thore Husfeldt, Theis Rauhe, Søren Skyum Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. Search on Bibsonomy SWAT The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
31Omer Berkman, Uzi Vishkin Almost Fully-parallel Parentheses Matching. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
31Sajal K. Das 0001, Kwang Bae Min, Ranette H. Halverson Efficient Parallel Algorithms for Tree-Related Problems Using the Parentheses Matching Strategy. Search on Bibsonomy IPPS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Sushil K. Prasad, Narsingh Deo Two EREW Algorithms for Parentheses Matching. Search on Bibsonomy IPPS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
31Calvin Ching-Yuen Chen, Sajal K. Das 0001 A Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM. Search on Bibsonomy IPPS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license