


default search action
ANALCO 2012: Kyoto, Japan
- Conrado Martínez, Hsien-Kuei Hwang:

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012, Kyoto, Japan, January 16, 2012. SIAM 2012, ISBN 978-1-61197-213-9 - Stephan G. Wagner:

Asymptotic Enumeration of Extensional Acyclic Digraphs. 1-8 - Michael Drmota, Konstantinos Panagiotou:

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. 9-15 - Shuji Kijima, Kentaro Koga, Kazuhisa Makino:

Deterministic Random Walks on Finite Graphs. 16-25 - Raymond Hemmecke, Sven Kosub, Ernst W. Mayr

, Hanjo Täubig, Jeremias Weihmann:
Inequalities for the Number of Walks in Graphs. 26-39 - Guy E. Blelloch:

Problem Based Benchmarks. - J. Ian Munro:

The Complexity of Partial Orders. 40 - Michael J. Bannister, David Eppstein:

Randomized Speedup of the Bellman-Ford Algorithm. 41-47 - Amin Coja-Oghlan, Alan M. Frieze:

Analyzing Walksat on Random Formulas. 48-55 - Osamu Watanabe:

Message Passing Algorithms for MLS-3LIN Problem. 56-64 - Yuliy M. Baryshnikov

, Vadim Zharnitsky:
Search on the Brink of Chaos. 65-74 - Ahmed Helmi, Alois Panholzer:

Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. 75-83 - Emma Yu Jin, Markus E. Nebel:

The Expected Order of Saturated RNA Secondary Structures. 84-91 - Jérémie O. Lumbroso

, Olivier Bodini:
Dirichlet Random Samplers for Multiplicative Combinatorial Structures. 92-106 - Cyril Banderier, Olivier Bodini, Yann Ponty, Hanane Tafat Bouzid:

Biodiversity of Pattern Distributions in Combinatorial Ecosystems. 107-115

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














