281 citations
- University of AmsterdamNL19 papers
- Eindhoven University of TechnologyNL16 papers
- College of Western IdahoUS5 papers
- University of WaterlooCA4 papers
- Vrije Universiteit AmsterdamNL4 papers
- Universidad Pública de Navarra (UPNA)ES3 papers
- Berkeley CollegeUS2 papers
- National University of SingaporeSG2 papers
- University of BristolGB2 papers
- University of California, BerkeleyUS2 papers
- University of CambridgeGB2 papers
- University of HaifaIL2 papers
21 papers · 1 filter
Streamers, sprites, leaders, lightning: from micro- to macroscales
Ute Ebert, Davis D. Sentman
"Streamers, sprites, leaders, lightning: from micro- to macroscales" was the theme of a workshop in October 2007 in Leiden, The Netherlands; it brought researchers from plasma phys…
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob van Glabbeek
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results re…
Welfare Undominated Groves Mechanisms
Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo +1
A common objective in mechanism design is to choose the outcome (for example, allocation of resources) that maximizes the sum of the agents' valuations, without introducing incenti…
A comparison of the notions of optimality in soft constraints and graphical games
Krzysztof R. Apt, Francesca Rossi, K. Brent Venable
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of t…
Approximate zero-one laws and sharpness of the percolation transition in a class of models including two-dimensional Ising percolation
J. van den Berg
One of the most well-known classical results for site percolation on the square lattice is the equation . In words, this equation means that for all values …
Algorithmic information theory
Peter D. Grunwald, Paul M. B. Vitanyi
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'…