zweidimensionales bewegtes Bild
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
- Location
-
Hannover TIB
- Extent
-
53MB, 00:26:04:01 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Gratzer, Daniel
Kavvos, G.A.
Nuyts, Andreas
Birkedal, Lars
- DOI
-
10.5446/49282
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Gratzer, Daniel
- Kavvos, G.A.
- Nuyts, Andreas
- Birkedal, Lars
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
Automata Learning: An Algebraic Approach: Q/A Session C - Paper C6.D
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Extensions of ω-Regular Languages: Q/A Session C - Paper C5.C
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
Automata Learning: An Algebraic Approach: Q/A Session C - Paper C6.D
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Extensions of ω-Regular Languages: Q/A Session C - Paper C5.C
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
Automata Learning: An Algebraic Approach: Q/A Session C - Paper C6.D
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A