3172 search results - page 11 / 635 » On the Random-Self-Reducibility of Complete Sets |
102
Voted
ISPASS
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we present the eDragon environment, a research platform created to perform complete performance analysis of new Web-based technologies. eDragon enables the understan...
114
Voted
CALCO
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
122
click to vote
SOFSEM
2005
Springer
15 years 6 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
106
Voted
HYBRID
2010
Springer
14 years 10 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
STACS
2009
Springer
15 years 7 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...