
Extracting Formal Models from Normative Texts
We are concerned with the analysis of normative texts  documents based ...
read it

A Multilingual FrameNetbased Grammar and Lexicon for Controlled Natural Language
Berkeley FrameNet is a lexicosemantic resource for English based on the...
read it

Understanding Quantum Algorithms via Query Complexity
Query complexity is a model of computation in which we have to compute a...
read it

Quantum versus Classical Online Algorithms with Advice and Logarithmic Space
In this paper, we consider online algorithms. Typically the model is inv...
read it

Quadratically Tight Relations for Randomized Query Complexity
Let f:{0,1}^n →{0,1} be a Boolean function. The certificate complexity C...
read it

Adaptive Lower Bound for Testing Monotonicity on the Line
In the property testing model, the task is to distinguish objects posses...
read it

Probabilistic verification of all languages
We present three protocols for verifying all languages: (i) For any unar...
read it

Postselecting probabilistic finite state recognizers and verifiers
In this paper, we investigate the computational and verification power o...
read it

Multilingual Clustering of Streaming News
Clustering news across languages enables efficient media monitoring by a...
read it

Upperbounds on the probability of finding marked connected components using quantum walks
Finding a marked vertex in a graph can be a complicated task when using ...
read it

The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
It is known that 2state binary and 3state unary probabilistic finite a...
read it

Testing convexity of functions over finite domains
We establish new upper and lower bounds on the number of queries require...
read it

Lackadaisical quantum walks on triangular and honeycomb 2D grids
In the typical model, a discretetime coined quantum walk search has the...
read it

Affine automata verifiers
We initiate the study of the verification power of AfAs as part of Arthu...
read it

Quantum Logarithmic Space and Postselection
Postselection, the power of discarding all runs of a computation in whi...
read it
University of Latvia
bakalaura, maÄ£istra, doktora un profesionÄlÄs studiju programmas, zinÄtniskÄ pÄtniecÄ«ba, aktÄ«va studentu un pasniedzÄju sabiedriskÄ dzÄ«ve