External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs

Anand Louis, Rameesh Paul. No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs. In Sepehr Assadi, Eva Rotenberg, editors, 2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026. pages 538-550, SIAM, 2026. [doi]

Authors

Anand Louis

This author has not been identified. Look up 'Anand Louis' in Google

Rameesh Paul

This author has not been identified. Look up 'Rameesh Paul' in Google
runs on