@inproceedings{2000,
  abstract     = {In this work we present a flexible tool for tumor progression, which simulates the evolutionary dynamics of cancer. Tumor progression implements a multi-type branching process where the key parameters are the fitness landscape, the mutation rate, and the average time of cell division. The fitness of a cancer cell depends on the mutations it has accumulated. The input to our tool could be any fitness landscape, mutation rate, and cell division time, and the tool produces the growth dynamics and all relevant statistics.},
  author       = {Reiter, Johannes and Božić, Ivana and Chatterjee, Krishnendu and Nowak, Martin},
  booktitle    = {Proceedings of 25th Int. Conf. on Computer Aided Verification},
  location     = {St. Petersburg, Russia},
  pages        = {101 -- 106},
  publisher    = {Springer},
  title        = {{TTP: Tool for tumor progression}},
  doi          = {10.1007/978-3-642-39799-8_6},
  volume       = {8044},
  year         = {2013},
}

@article{2009,
  abstract     = {Traditional statistical methods for confidentiality protection of statistical databases do not scale well to deal with GWAS databases especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual’s privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially-private approach to penalized logistic regression.},
  author       = {Uhler, Caroline and Slavkovic, Aleksandra and Fienberg, Stephen},
  journal      = {Journal of Privacy and Confidentiality },
  number       = {1},
  pages        = {137 -- 166},
  publisher    = {Carnegie Mellon University},
  title        = {{Privacy-preserving data sharing for genome-wide association studies}},
  doi          = {10.29012/jpc.v5i1.629},
  volume       = {5},
  year         = {2013},
}

@article{2010,
  abstract     = {Many algorithms for inferring causality rely heavily on the faithfulness assumption. The main justification for imposing this assumption is that the set of unfaithful distributions has Lebesgue measure zero, since it can be seen as a collection of hypersurfaces in a hypercube. However, due to sampling error the faithfulness condition alone is not sufficient for statistical estimation, and strong-faithfulness has been proposed and assumed to achieve uniform or high-dimensional consistency. In contrast to the plain faithfulness assumption, the set of distributions that is not strong-faithful has nonzero Lebesgue measure and in fact, can be surprisingly large as we show in this paper. We study the strong-faithfulness condition from a geometric and combinatorial point of view and give upper and lower bounds on the Lebesgue measure of strong-faithful distributions for various classes of directed acyclic graphs. Our results imply fundamental limitations for the PC-algorithm and potentially also for other algorithms based on partial correlation testing in the Gaussian case.},
  author       = {Uhler, Caroline and Raskutti, Garvesh and Bühlmann, Peter and Yu, Bin},
  journal      = {The Annals of Statistics},
  number       = {2},
  pages        = {436 -- 463},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Geometry of the faithfulness assumption in causal inference}},
  doi          = {10.1214/12-AOS1080},
  volume       = {41},
  year         = {2013},
}

@article{2117,
  abstract     = {We prove new upper and lower bounds for Banach space-valued stochastic integrals with respect to a compensated Poisson random measure. Our estimates apply to Banach spaces with non-trivial martingale (co)type and extend various results in the literature. We also develop a Malliavin framework to interpret Poisson stochastic integrals as vector-valued Skorohod integrals, and prove a Clark-Ocone representation formula.},
  author       = {Dirksen, Sjoerd and Jan Maas and van Neerven, Jan M},
  journal      = {Electronic Journal of Probability},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Poisson stochastic integration in Banach spaces}},
  doi          = {10.1214/EJP.v18-2945 },
  volume       = {18},
  year         = {2013},
}

@article{2129,
  abstract     = {This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. 


},
  author       = {Gigli, Nicola and Jan Maas},
  journal      = {SIAM Journal on Mathematical Analysis},
  number       = {2},
  pages        = {879 -- 899},
  publisher    = {Society for Industrial and Applied Mathematics },
  title        = {{Gromov-Hausdorff convergence of discrete transportation metrics}},
  doi          = {10.1137/120886315 },
  volume       = {45},
  year         = {2013},
}

@article{2139,
  abstract     = {Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms.},
  author       = {Mikhail Lemeshko},
  journal      = {Frontiers Physics},
  number       = {17},
  publisher    = {Frontiers Media},
  title        = {{Manipulating scattering of ultracold atoms with light-induced dissipation}},
  doi          = {10.3389/fphy.2013.00017},
  volume       = {1},
  year         = {2013},
}

