Succinct arguments of knowledge are computationally-sound proofs of knowledge for NP
where the verifier's running time is independent of the time complexity of the NP …

The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-
one programs by the addition of new linear inequalities. We address the question of how …

Self-replication is one of the fundamental aspects of computing where a program or a
system may duplicate, evolve and mutate. Our point of view is that Kleene's (second) …

Abstract Probabilistically-Checkable Proofs (PCPs) form the algorithmic core that enables
succinct verification of long proofs/computations in many cryptographic constructions, such …

We consider piecewise linear embeddings of graphs in 3-space ℝ 3. Such an embedding is
linkless if every pair of disjoint cycles forms a trivial link (in the sense of knot theory) …

The autonomous guided robots are one of the greatest challenges for the robotics industry,
having a considerable impact for current research and future applications. Despite the level …

This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most
memory efficient linear time and space algorithm available to compute the string complexity …

From a programming perspective, Alan Turing's epochal 1936 paper on computable
functions introduced several new concepts, including what is today known as self …

Abstract O'Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data
structures using separation logic. They reason about the local parts of the memory accessed …

In this paper we propose a simulation of Work-Time framework algorithms on the recently
proposed Speculative Prefetcher and Evaluator (SPE) processor, using a pipelined …