𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Coins From Old: Computing With Unknown Bias

✍ Scribed by Elchanan Mossel*; Yuval Peres†; With an appendix by Christopher Hillar‡, University of California, Berkeley, 970 Evans Hall #3840, Berkeley, CA 94720-3840, USA, [email protected]

Book ID
106167575
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
284 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Coins from Old, Smoothly
New Coins from Old, Smoothly
✍ Olga Holtz; Fedor Nazarov; Yuval Peres 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 951 KB
Computing Vertex Connectivity: New Bound
Computing Vertex Connectivity: New Bounds from Old Techniques
✍ Monika R. Henzinger; Satish Rao; Harold N. Gabow 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 198 KB

The vertex connectivity of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding Ž Ä 3 separator. The time for a digraph having n vertices and m e