I agree that this site is using cookies. You can find further informations here.
X
Pettie, Seth
175  results:
Search for persons X
?
1

Connectivity Labeling and Routing with Multiple Vertex Fail..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Parter, Merav ; Petruschka, Asaf ; Pettie, Seth - p. 823-834 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Byzantine Agreement with Optimal Resilience via Statistical..:

Huang, Shang-En ; Pettie, Seth ; Zhu, Leqi
Journal of the ACM.  71 (2024)  2 - p. 1-37 , 2024
Link: https://doi.org/10.1145/..
 
?
3

Better Cardinality Estimators for HyperLogLog, PCSA, and Be..:

, In: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Wang, Dingyu ; Pettie, Seth - p. 317-327 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

Almost Optimal Exact Distance Oracles for Planar Graphs:

Charalampopoulos, Panagiotis ; Gawrychowski, Paweł ; Long, Yaowei...
Journal of the ACM.  70 (2023)  2 - p. 1-50 , 2023
Link: https://doi.org/10.1145/..
 
?
5

Optimal vertex connectivity oracles:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Pettie, Seth ; Saranurak, Thatchaphol ; Yin, Longhui - p. 151-161 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

Wake up and join me! An energy-efficient algorithm for maxi..:

Dani, Varsha ; Gupta, Aayush ; Hayes, Thomas P..
Distributed Computing.  36 (2022)  3 - p. 373-384 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Approximate Generalized Matching: f-Matchings and f-Edge Co..:

Huang, Dawei ; Pettie, Seth
Algorithmica.  84 (2022)  7 - p. 1952-1992 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Byzantine agreement in polynomial time with near-optimal re..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Huang, Shang-En ; Pettie, Seth ; Zhu, Leqi - p. 502-514 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

Near-optimal Distributed Triangle Enumeration via Expander ..:

Chang, Yi-Jun ; Pettie, Seth ; Saranurak, Thatchaphol.
Journal of the ACM (JACM).  68 (2021)  3 - p. 1-36 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Planar Distance Oracles with Better Time-Space Tradeoffs:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Long, Yaowei ; Pettie, Seth - p. 2517-2537 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Information theoretic limits of cardinality estimation: Fis..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Pettie, Seth ; Wang, Dingyu - p. 556-569 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Brief Announcement: Wake Up and Join Me! An Energy Efficien..:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
Dani, Varsha ; Gupta, Aayush ; Hayes, Thomas P.. - p. 151-153 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Near-optimal Distributed Triangle Enumeration via Expander ..:

Chang, Yi-Jun ; Pettie, Seth ; Saranurak, Thatchaphol.
Journal of the ACM.  68 (2021)  3 - p. 1-36 , 2021
Link: https://doi.org/10.1145/..
 
?
14

The Communication Complexity of Set Intersection and Multip..:

Huang, Dawei ; Pettie, Seth ; Zhang, Yixiang.
SIAM Journal on Computing.  50 (2021)  2 - p. 674-717 , 2021
Link: https://doi.org/10.1137/..
 
?
15

Lower Bounds on Sparse Spanners, Emulators, and Diameter-Re..:

Huang, Shang-En ; Pettie, Seth
SIAM Journal on Discrete Mathematics.  35 (2021)  3 - p. 2129-2144 , 2021
Link: https://doi.org/10.1137/..
 
1-15