Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Harris, David G.
23280  Ergebnisse:
Personensuche X
?
1

Algorithms for Matrix Multiplication via Sampling and Oppor..:

Harris, David G.
Algorithmica.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

Exponentially Faster Massively Parallel Maximal Matching:

Behnezhad, Soheil ; Hajiaghayi, Mohammadtaghi ; Harris, David G.
Journal of the ACM.  70 (2023)  5 - p. 1-18 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Deterministic algorithms for the Lovász local lemma: Simple..:

Harris, David G.
Random Structures & Algorithms.  63 (2023)  3 - p. 716-752 , 2023
Link: https://doi.org/10.1002/..
 
?
4

On the Locality of Nash-Williams Forest Decomposition and S..:

Harris, David G. ; Su, Hsin-Hao ; Vu, Hoa T.
SIAM Journal on Discrete Mathematics.  37 (2023)  2 - p. 800-830 , 2023
Link: https://doi.org/10.1137/..
 
?
5

Some remarks on hypergraph matching and the Füredi–Kahn–Sey..:

Bansal, Nikhil ; Harris, David G.
Random Structures & Algorithms.  62 (2022)  1 - p. 52-67 , 2022
Link: https://doi.org/10.1002/..
 
?
6

Algorithms for Weighted Independent Transversals and Strong..:

Graf, Alessandra ; Harris, David G. ; Haxell, Penny
ACM Transactions on Algorithms.  18 (2021)  1 - p. 1-16 , 2021
Link: https://doi.org/10.1145/..
 
?
7

Optimal Bounds for the k-cut Problem:

Gupta, Anupam ; Harris, David G. ; Lee, Euiwoong.
ACM Journal of the ACM (JACM).  69 (2021)  1 - p. 1-18 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

Algorithms for weighted independent transversals and strong..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Graf, Alessandra ; Harris, David G. ; Haxell, Penny - p. 662-674 , 2021
Link: https://doi.org/10.1137/..
 
?
9

Optimal Bounds for thek-cut Problem:

Gupta, Anupam ; Harris, David G. ; Lee, Euiwoong.
Journal of the ACM.  69 (2021)  1 - p. 1-18 , 2021
Link: https://doi.org/10.1145/..
 
?
10

On the Locality of Nash-Williams Forest Decomposition and S..:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
Harris, David G. ; Su, Hsin-Hao ; Vu, Hoa T. - p. 295-305 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Algorithms for weighted independent transversals and strong..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Graf, Alessandra ; Harris, David G. ; Haxell, Penny - p. 662-674 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

New bounds for the Moser‐Tardos distribution:

Harris, David G.
Random Structures & Algorithms.  57 (2020)  1 - p. 97-131 , 2020
Link: https://doi.org/10.1002/..
 
?
13

Bounds and algorithms for graph trusses:

Burkhardt, Paul ; Faber, Vance ; Harris, David G.
Journal of Graph Algorithms and Applications.  24 (2020)  3 - p. 191-214 , 2020
Link: https://doi.org/10.7155/..
 
?
14

Oblivious Resampling Oracles and Parallel Algorithms for th..:

Harris, David G.
ACM Transactions on Algorithms.  17 (2020)  1 - p. 1-32 , 2020
Link: https://doi.org/10.1145/..
 
?
15

Partial resampling to approximate covering integer programs:

Chen, Antares ; Harris, David G. ; Srinivasan, Aravind
Random Structures & Algorithms.  58 (2020)  1 - p. 68-93 , 2020
Link: https://doi.org/10.1002/..
 
1-15