Sciweavers

4743 search results - page 110 / 949
» The PlusCal Algorithm Language
Sort
View
ICALP
1995
Springer
15 years 6 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis
PLDI
1995
ACM
15 years 5 months ago
Flow-Sensitive Interprocedural Constant Propagation
We present a flow-sensitive interprocedural constant propagation algorithm, which sttpports recursion while only performing one flow-sensitive analysis of each procedure. We prese...
Paul R. Carini, Michael Hind
99
Voted
ESOP
2008
Springer
15 years 4 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
COMPGEOM
2011
ACM
14 years 6 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 2 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys