✦ LIBER ✦

A theory for the multiset sampler

✍ Scribed by Yuguo Chen

Book ID: 116890349
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 192 KB
Volume: 82
Category: Article
ISSN: 0167-7152
DOI: 10.1016/j.spl.2011.09.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A framework for multiset merging

✍ Antoon Bronselaer; Daan Van Britsom; Guy De Tré 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 230 KB

An algorithm for compositions of a multi

An algorithm for compositions of a multiset

✍ Peter H Sellers 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 491 KB

A Gray Code for Combinations of a Multis

A Gray Code for Combinations of a Multiset

✍ Frank Ruskey; Carla D. Savage 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A loopless algorithm for generating the

A loopless algorithm for generating the permutations of a multiset

✍ Vincent Vajnovszki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deÿned previou

A Note on Multiset Permutations

✍ Yen, Lily 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 453 KB

Finding the Extrema of a Distributed Mul

Finding the Extrema of a Distributed Multiset

✍ Paola Alimonti; Paola Flocchini; Nicola Santoro 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 327 KB

If the ring is asynchronous, the number of messages required to solve LE (and, thus, EF) is ⌰(n и log n) [4, 6-8, 14, 15]. For synchronous rings, several solutions have been presented with different bits-time complexities [5, 8-11, 16, 18, 19]. Unlike the asynchronous case, knowledge of the ring siz