Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Kral, Karel"'
Autor:
Bursztein, Elie, Invernizzi, Luca, Král, Karel, Moghimi, Daniel, Picod, Jean-Michel, Zhang, Marina
To make cryptographic processors more resilient against side-channel attacks, engineers have developed various countermeasures. However, the effectiveness of these countermeasures is often uncertain, as it depends on the complex interplay between sof
Externí odkaz:
http://arxiv.org/abs/2306.07249
Autor:
Koucký, Michal, Král, Karel
We build boolean circuits of size $O(nm^2)$ and depth $O(\log(n) + m \log(m))$ for sorting $n$ integers each of $m$-bits. We build also circuits that sort $n$ integers each of $m$-bits according to their first $k$ bits that are of size $O(nmk(1 + \lo
Externí odkaz:
http://arxiv.org/abs/2102.10027
In this paper, we investigate the relative power of several conjectures that attracted recently lot of interest. We establish a connection between the Network Coding Conjecture (NCC) of Li and Li and several data structure like problems such as non-a
Externí odkaz:
http://arxiv.org/abs/2102.09294
Oblivious RAM (ORAM), introduced in the context of software protection by Goldreich and Ostrovsky [JACM'96], aims at obfuscating the memory access pattern induced by a RAM computation. Ideally, the memory access pattern of an ORAM should be independe
Externí odkaz:
http://arxiv.org/abs/1903.03385
Autor:
Gärtner, Bernd, Hansen, Thomas Dueholm, Hubáček, Pavel, Král, Karel, Mosaad, Hagar, Slívová, Veronika
We study the computational complexity of ARRIVAL, a zero-player game on $n$-vertex switch graphs introduced by Dohrau, G\"{a}rtner, Kohler, Matou\v{s}ek, and Welzl. They showed that the problem of deciding termination of this game is contained in $\t
Externí odkaz:
http://arxiv.org/abs/1802.07702
Publikováno v:
The Electronic Journal of Combinatorics 27 (2020), Issue 1, P1.16, 32 pp
An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph with $N$ v
Externí odkaz:
http://arxiv.org/abs/1310.7208
Publikováno v:
In Chemical Physics 1 June 2019 522:15-23
Autor:
Kral, Karel, Mensik, Miroslav
We present the theory of the electronic transfer and the optical properties of the quasi-zero dimensional quantum nanostructures, like quantum dots or the DNA molecule. The theory is based on the multiple scattering of the charge carriers in the quas
Externí odkaz:
http://arxiv.org/abs/1010.2090
Autor:
Kral, Karel
The effect of the up-conversion of the electronic energy level occupation was earlier interpreted as an implication of the multiple scattering of the charge carriers on the longitudinal optical phonons of the lattice vibrations in a small system like
Externí odkaz:
http://arxiv.org/abs/0807.0511
Autor:
Kral, Karel
Longitudinal optical phonons have been used to interpret the electronic energy relaxation in quantum dots and at the same time they served as a reservoir, with which the electronic subsystem is in contact. Such a phonon subsystem is expected to be pa
Externí odkaz:
http://arxiv.org/abs/cond-mat/0507167