Остановите войну!
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 39 matches
- 1996
- Chua-Huang Huang, P. Sadayappan, Utpal Banerjee, David Gelernter, Alexandru Nicolau, David A. Padua:
Languages and Compilers for Parallel Computing, 8th International Workshop, LCPC'95, Columbus, Ohio, USA, August 10-12, 1995, Proceedings. Lecture Notes in Computer Science 1033, Springer 1996, ISBN 3-540-60765-X [contents] - 1995
- Gagan Agrawal, Joel H. Saltz:
Interprocedural Data Flow Based Optimizations for Compilation of Irregular Problems. LCPC 1995: 465-479 - Erik R. Altman, Guang R. Gao, Ramaswamy Govindarajan:
An Experimental Study of an ILP-based Exact Solution Method for Software Pipelining. LCPC 1995: 16-30 - William F. Appelbe, Srinivas Doddapaneni, Reid Harmon, Phil May, D. Scott Wills, Maurizio Vitale:
Hoisting Branch Conditions - Improving Super-Scalar Processor Performance. LCPC 1995: 304-317 - Eduard Ayguadé, Jordi Garcia, Mercè Gironés, M. Luz Grande, Jesús Labarta:
Data Redistribution in an Automatic Data Distribution Tool. LCPC 1995: 407-421 - Aart J. C. Bik, Harry A. G. Wijshoff:
Annotations for a Sparse Compiler. LCPC 1995: 500-514 - William Blume, Rudolf Eigenmann:
Demand-Driven, Symbolic Range Propagation. LCPC 1995: 141-160 - Rastislav Bodík, Rajiv Gupta:
Array Data Flow Analysis for Load-Store Optimizations in Superscalar Architectures. LCPC 1995: 1-15 - Thomas E. Cheatham, Amr F. Fahmy, Dan C. Stefanescu:
General Purpose Optimization Technology. LCPC 1995: 422-433 - Lynn Choi, Pen-Chung Yew:
Interprocedural Array Data Flow Analysis for Cache Coherence. LCPC 1995: 81-95 - Michal Cierniak, Wei Li:
Recovering Logical Structures of Data. LCPC 1995: 362-376 - Béatrice Creusillet, François Irigoin:
Interprocedural Array Region Analyses. LCPC 1995: 46-60 - Luiz De Rose, Kyle A. Gallivan, Efstratios Gallopoulos, Bret A. Marsolf, David A. Padua:
FALCON: A MATLAB Interactive Restructuring Compiler. LCPC 1995: 269-288 - P. F. G. Dechering, J. A. Trescher, J. P. M. de Vreught, Henk J. Sips:
V-cal: A Calculus for the Compilation of Data Parallel Languages. LCPC 1995: 111-125 - Henry G. Dietz, Tai M. Chung, Timothy Mattox:
A Parallel Processing Support Library Based on Synchronized Aggregate Communication. LCPC 1995: 254-268 - Peter A. Dinda, David R. O'Hallaron, Jaspal Subhlok, Jon A. Webb, Bwolen Yang:
Language and Run-Time Support for Network Parallel Computing. LCPC 1995: 534-550 - Benoît Dupont de Dinechin:
Insertion Scheduling: An Alternative to List Scheduling for Modulo Schedulers. LCPC 1995: 31-45 - Rakesh Ghiya, Laurie J. Hendren:
Connection Analysis: A Practical Interprocedural Heap Analysis for C. LCPC 1995: 515-533 - Mary W. Hall, Brian R. Murphy, Saman P. Amarasinghe, Shih-Wei Liao, Monica S. Lam:
Interprocedural Analysis for Parallelization. LCPC 1995: 61-80 - Kazuaki Ishizaki, Hideaki Komatsu:
A Loop Parallelization Algorithm for HPF Compilers. LCPC 1995: 176-190 - S. D. Kaushik, Chua-Huang Huang, P. Sadayappan:
Compiling Array Statements for Efficient Execution on Distributed-Memory Machines: Two-Level Mappings. LCPC 1995: 209-223 - Wayne Kelly, William W. Pugh, Evan Rosser, Tatiana Shpeisman:
Transitive Closure of Infinite Graphs and Its Applications. LCPC 1995: 126-140 - Ken Kennedy, John M. Mellor-Crummey, Gerald Roth:
Optimizing Fortran 90 Shift Operations on Distributed-Memory Multicomputers. LCPC 1995: 161-175 - Vladimir Kotlyar, Keshav Pingali, Paul Stodghill:
Automatic Parallelization of the Conjugate Gradient Algorithm. LCPC 1995: 480-499 - Kathryn S. McKinley, Sharad Singhai, Glen E. Weaver, Charles C. Weems:
Compiler Architectures for Heterogeneous Systems. LCPC 1995: 434-449 - Samuel P. Midkiff:
Dependence Analysis in Parallel Loops with i±k Subscripts. LCPC 1995: 331-345 - José E. Moreira, Dale Schouten, Constantine D. Polychronopoulos:
The Performance Impact of Granularity Control and Functional Parallelism. LCPC 1995: 581-597 - Trung N. Nguyen, Junjie Gu, Zhiyuan Li:
An Interprocedural Parallelizing Compiler and Its Support for Memory Hierarchy Research. LCPC 1995: 96-110 - Steven Novack, Joseph Hummel, Alexandru Nicolau:
A Simple Mechanism for Improving the Accuracy and Efficiency of Instruction-Level Disambiguation. LCPC 1995: 289-303 - Daniel J. Palermo, Prithviraj Banerjee:
Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers. LCPC 1995: 392-406
skipping 9 more matches
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-05-26 07:33 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