zweidimensionales bewegtes Bild
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
- Location
-
Hannover TIB
- Extent
-
34MB, 00:21:16:06 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Xu, Yinzhan
Sandlund, Bryce
- DOI
-
10.5446/49403
- 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
- Xu, Yinzhan
- Sandlund, Bryce
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Faster Random k-CNF Satisfiability: Q/A Session B - Paper B3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
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
Faster Random k-CNF Satisfiability: Q/A Session B - Paper B3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
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
Faster Random k-CNF Satisfiability: Q/A Session B - Paper B3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
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