English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Fast and Simple Modular Subset Sum

Axiotis, K., Backurs, A., Bringmann, K., Jin, C., Nakos, V., Tzamos, C., et al. (2021). Fast and Simple Modular Subset Sum. In V. King, & H. Viet Le (Eds.), Symposium on Simplicity in Algorithms (pp. 57-67). Philadelphia, PA: SIAM. doi:10.1137/1.9781611976496.6.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0007-56CF-0 Version Permalink: https://hdl.handle.net/21.11116/0000-0008-DBAC-0
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Axiotis, Kyriakos1, Author
Backurs, Arturs1, Author
Bringmann, Karl2, Author           
Jin, Ce1, Author
Nakos, Vasileios2, Author           
Tzamos, Christos1, Author
Wu, Hongxun1, 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: 20202021
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Axiotis_SOSA2021
DOI: 10.1137/1.9781611976496.6
 Degree: -

Event

show
hide
Title: SIAM Symposium on Simplicity in Algorithms
Place of Event: Alexandria, VA, USA (Virtual Conference)
Start-/End Date: 2021-01-11 - 2021-01-12

Legal Case

show

Project information

show hide
Project name : TIPEA
Grant ID : 850979
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: Symposium on Simplicity in Algorithms
  Abbreviation : SOSA 2021
  Other : SOSA21
  Subtitle : Proceedings
Source Genre: Proceedings
 Creator(s):
King, Valerie1, Editor
Viet Le, Hung1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 57 - 67 Identifier: ISBN: 978-1-61197-649-6