Publications related to Integer overflow

Overflow-free compute memories for edge AI acceleration

David Atienza Alonso, Giovanni Ansaloni, Alexandre Sébastien Julien Levisse, Marco Antonio Rios, Flavio Ponzina

Compute memories are memory arrays augmented with dedicated logic to support arithmetic. They support the efficient execution of data-centric computing patterns, such as those characterizing Artificial Intelligence (AI) algorithms. These architectures can ...

2023

On Verified Scala for STIX File System Embedded Code using Stainless

Viktor Kuncak, Jad Hamza

We present an approach for using formal methods in embedded systems and its evaluation on a case study. In our approach, the developers describe the system in a restricted subset of the high-level programming language Scala. We then use 1) a verification s ...

2022

Isolated ballistic non-abelian interface channel

Mitali Banerjee

The topological order of a quantum Hall state is mirrored by the gapless edge modes owing to bulk-edge correspondence. The state at the filling of ν = 5/2, predicted to host non-abelian anyons, supports a variety of edge modes (integer, fractional, neutral ...

2022

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021

Paths in pseudorandom graphs and applications

Van Thang Pham

Let G = (V, E) be an (n, d, lambda)-graph. In this paper, we give an asymptotically tight condition on the size of U subset of V such that the number of paths of length k in U is close to the expected number for arbitrary integer k >= 1. More precisely, we ...

CHARLES BABBAGE RES CTR2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

Integer overflow

Graph Chatbot

Chat with Graph Search

Overflow-free compute memories for edge AI acceleration

On Verified Scala for STIX File System Embedded Code using Stainless

Isolated ballistic non-abelian interface channel

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

A decomposition of multicorrelation sequences for commuting transformations along primes

Paths in pseudorandom graphs and applications

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

New Results in Integer and Lattice Programming

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Faster Algorithms for Integer Programs with Block Structure

Overflow-free compute memories for edge AI acceleration

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

A decomposition of multicorrelation sequences for commuting transformations along primes

Isolated ballistic non-abelian interface channel

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Paths in pseudorandom graphs and applications

Faster Algorithms for Integer Programs with Block Structure

New Results in Integer and Lattice Programming

On Verified Scala for STIX File System Embedded Code using Stainless