"Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data."

Juan José Besa Vial et al. (2018)

> Home

Details and statistics

DOI: 10.1137/1.9781611975055.8

access: closed

type: Conference or Workshop Paper

metadata version: 2018-01-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alenex/VialDEGJ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alenex/VialDEGJ18
Juan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson:
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data. ALENEX 2018: 87-96

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.