E-LIB Suche - Ergebnisse für: Chan, T.-H. Hubert

1

Max-min greedy matching problem: Hardness for the adversary..:

Hubert Chan, T.-H. ; Tang, Zhihao Gavin ; Xue, Quan
Theoretical Computer Science. 986 (2024) - p. 114329 , 2024

Link: https://doi.org/10.1016/..

2

A Theory of Composition for Differential Obliviousness:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,

Zhou, Mingxun ; Shi, Elaine ; Chan, T.-H. Hubert. - p. 3-34 , 2023

Link: https://doi.org/10.1007/..

3

Generalized Sorting with Predictions Revisited:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,

Chan, T.-H. Hubert ; Sun, Enze ; Wang, Bo - p. 29-41 , 2023

Link: https://doi.org/10.1007/..

4

Fully Dynamic k-Center Clustering with Outliers:

Chan, T.-H. Hubert ; Lattanzi, Silvio ; Sozio, Mauro.
Algorithmica. 86 (2023) 1 - p. 171-193 , 2023

Link: https://doi.org/10.1007/..

5

Game-Theoretically Secure Protocols for the Ordinal Random ..:

, In: Applied Cryptography and Network Security; Lecture Notes in Computer Science,

Chan, T.-H. Hubert ; Wen, Ting ; Xie, Hao. - p. 582-610 , 2023

Link: https://doi.org/10.1007/..

6

A feedforward unitary equivariant neural network:

Ma, Pui-Wai ; Chan, T.-H. Hubert
Neural Networks. 161 (2023) - p. 154-164 , 2023

Link: https://doi.org/10.1016/..

7

Max-Min Greedy Matching Problem: Hardness for the Adversary..:

, In: Frontiers of Algorithmics; Lecture Notes in Computer Science,

Chan, T.-H. Hubert ; Tang, Zhihao Gavin ; Xue, Quan - p. 85-104 , 2023

Link: https://doi.org/10.1007/..

8

Locality-Preserving Oblivious RAM:

Asharov, Gilad ; Chan, T.-H. Hubert ; Nayak, Kartik...
Journal of Cryptology. 35 (2022) 2 - p. , 2022

Link: https://doi.org/10.1007/..

9

Fully Dynamic k-Center Clustering with Outliers:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Chan, T.-H. Hubert ; Lattanzi, Silvio ; Sozio, Mauro. - p. 150-161 , 2022

Link: https://doi.org/10.1007/..

10

Communication complexity of byzantine agreement, revisited:

Abraham, Ittai ; Chan, T.-H. Hubert ; Dolev, Danny...
Distributed Computing. 36 (2022) 1 - p. 3-28 , 2022

Link: https://doi.org/10.1007/..

11

Foundations of Differentially Oblivious Algorithms:

Chan, T.-H. Hubert ; Chung, Kai-Min ; Maggs, Bruce.
Journal of the ACM. 69 (2022) 4 - p. 1-49 , 2022

Link: https://doi.org/10.1145/..

12

On the Hardness of Opinion Dynamics Optimization with $$L_1..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,

Chan, T.-H. Hubert ; Lee, Chui Shan - p. 515-527 , 2021

Link: https://doi.org/10.1007/..

13

Opinion Dynamics Optimization by Varying Susceptibility to ..:

Abebe, Rediet ; Chan, T.-H. HUBERT ; Kleinberg, Jon...
ACM Transactions on Knowledge Discovery from Data (TKDD). 16 (2021) 2 - p. 1-34 , 2021

Link: https://dl.acm.org/doi/1..

14

Opinion Dynamics Optimization by Varying Susceptibility to ..:

Abebe, Rediet ; Chan, T.-H. HUBERT ; Kleinberg, Jon...
ACM Transactions on Knowledge Discovery from Data. 16 (2021) 2 - p. 1-34 , 2021

Link: https://doi.org/10.1145/..

15

Distributed approximate k-core decomposition and min–max ed..:

Chan, T.-H. Hubert ; Sozio, Mauro ; Sun, Bintao
Journal of Parallel and Distributed Computing. 147 (2021) - p. 87-99 , 2021

Link: https://doi.org/10.1016/..