English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Fast and Simple Modular Subset Sum

Axiotis, K., Backurs, A., Bringmann, K., Jin, C., Nakos, V., Tzamos, C., et al. (in press). Fast and Simple Modular Subset Sum. In SIAM Symposium on Simplicity in Algorithms (SOSA21).

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-0007-56D0-D
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: 2020
 Publication Status: Accepted / In Press
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Axiotis_SOSA2020
 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

Source 1

show
hide
Title: SIAM Symposium on Simplicity in Algorithms (SOSA21)
  Abbreviation : SOSA 2021
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -