Amanote Research

Amanote Research

    RegisterSign In

A Binding Scope Analysis for Generic Programs on Arrays

Lecture Notes in Computer Science - Germany
doi 10.1007/11964681_13
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Clemens GrelckSven-Bodo ScholzAlex Shafarenko
Publisher

Springer Berlin Heidelberg


Related search

Information Technology for Managers: Australian Generic MBA Programs

1997English

Generic Binding Sites, Generic DNA-binding Domains: Where Does Specific Promoter Recognition Come From?

FASEB Journal
BiochemistryBiotechnologyGeneticsMolecular BiologyMedicine
2009English

Symbolic Conditioning of Arrays in Probabilistic Programs

Proceedings of the ACM on Programming Languages
2017English

Minisequencing: A Specific Tool for DNA Analysis and Diagnostics on Oligonucleotide Arrays

Genome Research
Genetics
1997English

A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic $I\timesJ\times2$ Arrays

SIAM Journal on Matrix Analysis and Applications
Analysis
2009English

A Network Analysis Method for Tailoring Academic Programs

Advances in Wireless Technologies and Telecommunication
2016English

Stability Analysis for Stochastic Programs

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
1991English

Fuzzy Decision Analysis for Project Scope Change Management

Decision Science Letters
Decision Sciences
2017English

Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy