- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Tight Bounds for Double Coverage Against Weak Adversaries ; day:2 ; month:9 ; year:2016 ; pages:1-17
Theory of computing systems ; (2.9.2016), 1-17
- Urheber
-
Bansal, Nikhil
- Beteiligte Personen und Organisationen
-
Eliáš, Marek
Jeż, Łukasz
Koumoutsos, Grigorios
Pruhs, Kirk
SpringerLink (Online service)
- DOI
-
10.1007/s00224-016-9703-3
- URN
-
urn:nbn:de:1111-2016093012816
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bansal, Nikhil
- Eliáš, Marek
- Jeż, Łukasz
- Koumoutsos, Grigorios
- Pruhs, Kirk
- SpringerLink (Online service)
Ähnliche Objekte (12)
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
A Tight Lower Bound for Planar Steiner Orientation
Weak gravity bounds in asymptotic string compactifications
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
A Tight Lower Bound for Planar Steiner Orientation
Weak gravity bounds in asymptotic string compactifications
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
A Tight Lower Bound for Planar Steiner Orientation
Weak gravity bounds in asymptotic string compactifications
Tight multi-user security bound of DbHtS
Tight Bounds for Online Coloring of Basic Graph Classes
Tight bounds on the descriptional complexity of regular expressions
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
A tight lower bound for semi-synchronous collaborative grid exploration
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting