|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 17 keywords
|
|
|
|
|
Results
Found 4 publication records. Showing 4 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | B. K. Sarkar, Shahid Jamal, Bhagirath Kumar |
An efficient parallel algorithm for finding the largest and the second largest elements from a list of elements.  |
ICIT  |
2006 |
DBLP DOI BibTeX RDF |
largest, Second_largest, P-RAM, optimal |
| 1 | Sushil K. Prasad, Sajal K. Das, Calvin Ching-Yuen Chen |
Efficient EREW PRAM Algorithms for Parentheses-Matching. |
IEEE Trans. Parallel Distrib. Syst. |
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 |
| 1 | Sajal K. Das, Wen-Bing Horng |
Managing a Parallel Heap Efficiently. |
PARLE |
1991 |
DBLP DOI BibTeX RDF |
optimal speedup, parallel algorithm, data structure, priority queue, Algorithm analysis, heap, EREW PRAM |
| 1 | Calvin Ching-Yuen Chen, Sajal K. Das |
Parallel Breadth-First and Breadth-Depth Traversals of Generated Trees. |
ICCI |
1990 |
DBLP DOI BibTeX RDF |
Linked list ranking, Breadth-depth search, Optimal speedup, Parallel algorithm, Breadth-first search, Tree traversal |
Displaying result #1 - #4 of 4 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")