( en | de | ru )

 

Disambiguation of "Brandt, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Enabling semantic access to static and streaming distributed data with Optique: demo

, , , , , , , , , , , , , , , , and . Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems, DEBS '16, Irvine, CA, USA, June 20 - 24, 2016, page 350–353. ACM, (2016)
DOI: 10.1145/2933267.2933290

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sebastian Brandt

Sebastian Brandt

Sebastian-Philipp Brandt

Jens Brandt

Multidimensional transcoding for adaptive video streaming. TU Braunschweig, (2009)

Olaf Brandt

 

Other publications of authors with the same name

A tight lower bound for semi-synchronous collaborative grid exploration., , and . Distributed Comput., 33 (6): 471-484 (2020)Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees., , , , , and . CoRR, (2022)Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs., , and . Pervasive Mob. Comput., (2017)Approximating Small Balanced Vertex Separators in Almost Linear Time., and . Algorithmica, 81 (10): 4070-4097 (2019)Distributed Lower Bounds for Ruling Sets., , and . FOCS, page 365-376. IEEE, (2020)Querying Log Data with Metric Temporal Logic., , , , and . J. Artif. Intell. Res., (2018)Wireless Evacuation on m Rays with k Searchers., , , and . SIROCCO, volume 10641 of Lecture Notes in Computer Science, page 140-157. Springer, (2017)Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory., , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 124-138. Springer, (2019)Approximating Small Balanced Vertex Separators in Almost Linear Time., and . WADS, volume 10389 of Lecture Notes in Computer Science, page 229-240. Springer, (2017)Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants., and . PODC, page 69-78. ACM, (2020)