In this paper we have proved that finite processes of the π-calculus satisfy UPD w.r.t. both strong bisimilarity and weak bisimilarity. We have obtained these results using the technique presented in [16] (see Theorem 1) and different properties tha…

A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposabl…

We thank Tom Kurtz for a discussion that helped us to simplify the proof of Corollary 3.4 substantially and to note the extension to the convergence in the uniform topology in Remark 3.2. We thank David Aldous and Vlada Limic for help on their resul…

We find scaling limits for the sizes of the largest components at criticality for rank-1 inhomogeneous random graphs with power-law degrees with powe…

We thank Giuseppe Savaré and Upanshu Sharma for the precious comments and help given during the preparation of this work. A particular thank goes to the whole CASA group from Technische Universiteit Eindhoven for the interesting and helpful discussi…

We prove the equivalence between the notion of Wasserstein gradient flow for a one-dimensional nonlocal transport PDE with attractive/repulsive Newto…

We consider a stylized stochastic model for a wireless CSMA network. Experimental results in prior studies indicate that the model provides remarkabl…

The $q$-Coloring problem asks whether the vertices of a graph can be properly colored with $q$ colors. Lokshtanov et al. [SODA 2011] showed that $q$-…

We present the formulation of a kinetic mapping scheme between the Direct Simulation Monte Carlo (DSMC) and the Lattice Boltzmann Method (LBM) which …

Process mining techniques focus on extracting insight in processes from event logs. In many cases, events recorded in the event log are too fine-grai…

Electromagnetic radiation in the soft x-ray spectral range ($1-100~\rm{nm}$ wavelengths or $0.01-1~\rm{keV}$ photon energies) is rapidly gaining impo…

We present an algorithm that takes as input an $n$-vertex planar graph $G$ and a $k$-vertex pattern graph $P$, and computes the number of (induced) c…

We study a parallel service queueing system with servers of types $s_1,\ldots,s_J$, customers of types $c_1,\ldots,c_I$, bipartite compatibility grap…

We propose a template matching method for the detection of 2D image objects that are characterized by orientation patterns. Our method is based on da…

The single server queue with multiple customer types and semi-Markovian service times, sometimes referred to as the $M/SM/1$ queue, has been well-stu…

When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density. The most …

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which …

We present a simple method for accessing the elastic properties of microscopic deformable particles. This method is based on measuring the pressure-i…

The emergence of new wearable technologies such as action cameras and smart-glasses has increased the interest of computer vision scientists in the F…

A substantial number of algorithms exists for the simulation of moving particles suspended in fluids. However, finding the best method to address a p…

Incremental stability is a property of dynamical and control systems, requiring the uniform asymptotic stability of every trajectory, rather than tha…

We report on a new technique to split an atomic beam coherently with an easily adjustable splitting angle. In our experiment metastable helium atoms …

We revisit the information-theoretic analysis of bit-interleaved coded modulation (BICM) by modeling the BICM decoder as a mismatched decoder. The mi…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account