Остановите войну!
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
- 2007
- George Almási, Calin Cascaval, Peng Wu:
Languages and Compilers for Parallel Computing, 19th International Workshop, LCPC 2006, New Orleans, LA, USA, November 2-4, 2006. Revised Papers. Lecture Notes in Computer Science 4382, Springer 2007, ISBN 978-3-540-72520-6 [contents] - 2006
- Diego Andrade, Basilio B. Fraguela, Ramon Doallo:
Cache Behavior Modelling for Codes Involving Banded Matrices. LCPC 2006: 205-219 - Kevin Andrusky, Stephen Curial, José Nelson Amaral:
Tree-Traversal Orientation Analysis. LCPC 2006: 220-234 - Jairo Balart, Marc González, Xavier Martorell, Eduard Ayguadé, Jesús Labarta:
Runtime Address Space Computation for SDSM Systems. LCPC 2006: 330-344 - Rajkishore Barik, Christian Grothoff, Rahul Gupta, Vinayaka Pandit, Raghavendra Udupa:
Optimal Bitwise Register Allocation Using Integer Linear Programming. LCPC 2006: 267-282 - Denis Barthou, Sébastien Donadio, Alexandre Duchateau, William Jalby, E. Courtois:
Iterative Compilation with Kernel Exploration. LCPC 2006: 173-189 - Christopher Barton, Calin Cascaval, José Nelson Amaral:
A Characterization of Shared Data Access Patterns in UPC Programs. LCPC 2006: 111-125 - Ganesh Bikshandi, Jia Guo, Christoph von Praun, Gabriel Tanase, Basilio B. Fraguela, María Jesús Garzarán, David A. Padua, Lawrence Rauchwerger:
Design and Use of htalib - A Library for Hierarchically Tiled Arrays. LCPC 2006: 17-32 - Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello:
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. LCPC 2006: 283-298 - Tong Chen, Zehra Sura, Kathryn M. O'Brien, John K. O'Brien:
Optimizing the Use of Static Buffers for DMA on a CELL Chip. LCPC 2006: 314-329 - Troy A. Johnson, Sang Ik Lee, Seung-Jai Min, Rudolf Eigenmann:
Can Transactions Enhance Parallel Programs? LCPC 2006: 2-16 - Alin Jula, Lawrence Rauchwerger:
Custom Memory Allocation for Free. LCPC 2006: 299-313 - Minhaj Ahmad Khan, Henri-Pierre Charles:
Applying Code Specialization to FFT Libraries for Integral Parameters. LCPC 2006: 96-110 - DaeGon Kim, Gautam Gupta, Sanjay V. Rajopadhye:
On Control Signals for Multi-Dimensional Time. LCPC 2006: 141-155 - Mark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo:
A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. LCPC 2006: 345-363 - Christopher Mueller, Andrew Lumsdaine:
Expression and Loop Libraries for High-Performance Code Synthesis. LCPC 2006: 80-95 - Stephen Olivier, Jun Huan, Jinze Liu, Jan F. Prins, James Dinan, P. Sadayappan, Chau-Wen Tseng:
UTS: An Unbalanced Tree Search Benchmark. LCPC 2006: 235-250 - David A. Patterson:
The Berkeley View: A New Framework and a New Platform for Parallel Research. LCPC 2006: 156-157 - Constantino G. Ribeiro, Marcelo Cintra:
Quantifying Uncertainty in Points-To Relations. LCPC 2006: 190-204 - Hassan A. Salamy, J. Ramanujam:
An Effective Heuristic for Simple Offset Assignment with Variable Coalescing. LCPC 2006: 158-172 - Ana Lucia Varbanescu, Maik Nijhuis, Arturo González-Escribano, Henk J. Sips, Herbert Bos, Henri E. Bal:
SP@CE - An SP-Based Programming Model for Consumer Electronics Streaming Applications. LCPC 2006: 33-48 - Shengyue Wang, Antonia Zhai, Pen-Chung Yew:
Exploiting Speculative Thread-Level Parallelism in Data Compression Applications. LCPC 2006: 126-140 - Chung-Ju Wu, Sheng-Yuan Chen, Jenq Kuen Lee:
Copy Propagation Optimizations for VLIW DSP Processors with Distributed Register Files. LCPC 2006: 251-266 - Katherine A. Yelick:
Compilation Techniques for Partitioned Global Address Space Languages. LCPC 2006: 1 - Weihua Zhang, Tao Bao, Binyu Zang, Chuanqi Zhu:
Data Pipeline Optimization for Shared Memory Multiple-SIMD Architecture. LCPC 2006: 49-63 - Yuan Zhao, Ken Kennedy:
Dependence-Based Code Generation for a CELL Processor. LCPC 2006: 64-79
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-19 16:58 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