Search
Search Results
-
Wait-Free Approximate Agreement on Graphs
Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes...
-
A Dynamic Temporal Logic for Quality of Service in Choreographic Models
We propose a framework for expressing and analyzing the Quality of Service (QoS) of message-passing systems using a choreographic model that consists...
-
Enabling four-dimensional conformal hybrid meshing with cubic pyramids
The main purpose of this article is to develop a novel refinement strategy for four-dimensional hybrid meshes based on cubic pyramids. This optimal...
-
-
Partial Key Exposure Attack on Short Secret Exponent CRT-RSA
Let (N, e) be an RSA public key, where \(N=pq\)...
-
Formalizing the Face Lattice of Polyhedra
Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of...
-
Reliable and Accurate Implicit Neural Representation of Multiple Swept Volumes with Application to Safe Human–Robot Interaction
In automated production using collaborative robots in a manufacturing cell, a crucial aspect is to avoid collisions to ensure the safety of workers...
-
Approximating Multistage Matching Problems
In multistage perfect matching problems, we are given a sequence of graphs on the same vertex set and are asked to find a sequence of perfect...
-
On the Lifted Multicut Polytope for Trees
We study the lifted multicut problem restricted to trees, which is np-hard in general and solvable in polynomial time for paths. In particular, we...
-
Into the Unknown: Assigning Reviewers to Papers with Uncertain Affinities
A successful peer review process requires that qualified and interested reviewers are assigned to each paper. Most automated reviewer assignment...
-
Unleashing the Power of Generation
If you are asked to paint a flower, you may ask many questions. “What type is it? How many petals? How many sepals? What is its size? What should be...
-
On \(\epsilon\)-sensitive monotone computations
We show that strong-enough lower bounds on monotone arithmetic circuits or the nonnegative rank of a matrix imply unconditional lower bounds in...
-
Learning with cone-based geometric models and orthologics
Recent approaches for knowledge-graph embeddings aim at connecting quantitative data structures used in machine learning to the qualitative...
-
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives
Markov decision processes can be viewed as transformers of probability distributions. While this view is useful from a practical standpoint to reason...
-
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP...
-
Graphical Piecewise-Linear Algebra
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces...
-
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
We investigate the complexity of finding small branch-and-bound trees using variable disjunctions. We first show that it is not possible to...
-
Robustness Analysis of Continuous-Depth Models with Lagrangian Techniques
This paper presents, in a unified fashion, deterministic as well as statistical Lagrangian-verification techniques. They formally quantify the...
-
Polymake.jl: A New Interface to polymake
We present the Julia interface to polymake, a software for research in polyhedral geometry. We describe the technical design and how the...
-
Relaxing the strong triadic closure problem for edge strength inference
Social networks often provide only a binary perspective on social ties: two individuals are either connected or not. While sometimes external...
