English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching

Bhattacharya, S., Kiss, P., & Saranurak, T. (2023). Sublinear Algorithms for (1.5+Epsilon)-Approximate Matching. In STOC '23 (pp. 254-266). New York, NY: ACM. doi:10.1145/3564246.3585252.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000C-9BA1-F Version Permalink: https://hdl.handle.net/21.11116/0000-000E-36D1-9
Genre: Conference Paper
Latex : Sublinear Algorithms for $(1.5+\epsilon)$-Approximate Matching
Other : Sublinear Algorithms for (1.5+E)-Approximate Matching

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bhattacharya, Sayan1, Author           
Kiss, Peter2, Author
Saranurak, Thatchaphol1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 202320232023
 Publication Status: Issued
 Pages: 28 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bhattacharya_STOC23
DOI: 10.1145/3564246.3585252
 Degree: -

Event

show
hide
Title: 55th Annual ACM Symposium on Theory of Computing
Place of Event: Orlando, FL, USA
Start-/End Date: 2023-06-20 - 2023-06-23

Legal Case

show

Project information

show

Source 1

show
hide
Title: STOC '23
  Abbreviation : STOC 2023
  Subtitle : Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 254 - 266 Identifier: ISBN: 978-1-4503-9913-5