Semigroups of Terms, Tree Languages, Menger Algebra of <i>n</i>-Ary Functions and Their Embedding Theorems by Thodsaporn Kumduang, Sorasak Leeratanavalee

“…The concepts of terms and tree languages are significant tools for the development of research works in both universal algebra and theoretical computer science. In this paper, we establish a strong connection between semigroups of terms and tree languages, which provides the tools for studying monomorphisms between terms and generalized hypersubstitutions. …”
Get full text

A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes by Till Tantau

Get full text

An elementary review on basic principles and developments of qubits for quantum computing by Eunmi Chae, Joonhee Choi, Junki Kim

“…Due to its rapid development, quantum computing has attracted considerable attention as a core technology for the next generation and has demonstrated its potential in simulations of exotic materials, molecular structures, and theoretical computer science. To achieve fully error-corrected quantum computers, building a logical qubit from multiple physical qubits is crucial. …”
Get full text

Distance-Locally Disconnected Graphs by Miller Mirka, Ryan Joe, Ryjáček Zdeněk

Get full text

On computational properties of gene assembly in ciliates by Vladimir Rogojin

“…This biological process is of high interest from the computational and mathematical points of view due to its close analogy with such concepts and notions in theoretical computer science as permutation and linked list sorting and string rewriting. …”
Get full text

SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM by Uroš Čibej, Jurij MIHELIČ

“…This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem. …”
Get full text

The Evolution of Financial Integration on Selected European Stock Markets: a Dynamic Principal Component Approach by Elżbieta Majewska, Joanna Olbryś

Get full text

24.244 Modal Logic, Fall 2009 by Stalnaker, Robert

“…Course material applies to philosophy, theoretical computer science, and linguistics.…”
Get full text

A simple proof that the (n2 − 1)-puzzle is hard by Demaine, Erik D, Rudoy, Mikhail

Get full text

Probabilistically checkable proofs by Sudan, Madhu

“…That certainly seems impossible, no matter how much reviewers of mathematical papers may wish for this. But theoretical computer science has shown that we can get very close to this objective! …”
Get full text

The taming of the semi-linear set by Chistikov, D, Haase, C

“…Semi-linear sets, which are rational subsets of the monoid (Z^d,+), have numerous applications in theoretical computer science. Although semi-linear sets are usually given implicitly, by formulas in Presburger arithmetic or by other means, the effect of Boolean operations on semi-linear sets in terms of the size of description has primarily been studied for explicit representations. …”

On bonded sequential and parallel deletion systems by Yosman, A. F., Fong, W. H., Hassim, H. I. M.

“…An area of interest in this field involves the combination of theoretical computer science and molecular biology. By using the concepts of string generation and molecular structure of DNA, formal language theory can be used to model the behavior of DNA molecules, known as DNA computation models. …”

Recent Advances in Positive-Instance Driven Graph Searching by Max Bannach, Sebastian Berndt

Get full text

De la computabilidad a la hipercomputabilidad by Enrique ALONSO

“…</p><p>ABSTRACT: This work analyzes the state of the art in theoretical computer science from a philosophical point of view especially directed to non expert readers. …”
Get full text

X-COPTER STUDIO by Michal Koutný, Ondrej Pilát, Patrik Černý, Maroš Kasinec, Roman Barták

Get full text

Addressing Machines as models of lambda-calculus by Giuseppe Della Penna, Benedetto Intrigila, Giulio Manzonetto

“…Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. …”
Get full text

Hypercontractivity on the symmetric group by Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer

“…The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. So far, variants of this inequality have been proved mainly for product spaces, which raises the question of whether analogous results hold over non-product domains.…”
Get full text

An Abstraction Technique for Verifying Shared-Memory Concurrency by Wytse Oortwijn, Dilian Gurov, Marieke Huisman

Get full text

An exponential lower bound on the complexity of regularization paths by Bernd Gärtner, Martin Jaggi, Clément Maria

Get full text

What’s behind meaning? by Alberto Peruzzi

“…On one side the paper argues that the resources provided by the development of mathematical logic, theoretical computer science, cognitive psychology, and general linguistics in the 20th Century, however indispensable to investigate the structure of language, rely on the existence of end products in the morphogenesis of meaning. …”
Get full text