Publication

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Publications associées (31)

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Geometrical Treatise on the Modelling of 3D Particulate Inclusion-Matrix Microstructures with an Application to Historical Stone Masonry Walls

Mahmoud S. M. Shaqfa

As historical stone masonry structures are vulnerable and prone to damage in earthquakes, investigating their structural integrity is important to reduce injuries and casualties while preserving their historical value. Stone masonry is a composite material ...

EPFL2022

Approximate CVPp in time 2(0.802n)

Friedrich Eisenbrand, Moritz Andreas Venzin

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Viktor Kuncak, Simon Guilloud

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

Formula Normalizations in Verification

Viktor Kuncak, Mario Bucev, Simon Guilloud, Dragana Milovancevic

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2023

An automatized method to determine latencies of motor-evoked potentials under physiological and pathophysiological conditions

Claudia Bigoni, Friedhelm Christoph Hummel, Takuya Morishita, Andéol Geoffroy Cadic-Melchior, Pierre Theopistos Vassiliadis

Background. Latencies of motor evoked potentials (MEPs) can provide insights into the motor neuronal pathways activated by transcranial magnetic stimulation. Notwithstanding its clinical relevance, accurate, unbiased methods to automatize latency detection ...

IOP Publishing Ltd2022

Rapid Scalable Distributed Power Flow with Open-Source Implementation

Yuning Jiang, Xinliang Dai

This paper introduces a new method for solving the distributed AC power flow (PF) problem by further exploiting the problem formulation. We propose a new variant of the ALADIN algorithm devised specifically for this type of problem. This new variant is cha ...

ELSEVIER2022

HyperLogLog: Exponentially Bad in Adversarial Settings

Mathilde Aliénor Raynal

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

IEEE COMPUTER SOC2022

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Novak Kaluderovic

Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms. This ...

EPFL2022

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Efficient geometric integrators for the linear and nonlinear time-dependent Schrödinger equation

Julien Roulet

Many physical and chemical reactions are driven by nonadiabatic processes, which imply the breakdown of the celebrated Born-Oppenheimer approximation. To understand these processes, experimentalists employ spectroscopic techniques. However, the obtained re ...

EPFL2022