zweidimensionales bewegtes Bild
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
- Standort
-
Hannover TIB
- Umfang
-
45MB, 00:22:50:06 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Mathur, Umang
Pavlogiannis, Andreas
Viswanathan, Mahesh
- DOI
-
10.5446/49318
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Mathur, Umang
- Pavlogiannis, Andreas
- Viswanathan, Mahesh
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
Modal Logics with Composition on Finite Forests: Expressivity and Complexity: Q/A Session A - Paper A6.E
The Complexity of Bounded Context Switching with Dynamic Thread Creation: Q/A Session D - Paper D4.B
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
Modal Logics with Composition on Finite Forests: Expressivity and Complexity: Q/A Session A - Paper A6.E
The Complexity of Bounded Context Switching with Dynamic Thread Creation: Q/A Session D - Paper D4.B
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
Modal Logics with Composition on Finite Forests: Expressivity and Complexity: Q/A Session A - Paper A6.E