default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Meierhans
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Li Chen
, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173- [c5]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. STOC 2024: 1174-1183 - [i9]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR abs/2407.10830 (2024) - [i8]Rasmus Kyng, Simon Meierhans, Gernot Zöcklein:
A Simple Dynamic Spanner via APSP. CoRR abs/2408.11368 (2024) - [i7]Rasmus Kyng, Simon Meierhans, Gernot Zöcklein:
Bootstrapping Dynamic APSP via Sparsification. CoRR abs/2408.11375 (2024) - 2023
- [i6]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications. CoRR abs/2311.06402 (2023) - [i5]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR abs/2311.18295 (2023) - 2022
- [c4]Rasmus Kyng, Simon Meierhans, Maximilian Probst:
Derandomizing Directed Random Walks in Almost-Linear Time. FOCS 2022: 407-418 - [c3]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. SODA 2022: 3452-3481 - [i4]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Derandomizing Directed Random Walks in Almost-Linear Time. CoRR abs/2208.10959 (2022) - 2021
- [j1]Johannes de Fine Licht, Maciej Besta, Simon Meierhans, Torsten Hoefler:
Transformations of High-Level Synthesis Codes for High-Performance Computing. IEEE Trans. Parallel Distributed Syst. 32(5): 1014-1029 (2021) - [i3]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. CoRR abs/2110.11712 (2021)
2010 – 2019
- 2019
- [c2]Joaquim Campos, Simon Meierhans, Abdelaziz Djelouah, Christopher Schroers:
Content Adaptive Optimization for Neural Image Compression. CVPR Workshops 2019: 0 - [c1]Stefano Leucci, Chih-Hung Liu, Simon Meierhans:
Resilient Dictionaries for Randomly Unreliable Memory. ESA 2019: 70:1-70:16 - [i2]Joaquim Campos, Simon Meierhans, Abdelaziz Djelouah, Christopher Schroers:
Content Adaptive Optimization for Neural Image Compression. CoRR abs/1906.01223 (2019) - 2018
- [i1]Johannes de Fine Licht, Maciej Besta, Simon Meierhans, Torsten Hoefler:
Transformations of High-Level Synthesis Codes for High-Performance Computing. CoRR abs/1805.08288 (2018)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 01:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
