Warren Schudy

According to our database, Warren Schudy authored at least 19 papers between 2006 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Stars: Tera-Scale Graph Building for Clustering and Graph Learning.

CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong

CoRR, 2022

Stars: Tera-Scale Graph Building for Clustering and Learning.

CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Massively Parallel Computation via Remote Memory Access.

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy

ACM Trans. Parallel Comput., 2021

Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient.

David L. Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy

Proc. VLDB Endow., 2020

2019

Variance Reduction in Bipartite Experiments through Correlation Clustering.

Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, Vahab S. Mirrokni

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2015

Concentration inequalities for nonlinear matroid intersection.

Konstantin Makarychev, Warren Schudy, Maxim Sviridenko

Random Struct. Algorithms, 2015

2012

Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data.

Warren Schudy

PhD thesis, 2012

Concentration and moment inequalities for polynomials of independent random variables.

Warren Schudy, Maxim Sviridenko

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems.

Marek Karpinski, Warren Schudy

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Online Correlation Clustering.

Claire Mathieu, Ocan Sankur, Warren Schudy

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Correlation Clustering with Noisy Input.

Claire Mathieu, Warren Schudy

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament.

Marek Karpinski, Warren Schudy

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2008

Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems.

Marek Karpinski, Warren Schudy

Electron. Colloquium Comput. Complex., 2008

Finding strongly connected components in parallel using <i>o</i>(log²<i>n</i>) reachability queries.

Warren Schudy

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Yet another algorithm for dense max cut: go greedy.

Claire Mathieu, Warren Schudy

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

More Efficient Internal-Regret-Minimizing Algorithms.

Amy Greenwald, Zheng Li, Warren Schudy

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

How to rank with few errors.

Claire Kenyon-Mathieu, Warren Schudy

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments.

Claire Kenyon-Mathieu, Warren Schudy

Electron. Colloquium Comput. Complex., 2006