Suchergebnisse - Theory of computation → Shared memory algorithms
-
1
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Parallel programming languages, 1. No poverty, Shared memory algorithms, 7. Clean energy, Computing methodologies, Theory of computation
Dateibeschreibung: application/pdf
-
2
Autoren: Li, Daniel Thomas
Schlagwörter: Computer science, graph algorithms, parallel algorithms, parallel bellman-ford, shared-memory algorithms, single source shortest paths, theory of computation
Dateibeschreibung: application/pdf
-
3
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ESA 2021
Schlagwörter: graph isomorphism, FOS: Computer and information sciences, Mathematics of computing → Graph algorithms, automorphism groups, parallel algorithms, Theory of computation → Shared memory algorithms, 02 engineering and technology, G.2.2, 68W20, 7. Clean energy, 01 natural sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, algorithm engineering
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2108.04590
https://drops.dagstuhl.de/opus/volltexte/2021/14587/pdf/LIPIcs-ESA-2021-6.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14587/
https://dblp.uni-trier.de/db/journals/corr/corr2108.html#abs-2108-04590
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.6 -
4
Autoren:
Schlagwörter: Theory of computation, Shared memory algorithms
Dateibeschreibung: application/pdf
Relation: Bashari, B., Jamadi, A., & Woelfel, P. (2023). Efficient Bounded Timestamping from Standard Synchronization Primitives [Report]. University of Calgary, Calgary, AB.; https://hdl.handle.net/1880/116565; https://dx.doi.org/10.11575/PRISM/dspace/41408
-
5
Autoren: RIZZARDI, Mariarosaria
Quelle: ACM Transactions on Mathematical Software. 44:1-23
Schlagwörter: 0101 mathematics, Mathematics of computing → Mathematical software performance, Theory of computation → Shared memory algorithms, Computing methodologies → Shared memory algorithms, 01 natural sciences, 0104 chemical sciences
-
6
Autoren: TAUBENFELD, GADI
Quelle: Journal of the ACM; Jul2022, Vol. 69 Issue 4, p1-30, 30p
Schlagwörter: BIOLOGICALLY inspired computing, MEMORY, MOLECULAR biology
-
7
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: Computer Science, Bounded Timestamping, Shared memory algorithms, Theory of computation
Dateibeschreibung: application/pdf
-
8
Autoren:
Weitere Verfasser:
Schlagwörter: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Theory of computation → Verification by model checking, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formal Languages and Automata Theory (cs.FL), Verification, Computer Science - Formal Languages and Automata Theory, Model Checking, Logic in Computer Science (cs.LO), Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Distributed algorithms, Parameterized models, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004, Theory of computation → Distributed algorithms, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
Dateibeschreibung: application/pdf
-
9
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Algorithms. 20:1-29
Schlagwörter: FOS: Computer and information sciences, online algorithms, online scheduling, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Online algorithms, 01 natural sciences, QA76, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), ddc:004, F.2.2, longest queue drop, buffer management
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2012.03906
http://wrap.warwick.ac.uk/154061/1/WRAP-breaking-barrier-2-competitiveness-longest-queue-drop-Englert-2021.pdf
https://research.utwente.nl/en/publications/39259b40-5ba5-487a-acd7-6302d453b99d
https://doi.org/10.4230/LIPIcs.ICALP.2021.17
https://drops.dagstuhl.de/opus/volltexte/2021/14086/pdf/LIPIcs-ICALP-2021-17.pdf/
https://drops.dagstuhl.de/opus/volltexte/2021/14086/
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-03906
https://arxiv.org/abs/2012.03906
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.17 -
10
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: FOS: Computer and information sciences, Lower Bounds, Theory of computation → Concurrency, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Shared-Memory, Leader Election, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
Dateibeschreibung: application/pdf
-
11
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Theoretical Computer Science. 886:13-26
Schlagwörter: Renaming, [SCCO.COMP] Cognitive science/Computer science, Shared-Memory, 0202 electrical engineering, electronic engineering, information engineering, Wait-Free, Mutual Exclusion, 0102 computer and information sciences, 02 engineering and technology, Concurrent algorithms, CCS CONCEPTS • Theory of computation → Distributed algorithms, 01 natural sciences, Assignment, Resource Allocation
Dateibeschreibung: application/pdf
Zugangs-URL: https://inria.hal.science/hal-01955902v1
https://hal.inria.fr/hal-01955902
https://dl.acm.org/doi/pdf/10.1145/3154273.3154303
https://doi.org/10.1145/3154273.3154303
https://dblp.uni-trier.de/db/conf/icdcn/icdcn2018.html#Delporte-Gallet18
https://dl.acm.org/doi/10.1145/3154273.3154303
https://hal.inria.fr/hal-01955902/document
https://dblp.uni-trier.de/db/journals/tcs/tcs886.html#Delporte-Gallet21
https://doi.org/10.1016/j.tcs.2021.06.040
https://www.sciencedirect.com/science/article/abs/pii/S0304397521003972 -
12
Autoren: et al.
Weitere Verfasser: et al.
Quelle: ACM Transactions on Embedded Computing Systems.
Schlagwörter: Memory peak, Sequential scheduling, Dataflow, SDF, [INFO]Computer Science [cs], Theory of computation → Streaming models, [INFO] Computer Science [cs], Task graph
Dateibeschreibung: application/pdf
-
13
Autoren:
Weitere Verfasser:
Quelle: Journal of Applied and Computational Topology. 8:1069-1098
Schlagwörter: combinatorial topology, FOS: Computer and information sciences, 0102 computer and information sciences, 02 engineering and technology, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing, [INFO] Computer Science [cs], 01 natural sciences, 7. Clean energy, Distributed computing, 102031 Theoretische Informatik, Computer Science - Distributed, Parallel, and Cluster Computing, 2012 ACM Subject Classification Theory of computation → Distributed algorithms Distributed computing distributed graph algorithms combinatorial topology, distributed graph algorithms, 102031 Theoretical computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), ddc:004
Dateibeschreibung: application/pdf
Zugangs-URL: http://arxiv.org/abs/2003.03255
https://ucrisportal.univie.ac.at/de/publications/8b94d914-dcb8-4035-a20f-89f5b9cfd352
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://doi.org/10.4230/LIPIcs.ICALP.2020.128
https://arxiv.org/pdf/2003.03255
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-03255
https://drops.dagstuhl.de/opus/volltexte/2020/12535/pdf/LIPIcs-ICALP-2020-128.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12535/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.128 -
14
Autoren:
Quelle: ACM Transactions on Mathematical Software. 49:1-25
Schlagwörter: 4613 Theory of computation, Technology, Science & Technology, Mathematics, Applied, bit plane truncation, TRUNCATION, Numerical & Computational Mathematics, 4606 Distributed computing and systems software, Computer Science, Software Engineering, tensors, ST-HOSVD, Data compression, 0806 Information Systems, Physical Sciences, Computer Science, Tucker decomposition, 4901 Applied mathematics, TENSOR, Mathematics, APPROXIMATION, 0802 Computation Theory and Mathematics
-
15
Autoren:
Weitere Verfasser:
Schlagwörter: wait-freedom, shared memory, strong linearizability, ABA, LL/SC, theory of computation
Dateibeschreibung: application/pdf
-
16
Autoren: et al.
Weitere Verfasser: et al.
Schlagwörter: FOS: Computer and information sciences, Impossibility proofs, Computing methodologies → Concurrent algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy, Concurrent Objects, Computer Science - Distributed, Parallel, and Cluster Computing, Computing methodologies → Distributed algorithms, Shared registers, Theory of computation → Distributed computing models, Theory of computation → Concurrent algorithms, Message-passing systems, 0202 electrical engineering, electronic engineering, information engineering, Distributed, Parallel, and Cluster Computing (cs.DC), Theory of computation → Distributed algorithms, ddc:004, Strong linearizability, BG simulation
Dateibeschreibung: application/pdf
-
17
Autoren: et al.
Quelle: IEEE Transactions on Pattern Analysis & Machine Intelligence; Oct2008, Vol. 30 Issue 10, p1800-1813, 14p
-
18
Autoren: De Schutter, Erik
Quelle: Frontiers in Neuroinformatics; 2023, p1-18, 18p
-
19
Autoren: et al.
Quelle: Journal of Chemical Theory and Computation.
Zugangs-URL: https://pubmed.ncbi.nlm.nih.gov/39221855
-
20
Autoren:
Quelle: ACM Transactions on Mathematical Software. 48(1)
Schlagwörter: 46 Information and Computing Sciences (for-2020), 4607 Graphics, Augmented Reality and Games (for-2020), Networking and Information Technology R&D (NITRD) (rcdc), Graph algorithm, GPU, sparse linear algebra, matrix multiply, cs.DC, cs.DC, cs.MS, 0802 Computation Theory and Mathematics (for), 0806 Information Systems (for), Numerical & Computational Mathematics (science-metrix), 4606 Distributed computing and systems software (for-2020), 4613 Theory of computation (for-2020), 4901 Applied mathematics (for-2020)
Dateibeschreibung: application/pdf
Nájsť tento článok vo Web of Science 
Full Text Finder 
Full Text