Остановите войну!
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
- 2020
- Yu Chen, Ivy Bo Peng, Zhen Peng, Xu Liu, Bin Ren:
ATMem: adaptive data placement in graph applications on heterogeneous memories. CGO 2020: 293-304 - Lin Cheng, Berkin Ilbeyi, Carl Friedrich Bolz-Tereick, Christopher Batten:
Type freezing: exploiting attribute type monomorphism in tracing JIT compilers. CGO 2020: 16-29 - Meghan Cowan, Thierry Moreau, Tianqi Chen, James Bornholt, Luis Ceze:
Automatic generation of high-performance quantized machine learning kernels. CGO 2020: 305-316 - Abdul Dakkak, Tom Wickham-Jones, Wen-Mei Hwu:
The design and implementation of the wolfram language compiler. CGO 2020: 212-228 - Sana Damani, Daniel R. Johnson, Mark Stephenson, Stephen W. Keckler, Eddie Q. Yan, Michael McKeown, Olivier Giroux:
Speculative reconvergence for improved SIMT efficiency. CGO 2020: 121-132 - Carol Eidt, Tanner Gooding:
SIMD support in .NET: abstract and concrete vector types and operations. CGO 2020: 229-241 - Ameer Haj-Ali, Nesreen K. Ahmed, Theodore L. Willke, Yakun Sophia Shao, Krste Asanovic, Ion Stoica:
NeuroVectorizer: end-to-end vectorization with deep reinforcement learning. CGO 2020: 242-255 - Mohamed Ismail, G. Edward Suh:
Efficient nursery sizing for managed languages on multi-core processors with shared caches. CGO 2020: 1-15 - Mohammad Mahdi Javanmard, Zafar Ahmad, Martin Kong, Louis-Noël Pouchet, Rezaul Chowdhury, Robert J. Harrison:
Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers. CGO 2020: 317-329 - Keyur Joshi, Vimuth Fernando, Sasa Misailovic:
Aloe: verifying reliability of approximate programs in the presence of recovery mechanisms. CGO 2020: 56-67 - Seokwon Kang, Kyunghwan Choi, Yongjun Park:
PreScaler: an efficient system-aware precision scaling framework on heterogeneous systems. CGO 2020: 280-292 - Stefan Krüger, Karim Ali, Eric Bodden:
CogniCryptGEN: generating code for the secure usage of crypto APIs. CGO 2020: 185-198 - Michael Leonard, Simone Campanoni:
Introducing the pseudorandom value generator selection in the compilation toolchain. CGO 2020: 256-267 - Tyson Loveless, Jason Ott, Philip Brisk:
A performance-optimizing compiler for cyber-physical digital microfluidic biochips. CGO 2020: 171-184 - Kazuaki Matsumura, Hamid Reza Zohouri, Mohamed Wahib, Toshio Endo, Satoshi Matsuoka:
AN5D: automated stencil framework for high-degree temporal blocking on GPUs. CGO 2020: 199-211 - Ejebagom John Ojogbo, Mithuna Thottethodi, T. N. Vijaykumar:
Secure automatic bounds checking: prevention is simpler than cure. CGO 2020: 43-55 - Sunghyun Park, Shikai Li, Ze Zhang, Scott A. Mahlke:
Low-cost prediction-based fault protection strategy. CGO 2020: 30-42 - Joe Savage, Timothy M. Jones:
HALO: post-link heap-layout optimisation. CGO 2020: 94-106 - Amir Shaikhha, Maximilian Schleich, Alexandru Ghita, Dan Olteanu:
Multi-layer optimizations for end-to-end data analytics. CGO 2020: 145-157 - Ghassan Shobaki, Austin Kerbow, Stanislav Mekhanoshin:
Optimizing occupancy and ILP on the GPU using a combinatorial approach. CGO 2020: 133-144 - Jubi Taneja, Zhengyang Liu, John Regehr:
Testing static analyses for precision and soundness. CGO 2020: 81-93 - Aakanksha Verma, Pankaj Kumar Kalita, Awanish Pandey, Subhajit Roy:
Interactive debugging of concurrent programs under relaxed memory models. CGO 2020: 68-80 - Wenwen Wang, Pen-Chung Yew, Antonia Zhai, Stephen McCamant:
Efficient and scalable cross-ISA virtualization of hardware transactional memory. CGO 2020: 107-120 - Teng Yu, Pavlos Petoumenos, Vladimir Janjic, Hugh Leather, John Thomson:
COLAB: a collaborative multi-factor scheduler for asymmetric multicore processors. CGO 2020: 268-279 - Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen, Laxman Dhulipala, Shoaib Kamil, Saman P. Amarasinghe, Julian Shun:
Optimizing ordered graph algorithms with GraphIt. CGO 2020: 158-170 - CGO '20: 18th ACM/IEEE International Symposium on Code Generation and Optimization, San Diego, CA, USA, February, 2020. ACM 2020, ISBN 978-1-4503-7047-9 [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-06-08 07:07 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