Results 11 to 20 of about 31,167 (325)
Sorting and Searching in Faulty Memories
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Irène Finocchi +2 more
exaly +6 more sources
No sorting? better searching! [PDF]
ACM Transactions on Algorithms, 2004 Questions about order versus disorder in systems and models have been fascinating scientists over the years. In computer science, order is intimately related to sorting, commonly meant as the task of arranging keys in increasing or decreasing order with respect to an underlying total order relation.
FRANCESCHINI G, GROSSI, ROBERTO
core +4 more sources
An asymmetric approach to preserve common intervals while sorting by reversals
Algorithms for Molecular Biology, 2009 Background The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios.
Gautier Christian +2 more
doaj +3 more sources
Cybernetics and Information Technologies, 2020 The mountain hiking destinations become more popular as this is one of the possible ways to cope with workplace stress and to prevent burnout. In contrast to the tourist destinations, mountain hiking requires special attention due to the variety of ...
Dimitrova Zornitsa +4 more
doaj +2 more sources
The complexity of lexicographic sorting and searching [PDF]
Applications of Mathematics, 1979 An asymptotically optimal sorting algorithm that uses $\Theta (n(log\ n+k))$ component comparisons to lexicographically sort the set of $n$ $k$-tuples is presented. This sorting algorithm builds the static data structure - the so called optimal lexicographic search tree - in which it is possible to perform member searching for an unknown $k$-tuple in ...
Fredman, Michael L., Wiedermann, Juraj
openaire +3 more sources
Optimal resilient sorting and searching in the presence of memory faults
Theoretical Computer Science, 2009 We investigate the problem of reliable computation in the presence of faults that may arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting and searching in optimal time while tolerating the largest possible number ...
Irène Finocchi +2 more
exaly +2 more sources
Sorting and Searching Behind the Curtain
Financial Cryptography, 2015 We propose a framework where a user can outsource his data to a cloud server in an encrypted form and then request the server to perform computations on this data and sort the result. Sorting is achieved via a novel protocol where the server is assisted by a secure coprocessor that is required to have only minimal computational and memory resources ...
Baldimtsi, F., Ohrimenko, O.
openaire +3 more sources
ONTOLOGY OF COMPUTATIONAL EXPERIMENT ORGANIZATION IN PROBLEMS OF SEARCHING AND SORTING
Ìнформаційні технології в освіті, 2011 Ontologies are a key technology of semantic processing of knowledge. We examine a methodology of ontology’s usage for the organization of computational experiment in problems of searching and sorting in studies of the course "Basics of algorithms and ...
A. Spivakovsky, N. Osipova
doaj +1 more source
Sorting Visualizer: A Visual Journey Through Sorting Algorithms
Journal of Informatics Electrical and Electronics Engineering (JIEEE)This paper, which is based on the importance of sorting algorithms, will carefully compare the features of various algorithms, beginning with their work effectiveness, algorithm execution, introductory concepts, sorting styles, and other aspects, and ...
Shreya Singh
semanticscholar +3 more sources
Research Progress and Challenge of Programming by Examples [PDF]
Jisuanji kexue, 2022 Program synthesis means that the computer automatically constructs code that conforms to the specified grammar and user’s given specifications.Programming by examples is a kind of paradigm in program synthesis that takes input and output examples as the ...
YAN Qian-yu, LI Yi, PENG Xin
doaj +1 more source