Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Prasad Tetali"'
Publikováno v:
Mathematical and Computational Applications, Vol 25, Iss 4, p 67 (2020)
Ribonucleic acid (RNA) secondary structures and branching properties are important for determining functional ramifications in biology. While energy minimization of the Nearest Neighbor Thermodynamic Model (NNTM) is commonly used to identify such pro
Externí odkaz:
https://doaj.org/article/79a62d9d9315400a871f5aaa06d7c347
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a $\textit{Schnyder wood}$ that has proven useful f
Externí odkaz:
https://doaj.org/article/580b68f7540c4e668282081ffaafd399
Autor:
Christine E. Heitsch, Prasad Tetali
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We consider a Markov chain Monte Carlo approach to the uniform sampling of meanders. Combinatorially, a meander $M = [A:B]$ is formed by two noncrossing perfect matchings, above $A$ and below $B$ the same endpoints, which form a single closed loop. W
Externí odkaz:
https://doaj.org/article/fd7eee7f0ea04f1180d1243aa6fb9ce6
Publikováno v:
SIAM Journal on Computing. 52:327-357
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41acfd2b3604751a06d2def479312b06
https://doi.org/10.1137/21m1434052
https://doi.org/10.1137/21m1434052
Publikováno v:
Random Structures & Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d723370127f22bc5567ed04bc00004c
https://doi.org/10.1002/rsa.21131
https://doi.org/10.1002/rsa.21131
Publikováno v:
ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE. :1207-1232
We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Prekopa-Leindler Inequality : the Four Functions Theorem of Ahlswede and Daykin on the disc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cafcaf8769b33230b8767c7602b56701
https://doi.org/10.2422/2036-2145.201906_002
https://doi.org/10.2422/2036-2145.201906_002
Publikováno v:
Combinatorial Theory. 2
Recall that an excedance of a permutation $��$ is any position $i$ such that $��_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it get
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0fa93e55a124aea02f72da1a1f5fb0d
https://doi.org/10.5070/c62156882
https://doi.org/10.5070/c62156882
Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash}, combinator
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57a5b6b1caa5d81e0aa8ef47d3044163
Publikováno v:
SODA
We study the generalized min sum set cover (GMSSC) problem, wherein given a collection of hyperedges $E$ with arbitrary covering requirements $k_e$, the goal is to find an ordering of the vertices to minimize the total cover time of the hyperedges; a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffcfa059c2ed8b5ed05f6142c777b8c9
https://ir.cwi.nl/pub/30798
https://ir.cwi.nl/pub/30798