Sorting Short Integers
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10438313" target="_blank" >RIV/00216208:11320/21:10438313 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.ICALP.2021.88" target="_blank" >https://doi.org/10.4230/LIPIcs.ICALP.2021.88</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.ICALP.2021.88" target="_blank" >10.4230/LIPIcs.ICALP.2021.88</a>
Alternative languages
Result language
angličtina
Original language name
Sorting Short Integers
Original language description
We build boolean circuits of size ????(nm2) and depth ????(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 ????(nmk (1 + log^*(n) - log^*(m))) and depth ????(log3(n)). This improves on the results of Asharov et al. [Asharov et al., 2021] and resolves some of their open questions.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
ISBN
978-3-95977-195-5
ISSN
1868-8969
e-ISSN
—
Number of pages
17
Pages from-to
1-17
Publisher name
Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
Place of publication
Dagstuhl, Germany
Event location
Glasgow, Scotland (Virtual Conference)
Event date
Jul 12, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—