zweidimensionales bewegtes Bild
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
- Standort
-
Hannover TIB
- Umfang
-
36MB, 00:20:32:25 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 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
-
Hu, Lunjia
Ma, Weijun
Bassilakis, Andrew
Drucker, Andrew
Göös, Mika
Tan, Li-Yang
- DOI
-
10.5446/49402
- 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
- Hu, Lunjia
- Ma, Weijun
- Bassilakis, Andrew
- Drucker, Andrew
- Göös, Mika
- Tan, Li-Yang
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
On the Complexity of Temporal Query Answering
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Query processing on low-energy many-core processors
On the Query Complexity of Black-Peg AB-Mastermind
On the query complexity of Black-Peg AB-mastermind
The exact query complexity of yes-no permutation mastermind
The Exact Query Complexity of Yes-No Permutation Mastermind
Hardware-conscious query processing for the many-core era
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Space-efficient Query Evaluation over Probabilistic Event Streams: Q/A Session C - Paper C5.F
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
On the Complexity of Temporal Query Answering
Qa- [Qa-]
Query processing on low-energy many-core processors
On the Query Complexity of Black-Peg AB-Mastermind
On the query complexity of Black-Peg AB-mastermind
The exact query complexity of yes-no permutation mastermind
The Exact Query Complexity of Yes-No Permutation Mastermind
Hardware-conscious query processing for the many-core era
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Space-efficient Query Evaluation over Probabilistic Event Streams: Q/A Session C - Paper C5.F
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
On the Complexity of Temporal Query Answering
Qa- [Qa-]
Query processing on low-energy many-core processors
On the Query Complexity of Black-Peg AB-Mastermind
On the query complexity of Black-Peg AB-mastermind
The exact query complexity of yes-no permutation mastermind
The Exact Query Complexity of Yes-No Permutation Mastermind
Hardware-conscious query processing for the many-core era
CROSSING Winter School 2016: Query Complexity and Lower Bounds (1)
CROSSING Winter School 2016: Query Complexity and Lower Bounds (2)
Space-efficient Query Evaluation over Probabilistic Event Streams: Q/A Session C - Paper C5.F