Home      Discussions      About
Join us

@liafa.jussieu.fr

Apr 10, 2011
Computer Science and Game Theory
Cryptography and Security

Let us start by fixing some notation. In a two-player game, let p be an efficiently computable correlated equilibrium that the players know and aim to generate. A typical scenario is that p is the lexicographically first correlated equilibrium that …

A quantum protocol for sampling correlated equilibria unconditionally…

A correlated equilibrium is a fundamental solution concept in game theory that enjoys many desirable properties. However, it requires a trusted media…
Jul 17, 2009
Computer Science and Game Theory
Distributed
Parallel
and Cluster Computing

Pavlovian Population protocols are symmetric. We just proved that they have a very limited computational power. However, assuming population protocols symmetric (not-necessarily Pavlovian) is not truly a restriction.

Population Protocols that Correspond to Symmetric Games

Population protocols have been introduced by Angluin et {al.} as a model of networks consisting of very limited mobile agents that interact in pairs …
May 11, 2012
Discrete Mathematics
Combinatorics

Vertex elimination orderings for hereditary graph classes

We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that w…
Jan 17, 2010
Data Structures and Algorithms

Succinct Dictionary Matching With No Slowdown

The problem of dictionary matching is a classical problem in string matching: given a set S of d strings of total length n characters over an (not ne…
Jan 06, 2016
Distributed
Parallel
and Cluster Computing

Notions of Connectivity in Overlay Networks

" How well connected is the network? " This is one of the most fundamental questions one would ask when facing the challenge of designing a communica…
Jun 08, 2010
Computer Science and Game Theory

We have compared three models of randomized strategies —behavioural, mixed, and general— in the context of graph games. Depending on the sub-case, we were able to expose variations in the amount of memory needed, the existence of finite-memory strat…

How do we remember the past in randomised strategies?

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specif…
Aug 31, 2017
Logic in Computer Science
Formal Languages and Automata Theory

We conclude the paper with some open questions.

Boundedness in languages of infinite words

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type…
Sep 15, 2009
Data Structures and Algorithms
Discrete Mathematics

An Optimal Labeling Scheme for Ancestry Queries

An ancestry labeling scheme assigns labels (bit strings) to the nodes of rooted trees such that ancestry queries between any two nodes in a tree can …
Mar 11, 2009
Combinatorics
Mathematical Physics

Plane overpartitions and cylindric partitions

Generating functions for plane overpartitions are obtained using various methods such as nonintersecting paths, RSK type algorithms and symmetric fun…
Dec 18, 2010
Discrete Mathematics
Quantitative Methods

Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic …

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$…
Sep 08, 2013
Combinatorics

Linear balanceable and subcubic balanceable graphs

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conje…
Jun 17, 2009
Computer Science and Game Theory

We proved that predicates on counts of input agents n≥0, n=0, n≥m, where n,m are some counts of input agents, can be computed by some Pavlovian population protocols.

Playing With Population Protocols

Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movem…
Mar 02, 2011
Number Theory
Discrete Mathematics

Redundancy of minimal weight expansions in Pisot bases

Motivated by multiplication algorithms based on redundant number representations, we study representations of an integer $n$ as a sum $n=\sum_k \epsi…
Oct 10, 2009
Combinatorics
Statistical Mechanics
Probability

Tableaux combinatorics for the asymmetric exclusion process and Ask…

Introduced in the late 1960's, the asymmetric exclusion process (ASEP) is an important model from statistical mechanics which describes a system of i…
May 10, 2012
Distributed
Parallel
and Cluster Computing
Discrete Mathematics

Collaborative search on the plane without communication

We generalize the classical cow-path problem [7, 14, 38, 39] into a question that is relevant for collective foraging in animal groups. Specifically,…
Nov 20, 2011
Probability
Discrete Mathematics
Cellular Automata and Lattice Gases

Density classification on infinite lattices and trees

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classificati…
Sep 04, 2013
Discrete Mathematics
Combinatorics

Detecting induced subgraphs

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any …
Feb 08, 2011

In this Section, we show a 3/4 lower bound for classical bit commitment schemes when players additionally have the power to perform perfect (strong or weak) coin-flipping. This will show that unlike strong coin flipping, quantum and classical bit co…

Optimal bounds for quantum bit commitment

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the info…
Aug 23, 2010
Data Structures and Algorithms
Discrete Mathematics

Consecutive ones property testing: cut or swap

Let C be a finite set of $N elements and R = {R_1,R_2, ..,R_m} a family of M subsets of C. The family R verifies the consecutive ones property if the…
Sep 23, 2008
Number Theory
Discrete Mathematics

Regularities of the distribution of abstract van der Corput sequences

Similarly to $\beta$-adic van der Corput sequences, abstract van der Corput sequences can be defined for abstract numeration systems. Under some assu…
There aren't more papers

Request Comment

or Invite via email
You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description