Sciweavers

12753 search results - page 2474 / 2551
» is 2002
Sort
View
ENDM
2002
86views more  ENDM 2002»
13 years 8 months ago
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
Stanislav Jendrol, Heinz-Jürgen Voss
ENTCS
2002
134views more  ENTCS 2002»
13 years 8 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
ENTCS
2002
113views more  ENTCS 2002»
13 years 8 months ago
A monadic approach to polycategories
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Jürgen Koslowski
ENTCS
2002
181views more  ENTCS 2002»
13 years 8 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
ENTCS
2002
90views more  ENTCS 2002»
13 years 8 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing
« Prev « First page 2474 / 2551 Last » Next »