


default search action
ANALCO 2016: Arlington, VA, USA
- James Allen Fill, Mark Daniel Ward:
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016. SIAM 2016, ISBN 978-1-61197-432-4 - Michael Mitzenmacher:
More Analysis of Double Hashing for Balanced Allocations. 1-9 - Michael Mitzenmacher:
A New Approach to Analyzing Robin Hood Hashing. 10-24 - Yusuke Kobayashi, Kenjiro Takazawa:
Randomized Strategies for Cardinality Robustness in the Knapsack Problem. 25-33 - Elie de Panafieu, Lander Ramos:
Graphs with degree constraints. 34-45 - Prateek Bhakta, Dana Randall:
Sampling Weighted Perfect Matchings on the Square-Octagon Lattice. 46-55 - Michael Drmota, Emma Yu Jin:
Scaling limit of random k-trees. 56-65 - Kevin Durant, Stephan Wagner:
Betweenness Centrality in Random Trees. 66-79 - Panpan Zhang:
On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits. 80-92 - Matús Mihalák, Przemyslaw Uznanski
, Pencho Yordanov
:
Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. 93-105 - Noela S. Müller, Ralph Neininger:
The CLT Analogue for Cyclic Urns. 121-127 - Jun Zhao, Panpan Zhang:
On Connectivity in a General Random Intersection Graph. 128-137 - Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. 138-148

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.