4743 search results - page 489 / 949 » The PlusCal Algorithm Language |
149
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
137
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
Path expressions are the principal means of locating data in a hierarchical model. But path expressions are brittle because they often depend on the structure of data and break if...
214
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant int...
125
click to vote
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
133
click to vote
SAC
2009
ACM
15 years 10 months ago
2009
ACM
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...