3122 search results - page 319 / 625 » A Theory of Network Equivalence |
165
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
188
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
186
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
191
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
168
click to vote
ESOP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...