Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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 (|)
e.g., graph|network
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.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2016
- Gabriel Rodríguez, José M. Andión, Mahmut T. Kandemir, Juan Touriño:
Trace-based affine reconstruction of codes. CGO 2016: 139-149 - Lénaïc Bagnères, Oleksandr Zinenko, Stéphane Huot, Cédric Bastoul:
Opening polyhedral compiler's black box. CGO 2016: 128-138 - Rajkishore Barik, Naila Farooqui, Brian T. Lewis, Chunling Hu, Tatiana Shpeisman:
A black-box approach to energy-aware scheduling on integrated CPU-GPU systems. CGO 2016: 70-81 - Kevin J. Brown, HyoukJoong Lee, Tiark Rompf, Arvind K. Sujeeth, Christopher De Sa, Christopher R. Aberger, Kunle Olukotun:
Have abstraction and eat performance, too: optimized heterogeneous computing with parallel patterns. CGO 2016: 194-205 - Soham Chakraborty, Viktor Vafeiadis:
Validating optimizations of concurrent C/C++ programs. CGO 2016: 216-226 - Linchuan Chen, Peng Jiang, Gagan Agrawal:
Exploiting recent SIMD architectural advances for irregular applications. CGO 2016: 47-58 - Dehao Chen, David Xinliang Li, Tipp Moseley:
AutoFDO: automatic feedback-directed optimization for warehouse-scale applications. CGO 2016: 12-23 - Daniele Cono D'Elia, Camil Demetrescu:
Flexible on-stack replacement in LLVM. CGO 2016: 250-260 - Byron Hawkins, Brian Demsky, Michael B. Taylor:
BlackBox: lightweight security monitoring for COTS binaries. CGO 2016: 261-272 - Ivan Jibaja, Ting Cao, Stephen M. Blackburn, Kathryn S. McKinley:
Portable performance on asymmetric multicore processors. CGO 2016: 24-35 - Melanie Kambadur, Martha A. Kim:
NRG-loops: adjusting power from within applications. CGO 2016: 206-215 - Toshihiko Koju, Reid Copeland, Motohiro Kawahito, Moriyoshi Ohara:
Re-constructing high-level information for language-specific binary re-optimization. CGO 2016: 273-283 - Ignacio Laguna, Martin Schulz, David F. Richards, Jon Calhoun, Luke N. Olson:
IPAS: intelligent protection against silent output corruption in scientific applications. CGO 2016: 227-238 - Tongping Liu, Xu Liu:
Cheetah: detecting false sharing efficiently and effectively. CGO 2016: 1-11 - Christos Margiolas, Michael F. P. O'Boyle:
Portable and transparent software managed scheduling on accelerators for fair resource sharing. CGO 2016: 82-93 - Dong Nguyen, Jongeun Lee:
Communication-aware mapping of stream graphs for multi-GPU platforms. CGO 2016: 94-104 - Vitor Paisante, Maroua Maalej, Leonardo Barbosa e Oliveira, Laure Gonnord, Fernando Magno Quintão Pereira:
Symbolic range analysis of pointers. CGO 2016: 171-181 - Probir Roy, Xu Liu:
StructSlim: a lightweight profiler to guide structure splitting. CGO 2016: 36-46 - Daniele G. Spampinato, Markus Püschel:
A basic linear algebra compiler for structured matrices. CGO 2016: 117-127 - Yulei Sui, Peng Di, Jingling Xue:
Sparse flow-sensitive pointer analysis for multithreaded programs. CGO 2016: 160-170 - Mateus Tymburibá, Rubens E. A. Moreira, Fernando Magno Quintão Pereira:
Inference of peak density of indirect branches to detect ROP attacks. CGO 2016: 150-159 - Vassilis Vassiliadis, Jan Riehme, Jens Deussen, Konstantinos Parasyris, Christos D. Antonopoulos, Nikolaos Bellas, Spyros Lalis, Uwe Naumann:
Towards automatic significance analysis for approximate computing. CGO 2016: 182-193 - Jingyue Wu, Artem Belevich, Eli Bendersky, Mark Heffernan, Chris Leary, Jacques A. Pienaar, Bjarke Roune, Rob Springer, Xuetian Weng, Robert Hundt:
gpucc: an open-source GPGPU compiler. CGO 2016: 105-116 - Adarsh Yoga, Santosh Nagarakatte:
Atomicity violation checker for task parallel programs. CGO 2016: 239-249 - Hao Zhou, Jingling Xue:
Exploiting mixed SIMD parallelism by reducing data reorganization overhead. CGO 2016: 59-69 - Björn Franke, Youfeng Wu, Fabrice Rastello:
Proceedings of the 2016 International Symposium on Code Generation and Optimization, CGO 2016, Barcelona, Spain, March 12-18, 2016. ACM 2016, ISBN 978-1-4503-3778-6 [contents]
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-24 21:57 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint