Filters








6 Hits in 5.1 sec

Optimal Dislocation with Persistent Errors in Subquadratic Time

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2019 Theory of Computing Systems  
In this work we present the first subquadratic time algorithm with optimal maximum dislocation: Our algorithm runs in O(N 3/2 ) time and guarantees O(log N ) maximum dislocation with high probability.  ...  We study the problem of sorting N elements in presence of persistent errors in comparisons: In this classical model, each comparison between two elements is wrong independently with some probability p,  ...  S TA C S 2 0 1 8 36:12 Optimal Dislocation with Persistent Errors in Subquadratic Time 8 . Insert s0 in S (4) using Algorithm 4 to obtain S (5) . Return S (5) .  ... 
doi:10.1007/s00224-019-09957-5 fatcat:ieaqqr3uwzdqdb37ej7pgohyzq

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)

Rolf Niedermeier, Brigitte Vallée
2020 Theory of Computing Systems  
The article Computing Hitting Set Kernels by AC 0 -Circuits by Max Bannach and Till Tantau presents for the first time kernels for the d-HITTINF ET problem that can be computed in constant parallel time  ...  Compared with the original extended abstracts, the articles have been extended with a description of the context, full proofs and additional results.  ...  The paper Optimal dislocation with persistent errors in subquadratic time by Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna studies the problem of sorting N elements in the presence  ... 
doi:10.1007/s00224-020-09969-6 fatcat:w43zrbitbvay7i7m5hom7odvdm

Optimal Sorting with Persistent Comparison Errors

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Michael Wagner
2019 European Symposium on Algorithms  
In order to achieve this optimality result, we solve two sub-problems in the persistent error comparisons model, and the respective methods have their own merits for further application.  ...  We consider the problem of sorting n elements in the case of persistent comparison errors.  ...  In particular, whether an optimal O(n log n) running time is sufficient for sorting with persistent comparison errors is a fundamental open question.  ... 
doi:10.4230/lipics.esa.2019.49 dblp:conf/esa/Geissmann0LP19 fatcat:naeyucsqqfdqjm3v6x7dasnwk4

Optimal Sorting with Persistent Comparison Errors [article]

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018 arXiv   pre-print
We consider the problem of sorting n elements in the case of persistent comparison errors.  ...  more difficult: a sequence with the best possible dislocation can be obtained in O(n n) time and, even without comparison errors, Ω(n n) time is necessary to guarantee such dislocation bounds.  ...  This naturally suggests the following question: What is the time complexity of sorting optimally with persistent errors?  ... 
arXiv:1804.07575v1 fatcat:mvdfjgtamjd6dlaqnu66en4bnu

Editors: Rolf Niedermeier and Brigitte Vallée; Article No. 36

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
licensed under Creative Commons License CC-BY 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)   unpublished
In this work we present the first subquadratic time algorithm with optimal maximum disloca-tion: Our algorithm runs in O(N 3/2) time and guarantees O(log N) maximum dislocation with high probability.  ...  We study the problem of sorting N elements in presence of persistent errors in comparisons: In this classical model, each comparison between two elements is wrong independently with some probability p,  ...  S TA C S 2 0 1 8 36:12 Optimal Dislocation with Persistent Errors in Subquadratic Time 8 . Insert s0 in S (4) using Algorithm 4 to obtain S (5) . Return S (5) .  ... 
fatcat:63l5wodqg5aejbdl2kpmnccnr4

Dagstuhl Reports, Volume 9, Issue 4, April 2019, Complete Issue [article]

2019
-Visual Computing in Materials Sciences Participants  ...  The hope is that real-time data collection and steering can bring the following benefits: 1) collect only relevant data; 2) instrument error correction; 3) optimize temporal and spatial resolution; 4)  ...  We describe the first sublinear approximate strictly subquadratic time algorithms for computing the geometric edit distance of two point sequences in constant dimensional Euclidean space.  ... 
doi:10.4230/dagrep.9.4 fatcat:7lr37ck6b5ekdogcndraqak7na