DE eng

Search in the Catalogues and Directories

Hits 1 – 4 of 4

1
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems ...
Le Gall, François; Seddighin, Saeed. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022
BASE
Show details
2
Streaming Periodicity with Mismatches
Grigorescu, Elena; Sadeqi Azer, Erfan; Zhou, Samson. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), 2017
BASE
Show details
3
Testing convexity properties of tree colorings
In: http://www.cs.technion.ac.il/~oyahalom/FischerYahalomConvexity.pdf
BASE
Show details
4
Testing convexity properties of tree colorings
In: http://www.cs.technion.ac.il/~eldar/Convexity-Algorithmica.pdf
BASE
Show details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
4
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern