English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time

Nanongkai, D., & Saranurak, T. (2017). Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time. In H. Hatami, P. McKenzie, & V. King (Eds.), STOC '17 (pp. 1122-1129). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000E-72AF-D Version Permalink: https://hdl.handle.net/21.11116/0000-000E-72B0-A
Genre: Conference Paper
Latex : Dynamic Spanning Forest with Worst-Case Update Time: {A}daptive, {Las Vegas}, and $O(n^{1/2-\epsilon})$-Time

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Nanongkai, Danupon1, Author                 
Saranurak, Thatchaphol1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2016-11-112017-04-172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: NanongkaiSTOC2017
DOI: 10.1145/3055399.3055447
 Degree: -

Event

show
hide
Title: 49th Annual ACM SIGACT Symposium on Theory of Computing
Place of Event: Montreal, Canada
Start-/End Date: 2017-06-19 - 2017-06-23

Legal Case

show

Project information

show

Source 1

show
hide
Title: STOC '17
  Subtitle : Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
  Abbreviation : STOC 2017
Source Genre: Proceedings
 Creator(s):
Hatami, Hamed1, Editor
McKenzie, Pierre1, Editor
King, Valerie1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1122 - 1129 Identifier: ISBN: 978-1-4503-4528-6