The Thermodynamic Arrow-of-time and Quantum Mechanics by Maccone, Lorenzo

Get full text

A lattice-based group signature scheme with verifier-local revocation by Ling, San, Nguyen, Khoa, Roux-Langlois, Adeline, Wang, Huaxiong

Get full text

Tight approximation bounds for combinatorial frugal coverage algorithms by Caragiannis, I, Kaklamanis, C, Kyropoulou, M

“…The problem was introduced and studied by Huang and Svitkina (Proceedings of the 29th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS), pp. 227–238, 2009) due to its connections to the donation center location problem. …”

Cross-Frequency Slow Oscillation–Spindle Coupling in a Biophysically Realistic Thalamocortical Neural Mass Model by Nikola Jajcay, Nikola Jajcay, Nikola Jajcay, Caglar Cakan, Caglar Cakan, Klaus Obermayer, Klaus Obermayer

Get full text

Dynamic construction of pan-genome subgraphs by Dede Kadir, Ohlebusch Enno

Get full text

Quantized rewiring: hardware-aware training of sparse deep neural networks by Horst Petschenig, Robert Legenstein

Get full text

Threshold changeable secret sharing schemes revisited by Zhang, Zhifang, Chee, Yeow Meng, Ling, San, Liu, Mulan, Wang, Huaxiong

Get full text
Get full text

Security management via Z and CSP by Simpson, A, Davies, J, Woodcock, J

Lattice-based group signatures : achieving full dynamicity (and deniability) with ease by Ling, San, Nguyen, Khoa, Wang, Huaxiong, Xu, Yanhong

Get full text

Conjunctive Query Answering in the Description Logic SHIQ by Glimm, B, Horrocks, I, Lutz, C, Sattler, U

Results and Analysis of SyGuS-Comp'15 by Alur, Rajeev, Fisman, Dana, Singh, Rishabh, Solar Lezama, Armando

Get full text
Get full text

Efficient computations of ℓ[subscript 1] and ℓ[subscript ∞] rearrangement distances by Amir, Amihood, Aumann, Yonatan, Indyk, Piotr, Levy, Avivit, Porat, Ely

Get full text
Get full text

Lattice-based FHE as secure as PKE by Brakerski, Zvika, Vaikuntanathan, Vinod

Get full text
Get full text

Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue) by Jesper Jansson

“…This is a Special Issue of the open-access journal <i>Algorithms</i> consisting of surveys in theoretical computer science [...]…”
Get full text

The Boolean zeta function by Algirdas Javtokas

“… This paper provides analysis on Dirichlet series with an coefficients obtained from MAJm (x1,..., xm) function known in theoretical computer science. …”
Get full text

On the Category of Partial Bijections by Emil Schwab

“…Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an inverse-Baer*-category with closed projections and in which the idempotents split is an exact category. …”
Get full text

LOGIC, PRIMES AND COMPUTATION: A TALE OF UNREST by STEFANO LEONESI, CARLO TOFFALORI

“… The early connections between Mathematical Logic and Computer Science date back to the thirties and to the birth itself of modern Theoretical Computer Science, and concern computability. This survey wishes to emphasize how alive and fruitful this relationship has been since then, and still is. …”
Get full text

Some Implications of Complexity Theory on Pseudo-random Bit Generation by Trilling, Stephen

“…A recent area of interest in theoretical computer science has been in the construction of so-called pseudo-random bit generators. …”
Get full text

The tiny effects of respiratory masks on physiological, subjective, and behavioral measures under mental load in a randomized controlled trial by Robert P. Spang, Kerstin Pieper

Get full text

Linear Encodings of Bounded LTL Model Checking by Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, Viktor Schuppan

Get full text