English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

Henzinger, M., Krinninger, S., & Nanongkai, D. (2016). A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 489-498). New York, NY: ACM. doi:10.1145/2897518.2897638.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-52C0-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-8591-3
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Henzinger, Monika1, Author
Krinninger, Sebastian2, Author           
Nanongkai, Danupon1, 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: 2016
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/2897518.2897638
BibTex Citekey: HenzingerKrin16
 Degree: -

Event

show
hide
Title: 48th Annual ACM SIGACT Symposium on Theory of Computing
Place of Event: Cambridge, MA, USA
Start-/End Date: 2016-06-19 - 2016-06-21

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing
  Abbreviation : STOC 2016
  Subtitle : STOC'16
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 489 - 498 Identifier: -