Qualitative constraint calculi are representation formalisms that allow for efficient reasoning about spatial and temporal information. Many of the calculi discussed in the field of Qualitative Spatial and Temporal Reasoning can be defined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to a new formalism in which one can repres...

A graph G = (V,E) is called (k, l)-full if G contains a subgraph H = (V, F ) of k|V |− l edges such that, for any non-empty F ′ ⊆ F , |F ′| ≤ k|V (F ′)| − l holds. Here, V (F ) denotes the set of vertices incident to F . It is known that the family of edge sets of (k, l)-full graphs forms a family of matroid, known as the sparsity matroid of G. In this paper, we give a constant-time approximati...

This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2 security level, this paper achieves a reciprocal decryption throughput of just 60493 cycles (plus cipher cost etc.) on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast root computation, a transposed additive FFT fo...

Weighted minwise hashing (WMH) is one of the fundamental subroutine, required by many celebrated approximation algorithms, commonly adopted in industrial practice for large scale-search and learning. The resource bottleneck of the algorithms is the computation of multiple (typically a few hundreds to thousands) independent hashes of the data. The fastest hashing algorithm is by Ioffe (Ioffe, 20...

Going back to the seminal paper [FSS84] by Furst, Saxe, and Sipser, analogues between polynomial time classes and constant depth circuit classes have been considered in a number of papers. Oracles separating polynomial time classes have been obtained by diagonalization making essential use of lower bounds for circuit classes. In this note we show how separating oracles can be obtained uniformly...

This has been quite an exciting summer for computational complexity. The 15th Conference on Computational Complexity held July 4-7 in Florence was a great success. We had many interesting talks and a wonderful invited talks and tutorials by Paul Beame, Luca Trevisan and Russell Impagliazzo. Preparations are underway for the 16th Conference next summer in Chicago. The Institute of Advanced Studi...

We propose to use the dominant time constant of a resistor-capacitor (RC) circuit as a measure of the signal propagation delay through the circuit. We show that the dominant time constant is a quasiconvex function of the conductances and capacitances, and use this property to cast several interesting design problems as convex optimization problems, speci cally, semide nite programs (SDPs). For ...

Applications for the manipulation of molecular structures are usually computationally intensive. Problems like protein docking or ab-initio protein folding need to frequently determine if two atoms in the structure collide. Therefore, an efficient algorithm for this problem, usually referred as clash detection, can greatly improve the application efficiency. This work focus mainly on the ab-ini...

Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key was O( 1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Ko...