Sciweavers

730 search results - page 7 / 146
» Combinatorics of Monotone Computations
Sort
View
JCB
2006
126views more  JCB 2006»
14 years 11 months ago
Combinatorics of Saturated Secondary Structures of RNA
Following Zuker (1986), a saturated secondary structure for a given RNA sequence is a secondary structure such that no base pair can be added without violating the definition of s...
P. Clote
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
14 years 11 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 11 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
SIAMDM
2010
194views more  SIAMDM 2010»
14 years 6 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 5 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel