Výsledky vyhledávání - acm: f.: theory of computation/f.1: computation by abstracts devices/f.1.2: modes of computation~
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: Discrete Models of Complex Systems ; https://univ-cotedazur.hal.science/hal-01741411 ; Discrete Models of Complex Systems, Mar 2018, Orléans, France
Témata: 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]
Dostupnost: https://univ-cotedazur.hal.science/hal-01741411
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: Reversibility and Universality ; https://univ-cotedazur.hal.science/hal-01741396 ; Reversibility and Universality, 2018
Témata: 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]
Dostupnost: https://univ-cotedazur.hal.science/hal-01741396
-
3
Zdroj: Communications of the ACM; Jun85, Vol. 28 Issue 6, p648-650, 3p
-
4
Zdroj: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p
Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits
Reviews & Products: COMMUNICATIONS of the ACM (Periodical)
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: 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-396Témata: 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
-
6
Zdroj: Communications of the ACM; Jan1982, Vol. 25 Issue 1, p69-72, 4p
-
7
Zdroj: Communications of the ACM; Apr1982, Vol. 25 Issue 4, p286-291, 6p
-
8
Autoři: Forrest M. Anderson, Forrest
Témata: • Quantum Gravity • Spectral Geometry • Motivic Cohomology • Gauge Theory • Holographic Duality • AdS/CFT Correspondence • Black Hole Thermodynamics • Entanglement Entropy • Ricci Curvature • Einstein Field Equations • Tensor Networks • Quantum Information Theory • Differential Geometry • Topological Field Theory • Causal Structure • Lorentzian Manifolds • Finite Element Methods (FEM) • Numerical Relativity • Spectral Decomposition • Page Curve • Quantum Corrections • Cauchy Surface • Geodesic Termination • Boundary Encoding • Entropy Saturation • Cosmic Censorship Conjecture (CCC) I• MSC 83C57 — Black holes • MSC 81T30 — String and superstring theories, other extended objects • MSC 58J50 — Spectral geometry, spectral invariants • MSC 14F42 — Motivic sheaves, motivic cohomology • MSC 53C44 — Geometric evolution equations (Ricci flow, etc.) • MSC 83C45 — Quantization of the gravitational field • MSC 35Q75 — PDEs in connection with quantum mechanics • ACM G.1.8 — Partial Differential Equations • ACM G.4 — Mathematical Software • ACM F.1.2 — Modes of Computation (Quantum) • Bekenstein-Hawking Entropy • Ryu-Takayanagi Formula • Faulkner-Lewkowycz-Maldacena Corrections • Penrose Diagrams • Christodoulou Collapse Models • Ashtekar-Bojowald Quantum Gravity • Yang-Mills Mass Gap • Grothendieck Motives • Unified Field Theory (SMIP-Q2 Protocol) • Quantum Gravity Consistency Conjecture • Validator-Grade Simulation Protocols • Instructional Closure Framework • Cross-Platform Replication (Python, C++, Julia)
-
9
Autoři: Deloche, Maximin, 1817-1900, Auteur du texte
Zdroj: Bibliothèque nationale de France, département Littérature et art, 4-Z-2000 (5), 1891.
Relation: Notice d'ensemble : http://catalogue.bnf.fr/ark:/12148/cb32012052k; Notice du catalogue : http://catalogue.bnf.fr/ark:/12148/cb32012052k
Přístupová URL adresa: http://gallica.bnf.fr/ark:/12148/bpt6k6476942d
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: ACM Transactions on Computational Logic. 19:1-24
Témata: [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)
Přístupová URL adresa: http://arxiv.org/abs/1609.07895
https://dblp.uni-trier.de/db/journals/corr/corr1609.html#Seiller16a
https://doi.org/10.1145/3226594
https://dl.acm .org/doi/pdf/10.1145/3226594
https://hal.archives-ouvertes.fr/hal-01922445
http://doi.org/10.1145/3226594 -
11
Autoři: a další
Přispěvatelé: a další
Témata: [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
-
12
Autoři: a další
Přispěvatelé: a další
Témata: 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
Popis souboru: application/pdf
-
13
Autoři: a další
Přispěvatelé: a další
Zdroj: Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: http://arxiv.org/abs/2001.11906
https://doaj.org/article/fe749c58e7b14f36b2ed877c61a493b6 -
14
Autoři:
Přispěvatelé:
Témata: 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
Popis souboru: application/pdf
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: 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⟩
Témata: 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]
-
16
Autoři: a další
Přispěvatelé: a další
Zdroj: http://tocl.acm.org/accepted/TOCL-2010-0004.pdf.
Témata: 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
Popis souboru: application/pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3770
http://tocl.acm.org/accepted/TOCL-2010-0004.pdf -
17
Autoři: a další
Přispěvatelé: a další
Zdroj: https://inria.hal.science/inria-00261376 ; [Research Report] RR-6476, INRIA. 2008, pp.43.
Témata: 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]
-
18
Autoři: a další
Přispěvatelé: a další
Zdroj: 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/
Témata: 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]
Geografické téma: London, United Kingdom
Relation: info:eu-repo/grantAgreement/EC/FP7/609551/EU/Large-scale computation without synchronisation/SYNCFREE
Dostupnost: 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 -
19
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.archives-ouvertes.fr/hal-02458358 ; 2020.
Témata: 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
-
20
Autoři:
Přispěvatelé:
Témata: 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
Popis souboru: 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
Nájsť tento článok vo Web of Science 
Full Text Finder