default search action
ANALCO 2010: Austin, Texas, USA
- Mordecai J. Golin, Robert Sedgewick:
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2010, Austin, Texas, USA, January 16, 2010. SIAM 2010, ISBN 978-0-89871-933-8 - Philippe Duchon, Hubert Larchevêque:
On the Search Path Length of Random Binary Skip Graphs. 1-8 - Srinivasan Balaji, Hosam M. Mahmoud:
Phases in the Mixing of Gases via the Ehrenfest Urn Model. 9-17 - Daniel Panario, L. Bruce Richmond, Benjamin Young:
Bivariate Asymptotics for Striped Plane Partitions. 18-26 - Amr Elmasry:
The Subset Partial Order: Computing and Combinatorics. 27-33 - Yongwook Choi:
Fast Algorithm for Optimal Compression of Graphs. 34-46 - Bruno Salvy:
Newton Iteration: From Numerics to Combinatorics, and Back. 47 - Olivier Bodini, Thomas Fernique, Damien Regnault:
Stochastic Flips on Two-letter Words. 48-55 - Lisa Fleischer:
Data Center Scheduling, Generalized Flows, and Submodularity. 56-65 - Lisa Fleischer, Zoya Svitkina:
Preference-constrained Oriented Matching. 66-73 - Takayuki Ichiba, Kazuo Iwama:
Averaging Techniques for Competitive Auctions. 74-81 - Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil:
On Two Distributions of Subgroups of Free Groups. 82-89 - Reinhard Bauer, Marcus Krug, Dorothea Wagner:
Enumerating and Generating Labeled k-degenerate Graphs. 90-98 - Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini, Michèle Soria:
The Connectivity-Profile of Random Increasing k-trees. 99-106
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.