@inproceedings{2181,
  abstract     = {There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all "legal" sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.},
  author       = {Henzinger, Thomas A and Kirsch, Christoph and Payer, Hannes and Sezgin, Ali and Sokolova, Ana},
  booktitle    = {Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language},
  isbn         = {978-1-4503-1832-7},
  location     = {Rome, Italy},
  pages        = {317 -- 328},
  publisher    = {ACM},
  title        = {{Quantitative relaxation of concurrent data structures}},
  doi          = {10.1145/2429069.2429109},
  year         = {2013},
}

@article{2204,
  abstract     = {We introduce a new platform for quantum simulation of many-body systems based on nonspherical atoms or molecules with zero dipole moments but possessing a significant value of electric quadrupole moments. We consider a quadrupolar Fermi gas trapped in a 2D square optical lattice, and show that the peculiar symmetry and broad tunability of the quadrupole-quadrupole interaction results in a rich phase diagram encompassing unconventional BCS and charge density wave phases, and opens up a perspective to create a topological superfluid. Quadrupolar species, such as metastable alkaline-earth atoms and homonuclear molecules, are stable against chemical reactions and collapse and are readily available in experiment at high densities.},
  author       = {Bhongale, Satyan and Mathey, Ludwig and Zhao, Erhai and Yelin, Susanne and Lemeshko, Mikhail},
  journal      = {Physical Review Letters},
  number       = {15},
  publisher    = {American Physical Society},
  title        = {{Quantum phases of quadrupolar fermi gases in optical lattices}},
  doi          = {10.1103/PhysRevLett.110.155301},
  volume       = {110},
  year         = {2013},
}

@misc{2205,
  abstract     = {The goal of the present article is to review the major developments that have led to the current understanding of molecule-field interactions and experimental methods for manipulating molecules with electromagnetic fields. Molecule-field interactions are at the core of several, seemingly distinct areas of molecular physics. This is reflected in the organisation of this article, which includes sections on field control of molecular beams, external field traps for cold molecules, control of molecular orientation and molecular alignment, manipulation of molecules by non-conservative forces, ultracold molecules and ultracold chemistry, controlled many-body phenomena, entanglement of molecules and dipole arrays, and stability of molecular systems in high-frequency super-intense laser fields. The article contains 852 references.},
  author       = {Mikhail Lemeshko and Krems, Roman V and Doyle, John M and Kais, Sabre},
  booktitle    = {Molecular Physics},
  number       = {12-13},
  pages        = {1648 -- 1682},
  publisher    = {Taylor & Francis},
  title        = {{Manipulation of molecules with electromagnetic fields}},
  doi          = {10.1080/00268976.2013.813595},
  volume       = {111},
  year         = {2013},
}

@article{2206,
  abstract     = {Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHoxY1-xF4. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases.},
  author       = {Mikhail Lemeshko and Yao, Norman Y and Gorshkov, Alexey V and Weimer, Hendrik and Bennett, Steven D and Momose, Takamasa and Gopalakrishnan, Sarang},
  journal      = {Physical Review B - Condensed Matter and Materials Physics},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Controllable quantum spin glasses with magnetic impurities embedded in quantum solids}},
  doi          = {10.1103/PhysRevB.88.014426},
  volume       = {88},
  year         = {2013},
}

@article{2207,
  abstract     = {The formation of molecules and supramolecular structures results from bonding by conservative forces acting among electrons and nuclei and giving rise to equilibrium configurations defined by minima of the interaction potential. Here we show that bonding can also occur by the non-conservative forces responsible for interaction-induced coherent population trapping. The bound state arises in a dissipative process and manifests itself as a stationary state at a preordained interatomic distance. Remarkably, such a dissipative bonding is present even when the interactions among the atoms are purely repulsive. The dissipative bound states can be created and studied spectroscopically in present-day experiments with ultracold atoms or molecules and can potentially serve for cooling strongly interacting quantum gases.},
  author       = {Mikhail Lemeshko and Weimer, Hendrik},
  journal      = {Nature Communications},
  publisher    = {Nature Publishing Group},
  title        = {{Dissipative binding of atoms by non-conservative forces}},
  doi          = {10.1038/ncomms3230},
  volume       = {4},
  year         = {2013},
}

