Publications related to Quantitative Languages

Lower Bounds for Unambiguous Automata via Communication Complexity

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

David Atienza Alonso, Tomas Teijeiro Campo, Una Pale

Wearable IoT devices and novel continuous monitoring algorithms are essential components of the healthcare transition from reactive interventions focused on symptom treatment to more proactive prevention, from one-size-fits-all to personalized medicine, an ...

IEEE2022

Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation

René Uwe Schneider, Marcello Farina

In modern engineering systems, reliability and safety can be conferred by efficient automatic monitoring and fault detection algorithms, allowing for the early identification and isolation of incipient faults. In case of large-scale and complex systems, sc ...

2020

TFHE: Fast Fully Homomorphic Encryption Over the Torus

This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary ...

SPRINGER2020

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Aris Filos Ratsikas

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...

ACM2019

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Maryam Kamgarpour, John Lygeros, Tony Alan Wood

The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...

2017

Optimal Switching Between Cash-Flow Streams

Thomas Alois Weber

We consider the problem of finding the optimal time to switch between two measurable cash-flow streams. A complete characterization of the set of solutions is obtained in terms of adjoint variables which measure the available gain from deviations. An itera ...

2017

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once t ...

Elsevier Science Bv2016

Quantitative Languages

Graph Chatbot

Chat with Graph Search

Lower Bounds for Unambiguous Automata via Communication Complexity

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation

TFHE: Fast Fully Homomorphic Encryption Over the Torus

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Optimal Switching Between Cash-Flow Streams

A Comment on “Computational Complexity of Stochastic Programming Problems”

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation

Lower Bounds for Unambiguous Automata via Communication Complexity

Optimal Switching Between Cash-Flow Streams

A Comment on “Computational Complexity of Stochastic Programming Problems”

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

TFHE: Fast Fully Homomorphic Encryption Over the Torus

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Control synthesis for stochastic systems given automata specifications defined by stochastic sets