default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWarren Schudy
Person information
- affiliation: Google Researc
- affiliation: Brown University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong:
Stars: Tera-Scale Graph Building for Clustering and Learning. NeurIPS 2022- [i10]CJ Carey, Jonathan Halcrow, Rajesh Jayaram, Vahab Mirrokni, Warren Schudy, Peilin Zhong:
Stars: Tera-Scale Graph Building for Clustering and Graph Learning. CoRR abs/2212.02635 (2022) - 2021
- [j3]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c14]David L. Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, Warren Schudy:
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient. NeurIPS 2021: 20243-20257 - 2020
- [j2]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [i9]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020)
2010 – 2019
- 2019
- [c13]Jean Pouget-Abadie, Kevin Aydin, Warren Schudy, Kay Brodersen, Vahab S. Mirrokni:
Variance Reduction in Bipartite Experiments through Correlation Clustering. NeurIPS 2019: 13288-13298 - [c12]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [i8]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - 2015
- [j1]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. Random Struct. Algorithms 46(3): 541-571 (2015) - 2012
- [b1]Warren Schudy:
Approximation Schemes for Inferring Rankings and Clusterings from Pairwise Data. Brown University, USA, 2012 - [c11]Konstantin Makarychev, Warren Schudy, Maxim Sviridenko:
Concentration inequalities for nonlinear matroid intersection. SODA 2012: 420-436 - [c10]Warren Schudy, Maxim Sviridenko:
Concentration and moment inequalities for polynomials of independent random variables. SODA 2012: 437-446 - 2011
- [c9]Marek Karpinski, Warren Schudy:
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems. APPROX-RANDOM 2011: 277-288 - [i7]Warren Schudy, Maxim Sviridenko:
Concentration and Moment Inequalities for Polynomials of Independent Random Variables. CoRR abs/1104.4997 (2011) - 2010
- [c8]Marek Karpinski, Warren Schudy:
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. ISAAC (1) 2010: 3-14 - [c7]Claire Mathieu, Warren Schudy:
Correlation Clustering with Noisy Input. SODA 2010: 712-728 - [c6]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. STACS 2010: 573-584 - [i6]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. CoRR abs/1001.0920 (2010) - [i5]Marek Karpinski, Warren Schudy:
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament. CoRR abs/1006.4396 (2010)
2000 – 2009
- 2009
- [c5]Marek Karpinski, Warren Schudy:
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. STOC 2009: 313-322 - [i4]Marek Karpinski, Warren Schudy:
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems. CoRR abs/0911.2214 (2009) - 2008
- [c4]Amy Greenwald, Zheng Li, Warren Schudy:
More Efficient Internal-Regret-Minimizing Algorithms. COLT 2008: 239-250 - [c3]Claire Mathieu, Warren Schudy:
Yet another algorithm for dense max cut: go greedy. SODA 2008: 176-182 - [c2]Warren Schudy:
Finding strongly connected components in parallel using o(log2n) reachability queries. SPAA 2008: 146-151 - [i3]Marek Karpinski, Warren Schudy:
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems. CoRR abs/0811.3244 (2008) - [i2]Marek Karpinski, Warren Schudy:
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c1]Claire Kenyon-Mathieu, Warren Schudy:
How to rank with few errors. STOC 2007: 95-103 - 2006
- [i1]Claire Kenyon-Mathieu, Warren Schudy:
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