@inproceedings{2210,
  abstract     = {A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.},
  author       = {Biedl, Therese and Held, Martin and Huber, Stefan},
  booktitle    = {29th European Workshop on Computational Geometry},
  location     = {Braunschweig, Germany},
  pages        = {95 -- 98},
  publisher    = {TU Braunschweig},
  title        = {{Reconstructing polygons from embedded straight skeletons}},
  year         = {2013},
}

@inproceedings{2237,
  abstract     = {We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.},
  author       = {Blanc, Régis and Gupta, Ashutosh and Kovács, Laura and Kragl, Bernhard},
  location     = {Stellenbosch, South Africa},
  pages        = {173 -- 181},
  publisher    = {Springer},
  title        = {{Tree interpolation in Vampire}},
  doi          = {10.1007/978-3-642-45221-5_13},
  volume       = {8312},
  year         = {2013},
}

@inproceedings{2243,
  abstract     = {We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.},
  author       = {Michaliszyn, Jakub and Otop, Jan},
  location     = {Torino, Italy},
  pages        = {563 -- 577},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Elementary modal logics over transitive structures}},
  doi          = {10.4230/LIPIcs.CSL.2013.563},
  volume       = {23},
  year         = {2013},
}

@inproceedings{2244,
  abstract     = {We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. },
  author       = {Matoušek, Jiří and Sedgwick, Eric and Tancer, Martin and Wagner, Uli},
  location     = {Bordeaux, France},
  pages        = {472 -- 483},
  publisher    = {Springer},
  title        = {{Untangling two systems of noncrossing curves}},
  doi          = {10.1007/978-3-319-03841-4_41},
  volume       = {8242},
  year         = {2013},
}

@article{2247,
  abstract     = {Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.},
  author       = {Zagorsky, Benjamin and Reiter, Johannes and Chatterjee, Krishnendu and Nowak, Martin},
  journal      = {PLoS One},
  number       = {12},
  publisher    = {Public Library of Science},
  title        = {{Forgiver triumphs in alternating prisoner's dilemma }},
  doi          = {10.1371/journal.pone.0080814},
  volume       = {8},
  year         = {2013},
}

@article{2256,
  abstract     = {Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license.},
  author       = {Danowski, Patrick and Goldfarb, Doron and Schaffner, Verena and Seidler, Wolfram},
  journal      = {VÖB Mitteilungen},
  number       = {3/4},
  pages        = {559 -- 587},
  publisher    = {Verein Österreichischer Bibliothekarinnen und Bibliothekare},
  title        = {{Linked (Open) Data - Bibliographische Daten im Semantic Web}},
  volume       = {66},
  year         = {2013},
}

@inproceedings{2258,
  abstract     = {In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.

Our construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.
},
  author       = {Kiltz, Eike and Pietrzak, Krzysztof Z and Szegedy, Mario},
  location     = {Santa Barbara, CA, United States},
  pages        = {571 -- 588},
  publisher    = {Springer},
  title        = {{Digital signatures with minimal overhead from indifferentiable random invertible functions}},
  doi          = {10.1007/978-3-642-40041-4_31},
  volume       = {8042},
  year         = {2013},
}

@inproceedings{2259,
  abstract     = {The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.

As a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.

Our approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.
},
  author       = {Alwen, Joel F and Krenn, Stephan and Pietrzak, Krzysztof Z and Wichs, Daniel},
  location     = {Santa Barbara, CA, United States},
  number       = {1},
  pages        = {57 -- 74},
  publisher    = {Springer},
  title        = {{Learning with rounding, revisited: New reduction properties and applications}},
  doi          = {10.1007/978-3-642-40041-4_4},
  volume       = {8042},
  year         = {2013},
}

@inproceedings{2260,
  abstract     = {Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.

The security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.
},
  author       = {Bernhard, David and Fuchsbauer, Georg and Ghadafi, Essam},
  location     = {Banff, AB, Canada},
  pages        = {518 -- 533},
  publisher    = {Springer},
  title        = {{Efficient signatures of knowledge and DAA in the standard model}},
  doi          = {10.1007/978-3-642-38980-1_33},
  volume       = {7954},
  year         = {2013},
}