2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972139, 9781611973020

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Analyzing Walksat on Random Formulas

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.7 ◽

2012 ◽

Cited By ~ 4

Author(s):

Amin Coja-Oghlan ◽

Alan Frieze

Inequalities for the Number of Walks in Graphs

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.4 ◽

2012 ◽

Cited By ~ 1

Author(s):

Raymond Hemmecke ◽

Sven Kosub ◽

Ernst W. Mayr ◽

Hanjo Täubig ◽

Jeremias Weihmann

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.2 ◽

2012 ◽

Author(s):

Michael Drmota ◽

Konstantinos Panagiotou

Keyword(s):

Central Limit Theorem ◽

Limit Theorem ◽

Central Limit ◽

Random Maps

Randomized Speedup of the Bellman–Ford Algorithm

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.6 ◽

2012 ◽

Cited By ~ 9

Author(s):

Michael J. Bannister ◽

David Eppstein

Search on the Brink of Chaos

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.9 ◽

2012 ◽

Author(s):

Yuliy Baryshnikov ◽

Vadim Zharnitsky

Message Passing Algorithms for MLS-3LIN Problem

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.8 ◽

2012 ◽

Cited By ~ 1

Author(s):

Osamu Watanabe

Keyword(s):

Message Passing ◽

Message Passing Algorithms

Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.10 ◽

2012 ◽

Cited By ~ 1

Author(s):

Ahmed Helmi ◽

Alois Panholzer

Keyword(s):

Hiring Problem

On the diversity of pattern distributions in rational language.

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.13 ◽

2012 ◽

Author(s):

Cyril Banderier ◽

Olivier Bodini ◽

Yann Ponty ◽

Hanane Tafat Bouzid

Keyword(s):

Rational Language

Asymptotic enumeration of extensional acyclic digraphs

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.1 ◽

2012 ◽

Cited By ~ 9

Author(s):

Stephan Wagner

Keyword(s):

Asymptotic Enumeration

Deterministic Random Walks on Finite Graphs

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973020.3 ◽

2012 ◽

Cited By ~ 7

Author(s):

Shuji Kijima ◽

Kentaro Koga ◽

Kazuhisa Makino

Keyword(s):

Random Walks ◽

Finite Graphs

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Analyzing Walksat on Random Formulas

Inequalities for the Number of Walks in Graphs

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps

Randomized Speedup of the Bellman–Ford Algorithm

Search on the Brink of Chaos

Message Passing Algorithms for MLS-3LIN Problem

Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem

On the diversity of pattern distributions in rational language.

Asymptotic enumeration of extensional acyclic digraphs

Deterministic Random Walks on Finite Graphs

2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications