PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Chan, T.-H. Hubert"

Author of the publication

copydeleteadd this publication to your clipboard
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.

, , , and . CoRR, (2019)

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.

T. Ertl

H. Binz

Hon. -Prof. Dr. -Ing. Hubert Ehbing University of Stuttgart

H. Bungartz

Dr. Hubert Keller University of Stuttgart

 

Other publications of authors with the same name

An incentive protocol for distributed dynamic P2P video-on-demand streaming., , and . ICCCN, page 1-6. IEEE, (2014)A PTAS for the Steiner Forest Problem in Doubling Metrics., , and . FOCS, page 810-819. IEEE Computer Society, (2016)Online Algorithms for Covering and Packing Problems with Convex Objectives., , , , , , , , , and 1 other author(s). FOCS, page 148-157. IEEE Computer Society, (2016)Metric Embeddings with Relaxed Guarantees., , , , , , , and . FOCS, page 83-100. IEEE Computer Society, (2005)Path ORAM: An Extremely Simple Oblivious RAM Protocol., , , , , , , and . J. ACM, 65 (4): 18:1-18:26 (2018)A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem., and . CoRR, (2013)Communication-Efficient Byzantine Agreement without Erasures., , and . CoRR, (2018)Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound., , and . IACR Cryptology ePrint Archive, (2014)Round Complexity of Byzantine Agreement, Revisited., , and . IACR Cryptology ePrint Archive, (2019)Capturing continuous data and answering aggregate queries in probabilistic XML., , , , and . ACM Trans. Database Syst., 36 (4): 25:1-25:45 (2011)