- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal"
- exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics"
- boolean and: separate words by space
e.g., codd model
- boolean or: connect words by pipe symbol (|)
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
found 6 matches
- Naresh Rapolu, Srimat Chakradhar, Ananth Grama:
VAYU: Accelerating stream processing applications through dynamic network-aware topology re-optimization. J. Parallel Distributed Comput. 111: 13-23 (2018)
- Tobias Berka, Giorgios Kollias, Helge Hagenauer, Marián Vajtersic, Ananth Grama:
Concurrent programming constructs for parallel MPI applications - The MPI threads library. J. Supercomput. 63(2): 385-406 (2013)
- Daniel Howard, J. J. Collins:
Grammatical Genetic Programming: Application in Automatic Code Parallelization. ICHIT (1) 2012: 217-223
- Taishin Y. Nishida:
A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing. Software Science and Engineering 1991: 16-38
- Hans-Jörg Kreowski, Anne Wilharm:
Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars. Graph-Grammars and Their Application to Computer Science 1986: 361-377
- Azriel Rosenfeld, Angela Y. Wu:
Cellular computers for parallel region-level image processing. Graph-Grammars and Their Application to Computer Science 1982: 333-348
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.