DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5...7
Hits 1 – 20 of 126

1
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
BASE
Show details
2
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
3
Between Deterministic and Nondeterministic Quantitative Automata (Invited Talk) ...
Boker, Udi. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022
BASE
Show details
4
Multiplicative Linear Logic from Logic Programs and Tilings
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
BASE
Show details
5
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
6
Verification of Program Transformations with Inductive Refinement Types
In: ISSN: 1049-331X ; ACM Transactions on Software Engineering and Methodology ; https://hal.inria.fr/hal-03518825 ; ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2021, 30 (1), pp.1-33. ⟨10.1145/3409805⟩ (2021)
BASE
Show details
7
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
8
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
9
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
10
Parametric updates in parametric timed automata
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-03340905 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, 17 (2), pp.13:1-13:67. ⟨10.23638/LMCS-17(2:13)2021⟩ ; https://lmcs.episciences.org/7470 (2021)
BASE
Show details
11
A Computational Simulation of Children’s Language Acquisition (Crazy New Idea) ...
Ambridge, Ben. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
12
Digital Currencies as Types (Invited Talk) ...
Zakian, Timothy A. K.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
13
Efficiently Testing Simon’s Congruence ...
Gawrychowski, Paweł; Kosche, Maria; Koß, Tore. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
14
The Edit Distance to k-Subsequence Universality ...
Day, Joel D.; Fleischmann, Pamela; Kosche, Maria. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
15
Faster Algorithms for Longest Common Substring ...
Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
16
A Compact Index for Cartesian Tree Matching ...
Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
17
Weighted Ancestors in Suffix Trees Revisited ...
Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
18
Constructing Strings Avoiding Forbidden Substrings ...
Bernardini, Giulia; Marchetti-Spaccamela, Alberto; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
19
The k-Mappability Problem Revisited ...
Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
20
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes ...
Bozzelli, Laura; Montanari, Angelo; Peron, Adriano. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details

Page: 1 2 3 4 5...7

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
126
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern