Motivated by understanding the power of quantum computation with restricted number of
qubits, we give two complete characterizations of unitary quantum space bounded …

The Lopsided Lovász Local Lemma (LLLL) is a powerful probabilistic principle that has
been used in a variety of combinatorial constructions. While this principle began as a …

In this paper, we give a silent self-stabilizing algorithm for constructing a k-clustering of any
asynchronous connected network with unique IDs. Our algorithm stabilizes in O (n) rounds …

In many data management scenarios the data is subject to frequent modifications, and it is
often essential to react to those changes quickly. When a train is canceled on short notice …

Catalytic computation was defined by Buhrman et al.(STOC, 2014). It addresses the
question whether memory, that already stores some unknown data that should be preserved …

Applications such as disaster and emergency management require near-instant access to
data from different sources to make decisions and take actions rapidly. Although previous …

In the last two decades visibly pushdown languages (VPLs) have found many applications
in diverse areas such as formal verification and processing of XML documents. Recently …

Algorithmic metatheorems state that if a problem can be described in a certain logic and the
inputs are structured in a certain way, then the problem can be solved with a certain amount …

We present an efficient parallel algorithm for the general Monotone Circuit Value Problem
(MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm …

In this thesis, we present several results along two different lines of research. The first part
concerns the study of position-based quantum cryptography, a topic in quantum …