Search Results - ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation
-
1
Authors: et al.
Contributors: et al.
Source: Discrete Models of Complex Systems ; https://univ-cotedazur.hal.science/hal-01741411 ; Discrete Models of Complex Systems, Mar 2018, Orléans, France
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Availability: https://univ-cotedazur.hal.science/hal-01741411
-
2
Authors: et al.
Contributors: et al.
Source: Reversibility and Universality ; https://univ-cotedazur.hal.science/hal-01741396 ; Reversibility and Universality, 2018
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.2: Classes defined by resource-bounded automata, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Availability: https://univ-cotedazur.hal.science/hal-01741396
-
3
Authors: et al.
Contributors: et al.
Source: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
https://hal.inria.fr/inria-00359792
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.385-396Subject Terms: Online Algorithms, Competitive Analysis, Storage Management, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]
Relation: inria-00359792; https://hal.inria.fr/inria-00359792; https://hal.inria.fr/inria-00359792/document; https://hal.inria.fr/inria-00359792/file/32-englert.pdf
-
4
Authors: et al.
Contributors: et al.
Source: ACM Transactions on Computational Logic. 19:1-24
Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Computer Science - Logic in Computer Science, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.3: Decision problems, recursive sets), 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.1: Classes defined by grammars or automata (e.g, resource-bounded), 03D15, 68Q15, 68Q55, 03D05, 03B47, 03F52, push-down, FOS: Mathematics, finite, 0101 mathematics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, context-free languages, regular sets, F.3.2, F.4.1, F.4.3, F.1.3, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics - Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, Logic in Computer Science (cs.LO), [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Computer Science - Computational Complexity, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.0: Alternation and nondeterminism, Logic (math.LO)
-
5
Authors: et al.
Contributors: et al.
Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation
-
6
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, C. 1.2 [Processors Architectures, Multiple Data Stream Architec- tures-parallel processors, F. 1.2 [Computation by Abstract Devices, Modes of Computation-paruN ism, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Prob- lems-computation on discrete structures General Terms, Algorithms, Theory, Verification Additional Key Words and Phrases, Addition, computational complexity, lower bounds, parallel random access machine, parity
File Description: application/pdf
-
7
Authors: et al.
Contributors: et al.
Subject Terms: Consensus, Byzantine process, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Optimal resilience, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.3: Network operating systems, ACM: D.: Software/D.1: PROGRAMMING TECHNIQUES/D.1.3: Concurrent Programming, Broadcast abstraction, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Signature-free algorithm, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO.INFO-DC]Computer Science [cs]/Distributed, Randomized algorithm, Distributed algorithm, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, Parallel, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.3: Relations between models, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, Asynchronous message-passing system, Simplicity, and Cluster Computing [cs.DC], [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.0: Alternation and nondeterminism, [INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR], Common coin
File Description: application/pdf
-
8
Authors: et al.
Contributors: et al.
Source: Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Subject Terms: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Logic, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], mathematics - dynamical systems, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, 0102 computer and information sciences, Dynamical Systems (math.DS), 01 natural sciences, computer science - logic in computer science, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, FOS: Mathematics, mathematics - logic, Mathematics - Dynamical Systems, 0101 mathematics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, mathematics - probability, BC1-199, Probability (math.PR), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], QA75.5-76.95, Mathematics - Logic, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, Logic in Computer Science (cs.LO), [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], Electronic computers. Computer science, Logic (math.LO), Mathematics - Probability
File Description: application/pdf
-
9
Authors: et al.
Contributors: et al.
Source: Leibniz International Proceedings in Informatics (LIPIcs) ; CONCUR 2017 - 28th International Conference on Concurrency Theory ; https://inria.hal.science/hal-01639845 ; CONCUR 2017 - 28th International Conference on Concurrency Theory, Roland Meyer; Uwe Nestmann, Sep 2017, Berlin, Germany. pp.1-17, ⟨10.4230/LIPIcs.CONCUR.2017.30⟩
Subject Terms: Reversible Computation, Keywords and phrases Communication-centric Systems, F33 Type Structure, Multiparty Session Types, 1998 ACM Subject Classification F12 Parallelism and Concurrency, Process Calculi, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
10
Authors: et al.
Contributors: et al.
Source: http://tocl.acm.org/accepted/TOCL-2010-0004.pdf.
Subject Terms: Categories and Subject Descriptors, B.6.3 [Logic Design, Design Aids—Automatic Synthesis, D.2.4 [Software Engineering, Software/Program Verification—Formal Methods, B.4.3 [Input/Output and Data Communication, Interconnections (Subsystems—Asynchronous/Synchronous Operations, F.1.2 [Computation by Abstract Devices, Modes of Computation—Parallelism and Concurrency, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computability Theory, temporal logic General Terms, Algorithms, Theory, Verification Additional Key Words and Phrases, Church’s problem, Distributed Systems, Synthesis, Semi-commutations ACM Reference Format
File Description: application/pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3770
http://tocl.acm.org/accepted/TOCL-2010-0004.pdf -
11
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02458358 ; 2020.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.00009; hal-02458358; https://hal.archives-ouvertes.fr/hal-02458358; https://hal.archives-ouvertes.fr/hal-02458358/document; https://hal.archives-ouvertes.fr/hal-02458358/file/Prob-ICC-short.pdf; ARXIV: 2002.00009
-
12
Authors: et al.
Contributors: et al.
Source: https://inria.hal.science/inria-00261376 ; [Research Report] RR-6476, INRIA. 2008, pp.43.
Subject Terms: DAG, stochastic scheduling, robustness, makespan, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
13
Authors: et al.
Contributors: et al.
Source: https://hal.science/hal-02487667 ; 2021.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.3: Relations among complexity classes, ACM: G.: Mathematics of Computing, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.10888; ARXIV: 2002.10888
-
14
Authors: et al.
Contributors: et al.
Source: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-01140262 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, pp.37. ⟨10.2168/LMCS-2014-994⟩ ; http://lmcs-online.org/
Subject Terms: Probabilistic Automata, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1504.04136; hal-01140262; https://hal.archives-ouvertes.fr/hal-01140262; https://hal.archives-ouvertes.fr/hal-01140262/document; https://hal.archives-ouvertes.fr/hal-01140262/file/main.pdf; ARXIV: 1504.04136
-
15
Authors: et al.
Contributors: et al.
Source: ISSN: 1942-3454.
Subject Terms: Branching programs, Binary formulas, Limited nondeterminism, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/1608.01932; ARXIV: 1608.01932
-
16
Authors: et al.
Contributors: et al.
Source: Int. W. on Principles and Practice of Consistency for Distributed Data (PaPoC) ; https://inria.hal.science/hal-01242700 ; Int. W. on Principles and Practice of Consistency for Distributed Data (PaPoC), ACM Sigops / EuroSys, Apr 2016, London, United Kingdom. pp.7, ⟨10.1145/2911151.2911157⟩ ; http://www2.ucsc.edu/papoc-2016/
Subject Terms: CRDTs, eventual consistency, replicated data types, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]
Subject Geographic: London, United Kingdom
Relation: info:eu-repo/grantAgreement/EC/FP7/609551/EU/Large-scale computation without synchronisation/SYNCFREE
Availability: https://inria.hal.science/hal-01242700
https://inria.hal.science/hal-01242700v1/document
https://inria.hal.science/hal-01242700v1/file/mvreg_arXiv.pdf
https://inria.hal.science/hal-01242700v1/file/bug-run%20%281%29.pdf
https://inria.hal.science/hal-01242700v1/file/bug-run.pdf
https://inria.hal.science/hal-01242700v1/file/lww-run.pdf
https://inria.hal.science/hal-01242700v1/file/lww-run2%20%281%29.pdf
https://inria.hal.science/hal-01242700v1/file/lww-run2.pdf
https://doi.org/10.1145/2911151.2911157 -
17
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.1.2 [Computation by Abstract Devices, Modes of Computation— Probabilistic computation General Terms, Theory, Algorithms Additional Key Words and Phrases, Randomness, extractors, Kolmogorov complexity ACM Reference Format
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.8545; http://cse.unl.edu/~vinod/papers/hpv_toct12.pdf
-
18
Authors: et al.
Contributors: et al.
Subject Terms: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, K.4.4 [Computers and Society, Electronic Commerce, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation, J.4 [Social and Behavioral Sciences, Economics General Terms, theory, algorithms, economics. Keywords, mechanism design, truthful mechanisms, single-parameter auctions, multi-armed bandit problem, regret, online learning
File Description: application/pdf
-
19
Authors:
Contributors:
Source: http://arxiv.org/pdf/0907.3986v1.pdf.
Subject Terms: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation—Online computation General Terms, Algorithms, Theory. Keywords, online learning, multi-armed bandits, contextual bandits, regret minimization, metric spaces
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.2364; http://arxiv.org/pdf/0907.3986v1.pdf
-
20
Authors: et al.
Contributors: et al.
Source: https://hal.archives-ouvertes.fr/hal-02487667 ; 2020.
Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.3: Parallelism and concurrency, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.3: Relations among complexity classes, ACM: G.: Mathematics of Computing, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.10888; hal-02487667; https://hal.archives-ouvertes.fr/hal-02487667; https://hal.archives-ouvertes.fr/hal-02487667/document; https://hal.archives-ouvertes.fr/hal-02487667/file/versionHAL.pdf; ARXIV: 2002.10888
Nájsť tento článok vo Web of Science 
Full Text Finder