In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties’ private input sets than what can be deduced from t...

The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer intervals in the range 1 to n and a set of m associated multisets of colors (specifying for each interval the colors to be used for its elements), one asks whether there is a “consistent” coloring for all integer poin...

This paper investigates the proof theory of multiplicative additive system virtual (MAV). MAV combines two established proof calculi: multiplicative additive linear logic (MALL) and basic system virtual (BV). Due to the presence of the self-dual non-commutative operator from BV, the calculus MAV is defined in the calculus of structures — a generalisation of the sequent calculus where inference ...

The complete double vertex graph $M_2(G)$ of $G$ is defined as the whose vertices are $2$-multisubsets $V(G)$, and two such adjacent in if their symmetric difference (as multisets) a pair $G$. In this paper we exhibit an infinite family graphs (containing Hamiltonian non-Hamiltonian graphs) for which Hamiltonian.

This paper describes a general framework for designing purely functional datatypes that automatically satisfy given size or structural constraints. Using the framework we develop implementations of different matrix types (eg square matrices) and implementations of several tree types (eg Braun trees, 2-3 trees). Consider, for instance, representing square /102/ matrices. The usual representation...

Secure Multi-Party Computation (SMC) offers a theoretically wellfounded way to enable applications that preserve their users’ privacy. However, the practical use of SMC has often been questioned in the past. This is partly due to the fact that the system assumptions made in theory are hard to meet in practice and partly due to the potentially very high overhead general purpose SMC frameworks in...

A binary matrix satisfies the consecutive ones property (C1P) if its columns can be permuted such that the 1s in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q1, . . . , Qm}, where Qi ⊆ R for some universe R, satisfies the C1P if the symbols in R can be permuted such that the elements of each set Qi ∈ F occur consecutively, as a contiguous segment of the...

We design and analyze deterministic truthful approximation mechanisms for multi-unit combinatorial auctions involving a constant number of distinct goods, each in arbitrary limited supply. Prospective buyers (bidders) have preferences over multisets of items, i.e., for more than one unit per distinct good, that are expressed through their private valuation functions. Our objective is to determi...

Inaccessibility of part of the database is a research topic hardly addressed in the literature about distributed databases. However, there are various application areas, where the database has to remain operable even if part of the database is inaccessible. In particular, queries to the database should be processed in an appropriate way. This means that the nal and all intermediate results of a...

The paper is concerned with the limit shape (under some probability measure) of convex polygonal lines on Z+ starting at the origin and with the right endpoint n = (n1, n2) → ∞. In the case of the uniform measure, the explicit limit shape γ∗ was found independently by Vershik, Bárány and Sinai. Bogachev and Zarbaliev recently showed that the limit shape γ∗ is universal in a certain class of mea...