output
20022011
most citedOn Using Matching Theory to Understand P2P Network Design

32 citations

Showing 2008Show all

11 papers · 1 filter

cs.GT2008

Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides

Nathalie Bertrand, Blaise Genest, Hugo Gimbert

We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actio…

math.CO200815 cited

Automatic Classification of Restricted Lattice Walks

Alin Bostan, Manuel Kauers

We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of w…

math.PR2008

Occupancy Schemes Associated to Yule Processes

Philippe Robert, Florian Simatos

An occupancy problem with an infinite number of bins and a random probability vector for the locations of the balls is considered. The respective sizes of bins are related to the s…

math.CO2008

New bijective links on planar maps via orientations

Eric Fusy

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triang…

cs.DM20083 cited

Mean asymptotic behaviour of radix-rational sequences and dilation equations (Extended version)

Philippe Dumas

The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rati…

math.CO2008

The height of random binary unlabelled trees

Nicolas Broutin, Philippe Flajolet

This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size is…