Sciweavers

3670 search results - page 87 / 734
» Linear Recursive Functions
Sort
View
95
Voted
ISMVL
1997
IEEE
82views Hardware» more  ISMVL 1997»
15 years 6 months ago
Finding Composition Trees for Multiple-Valued Functions
The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realiza...
Elena Dubrova, Jon C. Muzio, Bernhard von Stengel
TAPSOFT
1997
Springer
15 years 6 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
111
Voted
CORR
2008
Springer
156views Education» more  CORR 2008»
15 years 2 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau
87
Voted
MA
2010
Springer
85views Communications» more  MA 2010»
14 years 9 months ago
Tail dependence functions and vine copulas
Tail dependence and conditional tail dependence functions describe, respectively, the tail probabilities and conditional tail probabilities of a copula at various relative scales....
Harry Joe, Haijun Li, Aristidis K. Nikoloulopoulos
105
Voted
POPL
1998
ACM
15 years 6 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide